A Fenwick Tree (also known as a Binary Indexed Tree) that supports efficient prefix sum, range sum and point queries, as well as point updates. The Fenwick Tree uses **1-based** indexing internally but presents a **0-based** interface to the user. This design improves efficiency and simplifies both internal operations and external usage.
source not stored for this graph (policy: none)
nothing calls this directly
no outgoing calls
no test coverage detected