Commonly used data structures for Swift
-
Updated
Nov 19, 2026 - Swift
Commonly used data structures for Swift
Advance data structure includes DSU, BIT, SQRT Decomposition, Segment Tree, Lazy Propagation, Trie Tree etc.
mstd (Maipa's Standard Library) is an extension of the C++ standard library, providing additional utility functions, new data types, and helpful templates for type comparisons. It aims to enhance the standard functionality with useful features while maintaining compatibility with modern C++.
A simple, static Ordered Set collection type for Swift. Doesn't depend on Foundation.
Go package ordered sets implemented with balanced binary search trees
A LinkedMapSet is an extension to MapSet that maintains ordering.
sorted key/value storage for C99
A simple ordered set type for python.
A mutable random access collection of unique elements, which behaves like a set, but guarantees insertion order
Repository Contains C++ Pgms on TREES - Binary Trees & Binary Search Trees - Easy Medium hard questions on leetcode --- ++ Set (ordered, unordered, Multiset)
A high-performance, zero-dependency, pure Swift 6 algorithms and data structures library for iOS, macOS, watchOS, tvOS, and visionOS.
A MutableSet that remembers its order, so that every entry has an index
Intrusive lists, sets & multisets for Python (Boost.Intrusive-inspired). Objects in multiple collections via member hooks.
Some C Utilities: Generic Hash Table, Doubly Linked List, Vector/Array, Ordered Set
Benchmarks for the Ordered library
To associate your repository with the ordered-set topic, visit your repo's landing page and select "manage topics."