variant | variant | |
---|---|---|
5 | 5 | |
9 | 645 | |
- | - | |
0.0 | 0.0 | |
about 3 years ago | over 1 year ago | |
C++ | C++ | |
MIT License | Boost Software License 1.0 |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
variant
- szLogVar::variant. C++17/20. O(log n) recursive template instantiation depth. Now updated with C++20 features.
-
szLogVar::variant: A C++17 variant that stores a binary tree of types inside a union. O(log N) recursive template instantiation depth. Features get_unchecked, a noexcept get method without checking index.
I've added some compile time benchmarks, found here. The gist of it is that szLogVar::variant has similar performance to std::variant when there are only a few types in the variant, but displays a noticeable improvement if the types are many.
variant
-
Backward compatible implementations of newer standards constructs?
For Variant I would recommend Michael Park's variant - mpark::variant
-
Is there an exception that I could throw if there is a path that should never run.
have a look at https://github.com/mpark/variant
-
An std::variant alternative for C++11
I know that there is boost::variant but adding the whole boot dependency for this use case seem too much. I have seen the following implementation and similar ones
-
How to implicitly convert between pointers and integral types
You could build your own versions if thats a concern. Or use one of the free pre-C++17 implementations (like I do in my C++11 codebase). https://github.com/mpark/variant
-
Using std::variant and std::visit to transform-reduce a (rose) tree
mpark::variant and mpark::visit are faster than the gcc STL implementation.
What are some alternatives?
type-fest - A collection of essential TypeScript types
BackportCpp - Library of backported modern C++ types to work with C++11
recursive-variant - Recursive Variant: A simple library for Recursive Variant Types
chessCAMO - chessCAMO is a newly proposed chess engine with a built-in variant that stands for Calculations Always Make Opportunities and was inspired by the very popular chess variant Crazyhouse. The "CAMO" portion comes from the idea that in this variant a player can sacrifice making a move to replace one of their pieces from the "piece reservoir".
optional - C++11/14/17 std::optional with functional-style extensions and reference support
Thrust - [ARCHIVED] The C++ parallel algorithms library. See https://github.com/NVIDIA/cccl
dyno - Runtime polymorphism done right
nonstd-lite - Parent of *-lite repositories, a migration path to post-C++11 features for pre-C++11 environments
doctest - The fastest feature-rich C++11/14/17/20/23 single-header testing framework
abseil-cpp - Abseil Common Libraries (C++)
ts-pattern - 🎨 The exhaustive Pattern Matching library for TypeScript, with smart type inference.
GSL - Guidelines Support Library