- Adding ESM named exports support (@jerome-benoit).
- Fixing
Set
operations CommonJS named export collision by renaming it toset
(@jerome-benoit). - Fixing missing
Uint8Vector
,Uint8ClampedVector
,Int8Vector
,Uint16Vector
,Int16Vector
,Uint32Vector
,Int32Vector
,Float32Vector
,Float64Vector
,PointerVector
CommonJS named exports (@jerome-benoit). - Fixing missing
PointerVector
TS exports (@jerome-benoit).
- Fixing
Float64Vector
TS exports (@atombrenner). - Improving performance of
FixedDeque
#.push
&#.pop
methods (@jerome-benoit). - Fixing some
FixedDeque
&CircularBuffer
methods.
- Slight performance optimization of LRU classes
#.setpop
method. - Adding missing constructors in TypeScript declarations (@jerome-benoit).
- Fixing type declarations of
FibonacciHeap
,StaticIntervalTree
&Vector
(@Macil).
- Adding partial type declarations for undocumented
utils/typed-arrays
.
- Fixing
BiMap.get
andInverseMap.get
types (@rubenferreira97).
- Fixing
NaN
size issue withMultiSet.remove
when removing non-existent keys.
- Fixing typings of low-level structure consuming methods (@jerome-benoit).
- Fixing
Heap
type declarations (@em-ctc).
- Adding
LRUCacheWithDelete
&LRUMapWithDelete
(@trivikr & @mrflip).
- Upgrading
obliterator
. - Improving performance of iterator methods across the library.
- Fixing
KDTree
typings (@clhuang).
- Refactoring
VPTree
memory layout. - Fixing
VPTree.nearestNeighbors
edge case. - Various
VPTree
optimizations.
- Fixing
Heap.replace
&Heap.pusphpop
types (@wholenews).
- Fixing
SparseQueueSet
deopt.
- Adding
TrieMap.update
(@wholenews).
- Adding
DefaultWeakMap
(@yoursunny).
- Improved typings for iteration methods (@yoursunny).
- Adding
SparseQueueSet
.
- Adding
SparseMap
. - Enhancing
SparseSet
performance.
- Adding
set.overlap
.
- Fixing build by including missing
sort
folder.
- Adding
KDTree
. - Adding
set.intersectionSize
. - Adding
set.unionSize
. - Adding
set.jaccard
. - Adding
FixedReverseHeap.peek
.
- Adding
PassjoinIndex
.
- Fixing
Heap.nsmallest
&Heap.nlargest
docs & typings. - Fixing
Heap.nsmallest
&Heap.nlargest
not using custom comparator function whenn = 1
.
- Fixing
BitSet
&BitVector
iteration methods edge case. - Fixing
BitSet
&BitVector
#.select
method.
- Fixing
BitSet
&BitVector
#.size
caching edge case.
- Adding
DefaultMap.peek
. - Fixing some error messages.
- Fixing
BitSet
&BitVector
#.size
caching.
- Stricter TS definitions (
--noImplicitAny
,--noImplicitReturns
) (@pbadenski).
- Adding
LRUCache.setpop
andLRUMap.setpop
(@veggiesaurus).
- Adding
LRUCache.peek
andLRUMap.peek
(@veggiesaurus).
- Fixing usage with TypeScript.
- Fixing
CircularBuffer
andFixedDeque
types.
- Adding
FixedDeque
. - Adding
CircularBuffer.unshift
. - Changing
CircularBuffer
semantics to now overwrite values when wrapping around.
- Adding the
DefaultMap.autoIncrement
factory. - Removing the
IncrementalMap
. - Fixing
Vector
typings. - Fixing
BitVector
typings.
- Fixing custom inspect methods for node >= 10.
- Adding
LRUCache
. - Adding
LRUMap
.
- Adding
#.forEachMultiplicity
toMultiSet
. - Adding
#.forEachAssociation
toMultiMap
. - Adding
DefaultMap
.
- Adding
FixedReverseHeap
. - Adding
Heap.nsmallest
&Heap.nlargest
. - Adding
MultiSet.isSubset
&MultiSet.isSuperset
. - Adding
#.top
toMultiSet
. - Adding missing
Heap
types. - Renaming
FiniteStack
toFixedStack
.
- Adding
FuzzyMultiMap.dimension
. - Adding
#.consume
toHeap
. - Adding
#.replace
toHeap
. - Adding
#.pushpop
toHeap
. - Improving
BitSet
andBitVector
#.toJSON
. - Improving
FiniteStack.from
&CircularBuffer.from
performance when handling arrays. Heap.from
is now linear time.- Refactoring
Heap
inner logic. - Fixing
CircularBuffer
's#.unshift
to#.shift
. - Fixing
SparseSet.delete
return consistency.
- Library is now fully typed.
- Adding
CircularBuffer
. - Adding
#.toArray
toHeap
.
- Adding
TrieMap
. - Reworking the
Trie
considerably.
- Adding
StaticIntervalTree
. - Adding
PointerVector
. - Adding
Queue.of
. - Adding
Stack.of
. - Improving
Vector
&BitVector
reallocation performance. - Improving
InvertedIndex
performance.
- Adding
FiniteStack
. - Adding
#.keys
toMultiSet
. - Adding
#.count
alias toMultiSet
. - Adding
#.count
alias toMultiMap
. - Adding
#.remove
toMultiMap
. - Adding
Vector.from
. - Adding
#.values
toVector
. - Adding
#.entries
toVector
. - Fixing bug when feeding invalid values to a
MultiSet
. - Fixing
.from
static methods not taking byte arrays into account. - Fixing bugs related to
Stack.pop
edge cases. - Optimizing
Stack
performance.
- Adding
HashedArrayTree
. - Adding
BitVector
. - Adding
#.frequency
toMultiSet
. - Adding
#.grow
toDynamicArray
. - Adding
#.reallocate
toDynamicArray
. - Adding
#.resize
toDynamicArray
. - Fixing several
MultiSet
issues. - Renaming
DynamicArray
toVector
. - Renaming the
DynamicArray.initialLength
option toinitialCapacity
. - Renaming
DynamicArray.allocated
tocapacity
. - Optimizing
MultiSet
performance. - Optimizing
SparseSet
memory consumption.
- Adding
#.has
toFuzzyMap
. - Adding
#.has
toFuzzyMultiMap
. - Adding
#.multiplicity
toMultiMap
. - Renaming
RangeMap
toIncrementalMap
. - Renaming
Index
toFuzzyMap
. - Renaming
MultiIndex
toFuzzyMultiMap
. - Renaming
DynamicArray
initialSize
option toinitialLength
. - Improving
MultiMap.set
performance. - Improving
BitSet.reset
performance. - Improving
Set.isSubset
&Set.isSuperset
performance.
- Adding
RangeMap
. - Improving
MultiSet
. - Out-of-bound
DynamicArray.set
will now correctly grow the array. - Fixing
StaticDisjointSet.find
complexity.
- Adding
DynamicArray
. - Adding
SparseSet
. - Adding
StaticDisjointSet
. - Adding iterator methods to
BitSet
. - Adding
#.rank
&#.select
toBitSet
. BitSet
now relies onUint32Array
rather thanUint8Array
.- Improving
BitSet
performances. - Using
obliterator
to handle iterators.
- Adding
BiMap
. - Adding
BitSet
. - Fixing universal iterator.
- Adding
InvertedIndex
.
- Adding bunch of set functions.
- Fixing error in
Trie.get
. - Fixing error related to
Trie.size
.
- Fixing an error in
VPTree.neighbors
.
- Adding
Index
. - Adding
MultiIndex
. - Adding
MultiMap
. - Adding
MultiSet
. - Adding
SymSpell
.
- Adding
VPTree
.
- Adding
BKTree
.
- Adding
BloomFilter
. - Adding static
#.from
method to all relevant structures. - Adding iterators to all relevant structures.
- Removing the
MultiSet
until proper API is found.
- Adding
MultiSet
.
- Adding
SuffixArray
&GeneralizedSuffixArray
. - Better
Trie
sentinel.
- Adding
Queue
. - Adding possibility to pass custom comparator to
Heap
&FibonacciHeap
.
- Adding
FibonacciHeap
. - Fixing bug related to
Heap
.
- Adding
Trie
.
- Adding
Heap
.
- Adding
LinkedList
. - Adding
Stack
.