Security News
CVE Volume Surges Past 48,000 in 2025 as WordPress Plugin Ecosystem Drives Growth
CVE disclosures hit a record 48,185 in 2025, driven largely by vulnerabilities in third-party WordPress plugins.
By Sarah Gooding - Jan 09, 2026
Lib0
Monorepo of isomorphic utility functions
This library is meant to replace all global JavaScript functions with isomorphic module imports. Additionally, it implements several performance-oriented utility modules. Most noteworthy are the binary encoding/decoding modules [lib0/encoding] / [lib0/decoding], the randomized testing framework [lib0/testing], the fast Pseudo Random Number Generator [lib0/PRNG], the small socket.io alternative [lib0/websocket], and the logging module [lib0/logging] that allows colorized logging in all environments. Lib0 has only one dependency, which is also from the author of lib0. If lib0 is transpiled with rollup or webpack, very little code is produced because of the way that it is written. All exports are pure and are removed by transpilers that support dead code elimination. Here is an example of how dead code elemination and mangling optimizes code from lib0:
// How the code is optimized by transpilers:
// lib0/json.js
export const stringify = JSON.stringify
export const parse = JSON.parse
// index.js
import * as json from 'lib0/json'
export const f = (arg1, arg2) => json.stringify(arg1) + json.stringify(arg2)
// compiled with rollup and uglifyjs:
const s=JSON.stringify,f=(a,b)=>s(a)+s(b)
export {f}
Performance resources
Each function in this library is tested thoroughly and is not deoptimized by v8 (except some logging and comparison functions that can't be implemented without deoptimizations). This library implements its own test suite that is designed for randomized testing and inspecting performance issues.
node --trace-deoptandnode --trace-opt- https://youtu.be/IFWulQnM5E0 Good intro video
- https://github.com/thlorenz/v8-perf
- https://github.com/thlorenz/deoptigate - A great tool for investigating deoptimizations
- https://github.com/vhf/v8-bailout-reasons - Description of some deopt messages
Code style
The code style might be a bit different from what you are used to. Stay open. Most of the design choices have been thought through. The purpose of this code style is to create code that is optimized by the compiler and that results in small code bundles when used with common module bundlers. Keep that in mind when reading the library.
- No polymorphism!
- Modules should only export pure functions and constants. This way the module bundler can eliminate dead code. The statement
const x = someCondition ? A : Bcannot be eleminated, because it is tied to a condition. - Use Classes for structuring data. Classes are well supported by jsdoc and are immediately optimized by the compiler. I.e. prefer
class Coord { constructor (x, y) { this.x = x; this.y = y} }instead of{ x: x, y: y }, because the compiler needs to be assured that the order of properties does not change.{ y: y, x: x }has a different hidden class than{ x: x, y: y }, which will lead to code deoptimizations if their use is alternated. - The user of your module should never create data objects with the
newkeyword. Prefer exporting factory functions likeconst createCoordinate = (x, y) => new Coord(x, y). - The use of class methods is discouraged, because method names can't be mangled or removed by dead code elimination.
- The only acceptable use of methods is when two objects implement functionality differently.
E.g.
class Duck { eat () { swallow() } }andclass Cow { eat () { chew() } }have the same signature, but implement it differently. - Prefer
constvariable declarations. Useletonly in loops.constalways leads to easier code. - Keep the potential execution stack small and compartmentalized. Nobody wants to debug spaghetti code.
- Give proper names to your functions and ask yourself if you would know what the function does if you saw it in the execution stack.
- Avoid recursion. There is a stack limit in most browsers and not every recursive function is optimized by the compiler.
- Semicolons are superfluous. Lint with https://standardjs.com/
Using lib0
lib0 contains isomorphic modules that work in nodejs, the browser, and other environments. It exports modules as the commonjs and the new esm module format.
If possible,
ESM module
import module from 'lib0/[module]' // automatically resolves to lib0/[module].js
CommonJS
require('lib0/[module]') // automatically resolves to lib0/dist/[module].cjs
Manual
Automatically resolving to commonjs and esm modules is implemented using conditional exports which is available in node>=v12. If support for older versions is required, then it is recommended to define the location of the module manually:
import module from 'lib0/[module].js'
// require('lib0/dist/[module].cjs')
Modules
[lib0/array] Utility module to work with Arrays.
import * as array from 'lib0/array'
Return the last element of an array. The element must exist
Append elements from src to dest
Transforms something array-like to an actual Array.
True iff condition holds on every element in the Array.
True iff condition holds on some element in the Array.
array.last(arr: ArrayLike<L>): Larray.create(): Array<C>array.copy(a: Array<D>): Array<D>array.appendTo(dest: Array<M>, src: Array<M>)array.from(arraylike: ArrayLike<T>|Iterable<T>): Tarray.every(arr: ARR, f: function(ITEM, number, ARR):boolean): booleanarray.some(arr: ARR, f: function(S, number, ARR):boolean): booleanarray.equalFlat(a: ArrayLike<ELEM>, b: ArrayLike<ELEM>): booleanarray.flatten(arr: Array<Array<ELEM>>): Array<ELEM>array.isArrayarray.unique(arr: Array<T>): Array<T>array.uniqueBy(arr: ArrayLike<T>, mapper: function(T):M): Array<T>[lib0/binary] Binary data constants.
import * as binary from 'lib0/binary'
n-th bit activated.
First n bits activated.
binary.BIT1: numberbinary.BIT2binary.BIT3binary.BIT4binary.BIT5binary.BIT6binary.BIT7binary.BIT8binary.BIT9binary.BIT10binary.BIT11binary.BIT12binary.BIT13binary.BIT14binary.BIT15binary.BIT16binary.BIT17binary.BIT18binary.BIT19binary.BIT20binary.BIT21binary.BIT22binary.BIT23binary.BIT24binary.BIT25binary.BIT26binary.BIT27binary.BIT28binary.BIT29binary.BIT30binary.BIT31binary.BIT32binary.BITS0: numberbinary.BITS1binary.BITS2binary.BITS3binary.BITS4binary.BITS5binary.BITS6binary.BITS7binary.BITS8binary.BITS9binary.BITS10binary.BITS11binary.BITS12binary.BITS13binary.BITS14binary.BITS15binary.BITS16binary.BITS17binary.BITS18binary.BITS19binary.BITS20binary.BITS21binary.BITS22binary.BITS23binary.BITS24binary.BITS25binary.BITS26binary.BITS27binary.BITS28binary.BITS29binary.BITS30binary.BITS31: numberbinary.BITS32: number[lib0/broadcastchannel] Helpers for cross-tab communication using broadcastchannel with LocalStorage fallback.
import * as broadcastchannel from 'lib0/broadcastchannel'
// In browser window A:
broadcastchannel.subscribe('my events', data => console.log(data))
broadcastchannel.publish('my events', 'Hello world!') // => A: 'Hello world!' fires synchronously in same tab
// In browser window B:
broadcastchannel.publish('my events', 'hello from tab B') // => A: 'hello from tab B'
Subscribe to global
publishevents.Unsubscribe from
publishglobal events.Publish data to all subscribers (including subscribers on this tab)
broadcastchannel.subscribe(room: string, f: function(any, any):any)broadcastchannel.unsubscribe(room: string, f: function(any, any):any)broadcastchannel.publish(room: string, data: any, origin: any)[lib0/buffer] Utility functions to work with buffers (Uint8Array).
import * as buffer from 'lib0/buffer'
Create Uint8Array with initial content from buffer
Create Uint8Array with initial content from buffer
Copy the content of an Uint8Array view to a new ArrayBuffer.
Encode anything as a UInt8Array. It's a pun on typescripts's
anytype. See encoding.writeAny for more information.Decode an any-encoded value.
buffer.createUint8ArrayFromLen(len: number)buffer.createUint8ArrayViewFromArrayBuffer(buffer: ArrayBuffer, byteOffset: number, length: number)buffer.createUint8ArrayFromArrayBuffer(buffer: ArrayBuffer)buffer.toBase64buffer.fromBase64buffer.copyUint8Array(uint8Array: Uint8Array): Uint8Arraybuffer.encodeAny(data: any): Uint8Arraybuffer.decodeAny(buf: Uint8Array): any[lib0/cache] An implementation of a map which has keys that expire.
import * as cache from 'lib0/cache'
Works well in conjunktion with setIfUndefined which has an async init function. Using getAsync & setIfUndefined ensures that the init function is only called once.
new cache.Cache(timeout: number)cache.removeStale(cache: module:cache.Cache<K, V>): numbercache.set(cache: module:cache.Cache<K, V>, key: K, value: V)cache.get(cache: module:cache.Cache<K, V>, key: K): V | undefinedcache.refreshTimeout(cache: module:cache.Cache<K, V>, key: K)cache.getAsync(cache: module:cache.Cache<K, V>, key: K): V | Promise<V> | undefinedcache.remove(cache: module:cache.Cache<K, V>, key: K)cache.setIfUndefined(cache: module:cache.Cache<K, V>, key: K, init: function():Promise<V>, removeNull: boolean): Promise<V> | Vcache.create(timeout: number)[lib0/component] Web components.
import * as component from 'lib0/component'
component.registry: CustomElementRegistrycomponent.define(name: string, constr: any, opts: ElementDefinitionOptions)component.whenDefined(name: string): Promise<CustomElementConstructor>new component.Lib0Component(state: S)component.Lib0Component#state: S|nullcomponent.Lib0Component#setState(state: S, forceStateUpdate: boolean)component.Lib0Component#updateState(stateUpdate: any)component.createComponent(name: string, cnf: module:component~CONF<T>): Class<module:component.Lib0Component>component.createComponentDefiner(definer: function)component.defineListComponentcomponent.defineLazyLoadingComponent[lib0/conditions] Often used conditions.
import * as conditions from 'lib0/conditions'
conditions.undefinedToNull[lib0/crypto]
import * as crypto from 'lib0/crypto'
y(data: string | Uint8Array): Uint8ArrayymmetricKey(secret: string | Uint8Array, salt: string | Uint8Array, opts: Object, opts.extractable: boolean, opts.usages: Array<'sign'|'verify'|'encrypt'|'decrypt'>): PromiseLike<CryptoKey>ymmetricKey()eAsymmetricKey(opts: Object, opts.extractable: boolean, opts.usages: Array<'sign'|'verify'|'encrypt'|'decrypt'>)eAsymmetricKey()ey(key: CryptoKey)ey()ymmetricKey(jwk: any, opts: Object, opts.extractable: boolean, opts.usages: Array<'sign'|'verify'|'encrypt'|'decrypt'>)ymmetricKey()symmetricKey(jwk: any, opts: Object, opts.extractable: boolean, opts.usages: Array<'sign'|'verify'|'encrypt'|'decrypt'>)symmetricKey()(data: Uint8Array, key: CryptoKey): PromiseLike<Uint8Array>()(data: Uint8Array, key: CryptoKey): PromiseLike<Uint8Array>()(data: Uint8Array, privateKey: CryptoKey): PromiseLike<Uint8Array>()(signature: Uint8Array, data: Uint8Array, publicKey: CryptoKey): PromiseLike<boolean>()[lib0/decoding] Efficient schema-less binary decoding with support for variable length encoding.
import * as decoding from 'lib0/decoding'
Use [lib0/decoding] with [lib0/encoding]. Every encoding function has a corresponding decoding function.
Encodes numbers in little-endian order (least to most significant byte order) and is compatible with Golang's binary encoding (https://golang.org/pkg/encoding/binary/) which is also used in Protocol Buffers.
// encoding step
const encoder = encoding.createEncoder()
encoding.writeVarUint(encoder, 256)
encoding.writeVarString(encoder, 'Hello world!')
const buf = encoding.toUint8Array(encoder)
// decoding step
const decoder = decoding.createDecoder(buf)
decoding.readVarUint(decoder) // => 256
decoding.readVarString(decoder) // => 'Hello world!'
decoding.hasContent(decoder) // => false - all data is read
A Decoder handles the decoding of an Uint8Array.
Decoding target.
Current decoding position.
Clone a decoder instance. Optionally set a new position parameter.
Create an Uint8Array view of the next
lenbytes and advance the position bylen.Important: The Uint8Array still points to the underlying ArrayBuffer. Make sure to discard the result as soon as possible to prevent any memory leaks. Use
buffer.copyUint8Arrayto copy the result into a new Uint8Array.Read variable length Uint8Array.
Important: The Uint8Array still points to the underlying ArrayBuffer. Make sure to discard the result as soon as possible to prevent any memory leaks. Use
buffer.copyUint8Arrayto copy the result into a new Uint8Array.Read the rest of the content as an ArrayBuffer
Skip one byte, jump to the next position.
Read one byte as unsigned integer.
Read 2 bytes as unsigned integer.
Read 4 bytes as unsigned integer.
Read 4 bytes as unsigned integer in big endian order. (most significant byte first)
Look ahead without incrementing the position to the next byte and read it as unsigned integer.
Look ahead without incrementing the position to the next byte and read it as unsigned integer.
Look ahead without incrementing the position to the next byte and read it as unsigned integer.
Read unsigned integer (32bit) with variable length. 1/8th of the storage is used as encoding overhead.
- numbers < 2^7 is stored in one bytlength
- numbers < 2^14 is stored in two bylength
Read signed integer (32bit) with variable length. 1/8th of the storage is used as encoding overhead.
- numbers < 2^7 is stored in one bytlength
- numbers < 2^14 is stored in two bylength
Look ahead and read varUint without incrementing position
Look ahead and read varUint without incrementing position
Look ahead and read varString without incrementing position
T must not be null.
Current state
Current state
Current state
Decoding target.
Current decoding position.
Decoding target.
Current decoding position.
Decoding target.
Current decoding position.
Decoding target.
Current decoding position.
Decoding target.
Current decoding position.
Decoding target.
Current decoding position.
new decoding.Decoder(uint8Array: Uint8Array)decoding.Decoder#arr: Uint8Arraydecoding.Decoder#pos: numberdecoding.createDecoder(uint8Array: Uint8Array): module:decoding.Decoderdecoding.hasContent(decoder: module:decoding.Decoder): booleandecoding.clone(decoder: module:decoding.Decoder, newPos: number): module:decoding.Decoderdecoding.readUint8Array(decoder: module:decoding.Decoder, len: number): Uint8Arraydecoding.readVarUint8Array(decoder: module:decoding.Decoder): Uint8Arraydecoding.readTailAsUint8Array(decoder: module:decoding.Decoder): Uint8Arraydecoding.skip8(decoder: module:decoding.Decoder): numberdecoding.readUint8(decoder: module:decoding.Decoder): numberdecoding.readUint16(decoder: module:decoding.Decoder): numberdecoding.readUint32(decoder: module:decoding.Decoder): numberdecoding.readUint32BigEndian(decoder: module:decoding.Decoder): numberdecoding.peekUint8(decoder: module:decoding.Decoder): numberdecoding.peekUint16(decoder: module:decoding.Decoder): numberdecoding.peekUint32(decoder: module:decoding.Decoder): numberdecoding.readVarUint(decoder: module:decoding.Decoder): numberdecoding.readVarInt(decoder: module:decoding.Decoder): numberdecoding.peekVarUint(decoder: module:decoding.Decoder): numberdecoding.peekVarInt(decoder: module:decoding.Decoder): numberdecoding.readVarStringdecoding.peekVarString(decoder: module:decoding.Decoder): stringdecoding.readFromDataView(decoder: module:decoding.Decoder, len: number): DataViewdecoding.readFloat32(decoder: module:decoding.Decoder)decoding.readFloat64(decoder: module:decoding.Decoder)decoding.readBigInt64(decoder: module:decoding.Decoder)decoding.readBigUint64(decoder: module:decoding.Decoder)decoding.readAny(decoder: module:decoding.Decoder)new decoding.RleDecoder(uint8Array: Uint8Array, reader: function(module:decoding.Decoder):T)decoding.RleDecoder#s: T|nulldecoding.RleDecoder#read()decoding.RleDecoder#s: Tnew decoding.IntDiffDecoder(uint8Array: Uint8Array, start: number)decoding.IntDiffDecoder#s: numberdecoding.IntDiffDecoder#read(): numbernew decoding.RleIntDiffDecoder(uint8Array: Uint8Array, start: number)decoding.RleIntDiffDecoder#s: numberdecoding.RleIntDiffDecoder#read(): numberdecoding.RleIntDiffDecoder#s: numbernew decoding.UintOptRleDecoder(uint8Array: Uint8Array)decoding.UintOptRleDecoder#s: numberdecoding.UintOptRleDecoder#read()decoding.UintOptRleDecoder#s: numbernew decoding.IncUintOptRleDecoder(uint8Array: Uint8Array)decoding.IncUintOptRleDecoder#s: numberdecoding.IncUintOptRleDecoder#read()new decoding.IntDiffOptRleDecoder(uint8Array: Uint8Array)decoding.IntDiffOptRleDecoder#s: numberdecoding.IntDiffOptRleDecoder#read(): numbernew decoding.StringDecoder(uint8Array: Uint8Array)decoding.StringDecoder#spos: numberdecoding.StringDecoder#read(): stringdecoding.RleDecoder#arr: Uint8Arraydecoding.RleDecoder#pos: numberdecoding.IntDiffDecoder#arr: Uint8Arraydecoding.IntDiffDecoder#pos: numberdecoding.RleIntDiffDecoder#arr: Uint8Arraydecoding.RleIntDiffDecoder#pos: numberdecoding.UintOptRleDecoder#arr: Uint8Arraydecoding.UintOptRleDecoder#pos: numberdecoding.IncUintOptRleDecoder#arr: Uint8Arraydecoding.IncUintOptRleDecoder#pos: numberdecoding.IntDiffOptRleDecoder#arr: Uint8Arraydecoding.IntDiffOptRleDecoder#pos: number[lib0/diff] Efficient diffs.
import * as diff from 'lib0/diff'
Create a diff between two strings. This diff implementation is highly efficient, but not very sophisticated.
Create a diff between two arrays. This diff implementation is highly efficient, but not very sophisticated.
Note: This is basically the same function as above. Another function was created so that the runtime can better optimize these function calls.
Diff text and try to diff at the current cursor position.
diff.simpleDiffString(a: string, b: string): module:diff~SimpleDiff<string>diff.simpleDiffdiff.simpleDiffArray(a: Array<T>, b: Array<T>, compare: function(T, T):boolean): module:diff~SimpleDiff<Array<T>>diff.simpleDiffStringWithCursor(a: string, b: string, cursor: number)[lib0/dom] Utility module to work with the DOM.
import * as dom from 'lib0/dom'
dom.doc: Documentdom.createElementdom.createDocumentFragmentdom.createTextNodedom.domParserdom.emitCustomEventdom.setAttributesdom.setAttributesMapdom.fragmentdom.appenddom.removedom.addEventListenerdom.removeEventListenerdom.addEventListenersdom.removeEventListenersdom.elementdom.canvasdom.textdom.pairToStyleStringdom.pairsToStyleStringdom.mapToStyleStringdom.querySelectordom.querySelectorAlldom.getElementByIddom.parseFragmentdom.childNodes: anydom.parseElementdom.replaceWithdom.insertBeforedom.appendChilddom.ELEMENT_NODEdom.TEXT_NODEdom.CDATA_SECTION_NODEdom.COMMENT_NODEdom.DOCUMENT_NODEdom.DOCUMENT_TYPE_NODEdom.DOCUMENT_FRAGMENT_NODEdom.checkNodeType(node: any, type: number)dom.isParentOf(parent: Node, child: HTMLElement)[lib0/encoding] Efficient schema-less binary encoding with support for variable length encoding.
import * as encoding from 'lib0/encoding'
Use [lib0/encoding] with [lib0/decoding]. Every encoding function has a corresponding decoding function.
Encodes numbers in little-endian order (least to most significant byte order) and is compatible with Golang's binary encoding (https://golang.org/pkg/encoding/binary/) which is also used in Protocol Buffers.
// encoding step
const encoder = encoding.createEncoder()
encoding.writeVarUint(encoder, 256)
encoding.writeVarString(encoder, 'Hello world!')
const buf = encoding.toUint8Array(encoder)
// decoding step
const decoder = decoding.createDecoder(buf)
decoding.readVarUint(decoder) // => 256
decoding.readVarString(decoder) // => 'Hello world!'
decoding.hasContent(decoder) // => false - all data is read
A BinaryEncoder handles the encoding to an Uint8Array.
The current length of the encoded data.
Transform to Uint8Array.
Verify that it is possible to write
lenbytes wtihout checking. If necessary, a new Buffer with the required length is attached.Write one byte to the encoder.
Write one byte at a specific position. Position must already be written (i.e. encoder.length > pos)
Write one byte as an unsigned integer.
Write one byte as an unsigned Integer at a specific location.
Write two bytes as an unsigned integer.
Write two bytes as an unsigned integer at a specific location.
Write two bytes as an unsigned integer
Write two bytes as an unsigned integer in big endian order. (most significant byte first)
Write two bytes as an unsigned integer at a specific location.
Write a variable length unsigned integer. Max encodable integer is 2^53.
Write a variable length integer.
We use the 7th bit instead for signaling that this is a negative number.
Write the content of another Encoder.
Append fixed-length Uint8Array to the encoder.
Append an Uint8Array to Encoder.
Create an DataView of the next
lenbytes. Use it to write data after calling this function.// write float32 using DataView const dv = writeOnDataView(encoder, 4) dv.setFloat32(0, 1.1) // read float32 using DataView const dv = readFromDataView(encoder, 4) dv.getFloat32(0) // => 1.100000023841858 (leaving it to the reader to find out why this is the correct result)Encode data with efficient binary format.
Differences to JSON: • Transforms data to a binary format (not to a string) • Encodes undefined, NaN, and ArrayBuffer (these can't be represented in JSON) • Numbers are efficiently encoded either as a variable length integer, as a 32 bit float, as a 64 bit float, or as a 64 bit bigint.
Encoding table:
Data Type Prefix Encoding Method Comment undefined 127 Functions, symbol, and everything that cannot be identified is encoded as undefined null 126 integer 125 writeVarInt Only encodes 32 bit signed integers float32 124 writeFloat32 float64 123 writeFloat64 bigint 122 writeBigInt64 boolean (false) 121 True and false are different data types so we save the following byte boolean (true) 120 - 0b01111000 so the last bit determines whether true or false string 119 writeVarString object<string,any> 118 custom Writes {length} then {length} key-value pairs array 117 custom Writes {length} then {length} json values Uint8Array 116 writeVarUint8Array We use Uint8Array for any kind of binary data Reasons for the decreasing prefix: We need the first bit for extendability (later we may want to encode the prefix with writeVarUint). The remaining 7 bits are divided as follows: [0-30] the beginning of the data range is used for custom purposes (defined by the function that uses this library) [31-127] the end of the data range is used for data encoding by lib0/encoding.js
Now come a few stateful encoder that have their own classes.
Current state
Basic diff decoder using variable length encoding.
Encodes the values [3, 1100, 1101, 1050, 0] to [3, 1097, 1, -51, -1050] using writeVarInt.
Current state
A combination of IntDiffEncoder and RleEncoder.
Basically first writes the IntDiffEncoder and then counts duplicate diffs using RleEncoding.
Encodes the values [1,1,1,2,3,4,5,6] as [1,1,0,2,1,5] (RLE([1,0,0,1,1,1,1,1]) ⇒ RleIntDiff[1,1,0,2,1,5])
Current state
Optimized Rle encoder that does not suffer from the mentioned problem of the basic Rle encoder.
Internally uses VarInt encoder to write unsigned integers. If the input occurs multiple times, we write write it as a negative number. The UintOptRleDecoder then understands that it needs to read a count.
Encodes [1,2,3,3,3] as [1,2,-3,3] (once 1, once 2, three times 3)
Increasing Uint Optimized RLE Encoder
The RLE encoder counts the number of same occurences of the same value. The IncUintOptRle encoder counts if the value increases. I.e. 7, 8, 9, 10 will be encoded as [-7, 4]. 1, 3, 5 will be encoded as [1, 3, 5].
A combination of the IntDiffEncoder and the UintOptRleEncoder.
The count approach is similar to the UintDiffOptRleEncoder, but instead of using the negative bitflag, it encodes in the LSB whether a count is to be read. Therefore this Encoder only supports 31 bit integers!
Encodes [1, 2, 3, 2] as [3, 1, 6, -1] (more specifically [(1 << 1) | 1, (3 << 0) | 0, -1])
Internally uses variable length encoding. Contrary to normal UintVar encoding, the first byte contains:
- 1 bit that denotes whether the next value is a count (LSB)
- 1 bit that denotes whether this value is negative (MSB - 1)
- 1 bit that denotes whether to continue reading the variable length integer (MSB)
Therefore, only five bits remain to encode diff ranges.
Use this Encoder only when appropriate. In most cases, this is probably a bad idea.
Optimized String Encoder.
Encoding many small strings in a simple Encoder is not very efficient. The function call to decode a string takes some time and creates references that must be eventually deleted. In practice, when decoding several million small strings, the GC will kick in more and more often to collect orphaned string objects (or maybe there is another reason?).
This string encoder solves the above problem. All strings are concatenated and written as a single string using a single encoding call.
The lengths are encoded using a UintOptRleEncoder.
new encoding.Encoder()encoding.Encoder#bufs: Array<Uint8Array>encoding.createEncoder(): module:encoding.Encoderencoding.length(encoder: module:encoding.Encoder): numberencoding.toUint8Array(encoder: module:encoding.Encoder): Uint8Arrayencoding.verifyLen(encoder: module:encoding.Encoder, len: number)encoding.write(encoder: module:encoding.Encoder, num: number)encoding.set(encoder: module:encoding.Encoder, pos: number, num: number)encoding.writeUint8(encoder: module:encoding.Encoder, num: number)encoding.setUint8(encoder: module:encoding.Encoder, pos: number, num: number)encoding.writeUint16(encoder: module:encoding.Encoder, num: number)encoding.setUint16(encoder: module:encoding.Encoder, pos: number, num: number)encoding.writeUint32(encoder: module:encoding.Encoder, num: number)encoding.writeUint32BigEndian(encoder: module:encoding.Encoder, num: number)encoding.setUint32(encoder: module:encoding.Encoder, pos: number, num: number)encoding.writeVarUint(encoder: module:encoding.Encoder, num: number)encoding.writeVarInt(encoder: module:encoding.Encoder, num: number)encoding.writeVarStringencoding.writeBinaryEncoder(encoder: module:encoding.Encoder, append: module:encoding.Encoder)encoding.writeUint8Array(encoder: module:encoding.Encoder, uint8Array: Uint8Array)encoding.writeVarUint8Array(encoder: module:encoding.Encoder, uint8Array: Uint8Array)encoding.writeOnDataView(encoder: module:encoding.Encoder, len: number): DataViewencoding.writeFloat32(encoder: module:encoding.Encoder, num: number)encoding.writeFloat64(encoder: module:encoding.Encoder, num: number)encoding.writeBigInt64(encoder: module:encoding.Encoder, num: bigint)encoding.writeBigUint64(encoder: module:encoding.Encoder, num: bigint)encoding.writeAny(encoder: module:encoding.Encoder, data: undefined|null|number|bigint|boolean|string|Object<string,any>|Array<any>|Uint8Array)new encoding.RleEncoder(writer: function(module:encoding.Encoder, T):void)encoding.RleEncoder#s: T|nullencoding.RleEncoder#write(v: T)new encoding.IntDiffEncoder(start: number)encoding.IntDiffEncoder#s: numberencoding.IntDiffEncoder#write(v: number)new encoding.RleIntDiffEncoder(start: number)encoding.RleIntDiffEncoder#s: numberencoding.RleIntDiffEncoder#write(v: number)new encoding.UintOptRleEncoder()encoding.UintOptRleEncoder#s: numberencoding.UintOptRleEncoder#write(v: number)encoding.UintOptRleEncoder#toUint8Array()new encoding.IncUintOptRleEncoder()encoding.IncUintOptRleEncoder#s: numberencoding.IncUintOptRleEncoder#write(v: number)encoding.IncUintOptRleEncoder#toUint8Array()new encoding.IntDiffOptRleEncoder()encoding.IntDiffOptRleEncoder#s: numberencoding.IntDiffOptRleEncoder#write(v: number)encoding.IntDiffOptRleEncoder#toUint8Array()new encoding.StringEncoder()encoding.StringEncoder#sarr: Array<string>encoding.StringEncoder#write(string: string)encoding.StringEncoder#toUint8Array()encoding.RleEncoder#bufs: Array<Uint8Array>encoding.IntDiffEncoder#bufs: Array<Uint8Array>encoding.RleIntDiffEncoder#bufs: Array<Uint8Array>[lib0/environment] Isomorphic module to work access the environment (query params, env variables).
import * as env from 'lib0/environment'
env.isNodeenv.isBrowserenv.isMacenv.hasParamenv.getParamenv.getVariableenv.getConf(name: string): string|nullenv.hasConfenv.productionenv.supportsColor[lib0/error] Error helpers.
import * as error from 'lib0/error'
error.create(s: string): Errorerror.methodUnimplemented(): nevererror.unexpectedCase(): never[lib0/eventloop] Utility module to work with EcmaScript's event loop.
import * as eventloop from 'lib0/eventloop'
Note: this is experimental and is probably only useful in browsers.
eventloop.enqueue(f: function():void)eventloop#destroy()eventloop.timeout(timeout: number, callback: function): module:eventloop~TimeoutObjecteventloop.interval(timeout: number, callback: function): module:eventloop~TimeoutObjecteventloop.Animationeventloop.animationFrame(cb: function(number):void): module:eventloop~TimeoutObjecteventloop.idleCallback(cb: function): module:eventloop~TimeoutObjecteventloop.createDebouncer(timeout: number): function(function():void):void[lib0/function] Common functions and function call helpers.
import * as function from 'lib0/function'
Calls all functions in
fswith args. Only throws after all functions were called.
function.callAll(fs: Array<function>, args: Array<any>)function.nopfunction.apply(f: function():T): Tfunction.id(a: A): Afunction.equalityStrict(a: T, b: T): booleanfunction.equalityFlat(a: Array<T>|object, b: Array<T>|object): booleanfunction.equalityDeep(a: any, b: any): booleanfunction.isOneOf(value: V, options: Array<OPTS>)[lib0/lib0] Experimental method to import lib0.
import * as lib0 from 'lib0/index'
Not recommended if the module bundler doesn't support dead code elimination.
[lib0/indexeddb] Helpers to work with IndexedDB.
import * as indexeddb from 'lib0/indexeddb'
IDB Request to Promise transformer
Iterate on keys and values
Iterate on the keys (no values)
Open store from transaction
indexeddb.rtop(request: IDBRequest): Promise<any>indexeddb.openDB(name: string, initDB: function(IDBDatabase):any): Promise<IDBDatabase>indexeddb.deleteDB(name: string)indexeddb.createStores(db: IDBDatabase, definitions: Array<Array<string>|Array<string|IDBObjectStoreParameters|undefined>>)indexeddb.transact(db: IDBDatabase, stores: Array<string>, access: "readwrite"|"readonly"): Array<IDBObjectStore>indexeddb.count(store: IDBObjectStore, range: IDBKeyRange): Promise<number>indexeddb.get(store: IDBObjectStore, key: String | number | ArrayBuffer | Date | Array<any> ): Promise<String | number | ArrayBuffer | Date | Array<any>>indexeddb.del(store: IDBObjectStore, key: String | number | ArrayBuffer | Date | IDBKeyRange | Array<any> )indexeddb.put(store: IDBObjectStore, item: String | number | ArrayBuffer | Date | boolean, key: String | number | ArrayBuffer | Date | Array<any>)indexeddb.add(store: IDBObjectStore, item: String|number|ArrayBuffer|Date|boolean, key: String|number|ArrayBuffer|Date|Array.<any>): Promise<any>indexeddb.addAutoKey(store: IDBObjectStore, item: String|number|ArrayBuffer|Date): Promise<number>indexeddb.getAll(store: IDBObjectStore, range: IDBKeyRange, limit: number): Promise<Array<any>>indexeddb.getAllKeys(store: IDBObjectStore, range: IDBKeyRange, limit: number): Promise<Array<any>>indexeddb.queryFirst(store: IDBObjectStore, query: IDBKeyRange|null, direction: 'next'|'prev'|'nextunique'|'prevunique'): Promise<any>indexeddb.getLastKey(store: IDBObjectStore, range: IDBKeyRange?): Promise<any>indexeddb.getFirstKey(store: IDBObjectStore, range: IDBKeyRange?): Promise<any>indexeddb.getAllKeysValues(store: IDBObjectStore, range: IDBKeyRange, limit: number): Promise<Array<KeyValuePair>>indexeddb.iterate(store: IDBObjectStore, keyrange: IDBKeyRange|null, f: function(any,any):void|boolean|Promise<void|boolean>, direction: 'next'|'prev'|'nextunique'|'prevunique')indexeddb.iterateKeys(store: IDBObjectStore, keyrange: IDBKeyRange|null, f: function(any):void|boolean|Promise<void|boolean>, direction: 'next'|'prev'|'nextunique'|'prevunique')indexeddb.getStore(t: IDBTransaction, store: String)IDBObjectStoreindexeddb.createIDBKeyRangeBound(lower: any, upper: any, lowerOpen: boolean, upperOpen: boolean)indexeddb.createIDBKeyRangeUpperBound(upper: any, upperOpen: boolean)indexeddb.createIDBKeyRangeLowerBound(lower: any, lowerOpen: boolean)[lib0/isomorphic] Isomorphic library exports from isomorphic.js.
import * as isomorphic from 'lib0/isomorphic'
[lib0/iterator] Utility module to create and manipulate Iterators.
import * as iterator from 'lib0/iterator'
iterator.mapIterator(iterator: Iterator<T>, f: function(T):R): IterableIterator<R>iterator.createIterator(next: function():IteratorResult<T>): IterableIterator<T>iterator.iteratorFilter(iterator: Iterator<T>, filter: function(T):boolean)iterator.iteratorMap(iterator: Iterator<T>, fmap: function(T):M)[lib0/json] JSON utility functions.
import * as json from 'lib0/json'
Transform JavaScript object to JSON.
Parse JSON object.
json.stringify(object: any): stringjson.parse(json: string): any[lib0/list]
import * as list from 'lib0/list'
Remove a single node from the queue. Only works with Queues that operate on Doubly-linked lists of nodes.
Remove a single node from the queue. Only works with Queues that operate on Doubly-linked lists of nodes.
new e#ListNode()e#next: this|nulle#prev: this|nullnew st()art: N | nulld: N | null(): module:list.List<N>()(queue: module:list.List<N>)()(queue: module:list.List<N>, node: N)()odeode()etween(queue: module:list.List<N>, left: N| null, right: N| null, node: N)etween()(queue: module:list.List<N>, node: N, newNode: N)()(queue: module:list.List<N>, n: N)()nt(queue: module:list.List<N>, n: N)nt()t(list: module:list.List<N>): N| nullt()(list: module:list.List<N>): N| null()(list: module:list.List<N>, f: function(N):M): Array<M>()(list: module:list.List<N>)()(list: module:list.List<N>, f: function(N):M)()[lib0/logging] Isomorphic logging module with support for colors!
import * as logging from 'lib0/logging'
logging.BOLDlogging.UNBOLDlogging.BLUElogging.GREYlogging.GREENlogging.REDlogging.PURPLElogging.ORANGElogging.UNCOLORlogging.print(args: Array<string|Symbol|Object|number>)logging.warn(args: Array<string|Symbol|Object|number>)logging.printError(err: Error)logging.printImg(url: string, height: number)logging.printImgBase64(base64: string, height: number)logging.group(args: Array<string|Symbol|Object|number>)logging.groupCollapsed(args: Array<string|Symbol|Object|number>)logging.groupEndlogging.printDom(createNode: function():Node)logging.printCanvas(canvas: HTMLCanvasElement, height: number)logging.vconsolesnew logging.VConsole(dom: Element)logging.VConsole#ccontainer: Elementlogging.VConsole#group(args: Array<string|Symbol|Object|number>, collapsed: boolean)logging.VConsole#groupCollapsed(args: Array<string|Symbol|Object|number>)logging.VConsole#groupEnd()logging.VConsole#print(args: Array<string|Symbol|Object|number>)logging.VConsole#printError(err: Error)logging.VConsole#printImg(url: string, height: number)logging.VConsole#printDom(node: Node)logging.VConsole#destroy()logging.createVConsole(dom: Element)logging.createModuleLogger(moduleName: string): function(...any):void[lib0/map] Utility module to work with key-value stores.
import * as map from 'lib0/map'
Creates a new Map instance.
Copy a Map object into a fresh Map object.
Get map property. Create T if property is undefined and set T on map.
const listeners = map.setIfUndefined(events, 'eventName', set.create) listeners.add(listener)Creates an Array and populates it with the content of all key-value pairs using the
f(value, key)function.Tests whether any key-value pairs pass the test implemented by
f(value, key).Tests whether all key-value pairs pass the test implemented by
f(value, key).
map.create(): Map<any, any>map.copy(m: Map<X,Y>): Map<X,Y>map.setIfUndefined(map: Map<K, T>, key: K, createT: function():T): Tmap.map(m: Map<K,V>, f: function(V,K):R): Array<R>map.any(m: Map<K,V>, f: function(V,K):boolean): booleanmap.all(m: Map<K,V>, f: function(V,K):boolean): boolean[lib0/math] Common Math expressions.
import * as math from 'lib0/math'
Base 10 exponential function. Returns the value of 10 raised to the power of pow.
math.floormath.ceilmath.absmath.imulmath.roundmath.log10math.log2math.logmath.sqrtmath.add(a: number, b: number): numbermath.min(a: number, b: number): numbermath.max(a: number, b: number): numbermath.isNaNmath.powmath.exp10(exp: number): numbermath.signmath.isNegativeZero(n: number): boolean[lib0/metric] Utility module to convert metric values.
import * as metric from 'lib0/metric'
Calculate the metric prefix for a number. Assumes E.g.
prefix(1000) = { n: 1, prefix: 'k' }
metric.yottametric.zettametric.exametric.petametric.terametric.gigametric.megametric.kilometric.hectometric.decametric.decimetric.centimetric.millimetric.micrometric.nanometric.picometric.femtometric.attometric.zeptometric.yoctometric.prefix(n: number, baseMultiplier: number): {n:number,prefix:string}[lib0/mutex] Mutual exclude for JavaScript.
import * as mutex from 'lib0/mutex'
Creates a mutual exclude function with the following property:
const mutex = createMutex() mutex(() => { // This function is immediately executed mutex(() => { // This function is not executed, as the mutex is already active. }) })
mutex.createMutex(): mutex[lib0/number]
import * as number from 'lib0/number'
number.MAX_SAFE_INTEGERnumber.MIN_SAFE_INTEGERnumber.LOWEST_INT32number.HIGHEST_INT32: numbernumber.isIntegernumber.isNaNnumber.parseInt[lib0/object] Utility functions for working with EcmaScript objects.
import * as object from 'lib0/object'
Object.assign
Calls
Object.prototype.hasOwnProperty.
object.create(): Object<string,any>object.assignobject.keys(obj: Object<string,any>)object.forEach(obj: Object<string,any>, f: function(any,string):any)object.map(obj: Object<string,any>, f: function(any,string):R): Array<R>object.length(obj: Object<string,any>): numberobject.some(obj: Object<string,any>, f: function(any,string):boolean): booleanobject.isEmpty(obj: Object|undefined)object.every(obj: Object<string,any>, f: function(any,string):boolean): booleanobject.hasProperty(obj: any, key: string|symbol): booleanobject.equalFlat(a: Object<string,any>, b: Object<string,any>): boolean[lib0/observable] Observable class prototype.
import * as observable from 'lib0/observable'
Handles named events.
Emit a named event. All registered event listeners that listen to the specified name will receive the event.
Emit a named event. All registered event listeners that listen to the specified name will receive the event.
new observable.Observable()observable.Observable#on(name: N, f: function)observable.Observable#once(name: N, f: function)observable.Observable#off(name: N, f: function)observable.Observable#emit(name: N, args: Array<any>)observable.Observable#destroy()websocket.WebsocketClient#on(name: N, f: function)websocket.WebsocketClient#once(name: N, f: function)websocket.WebsocketClient#off(name: N, f: function)websocket.WebsocketClient#emit(name: N, args: Array<any>)[lib0/pair] Working with value pairs.
import * as pair from 'lib0/pair'
new pair.Pair(left: L, right: R)pair.create(left: L, right: R): module:pair.Pair<L,R>pair.createReversed(right: R, left: L): module:pair.Pair<L,R>pair.forEach(arr: Array<module:pair.Pair<L,R>>, f: function(L, R):any)pair.map(arr: Array<module:pair.Pair<L,R>>, f: function(L, R):X): Array<X>[lib0/prng] Fast Pseudo Random Number Generators.
import * as prng from 'lib0/prng'
Given a seed a PRNG generates a sequence of numbers that cannot be reasonably predicted. Two PRNGs must generate the same random sequence of numbers if given the same seed.
Create a Xoroshiro128plus Pseudo-Random-Number-Generator. This is the fastest full-period generator passing BigCrush without systematic failures. But there are more PRNGs available in ./PRNG/.
Generates a single random bool.
Generates a random integer with 53 bit resolution.
Generates a random integer with 53 bit resolution.
Generates a random integer with 32 bit resolution.
Generates a random integer with 53 bit resolution.
Generates a random real on [0, 1) with 53 bit resolution.
Generates a random character from char code 32 - 126. I.e. Characters, Numbers, special characters, and Space:
TODO: this function produces invalid runes. Does not cover all of utf16!!
Returns one element of a given array.
prng.DefaultPRNGprng.create(seed: number): module:prng~PRNGprng.bool(gen: module:prng~PRNG): Booleanprng.int53(gen: module:prng~PRNG, min: Number, max: Number): Numberprng.uint53(gen: module:prng~PRNG, min: Number, max: Number): Numberprng.int32(gen: module:prng~PRNG, min: Number, max: Number): Numberprng.uint32(gen: module:prng~PRNG, min: Number, max: Number): Numberprng.int31(gen: module:prng~PRNG, min: Number, max: Number): Numberprng.real53(gen: module:prng~PRNG): Numberprng.char(gen: module:prng~PRNG): stringprng.letter(gen: module:prng~PRNG): stringprng.word(gen: module:prng~PRNG, minLen: number, maxLen: number): stringprng.utf16Rune(gen: module:prng~PRNG): stringprng.utf16String(gen: module:prng~PRNG, maxlen: number)prng.oneOf(gen: module:prng~PRNG, array: Array<T>): Tprng.uint8Array(gen: module:prng~PRNG, len: number): Uint8Arrayprng.uint16Array(gen: module:prng~PRNG, len: number): Uint16Arrayprng.uint32Array(gen: module:prng~PRNG, len: number): Uint32Array[lib0/promise] Utility helpers to work with promises.
import * as promise from 'lib0/promise'
Promise.allwait for all promises in the array to resolve and return the resultChecks if an object is a promise using ducktyping.
Promises are often polyfilled, so it makes sense to add some additional guarantees if the user of this library has some insane environment where global Promise objects are overwritten.
promise.create(f: function(PromiseResolve<T>,function(Error):void):any): Promise<T>promise.createEmpty(f: function(function():void,function(Error):void):void): Promise<void>promise.all(arrp: Array<Promise<T>>): Promise<Array<T>>promise.reject(reason: Error): Promise<never>promise.resolve(res: T|void): Promise<T|void>promise.resolveWith(res: T): Promise<T>promise.until(timeout: number, check: function():boolean, intervalResolution: number): Promise<void>promise.wait(timeout: number): Promise<undefined>promise.isPromise(p: any): boolean[lib0/queue]
import * as queue from 'lib0/queue'
new de#QueueNode()de#next: module:queue.QueueNode|nullnew ueue()tart: module:queue.QueueNode | nullnd: module:queue.QueueNode | null(): module:queue.Queue()(queue: module:queue.Queue)()(queue: module:queue.Queue, n: module:queue.QueueNode)()(queue: module:queue.Queue): module:queue.QueueNode | null()[lib0/random] Isomorphic module for true random numbers / buffers / uuids.
import * as random from 'lib0/random'
Attention: falls back to Math.random if the browser does not support crypto.
random.randrandom.uint32random.uint53random.oneOf(arr: Array<T>): Trandom.uuidv4[lib0/set] Utility module to work with sets.
import * as set from 'lib0/set'
set.createset.toArray(set: Set<T>): Array<T>set.first(set: Set<T>): Tset.from(entries: Iterable<T>): Set<T>[lib0/sort] Efficient sort implementations.
import * as sort from 'lib0/sort'
Note: These sort implementations were created to compare different sorting algorithms in JavaScript. Don't use them if you don't know what you are doing. Native Array.sort is almost always a better choice.
This algorithm beats Array.prototype.sort in Chrome only with arrays with 10 million entries. In most cases [].sort will do just fine. Make sure to performance test your use-case before you integrate this algorithm.
Note that Chrome's sort is now a stable algorithm (Timsort). Quicksort is not stable.
sort.insertionSort(arr: Array<T>, compare: function(T,T):number): voidsort.quicksort(arr: Array<T>, compare: function(T,T):number): void[lib0/statistics] Utility helpers for generating statistics.
import * as statistics from 'lib0/statistics'
statistics.median(arr: Array<number>): numberstatistics.average(arr: Array<number>): number[lib0/storage] Isomorphic variable storage.
import * as storage from 'lib0/storage'
Uses LocalStorage in the browser and falls back to in-memory storage.
This is basically localStorage in browser, or a polyfill in nodejs
A polyfill for
addEventListener('storage', event => {..})that does nothing if the polyfill is being used.
storage.varStoragestorage.onChange(eventHandler: function({ key: string, newValue: string, oldValue: string }): void)[lib0/string] Utility module to work with strings.
import * as string from 'lib0/string'
Compute the utf8ByteLength
string.fromCharCodestring.fromCodePointstring.trimLeft(s: string): stringstring.fromCamelCase(s: string, separator: string): stringstring.utf8ByteLength(str: string): numberstring.utf8TextEncoderstring.encodeUtf8string.decodeUtf8string.splice(str: string, index: number, remove: number, insert: string)[lib0/symbol] Utility module to work with EcmaScript Symbols.
import * as symbol from 'lib0/symbol'
Return fresh symbol.
symbol.create(): Symbolsymbol.isSymbol(s: any): boolean[lib0/testing] Testing framework with support for generating tests.
import * as testing from 'lib0/testing'
// test.js template for creating a test executable
import { runTests } from 'lib0/testing'
import * as log from 'lib0/logging'
import * as mod1 from './mod1.test.js'
import * as mod2 from './mod2.test.js'
import { isBrowser, isNode } from 'lib0/environment.js'
if (isBrowser) {
// optional: if this is ran in the browser, attach a virtual console to the dom
log.createVConsole(document.body)
}
runTests({
mod1,
mod2,
}).then(success => {
if (isNode) {
process.exit(success ? 0 : 1)
}
})
// mod1.test.js
/**
* runTests automatically tests all exported functions that start with "test".
* The name of the function should be in camelCase and is used for the logging output.
*
* @param {t.TestCase} tc
*\/
export const testMyFirstTest = tc => {
t.compare({ a: 4 }, { a: 4 }, 'objects are equal')
}
Now you can simply run node test.js to run your test or run test.js in the browser.
A PRNG for this test case. Use only this PRNG for randomness to make the test case reproducible.
Describe what you are currently testing. The message will be logged.
export const testMyFirstTest = tc => { t.describe('crunching numbers', 'already crunched 4 numbers!') // the optional second argument can describe the state. }Describe the state of the current computation.
export const testMyFirstTest = tc => { t.info(already crunched 4 numbers!') // the optional second argument can describe the state. }Group outputs in a collapsible category.
export const testMyFirstTest = tc => { t.group('subtest 1', () => { t.describe('this message is part of a collapsible section') }) await t.groupAsync('subtest async 2', async () => { await someaction() t.describe('this message is part of a collapsible section') }) }Group outputs in a collapsible category.
export const testMyFirstTest = async tc => { t.group('subtest 1', () => { t.describe('this message is part of a collapsible section') }) await t.groupAsync('subtest async 2', async () => { await someaction() t.describe('this message is part of a collapsible section') }) }Measure the time that it takes to calculate something.
export const testMyFirstTest = async tc => { t.measureTime('measurement', () => { heavyCalculation() }) await t.groupAsync('async measurement', async () => { await heavyAsyncCalculation() }) }Measure the time that it takes to calculate something.
export const testMyFirstTest = async tc => { t.measureTimeAsync('measurement', async () => { await heavyCalculation() }) await t.groupAsync('async measurement', async () => { await heavyAsyncCalculation() }) }
testing.extensivetesting.envSeednew testing.TestCase(moduleName: string, testName: string)testing.TestCase#moduleName: stringtesting.TestCase#testName: stringtesting.TestCase#resetSeed()testing.TestCase#prng: prng.PRNGtesting.repetitionTimetesting.run(moduleName: string, name: string, f: function(module:testing.TestCase):void|Promise<any>, i: number, numberOfTests: number)testing.describe(description: string, info: string)testing.info(info: string)testing.printDomtesting.printCanvastesting.group(description: string, f: function(void):void)testing.groupAsync(description: string, f: function(void):Promise<any>)testing.measureTime(message: string, f: function():void): numbertesting.measureTimeAsync(message: string, f: function():Promise<any>): Promise<number>testing.compareArrays(as: Array<T>, bs: Array<T>, m: string): booleantesting.compareStrings(a: string, b: string, m: string)testing.compareObjects(a: Object<K,V>, b: Object<K,V>, m: string)testing.compare(a: T, b: T, message: string?, customCompare: function(any,T,T,string,any):boolean)testing.assert(condition: boolean, message: string?)testing.promiseRejected(f: function():Promise<any>)testing.fails(f: function():void)testing.runTests(tests: Object<string, Object<string, function(module:testing.TestCase):void|Promise<any>>>)testing.fail(reason: string)testing.skip(cond: boolean)[lib0/time] Utility module to work with time.
import * as time from 'lib0/time'
Return current time.
Return current unix time.
Transform time (in ms) to a human readable format. E.g. 1100 => 1.1s. 60s => 1min. .001 => 10μs.
time.getDate(): Datetime.getUnixTime(): numbertime.humanizeDuration(d: number): string[lib0/tree] Red-black-tree implementation.
import * as tree from 'lib0/tree'
This is a Red Black Tree implementation
new tree.Tree()tree.Tree#findNext(id: K)tree.Tree#findPrev(id: K)tree.Tree#findNodeWithLowerBound(from: K)tree.Tree#findNodeWithUpperBound(to: K)tree.Tree#findSmallestNode(): Vtree.Tree#findWithLowerBound(from: K): Vtree.Tree#findWithUpperBound(to: K): Vtree.Tree#iterate(from: K, from: K, f: K)tree.Tree#find(id: K): V|nulltree.Tree#findNode(id: K): module:tree~N<V>|nulltree.Tree#delete(id: K)tree.Tree#put()[lib0/url] Utility module to work with urls.
import * as url from 'lib0/url'
Parse query parameters from an url.
url.decodeQueryParams(url: string): Object<string,string>url.encodeQueryParams(params: Object<string,string>): string[lib0/webcrypto.browser]
import * as webcrypto.browser from 'lib0/webcrypto.browser'
()omValuesomValues()[lib0/webcrypto.node]
import * as webcrypto.node from 'lib0/webcrypto.node'
()to.subtle: anyomValuesomValues()[lib0/websocket] Tiny websocket connection handler.
import * as websocket from 'lib0/websocket'
Implements exponential backoff reconnects, ping/pong, and a nice event system using [lib0/observable].
Whether to connect to other peers or not
new websocket.WebsocketClient(url: string, opts: object, opts.binaryType: 'arraybuffer' | 'blob' | null)websocket.WebsocketClient#ws: WebSocket?websocket.WebsocketClient#shouldConnect: booleanwebsocket.WebsocketClient#send(message: any)websocket.WebsocketClient#destroy()websocket.WebsocketClient#disconnect()websocket.WebsocketClient#connect()React-Native support
React-native apps should be able to use lib0. You need to install a polyfill for webcrypto and enable package-exports support in react-native:
# install polyfill
npm i isomorphic-webcrypto@^2.3.8 # last known working version was 2.3.8
Add this to metro.config.js (see docs):
const config = {
// ...
resolver: {
unstable_enablePackageExports: true
}
}
License
The MIT License © Kevin Jahns
Other packages similar to lib0
lodash
Lodash is a popular utility library that provides a wide range of functions for common programming tasks, such as manipulating arrays and objects, and working with functions and strings. Compared to lib0, Lodash has a larger community and more comprehensive documentation, but it is also larger in size.
underscore
Underscore is another utility library similar to Lodash, offering a variety of functions for functional programming. It is known for its simplicity and ease of use. While it provides many of the same utilities as lib0, it is not as lightweight and may not include some of the more specialized data structures found in lib0.
ramda
Ramda is a functional programming library for JavaScript that emphasizes immutability and pure functions. It provides a different approach compared to lib0, focusing more on functional programming paradigms. Ramda is a good choice for projects that require a functional programming style.
FAQs
> Monorepo of isomorphic utility functions
The npm package lib0 receives a total of 1,942,702 weekly downloads. As such, lib0 popularity was classified as popular.
We found that lib0 demonstrated a healthy version release cadence and project activity because the last version was released less than a year ago. It has 1 open source maintainer collaborating on the project.
Package last updated on 30 Dec 2025
Did you know?
Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.
Related posts
Security News
Insecure Agents Podcast: Certified Patches, Supply Chain Security, and AI Agents
Socket CEO Feross Aboukhadijeh joins Insecure Agents to discuss CVE remediation and why supply chain attacks require a different security approach.
By Sarah Gooding - Jan 08, 2026
Security News
Tailwind CSS Announces 75% Layoffs as LLMs Reshape OSS Business Models
Tailwind Labs laid off 75% of its engineering team after revenue dropped 80%, as LLMs redirect traffic away from documentation where developers discover paid products.
By Sarah Gooding - Jan 08, 2026