A JavaScript implementation of Binary Indexed Tree with fast initialization

Binary Indexed Tree(aka Fenwick Tree) implementation

N-dimensional Binary Indexed Tree

Zero-dependency data structures: linked lists (doubly/singly linked, circular), deques, ring buffers, unrolled lists, caches (LRU, LFU, SLRU, Clock, FIFO), heaps (binary, indexed, pairing), timer wheels, object pools, queues, stacks, splay trees, skip lis

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

List of binary file extensions

Check if a file path is a binary file

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

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

Angular wrapper to IndexedDB database.

Check whether a binary version satisfies a semver range

IndexedDB-based stamper for @turnkey/http

Unpack multibyte binary values from buffers

Reads a binary file to determine its CPU architecture.

Check if a binary is working

Get the version of a binary in semver format

JavaScript implementation of the BSER Binary Serialization

Detects if a file is binary in Node.js. Similar to Perl's -B.

Binary Search Trees

Helper function to build binary assignment operator visitors