Why is there no transform_if in the C++ standard library?

by

The standard library favours elementary algorithms.

Containers and algorithms should be independent of each other if possible.

Likewise, algorithms that can be composed of existing algorithms are only rarely included, as shorthand.

If you require a transform if, you can trivially write it. If you want it /today/, composing of ready-mades and not incur overhead, you can use a range library that has lazy ranges, such as Boost.Range, e.g.:

v | filtered(arg1 % 2) | transformed(arg1 * arg1 / 7.0)

As @hvd points out in a comment, transform_if double result in a different type (double, in this case). Composition order matters, and with Boost Range you could also write:

 v | transformed(arg1 * arg1 / 7.0) | filtered(arg1 < 2.0)

resulting in different semantics. This drives home the point:

it makes very little sense to include std::filter_and_transform, std::transform_and_filter, std::filter_transform_and_filter etc. etc. into the standard library.

See a sample Live On Coliru

#include <boost/range/algorithm.hpp>
#include <boost/range/adaptors.hpp>

using namespace boost::adaptors;

// only for succinct predicates without lambdas
#include <boost/phoenix.hpp>
using namespace boost::phoenix::arg_names;

// for demo
#include <iostream>

int main()
{
    std::vector<int> const v { 1,2,3,4,5 };

    boost::copy(
            v | filtered(arg1 % 2) | transformed(arg1 * arg1 / 7.0),
            std::ostream_iterator<double>(std::cout, "\n"));
}

More Related Contents:

  1. What’s the difference between “STL” and “C++ Standard Library”?
  2. How to convert an instance of std::string to lower case
  3. std::string formatting like sprintf
  4. What are the mechanics of short string optimization in libc++?
  5. Writing your own STL Container
  6. Library function for Permutation and Combination in C++
  7. Deleting elements from std::set while iterating
  8. Using local classes with STL algorithms
  9. Can I take the address of a function defined in standard library?
  10. How to get IOStream to perform better?
  11. How to remove duplicates from unsorted std::vector while keeping the original ordering using algorithms?
  12. std::next_permutation Implementation Explanation
  13. std::queue iteration
  14. C++ valarray vs. vector
  15. C++ std::vector vs array in the real world
  16. What does string::npos mean in this code?
  17. C++ Filehandling: Difference between ios::app and ios::ate?
  18. Assign a nullptr to a std::string is safe?
  19. How to find the intersection of two STL sets?
  20. GCC linker can’t find standard library?
  21. Why isn’t there int128_t?
  22. Why is the STL so heavily based on templates instead of inheritance?
  23. std::lexical_cast – is there such a thing?
  24. Why was std::pow(double, int) removed from C++11?
  25. How similar are Boost.Filesystem and the C++ standard filesystem library?
  26. Why do we need to tie std::cin and std::cout?
  27. STL algorithms: Why no additional interface for containers (additional to iterator pairs)?
  28. Why the sequence-operation algorithms predicates are passed by copy?
  29. How can I use a std::valarray to store/manipulate a contiguous 2D array?
  30. Why is operator!= removed in C++20 for many standard library types?

Leave a Comment