Skip to content

an unsigned integer collection with O(1) time complexity for addition, deletion, and lookup. Iteration is O(n).

License

Notifications You must be signed in to change notification settings

gigann/sparse-set-js

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

23 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

sparse-set-js

A sparse set is a performant, set-like unsigned integer collection, providing O(1) time complexity for addition, deletion, and lookup. Iteration is O(n).

Features

  • ECMA Script 2015 (ES6) style API
  • Framework agnostic
  • TypeScript compatible

Installation

npm install https://github.com/gigann/sparse-set-js.git

Usage

Import

import SparseSet from 'sparse-set';

Initialize

let sset = new SparseSet(capacity, maximumValue);

Insert - O(1)

sset.add(1);

Delete - O(1)

sset.delete(1);

Lookup - O(1)

sset.has(1);

Iterate - O(n)

sset.forEach(e => {
  someFunction(e);
});

Clear - O(1)

sset.clear();

About

an unsigned integer collection with O(1) time complexity for addition, deletion, and lookup. Iteration is O(n).

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published