Why is it not good to use recursive inheritance for std::tuple implementations?

by

A non-recursive implementation has better compile-time performance. Believe it or not, in a heavily used library facility like std::tuple, how it is implemented can impact (for better or worse), the compile times the client sees. Recursive implementations tend to produce compile times that are linear in the depth of recursion (or can be even worse).

This impacts more than just the instantiation of the tuple itself. std::get<I>(tuple) for example will take a linear amount of compile time for one implementation and a constant amount of compile time for another implementation. This impact can rapidly deteriorate (or not) when dealing with tuples of tuples. I.e. the recursive implementation could result in O(N^2) compile time while the non-recursive implementation is still O(1).

Fwiw, the libc++ implementation lays the objects out in the order specified by the client, but optimizes away space for empty components using the compiler’s empty base class optimization facility.

More Related Contents:

  1. How can you iterate over the elements of an std::tuple?
  2. C++ std::tuple order of destruction
  3. what is the concept of evaluation of expression z = (y = 30) + (y = 10) + (y = 20); [closed]
  4. Is cout synchronized/thread-safe?
  5. Why C++11 in-class initializer cannot use parentheses?
  6. Sorting zipped (locked) containers in C++ using boost or the STL
  7. Is local static variable initialization thread-safe in C++11? [duplicate]
  8. What does the thread_local mean in C++11?
  9. Does constexpr imply inline?
  10. The reason of using `std::greater` for creating min heap via `priority_queue`
  11. C++11: The range-based for statement: “range-init” lifetime?
  12. istream behavior change in C++ upon failure
  13. Do rvalue references allow dangling references?
  14. std::unique_ptr, deleters and the Win32 API
  15. Difference between std::system_clock and std::steady_clock?
  16. Which headers in the C++ standard library are guaranteed to include another header?
  17. Default template argument when using std::enable_if as templ. param.: why OK with two template functions that differ only in the enable_if parameter?
  18. Is there a range class in C++11 for use with range based for loops?
  19. std::auto_ptr to std::unique_ptr
  20. How can I use C++ 11 features in Clang?
  21. The new keyword “auto”; When should it be used to declare a variable type? [duplicate]
  22. Understanding rvalue references
  23. Equivalent of “using namespace X” for scoped enumerations?
  24. How to typedef a template class? [duplicate]
  25. Using C++ base class constructors?
  26. Why the sequence-operation algorithms predicates are passed by copy?
  27. Reference invalidation after applying reverse_iterator on a custom made iterator
  28. C++11 Implementation of Spinlock using header “
  29. Move semantics == custom swap function obsolete?
  30. How to assert if a std::mutex is locked?

Leave a Comment