Efficient immutable bags (multisets) made with mori
An immutable Set where each element can occur multiple times
generate multiset combinations using an efficient loopless algorithm
Modern, high-performance data structures for JavaScript & TypeScript - inspired by Python's collections module
[Usage]('./USAGE.md')
The compilers and the spec for the windsor query language
Fast JS MultiSet implementation.
functions for manipulating genotypes and genotype likelihoods
Compact ASCII serialization for small integer sets and multisets.
A multiset implementation, currently based on a HashMap
Stack allocated uint multiset, with optional SIMD implementations.
A Multiset that can return a capped value on the elements
An ordered multiset of machine numbers
A hash multiset implementation.
A comprehensive mathematical set theory library implementing standard set operations, multisets, and set laws verification
btreeset with more capacity
Multisets/bags
An incremental hash function for multi-sets.
A tree-based multiset for Rust
Simple API for working with sets and multisets of elements of type usize
A Rust library for algebraic structures called tracts, which generalize fields and hyperfields.
Multisets with negative membership
A pure Ruby implementation of a bag (multiset) collection that tracks element occurrences
Unlike ordinary set(see Ruby documentation for "set" library), multiset can contain two or more same items. Set[:a,:b,:c,:b,:b,:c] # => #<Set: {:b, :c, :a}> Multiset[:a,:b,:c,:b,:b,:c] # => #<Multiset:#3 :b, #2 :c, #1 :a> Multisets are typically used for counting elements and their appearances in collections.
Generate integer, set and multiset partitions
No description provided.
No description provided.
No description provided.