unordered

A fast, memory efficient hash map for C++

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.

Greg's Template Library of useful classes.

Test equality of unordered sequences

Unordered Go channel

Some knowledge about store collections of data in Sets

C++ unordered map for Python

List -ordered, unordered, ascending & descending

Toolkit for hashing user-defined types for use in hash maps, sets, etc.

Here, I have uploaded basics of Standard template library in C++