A K-Means clustering library for React / Vue / Angular / Typescript / Javascript, featuring K-Means++ initialisation and support for multiple runs to ensure optimal inertia

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".

Yet Another Linked List

Find a file or directory by walking up parent directories

Turn a function into an `http.Agent` instance

An HTTP(s) proxy `http.Agent` implementation for HTTPS

Brand checking of React Elements.

Get the path of the parent module

merge<A, B, C, ...>(a: {[k: string]: A}, b: {[k: string]: B}, c: {[k: string]: C}, ...): {[k: string]: A|B|C|...}

Import a module while bypassing the cache

Get a stream as a string, Buffer, ArrayBuffer or array

YAML 1.2 parser and serializer

the most correct and second fastest glob implementation in JavaScript

[](https://www.npmjs.com/package/@smithy/types) [](https://www.npmjs.com/package/@smithy/types)

Tiny JavaScript tokenizer.

An Esprima-compatible JavaScript parser built on Acorn

A utility to retry failed async methods.

A simple cache for a few of the JS Error constructors.

Node.js releases data

A collection of token providers