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-treeAlgorithm 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 stackImplementation 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 cocoapodsThe 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
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.