Skip to content
This repository

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP

Data structure for representing lists with fast insert, remove, and lookup from element to index.

branch: master

Fetching latest commit…

Octocat-spinner-32-eaf2f5

Cannot retrieve the latest commit at this time

Octocat-spinner-32 test
Octocat-spinner-32 Makefile
Octocat-spinner-32 README.md
Octocat-spinner-32 index.js
README.md

Enumtree

Fast enumeration tree - represents an ordered sequence of elements with O(n) insert, remove, and position

Supports the following operations:

  • insert(id, pos) - insert element id at position pos
  • remove(pos) - remove element at position pos
  • pos(id) - return the position of element id

Status

Currently have part of a proof-of-concept in node.js, the "real" implementation will be in C.

TODO

  • Red-Black balancing
  • Delete
  • Implement in blazing-fast C
Something went wrong with that request. Please try again.