mnemonist - Curated collection of data structures for the JavaScript language.

•    Javascript

---

Mnemonist 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-tree

Algorithm - Algorithm is a library of tools that is used to create intelligent applications.

•    Swift

---

Algorithm is a library of tools that is used to create intelligent applications. Embedded frameworks require a minimum deployment target of iOS 8 or OS X Mavericks (10.9).

algorithm algorithms data-structures data-structure data-structures-algorithms probability probabilistic-programming set multiset dictionary multidictionary conditional-probability redblacktree redblacktrees swift-3 cosmicmind sorted-sets doublylinkedlist stack

Buckets-Swift - Swift Collection Data Structures Library

•    Swift

---

Buckets 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 cocoapods

multichoose - generate multiset combinations (n multichoose k)

•    C++

---

The method generates all multisets that would be generated from taking k elements from a multiset of n. Repeated multisets are possible if the input set contains repeated elements. The number of multiset combinations equals the multinomial coefficient (n multichoose k). This example lists all the possible unordered genotypes at a given genetic loci of which there are two copies (e.g. chromosomes). In this case k (=2) could be understood as the expected ploidy of the given locus.

multiset combinations multichoose combinatorics math