We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
"Deep" versions of algorithms would work for nested enumerables without breaking this nested hierarchy. For example:
const auto input = { (std::vector{1, 2}), (std::vector{3, 4, 5}), (std::vector{6}) }; const auto output1 = input | deep_filter([](const auto &i){ return i >=2; }); // output1 is now {{2}, {3, 4, 5}, {6}} const auto output2 = input | deep_filter([](const auto &i){ return i < 6; }); // output2 is now {{1, 2}, {3, 4, 5}, {}}
I will gladly disscuss pros and cons of keeping the empty containers inside hierachy.
Our TODO list is:
The text was updated successfully, but these errors were encountered:
No branches or pull requests
"Deep" versions of algorithms would work for nested enumerables without breaking this nested hierarchy. For example:
I will gladly disscuss pros and cons of keeping the empty containers inside hierachy.
Our TODO list is:
The text was updated successfully, but these errors were encountered: