Binary Indexed Tree(aka Fenwick Tree) implementation

A JavaScript implementation of Binary Indexed Tree with fast initialization

N-dimensional Binary Indexed Tree

Binary Indexed Tree (aka Fenwick Tree) implementation using a Redis backend

Binary Search Trees

Tree or binary tree printer, print any tree to terminal or debug window

Different binary search tree implementations, including a self-balancing one (AVL)

Utilities and Classes for parsing, formatting and managing Ethereum ABIs.

High-performance (binary) tree and sorted map implementation (AVL, Splay, Radix, Red-Black)

The primary functions of the world state package are to maintain the collection of Merkle Trees comprising the global state of the system and to offer an interface with which the trees can be queried.

IndexedDB-based stamper for @turnkey/http

List of binary file extensions

The Merkle Trees package contains typescript implementations of the various Merkle Trees required by the system.

Check if a file path is a binary file

Server-side DOM implementation based on Mozilla's dom.js

This is an implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.

MessagePack for ECMA-262/JavaScript/TypeScript

CLI for generating fast incremental parsers

Array#filter() with also detecting indexes of filtered values

A logger for just about everything.