Modern C++ B-tree containers
-
Updated
Aug 11, 2023 - C++
Modern C++ B-tree containers
C++11 library that provides several new or lesser-known containers, like flat_map/set, small_map/set, static_map/set, small_vector, static_vector, and many more.
Collection of high performance C++ containers that can be chosen as drop-in replacements for std::vector and std::set
Headers Only C++11 Containers library. No standard library is required.
Radix set/map implementation
Library of some neat 2 dimensional data structures and algorithms which operate on them implemented in c++17
Turing-complete 64-bit virtual machine written in C++ and C#
Set of data types (CRDTs) to build a collaborative data usable with the CollabServer Framework
Java and C++ implementations of a dynamic, self-balancing k-d tree and a k-d tree-based key-to-multiple-value map, and multi-threaded implementations of a static k-d tree and a k-d tree-based key-to-multiple-value map. Also included are algorithms for nearest-neighbor search, region search, and reverse nearest-neighbors search.
notes of code-init-workshop📝
c++ associative containers based on the XOR scapegoat tree
🥋 C++ Yandex courses
Solution for May LeetCoding Challenge are Provided.
solved leetcode, hackerrank and other competitive competition questions in C++. In each folder there are question related to that topic. I have uploaded the solutions also. kindly ignore the .exe files.
Fast C++ flat (open addressing) hash set, map
Add a description, image, and links to the set topic page so that developers can more easily learn about it.
To associate your repository with the set topic, visit your repo's landing page and select "manage topics."