Filter By
15 Repositories
C++ (or C) Containers
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
1.3k Jan 5, 2023
A fast, memory efficient hash map for C++
I now recommend using the parallel hashmap instead of sparsepp, unless if you are stuck with a non C++11 compatible compiler, or if using a little bit
1.1k Jan 4, 2023
C++ associative containers
This directory contains several hash-map implementations, similar in API to SGI's hash_map class, but with different performance characteristics. spa
1.4k Jan 1, 2023
Retro coding in C/C++ in a 3D template with full low-level control.
BRIEF INFO ON THE 2021 WORLD TEMPLATE Project website: https://jacco.ompf2.com/voxel-world-template/ Purpose: This template has been designed to make
140 Dec 31, 2022
Prime Number Projects in C#/C++/Python
Primes | A Software Drag Race Source code to Dave's Garage video benchmarking the same prime number sieve in Python, C#, and C++. Community contributi
90 Dec 31, 2022
🏅State-of-the-art learned data structure that enables fast lookup, predecessor, range searches and updates in arrays of billions of items using orders of magnitude less space than traditional indexes
The Piecewise Geometric Model index (PGM-index) is a data structure that enables fast lookup, predecessor, range searches and updates in arrays of bil
651 Dec 29, 2022
ring-span lite - A C++yy-like ring_span type for C++98, C++11 and later in a single-file header-only library
ring-span lite: A circular buffer view for C++98 and later Contents Example usage In a nutshell Dependencies Installation Synopsis Reported to work wi
127 Dec 28, 2022
C++ implementation of a fast hash map and hash set using robin hood hashing
A C++ implementation of a fast hash map and hash set using robin hood hashing The robin-map library is a C++ implementation of a fast hash map and has
872 Dec 26, 2022
C++ implementation of a fast hash map and hash set using hopscotch hashing
A C++ implementation of a fast hash map and hash set using hopscotch hashing The hopscotch-map library is a C++ implementation of a fast hash map and
578 Dec 23, 2022
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
344 Dec 19, 2022
Enable bitwise operators on scoped enums.
cpp17-enum-flag Enable bitwise operators on scoped enums. Library compiles with no warnings (-std=c++17 -Wall -Wshadow -Wextra -Wnon-virtual-dtor -ped
13 Dec 13, 2022
Simple Useful Libraries: The C++17 header-only dynamic bitset
dynamic_bitset Simple Useful Libraries: The C++17 header-only dynamic bitset Requirements To use this dynamic bitset, you will need a C++17 compliant
118 Dec 12, 2022
A c++ toolbox of locality-sensitive hashing (LSH), provides several popular LSH algorithms, also support python and matlab.
LSHBOX-0.9 A C++ Toolbox of Locality-Sensitive Hashing for Large Scale Image Retrieval, Also Support Python and MATLAB. Change Log 2015.07.04 A new LS
269 Nov 13, 2022
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
117 Nov 8, 2022
Template Library of Tree Data Structures in C++17
Template Library of Tree Data Structures in C++17 Implementations AVL Tree Binary Search Tree BTree KD-Tree Splay Tree Trie Notes This project is for
149 Feb 8, 2021