Skip to content
Compile-time-efficient proof-of-concept implementation for std::tuple
Branch: master
Clone or download
Latest commit 9396f37 Mar 13, 2019
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
.conan Add clang-7, clang-8 and scan-build to CI Mar 13, 2019
include/tao Add clang-7, clang-8 and scan-build to CI Mar 13, 2019
src/test/tuple
.appveyor.yml
.clang-format
.gitignore
.travis.yml
CMakeLists.txt Add CMake / AppVeyor Jun 27, 2018
LICENSE Add clang-7, clang-8 and scan-build to CI Mar 13, 2019
Makefile Add clang-7, clang-8 and scan-build to CI Mar 13, 2019
README.md Add clang-7, clang-8 and scan-build to CI Mar 13, 2019
Variadic Templates.pdf Final version Nov 12, 2015
conanfile.py Conan support Jul 19, 2018

README.md

The Art of C++ / Tuple

Release Download TravisCI AppVeyor

The Art of C++ / Tuple is a C++11 header-only proof-of-concept implementation of std::tuple.

Rationale

Why another implementation of std::tuple? To provide a proof-of-concept that, when avoiding recursion, code can benefit in significant ways. I prepared a talk about it, including some benchmarks.

Download presentation

TL;DR: GCC 5 on Linux with libstdc++'s std::tuple requires 19.6s and an instantiation depth of at least 3.719 to compile an example generating a tuple with 265 elements via std::tuple_cat. tao::tuple requires 1.2s and an instantiation depth of 26 on the same system.

Apple LLVM 7.0 (~Clang 3.7) with libc++'s std::tuple requires 70s and an instantiation depth of 514 to compile the example. tao::tuple requires 1.7s and an instantiation depth of 15 on the same system. This case does not change std::integer_sequence or std::make_integer_sequence, all improvements are coming from all the other improvements from avoiding recursion.

CUDA

tao::tuple supports CUDA.

Compatibility

  • Requires C++11 or newer.
  • Tested with GCC 4.8+, Clang 3.4+, and Visual Studio 2017.

Changelog

1.0.0

Released 2018-08-01

  • Initial release.

License

The Art of C++ is certified Open Source software. It may be used for any purpose, including commercial purposes, at absolutely no cost. It is distributed under the terms of the MIT license reproduced here.

Copyright (c) 2015-2019 Daniel Frey

Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

You can’t perform that action at this time.