Compute prefix sums of arrays in O(log n)

Fenwick tree

Binary Indexed Tree(aka Fenwick Tree) implementation

Binary Indexed Tree (aka Fenwick Tree) implementation using a Redis backend

A 1-based Fenwick Tree implementation.

A fenwick tree.

Fenwick Tree for prefix sums

Fenwick Tree with log(n) update and query to implement a prefix sum. [Article](https://medium.com/carpanese/a-visual-introduction-to-fenwick-tree-89b82cac5b3c)

Virtual scroll engine with zero DOM measurement. Fenwick tree + composable height providers.

Zero-dependency segment tree and Fenwick tree (BIT) for range queries and prefix sums — TypeScript-first npm equivalent of Python sortedcontainers range structures and Java segment trees.

htmlparser2 tree adapter for parse5.

mdast utility to serialize markdown

mdast utility to parse markdown

mdast extension to parse and serialize GFM task list items

unist utility to visit nodes

unist utility to recursively walk over nodes, with ancestral information

mdast extension to parse and serialize GFM (GitHub Flavored Markdown)

Color helpers to ease transformation between formats, gamut, etc

TypeScript definitions for @babel/generator

mdast utility to transform to hast