Fenwick tree

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

Zero-dependency, zero-GC family of O(log n) data structures that proves its logarithm: BinaryHeap (array-embedded O(log n) push/pop min-heap), Fenwick/BIT (O(log n) point-update AND prefix-sum via the i & -i walk), SegmentTree (O(log n) associative range-

Fenwick Tree for prefix sums

Compute prefix sums of arrays in O(log n)

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.

Framework-free data engine behind the OGE UI suite: DataSource contract (array, custom, OData), filtering/sorting/grouping pipeline, virtualization math and CSV export.

Algorithms and data-structures implemented on JavaScript

High-performance virtual scrolling component for React with variable item heights

Signal-based Angular data grid: virtualized rendering for 100k+ rows, filtering, grouping, editing, selection, column virtualization, state persistence and Excel/PDF export.

Ultra-fast React virtualization library - 120+ FPS, 10M+ items, powered by Rust/WASM

Data-structures and algorithms implemented on TypeScript

React Native renderer for mugen — virtualized lists with analytic row heights, measured with pretext-native, never the host layout.

A JavaScript implementation of Binary Indexed Tree with fast initialization

Algorithm primitives and data structures for Reynard applications