-
Notifications
You must be signed in to change notification settings - Fork 0
A sparse set is a data structure that allows (at the cost of double the memory for indexes) to do insertion deletion and lookup in O(1) while maintaining a O(n) traversal time where n is the amount of elements in the set.
araml/sparse_set
About
A sparse set is a data structure that allows (at the cost of double the memory for indexes) to do insertion deletion and lookup in O(1) while maintaining a O(n) traversal time where n is the amount of elements in the set.
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published