Binary Trees written in TypeScript
Binary Search Trees
Different binary search tree implementations, including a self-balancing one (AVL)
Tree or binary tree printer, print any tree to terminal or debug window
High-performance (binary) tree and sorted map implementation (AVL, Splay, Radix, Red-Black)
Different binary search tree implementations, including a self-balancing one (AVL)
MessagePack for ECMA-262/JavaScript/TypeScript
List of binary file extensions
Check if a binary is working
A fork of `binary-search-tree` 0.2.x with upgraded dependencies from the Sails core team.
Cross-Platform Binary API
Interval search tree with TypeScript support
Check whether a binary version satisfies a semver range
Unpack multibyte binary values from buffers
JavaScript implementation of the BSER Binary Serialization
Check if a file path is a binary file
Detect the file type of a file, stream, or data
Efficient Binary heap (priority queue, binary tree) data structure for JavaScript / TypeScript. Includes JavaScript methods, Python's heapq module methods, and Java's PriorityQueue methods.
Turn any collection of objects into its own efficient tree or linked list using Symbol
Fast CBOR with a focus on strictness
reads a BMFont binary in a Buffer into a JSON object
This is an implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
Get the version of a binary in semver format
CLI for generating fast incremental parsers
Tokyo Cabinet is a library of routines for managing a database. The database is a simple data file containing records, each is a pair of a key and a value. Every key and value is serial bytes with variable length. Both binary data and character string can be used as a key and a value. There is neither concept of data tables nor data types. Records are organized in hash table, B+ tree, or fixed-length array.
Kyoto Cabinet is a library of routines for managing a database. The database is a simple data file containing records, each is a pair of a key and a value. Every key and value is serial bytes with variable length. Both binary data and character string can be used as a key and a value. Each key must be unique within a database. There is neither concept of data tables nor data types. Records are organized in hash table or B+ tree.
Kyoto Cabinet is a library of routines for managing a database. The database is a simple data file containing records, each is a pair of a key and a value. Every key and value is serial bytes with variable length. Both binary data and character string can be used as a key and a value. Each key must be unique within a database. There is neither concept of data tables nor data types. Records are organized in hash table or B+ tree.
Kyoto Cabinet is a library of routines for managing a database. The database is a simple data file containing records, each is a pair of a key and a value. Every key and value is serial bytes with variable length. Both binary data and character string can be used as a key and a value. Each key must be unique within a database. There is neither concept of data tables nor data types. Records are organized in hash table or B+ tree.
Kyoto Cabinet is a library of routines for managing a database. The database is a simple data file containing records, each is a pair of a key and a value. Every key and value is serial bytes with variable length. Both binary data and character string can be used as a key and a value. Each key must be unique within a database. There is neither concept of data tables nor data types. Records are organized in hash table or B+ tree.
No description provided.
No description provided.
No description provided.