Frozen ](https://github.com/serge-sans-paille) |  constexpr  Perfect-hashing-based frozen sets and maps  |  [ Apache-2.0 ](https://www.apache.org/licenses/LICENSE-2.0) |   
[ Immer ](https://github.com/arximboldi/immer) |  A library of persistent and immutable data structures  |  Boost  |  cmake   
[ plf::colony ](https://www.plflib.org/colony.htm) |  Unordered "bag-like" container which outperforms ` std:: ` containers in high-modification scenarios while maintaining valid pointers to non-erased elements regardless of insertion and erasure. C++98/11/14/etc-compatible. See also [ P0447 ](https://wg21.link/P0447) ( ` std::hive ` ). ( [ Src ](https://github.com/mattreecebentley/plf_colony) )  |  [ zlib ](https://en.wikipedia.org/wiki/Zlib_License) |  [ conan ](https://github.com/alaingalvan/conan-plf-colony) [ build2 ](https://cppget.org/plf-colony)  
[ plf::list ](https://www.plflib.org/list.htm) |  A  [ std::list ](/w/cpp/container/list "cpp/container/list") implementation which sacrifices range-splicing for cache-friendliness, yielding faster insertion, erasure and iteration. C++98/03/11/14/17/20/23/26/etc-compatible. ( [ Src ](https://github.com/mattreecebentley/plf_list) ) ( [ Doc ](https://plflib.org/list.htm) )  |  [ zlib ](https://en.wikipedia.org/wiki/Zlib_License) |  —   
[ plf::reorderase ](https://www.plflib.org/reorderase.htm) |  An extension and optimization of the "swap-and-pop"/"move-and-pop" idiom for random access containers to increase random_access container erase performance, when post-erasure order is unimportant. Covers single, range and ` std::erase_if ` -style erasures. C++98/11/14/etc-compatible. ( [ Src ](https://github.com/mattreecebentley/plf_reorderase) )  |  [ zlib ](https://en.wikipedia.org/wiki/Zlib_License) |   
[ plf::queue ](https://www.plflib.org/queue.htm) |  A drop-in replacement container for the  [ std::queue ](/w/cpp/container/queue "cpp/container/queue") container adaptor with better performance than  [ std::deque ](/w/cpp/container/deque "cpp/container/deque") and  [ std::list ](/w/cpp/container/list "cpp/container/list") in a queue context. C++98/11/14/etc-compatible. ( [ Src ](https://github.com/mattreecebentley/plf_queue) )  |  [ zlib ](https://en.wikipedia.org/wiki/Zlib_License) |   
[ plf::stack ](https://www.plflib.org/stack.htm) |  A drop-in replacement container for the  [ std::stack ](/w/cpp/container/stack "cpp/container/stack") container adaptor with better performance than  [ std::vector ](/w/cpp/container/vector "cpp/container/vector") and  [ std::deque ](/w/cpp/container/deque "cpp/container/deque") in a stack context. C++98/11/14/etc-compatible. ( [ Src ](https://github.com/mattreecebentley/plf_stack) )  |  [ zlib ](https://en.wikipedia.org/wiki/Zlib_License) |   
[ ring_span ](https://github.com/martinmoene/ring-span-lite) |  A lite implementation of Arthur O'Dwyer's ` ring_span ` , a.k.a. circular buffer view. C++98- compatible.  |  [ BSL-1.0 ](https://github.com/martinmoene/ring-span-lite/blob/master/LICENSE.txt) |  header-only; cmake   
[ strict_variant ](https://github.com/cbeck88/strict-variant) |  A realtime/embedded-friendly (i.e. ` -fno-exceptions ` / ` -fno-rtti ` compatible), never-empty ` variant ` targetting C++11. Fast, prevents many undesirable implicit conversions.  |  BSL-1.0  |  cmake   
[ Ygg ](https://github.com/tinloaf/ygg) |  An intrusive C++11 implementation of high-performance containers and data structures such as a [ Red–black tree ](https://en.wikipedia.org/wiki/Red%E2%80%93black_tree "enwiki:Red–black tree") , an [ Interval tree ](https://en.wikipedia.org/wiki/Interval_tree "enwiki:Interval tree") and an Interval Map.  |  MIT  |  cmake   
  
##  [ [ edit ](/mwiki/index.php?title=cpp/links/libs&action=edit&section=9
"Edit section: Cryptography") ]  Cryptography

Library  |  Description  |  License  |  Configuration   
---|---|---|---  
[ Botan ](https://botan.randombit.net/) |  A cryptography Toolkit. ( [ Src ](https://github.com/randombit/bota