The lodash method `_.ary` exported as a module.

Clips function argument lengths.

Functionality for modelling n-ary trees

n-ary tree implementation in JavaScript(TypeScript).

An n-ary Huffman algorithm implementation.

High-performance d-ary heap priority queue with O(1) item lookup, configurable arity, and min/max heap support

A complete k-ary tree is a k-ary tree which is maximally space efficient. It must be completely filled on every level except for the last level. However, if the last level is not complete, then all nodes of the tree must be "as far left as possible".

n-ary trees

d-ary heap data structure library for JavaScript

n-ary tree mutation library.

A tree data structure

A library for working with n-ary tree.

(bin)ary encryption algorithm based off cipherHash (ch)

OLPC JSON canonicalization

Some experimental HOFs for composing n-ary functions

CLI to add LibAry components to your project

n-ary gray codes of radix k

Generate n-ary trees for visualization

nv-cli-ary-set ===================== - nv-cli-ary-set - simple cli tool, creat dict mirror of array

MCP server for browsing and installing LibAry components