@subspace/red-black-tree/dist/utils.d.ts

This library provides advanced implementation of Red-black tree, which is a kind of self-balancing binary search tree for JavaScript

export declare function compareUint8Array(aKey: Uint8Array, bKey: Uint8Array): -1 | 0 | 1;
/**
 * If one key is longer than other, extra length is not checked
 *
 * @param aKey
 * @param bKey
 */
export declare function uint8ArraysDiff(aKey: Uint8Array, bKey: Uint8Array): bigint;
export declare function maxNumberToBytes(maxNumber: number): number;
/**
 * @param source
 * @param offset At which offset in bytes to start reading a number
 * @param numberOfBytes How many bytes are used to store a number
 */
export declare function getNumberFromBytes(source: Uint8Array, offset: number, numberOfBytes: number): number;
/**
 * @param source
 * @param offset At which offset in bytes to start writing a number
 * @param numberOfBytes How many bytes are used to store a number
 * @param newNumber Number that should be set
 */
export declare function setNumberToBytes(source: Uint8Array, offset: number, numberOfBytes: number, newNumber: number): void;