Comments (5)
I've never sure where to stop for adding the reverse versions of things. Like rall
and rany
feel clearly superfluous, yet rposition
is worth it because it's not just .rev().position
.
This started me thinking "well why don't you want to write .rev().find_map
?", where my guess is that the biggest reason is that rev
takes self
. So here's a stab at asking libs-api to let you write .as_rev().find_map
instead, which would hopefully lessen the need to add more r
versions of things: rust-lang/libs-team#385
from itertools.
I think the std lib dismissed the idea, probably not more efficient than the alternative. I don't know where to find the info though.
The only thing related I have is #818 (comment) where we had the same thought.
Is it really missing though?
from itertools.
Just struck me as odd, that there is find_map
and no rfind_map
. But guess rev()
works fine as well and keeps the trait concise.
from itertools.
Well, maybe a bit constructed, but rall
and rany
could make sense if you know elements are not evenly distributed and the iterator may short circuit earlier :P
from itertools.
Yeah, not saying that you'd never want to run them backwards, just that they seems unusual enough to not need a dedicated method on DoubleEndedIterator
.
from itertools.
Related Issues (20)
- Feature Request: `raise_results()` adapter HOT 1
- The cutting block: These features will be removed from itertools eventually (2)
- `k_smallest[_by]/tail`: similarities and differences
- Implement `DoubleEndedIterator` for `Powerset` HOT 3
- Support for TryFrom::try_from on the items of iterator HOT 5
- Iterators generating (many) vectors (v2)
- using izip is slower than ziping 3 times HOT 7
- FormatWith should implement fmt::Debug HOT 1
- `Itertools::dedup_by[_key]` vs `Vec`
- Merge `MultiPeek` and `PeekNth` HOT 1
- Feature request: `try_collect_vec()` HOT 3
- feature request: split_vec() HOT 1
- Itertools 0.13.0 breaks strum derive macros if both are in scope at the same time. HOT 8
- get (new range iterator) breaks strum HOT 2
- How does tree_reduce achieve O(ln(n)) operations? HOT 10
- Implement `DoubleEndedIterator` for `FilterOk` HOT 3
- `.try_collect()` for `Iterator<Option>` HOT 7
- `maybe_` for `cmp`, `partial_cmp`, `eq`, `ne`, `lt`, `le`, `gt`, `ge` HOT 2
- Add single-element tuple for `collect_tuple` HOT 3
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from itertools.