Repository Index

A family of header-only, very fast and memory-friendly hashmap and btree containers.

• hash
• tables
• unordered-map
• unordered-set

A fast & densely stored hashmap and hashset

• c-plus-plus
• cpp17
• cpp
• hash

A fast, memory efficient hash map for C++

• hash-tables
• sparse-containers
• unordered
• sparsehash

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.

• container
• cpp
• template
• unordered

Easily output ASCII tree from Go program or Markdown unordered list . There's also CLI tool that can output tree from JSON, YAML, or TOML! It's called *xtree*.

• tree
• markdown
• tree-structure
• directory

C++11/20 library that provides static_vector, small_vector, static_map, small_map, flat_map, static_flat_map, small_flat_map, static_unordered_map, small_unordered_map, etc.

• cpp11
• header-only
• small-vector
• flat-map

Efficiently remove an element from an unordered array without doing a splice