java has this datastructure
and it has these 2 methods
is there a rust equivalent data struture to Java's TreeSet that has these properties?
i didn't think BTreeSet did it. https://docs.oracle.com/javase/8/docs/api/java/util/NavigableSet.html
#rust equivalent to java navigable set
umbral kestrel
sour fractal
java has this datastructure
and it has these 2 methods
is there a rust equivale...
you might be looking for https://doc.rust-lang.org/nightly/std/collections/struct.BTreeSet.html#method.range
it's a bit more generic of an api, as it takes a range and returns an iterator of elements, but set.higher(x) could be done with
set.range(x..).next()
```and `set.lower(x)` with
```rs
set.range(..x).next_back()
does this work when x is not an integer, but is a linesegment?
it just has an Ord and PartialOrd implementation
sour fractal
does this work when x is not an integer, but is a linesegment?
BTreeSet::range accepts any range that satisfies RangeBounds<T>, which includes (Bound<T>, Bound<T>) so in your case, you could use
(BoundIncluded(x) Bound::Unbounded)
```for a `x..` equivalent and
```rs
(Bound::Unbounded, BoundExcluded(x))
```for a `..x` equivalentTHANK YOU
sour fractal
seems that the std docs actually use BtreeMap::range in their example of Bound: https://doc.rust-lang.org/nightly/std/ops/enum.Bound.html#examples
though they do it with integers, which is a bit weird
umbral kestrel
yea
the fact that im not using integers confused me in how id use that
trim laurel