Binary Tree. Javascript & Typescript Data Structure.
bodec =====
Framework-independent loaders for 3D graphics formats
Describe binary structures with full TypeScript support. Encode and decode into pure JavaScript objects.
Binary Search Trees
buffer operations
Returns an array of Typed Array names that are available in the current environment
Robustly get the byte offset of a Typed Array
Tree or binary tree printer, print any tree to terminal or debug window
Get the ArrayBuffer out of a TypedArray, robustly.
Is this value a JS Typed Array? This module works cross-realm/iframe, does not depend on `instanceof` or mutable properties, and despite ES6 Symbol.toStringTag.
A simple list of possible Typed Array names.
Robustly get the length of a Typed Array
Which kind of Typed Array is this JavaScript value? Works cross-realm, without `instanceof`, and despite Symbol.toStringTag.
Arrays.
Convert a typed array to a Buffer without a copy
Robustly get the byte length of a Typed Array
High-performance (binary) tree and sorted map implementation (AVL, Splay, Radix, Red-Black)
Different binary search tree implementations, including a self-balancing one (AVL)
TypeScript definitions for linkify-it
Check if a file path is a binary file
No description provided.
List of binary file extensions
Yet another simple Postgres SQL parser/modifier
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.