Buckets is a complete, fully tested and documented data structure library written in pure JavaScript.
data-structures collections collection linked-list dictionary map multimap stack queue set bag binary-heap priority-queue binary-search binary-search-tree tree tree-structure buckets data structure linked list heap priority binary data-structure hashmapMnemonist is a curated collection of data structures for the JavaScript language. It gathers classic data structures (think heap, trie etc.) as well as more exotic ones such as Buckhard-Keller trees etc.
data-structure bag bimap bit-array bit-set bit-vector bitset bk-tree burkhard-keller-tree circular-buffer counter data-structures disjoint-set fibonacci-heap fuzzy-map hashed-array-tree heap interval-tree inverted-index linked-list multimap multiset queue sparse-set stack structures suffix-tree symspell trie union-find vantage-point-tree vector vp-treeImplementation of STL (Standard Template Library) in TypeScript. TSTL is an open-source project providing features of STL, migrated from C++ to TypeScript. You can enjoy the STL's own specific containers, algorithms and functors in the JavaScript. If TypeScript, you also can take advantage of type restrictions and generic programming with the TypeScript.
typescript stl container collection iterator algorithm critical-section mutex semaphore hashmap treemap tstl typescript-stl typescript-standard-template-library functor exception functional utility thread numeric special_math vector deque list forward_list stack queue priority_queue set multiset unordered_set unordered_multiset map multimap unordered_map unordered_multimap treeset treemultiset hashset hashmultiset treemultimap hashmultimap shared_mutex timed_mutex shared_timed_mutex unique_lock shared_lock timed_semaphore latch barrier flex_barrierBuckets is a complete, tested and documented collections library for swift.Carthage is a decentralized dependency manager that automates the process of adding frameworks to your application.
swift-3 queue deque stack priority-queue matrix multiset multimap bimap graph trie bitarray circular-buffer bloom-filter swift-package-manager carthage cocoapodsA collection of data structures implemented in Swift. All collection types are implemented as structures with the exception of the LinkedList data structure. This means they are copied when they are assigned to a new constant or variable, or when they are passed to a function or method.
datastructures swift-3 linkedlist stack queue priority-queue red-black-trees bimap bloom-filter multimap binary-heap trie avl-tree graphThis is the missing multimap collection for the Go language (also a simple practice in creating a proper library/package). A multimap (sometimes also multihash or multidict) is a generalization of a map or associative array abstract data type in which more than one value may be associated with and returned for a given key.
golang-package data-structures multimap mapA Map subclass with support for multiple keys for one entry. A ManyKeysMap object is identical to a regular Map, which the exception that it only supports a sequence of keys as key, instead of a single key. This will let you attach a value to a specific combination of keys, instead of a single key.
any key keys many map multi multimap multipleThe multimap data structure is a map in which more than one value may be stored under each key. Distributed under the MIT license. See LICENSE for details.
multimap
We have large collection of open source products. Follow the tags from
Tag Cloud >>
Open source products are scattered around the web. Please provide information
about the open source projects you own / you use.
Add Projects.