Repository URL to install this package:
Version:
0.1.2 ▾
|
odigos
/
etc
/
odigos-vmagent
/
instrumentations
/
nodejs-ebpf
/
node_modules
/
@js-sdsl
/
ordered-map
/
CHANGELOG.md
|
---|
All notable changes to this project will be documented in this file.
The format is based on Keep a Changelog and this project adheres to Semantic Versioning.
isAccessible
function to iterators for iterable containers.Symbol.iterator
function.TreeContainer
erase
function.reverse
and sort
returned value to this
.container
to Iterator
which means the container that the iterator pointed to.Queue
, separate Queue
from Deque
.TreeNodeEnableIndex
.iterator access denied
error message to reduce the packing size.Container
and add general functions.LinkList
to do optimization.length
property to all the container.pop
function including popBack
and popFront
to all the container which has such function.eraseElementByKey
which means whether erase successfully.push
or insert
function which means the size of the container.updateKeyByIterator
.HashContainer
implementation to optimize.ts
sourcemap for debug mode.this
param for forEach
function.find
, remove
, updateItem
and toArray
functions to PriorityQueue
.index
property to tree iterator which represents the sequential index of the iterator in the tree.checkWithinAccessParams
function.HashContainer
are moved to HashContainerConst
const enum.boolean
type to IteratorType
const enum type.TreeNode.color
is now changed from boolean
to TreeNodeColor
const enum.Queue
and Deque
should return undefined
when container is empty.Object.defineProperty'
to Proxy
.normal
and reverse
to boolean.SequentialContainer
and TreeBaseContainer
export in the index.es6
.Deque
from sequential queue to circular queue.Vector
length bugs.if (this.empty())
to if (!this.length)
.HashSet
api eraseElementByValue
's name to eraseElementByKey
.Set
's and Map
's name to OrderedSet
and OrderedMap
to distinguish it from the official container.OrderedSet
api eraseElementByValue
's name to eraseElementByKey
.eraseElementByIterator
function.T, K
to K, V
(don't affect using).find
, lowerBound
, upperBound
, reverseLowerBound
and reverseUpperBound
function's returned value to Iterator
.