cmcstl2
cmcstl2 copied to clipboard
An implementation of C++ Extensions for Ranges
All the examples are ill-formed. ```cpp #include namespace view { using namespace std::experimental::ranges::view; using namespace std::experimental::ranges::view::ext; } // namespace view int main() { auto s1 = view::generate([]{ return 0; })...
sequence_of_tuple | ranges::ext::view::elements static_array | ranges::ext::view::elements map | ranges::ext::view::keys; map | ranges::ext::view::values;
Anything not integrated by now is likely not important enough to be integrated.
The following code shows a compilation problem: ```c++ #include #include #include #include #include /** Class to allow iteration over all lines from an input stream. */ class istream_line_reader { public:...
This might be a bug in GCC, not Ranges. Link: https://godbolt.org/g/rxBUhq ```cpp #include #include #include using std::experimental::ranges::Assignable; using T = std::vector; static_assert(Assignable); int main() { // diagnostic equivalent to: //...
Thusly proving that @tomaszkam's "itinerary" example can be implemented efficiently in STL2 with very minor changes, leaving the `CommonReference` requirement intact on `StrictTotallyOrderedWith`. The benchmark, compiled with gcc-8.1 on a...
This changes the following things: 1. Tests and examples now build optionally. To build them, pass `-DBUILD_TESTS=1` or `-DBUILD_EXAMPLES=1` to CMake respectively 2. Added a `conanfile.py` that retrieves the git...
* Added a post-increment operator overload to basic_iterator that returns a self reference for non-input cursors that don't provide post_increment(). * Added a test to validate that output iterators that...
...and eliminate variability in the benchmark due to using the standard library implementations of the algorithms.
What should come of the deprecated algorithm overloads, which aren't mentioned in P0896?