Optimal evaluation of some lambda terms
ECMAScript spec abstract operations.
JWA implementation (supports all JWS algorithms)
A collection of implementation for ECMAScript abstract operations
Write Pino transports easily
Implementation of JSON Web Signatures
ECMAScript “ToPrimitive” algorithm. Provides ES5 and ES2015 versions.
ECMAScript (ESTree) AST walker
An Abstract Class for describing an Ethereum Provider for ethers.
A Light–weight CSS Preprocessor
An Abstract Class for desribing an Ethereum Signer for ethers.
Abstract class for a lexicographically sorted key-value database
utf8 to/from bytes codec (esm/cjs)
[](https://www.npmjs.com/package/@loaderkit/resolve) [](https://github.com/braidnetworks/loaderkit/blob/main/LICENSE) [![gith
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
Detect the indentation of code
Sniff the encoding from a HTML byte stream
Simple “Least Recently Used” (LRU) cache
The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
rehype plugin to add `id` attributes to headings
Fast 2D concave hull algorithm in JavaScript (generates an outline of a point set)
The lightest signal library.
A noop logger that conforms to the Log4j interface for modules to stub out internal logging
encode/decode number as bitcoin variable length integer
DEVp2p aims to provide a lightweight abstraction layer that provides these low-level algorithms, protocols and services in a transparent framework without predetermining the eventual transmission-use-cases of the protocols.
Pegarus is, broadly, an implementation of LPEG on Rubinius. LPEG implements a Parsing Expression Grammar using a parsing machine rather than the Packrat algorithm. (See "A Text Pattern-Matching Tool based on Parsing Expression Grammars" by Roberto Ierusalimschy.) Pegarus actually implements an abstract syntax tree (AST) for the PEG. There are various options to execute the AST against a subject string. One option is a simple AST-walking evaluator. A second option is an implementation of the LPEG parsing machine. A third option is a compiler that targets Rubinius bytecode.
No description provided.
No description provided.
No description provided.
No description provided.