@blackglory/structures 0.10.7 → 0.10.10

package/README.md

@@ -219,14 +219,17 @@ class SparseSet implements Iterable<number> {
 
   has(value: number): boolean
   add(value: number): void
-  delete(value: number): void
+  delete(value: number): boolean
 }
 ```
 
+Note that `SparseSet` is not faster than JavaScript's built-in `Set` in many cases.
+
 ### SparseMap
 ```ts
 class SparseMap<T> {
   get [Symbol.toStringTag](): string
+  get size(): number
 
   entries(): IterableIterator<[key: number, value: T]>
   keys(): IterableIterator<number>
@@ -265,6 +268,7 @@ class DynamicTypedArray<T extends TypedArrayConstructor> {
   get(index: number): number | undefined
   push(...values: number[]): void
   pop(): number | undefined
+  sort(compare?: (a: number, b: number) => number): void
 }
 ```
 
@@ -280,7 +284,7 @@ class TypedSparseSet<T extends UnsignedTypedArrayConstructor> {
 
   has(value: number): boolean
   add(value: number): void
-  delete(value: number): void
+  delete(value: number): boolean
 }
 ```
 
@@ -288,6 +292,7 @@ class TypedSparseSet<T extends UnsignedTypedArrayConstructor> {
 ```ts
 class TypedSparseMap<T extends TypedArrayConstructor> {
   get [Symbol.toStringTag](): string
+  get size(): number
 
   constructor(array: DynamicTypedArray<T>)
 
@@ -332,3 +337,5 @@ class BitSet {
   clear(): void
 }
 ```
+
+Due to the length of arrays supported by JavaScript, `BitSet` cannot support very large values.