A purely functional red-black tree data structure
JavaScript
389
41
MIT License
This is a JavaScript library that provides a fully persistent, functional red-black tree data structure. It allows for non-destructive updates where operations return new tree versions while sharing structure with previous versions, using O(log n) additional memory per update. The library is useful for applications that need to maintain multiple versions of a data structure or perform historical queries, such as geometric algorithms or tracking algorithm execution history.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of mikolalysenko/functional-red-black-tree
Generates an array of consecutive integers starting at 0
tap-producing test harness for node and browsers
Support the repos that depend on this repository
Top contributors
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet