diff options
| author | Eugen Wissner <belka@caraus.de> | 2018-09-06 12:50:42 +0200 |
|---|---|---|
| committer | Eugen Wissner <belka@caraus.de> | 2018-09-06 12:50:42 +0200 |
| commit | 94c7fd2231e6c1338e7ee0bf240e854dffaaacac (patch) | |
| tree | ef1b031b017952a3a5fb4b6761187fdfb0a5d789 /CONTRIBUTING.md | |
| parent | 5ba6d35a1b146c206602704369a1c6ba18a0152a (diff) | |
| download | tanya-94c7fd2231e6c1338e7ee0bf240e854dffaaacac.tar.gz | |
Move range.adapter to algorithms + take() bugfixes
A lot of algorithms like lazy sort() can be also classified as adapters
since it wraps the original range and allows to access the elements of
the range in a particular order. The only reason why take() was in
range.adapter is that take() is trivial - it doesn't change the order of
elements but can turn an infinite range into finite one. This
distinction between trivial and non-trivial algorithms isn't absolutely
clear. So let us put all algorithms and any adapters that change the
range iteration in some way into "algorithm" package to avoid any
confusion later.
- range.adapter is renamed into algorithm.iteration
- range.adapter is deprecated
- Added missing imports for take() and takeExactly()
- takeExactly() doesn't wrap ranges that have slicing anymore
- Voldemort structs for take() takeExactly() are now static
Diffstat (limited to 'CONTRIBUTING.md')
0 files changed, 0 insertions, 0 deletions
