Data structures for Go
-
Updated
Jan 6, 2019 - Go
Data structures for Go
An implementation of mutable and immutable ordered sets.
OrderedSet for Pharo Smalltalk
A MutableSet that remembers its order, so that every entry has an index
A mutable random access collection of unique elements, which behaves like a set, but guarantees insertion order
Go package ordered sets implemented with balanced binary search trees
A simple, static Ordered Set collection type for Swift. Doesn't depend on Foundation.
sorted key/value storage for C99
A LinkedMapSet is an extension to MapSet that maintains ordering.
Advance data structure includes DSU, BIT, SQRT Decomposition, Segment Tree, Lazy Propagation, Trie Tree etc.
Commonly used data structures for Swift
Add a description, image, and links to the ordered-set topic page so that developers can more easily learn about it.
To associate your repository with the ordered-set topic, visit your repo's landing page and select "manage topics."