Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Intended for comparison only with #2721 / #2809 by way of offering an 'alternative' (simpler?) design...
NB I'd be very tempted to refactor eg
UpperBound
andMinimalUpperBoundAbove
in terms of intersection-closed predicates, ie to develop a theory of objects '≤
-minimal such thatP
' for predicatesP
under suitable closure conditions, but that's a tale for another day, as well as the theory of 'inclusions' between DC-'subsets' of a given preorder, so that the various lubs/mubs could be compared according to their indexing setsI
... etc.UPDATED: definition of Mub might require the additional precondition that
x
is a lower bound for the image off
, to rule out nonsensical definitions... oops!