TreeMap::lower_bound_iter should be traversable in reverse #9963
Comments
|
TreeMap is not in std lib anymore. |
flip1995
pushed a commit
to flip1995/rust
that referenced
this issue
Dec 1, 2022
Migrate from highfive to triagebot This migrates this repository from using the highfive bot to using triagebot (aka rustbot). This should not be merged without coordinating the removal of the highfive webhook and/or merging rust-lang/highfive#435. changelog: none
flip1995
pushed a commit
to flip1995/rust
that referenced
this issue
Dec 1, 2022
Add S-waiting-on-review autolabel. This adds the S-waiting-on-review autolabel feature for new PRs. This was previously handled by highfive, but I neglected to include it in rust-lang#9963. changelog: none
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
In some algorithms you want to iterate leftwards in a set starting at the lower bound.
If a TreeSet contains values 0..9 and lower_bound_iter(4) is called,
there should be a way to transform that iterator to something that lazily generates the sequence 4,3,2,1,0.
That is. It is not enough to simply reverse the forward iterator, since that would yield 9,8,7,6,5,4
The text was updated successfully, but these errors were encountered: