37 Resources
C/C++ container Libraries
Parallel-hashmap - A family of header-only, very fast and memory-friendly hashmap and btree containers.
The Parallel Hashmap Overview This repository aims to provide a set of excellent hash map implementations, as well as a btree alternative to std::map
Flat map - Header only associative linear container.
flat_map flat_map is a header only associative container library that constructed on linear container. It compliants C++17/20 standard associative con
Northstar-dedicated - Docker container for the Northstar dedicated server. Also includes general notes on running the dedi on Linux. WIP.
northstar-dedicated Docker image for the Northstar dedicated server. Not ready yet (it'll probably be another day or two). Versioning Tentative. Stabl
Fast C++ container combining the best features of std::vector and std::deque
veque The double-ended vector A very fast C++17 container combining the best features of std::vector and std::deque "In Most Cases, Prefer Using deque
A composable container for Adaptive ROS 2 Node computations. Select between FPGA, CPU or GPU at run-time.
adaptive_component A composable stateless container for Adaptive ROS 2 Node computations. Select between FPGA, CPU or GPU at run-time. Nodes using har
C++ intrusive container templates. Abstract node links, no use of new/delete.
C-plus-plus-intrusive-container-templates C++ intrusive container templates. Abstract node links, no use of new/delete (AVL tree, singly-linked list,
The near bare metal multi-container supervisor and OS management system.
Pantavisor What is Pantavisor? Pantavisor is the easiest way to build and manage embedded Linux projects with lightweight containers. Put your Linux d
Generic single-file implementations of AVL tree in C and C++ suitable for deeply embedded systems
Cavl Generic single-file implementation of AVL tree suitable for deeply embedded systems. Simply copy cavl.h or cavl.hpp (depending on which language
Pottery - A container and algorithm template library in C
Pottery - A container and algorithm template library in C
Docker files and scripts to setup and run VINS-FUSION-gpu on NVIDIA jetson boards inside a docker container.
jetson_vins_fusion_docker This repository provides Docker files and scripts to easily setup and run VINS-FUSION-gpu on NVIDIA jetson boards inside a d
Running Docker container on Raspberry Pi (armhf)
Running Docker container on Raspberry Pi (armhf)
PoC of a native Linux file system to mount container images.
composefs PoC of a native Linux file system to mount container images. It is unfinished and just a few days of work. The idea is to pass a binary blob
This is a simple UNITEST to test the implementation of the the various container types of the C++ standard template library
ft_container UNITest. This is a simple UNITEST to test the implementation of the the various container types of the C++ standard template library that
A realtime/embedded-friendly C++11 variant type which is never empty and prevents undesirable implicit conversions
strict variant Do you use boost::variant or one of the many open-source C++11 implementations of a "tagged union" or variant type in your C++ projects
A C++ data container replicating std::stack functionality but with better performance than standard library containers in a stack context.
plf::stack A data container replicating std::stack functionality but with better performance than standard library containers in a stack context. C++9
A drop-in replacement for std::list with 293% faster insertion, 57% faster erasure, 17% faster iteration and 77% faster sorting on average. 20-24% speed increase in use-case testing.
plf::list A drop-in replacement for std::list with (on average): 293% faster insertion 57% faster erasure 17% faster iteration 77% faster sorting 70%
An unordered C++ data container providing fast iteration/insertion/erasure while maintaining pointer/iterator validity to non-erased elements regardless of insertions/erasures. Provides higher-performance than std:: library containers for high-modification scenarios with unordered data.
plf::colony An unordered data container providing fast iteration/insertion/erasure while maintaining pointer/iterator/reference validity to non-erased
Simple data packing library (written in C99)
Features Compressed file pack creation Runtime file pack reading Supported operating systems Ubuntu MacOS Windows Build requirements C99 compiler CMak
this lib with 26 template container and 10 kinds of algorithm, it is a good lib for study and usage
simple stl this lib simplify the achievement detail of common container, but add the container variety, the whole code partily follow Google Style. Em
C++ small containers
Applications usually contain many auxiliary small data structures for each large collection of values.
Fast & memory efficient hashtable based on robin hood hashing for C++11/14/17/20
➵ robin_hood unordered map & set robin_hood::unordered_map and robin_hood::unordered_set is a platform independent replacement for std::unordered_map
A family of header-only, very fast and memory-friendly hashmap and btree containers.
The Parallel Hashmap Overview This repository aims to provide a set of excellent hash map implementations, as well as a btree alternative to std::map
this package help you to give glassomorphic+ neomrphic both effects to a container (at a time).
duomorphsim this package help you to give glassomorphic+ neomrphic both effects to a container (at a time). Usage DuoMorphicCard need four argument wh
A C++ data container replicating std::queue functionality but with better performance.
A data container replicating std::queue functionality but with better performance than standard library containers in a queue context. C++98/03/11/14/etc-compatible.
Ubpa small flat containers based on C++20
USmallFlat Ubpa small flat containers based on C++20 Containers basic_flat_map basic_flat_multimap basic_flat_multiset basic_flat_set basic_small_vect
Accelerated Container Image
OverlayBD Accelerated Container Image Accelerated Container Image is an open-source implementation of paper "DADI: Block-Level Image Service for Agile
An implementation of a weak handle interface to a packed vector in C++
Experimental handle container in C++ Overview Following on from c-handle-container, this library builds on the same ideas but supports a dynamic numbe
A C++11 or library for parsing and serializing JSON to and from a DOM container in memory.
Branch master develop Azure Docs Drone Matrix Fuzzing --- Appveyor codecov.io Boost.JSON Overview Boost.JSON is a portable C++ library which provides
30 Seconds of C++ (STL in C++). Read More about 30C++ here 👉
30 Seconds of C++ (STL in C++). Read More about 30C++ here 👉
A C++20 concepts library, providing container concepts etc.
More concepts #include more_concepts/more_concepts.hpp This library aims to provide general purpose concepts that are not available in the C++20 con
Library of generic and type safe containers in pure C language (C99 or C11) for a wide collection of container (comparable to the C++ STL).
M*LIB: Generic type-safe Container Library for C language Overview M*LIB (M star lib) is a C library enabling to use generic and type safe container i
🦘 A dependency injection container for C++11, C++14 and later
kangaru 🦘 Kangaru is an inversion of control container for C++11, C++14 and later. It provides many features to automate dependency injection and red
A header-only library for C++(0x) that allows automagic pretty-printing of any container.
cxx-prettyprint =============== A pretty printing library for C++ containers. Synopsis: Simply by including this header-only library in your sourc
Fast & memory efficient hashtable based on robin hood hashing for C++11/14/17/20
➵ robin_hood unordered map & set robin_hood::unordered_map and robin_hood::unordered_set is a platform independent replacement for std::unordered_map
A drop-in replacement for std::list with 293% faster insertion, 57% faster erasure, 17% faster iteration and 77% faster sorting on average. 20-24% speed increase in use-case testing.
plf_list A drop-in replacement for std::list with (on average): 293% faster insertion 57% faster erasure 17% faster iteration 77% faster sorting 70% f
An unordered C++ data container providing fast iteration/insertion/erasure while maintaining pointer/iterator validity to non-erased elements regardless of insertions/erasures. Provides higher-performance than std:: library containers for high-modification scenarios with unordered data.
plf_colony An unordered data container providing fast iteration/insertion/erasure while maintaining pointer/iterator/reference validity to non-erased
? A glib-like multi-platform c library
A glib-like cross-platform C library Supporting the project Support this project by becoming a sponsor. Your logo will show up here with a link to you