I'm the author of some software which dumps out C++ code to be compiled with g++. This code sometimes contains many different and many long tuples. I deduced that long tuples cause rather long compile times. I already wrote some compression, which collects identical entries in such a tuple and moves them into an array. But this compression reduces (run-time) performance. I already wrote different tuple implementations, and one of the compiles much faster than the regular provided std::tuple. What could be the criterium for such a tuple implementation, which makes g++ take more or less compile time assuming the same code using this tuple? Peter
