Beta
Filter View
14sv90
Description:
In this Kata you will implement a lazy view into a filtered range.
A range is an object with a begin() and a end() member function returning iterators.
Your algorithm should return only that elements from the range that fulfill a given predicate p. In contrast to the existing standard library function it should do so lazy. This implies that your algorithm should work on infinite ranges as long as not all elements are used.
Further reading:
-The current proposal for standardization of ranges for C++
See also
Algorithms
Iterators
Similar Kata:
Stats:
| Created | Jan 22, 2017 |
| Published | Jan 22, 2017 |
| Warriors Trained | 222 |
| Total Skips | 51 |
| Total Code Submissions | 258 |
| Total Times Completed | 14 |
| C++ Completions | 14 |
| Total Stars | 8 |
| % of votes with a positive feedback rating | 100% of 10 |
| Total "Very Satisfied" Votes | 10 |
| Total "Somewhat Satisfied" Votes | 0 |
| Total "Not Satisfied" Votes | 0 |
| Total Rank Assessments | 9 |
| Average Assessed Rank | 3 kyu |
| Highest Assessed Rank | 1 kyu |
| Lowest Assessed Rank | 6 kyu |
