Kivach
Cascading donations
Add repoPopularDonorsF.A.Q.
My repos

Footer

Subscribe to our newsletter

The latest news, articles, and resources, sent to your inbox.

DiscordTelegramTwitterMediumFacebookYouTubeGitHub

All information about repositories belongs to their owners.

More information about Kivach in the introductory article.

Built on Obyte

This project provides JavaScript implementations of binary search trees (BinTree) and self-balancing red-black trees (RBTree), offering efficient data storage and retrieval in sorted order. It's designed for developers needing performant tree data structures in JavaScript applications, with usage ranging from simple sorted collections to complex algorithms requiring ordered data. The library is suitable for both Node.js and browser environments, making it versatile for various JavaScript projects.

Total donated
Undistributed
Share with your subscribers:

Recipients

How the donated funds are distributed

Support the dependencies of vadimg/js_bintrees

Account's avatar
caolan/nodeunit
Easy unit testing for node.js and the browser.
Account's avatar
jshint/jshint
Static analysis tool for JavaScript
Account's avatar
jashkenas/underscore
JavaScript's functional programming helper library.

Support the repos that depend on this repository

Top contributors

vadimg's profile
vadimg
50 contributions
defunctzombie's profile
defunctzombie
11 contributions
datatypevoid's profile
datatypevoid
1 contributions
mikolalysenko's profile
mikolalysenko
1 contributions
stephantabor's profile
stephantabor
1 contributions
mamod's profile
mamod
1 contributions

Recent events

Kivach works on the Obyte network, and therefore you can track all donations.

No events yet
vadimg

vadimg/js_bintrees

Javascript implementation of binary search trees

JavaScript
225
51
MIT License