Compute prefix sums of arrays in O(log n)
Binary Indexed Tree(aka Fenwick Tree) implementation
Fenwick tree
A fenwick tree.
Binary Indexed Tree (aka Fenwick Tree) implementation using a Redis backend
A 1-based Fenwick Tree implementation.
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)
Fenwick Tree for prefix sums
Virtual scroll engine with zero DOM measurement. Fenwick tree + composable height providers.
htmlparser2 tree adapter for parse5.
Algorithms and data-structures implemented on JavaScript
mdast utility to serialize markdown
unist utility to visit nodes
mdast extension to parse and serialize GFM task list items
mdast utility to parse markdown
mdast extension to parse and serialize GFM (GitHub Flavored Markdown)
TypeScript definitions for @babel/generator
unist utility to recursively walk over nodes, with ancestral information
Regular Expressions parser in JavaScript
Color helpers to ease transformation between formats, gamut, etc
unist utility to get the position of a node
mdast extension to parse and serialize GFM tables
TypeScript definitions for @babel/traverse
TypeScript definitions for unist
An implementation of a binary indexed tree (Fenwick tree) data structure in Rust.
fenwick-tree-based test utils for the 'arithmetic-coding' crate