@blackglory/structures 0.10.6 → 0.10.9

package/README.md

@@ -219,10 +219,12 @@ 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> {
@@ -265,6 +267,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 +283,7 @@ class TypedSparseSet<T extends UnsignedTypedArrayConstructor> {
 
   has(value: number): boolean
   add(value: number): void
-  delete(value: number): void
+  delete(value: number): boolean
 }
 ```
 
@@ -328,7 +331,9 @@ class BitSet {
 
   has(value: number): boolean
   add(value: number): void
-  delete(value: number): void
+  delete(value: number): boolean
   clear(): void
 }
 ```
+
+Due to the length of arrays supported by JavaScript, `BitSet` cannot support very large values.