Algorithms: Range Queries

def fenwick_add(tree: list[int], index: int, delta: int) -> int:
    alg_require(isinstance(tree, list) and len(tree) <= 1000000)
    alg_require(type(index) is int and -2147483648 <= index <= 2147483647)
    alg_require(type(delta) is int and -2147483648 <= delta <= 2147483647)
    n: int = len(tree) - 1
    alg_require(n >= 0 and n <= 1000000)
    alg_require(len(tree) == n + 1)
    alg_require(index >= 0 and index < n)
    index += 1
    while index <= n:
        tree[index] += delta
        index += index & -index

int fenwick_add(int *tree, size_t tree_length, int index, int delta) {
    int alg_error = 0;
    int alg_result = INT_MIN;
    errno = 0;
    if (tree_length > 1000000 || (tree_length && !tree)) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
    int n = alg_sub((int)tree_length, 1, &alg_error);
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    if (!(((n >= 0) && (n <= 1000000)))) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    if (!(((int)tree_length == alg_add(n, 1, &alg_error)))) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    if (!(((index >= 0) && (index < n)))) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }

int fenwick_add(std::vector<int>& tree, int index, int delta) {
    alg_require(tree.size() <= 1000000);
    int n = alg_sub((int)tree.size(), 1);
    alg_require(((n >= 0) && (n <= 1000000)));
    alg_require(((int)tree.size() == alg_add(n, 1)));
    alg_require(((index >= 0) && (index < n)));
    index = alg_add(index, 1);
    while ((index <= n)) {
        tree[index] = alg_add(tree[index], delta);
        index = alg_add(index, (index & alg_sub(0, index)));
    }
    return 0;

    static int fenwick_add(Span<int> tree, int index, int delta) {
        checked {
            int n = (tree.Length - 1);
            alg_require(((n >= 0) && (n <= 1000000)));
            alg_require((tree.Length == (n + 1)));
            alg_require(((index >= 0) && (index < n)));
            index = (index + 1);
            while ((index <= n)) {
                tree[index] = (tree[index] + delta);
                index = (index + (index & (-index)));
            }
            return 0;

function fenwick_add(array &$tree, int $index, int $delta): int {
    alg_require(array_is_list($tree));
    $n = alg_sub(count($tree), 1);
    alg_require((($n >= 0) && ($n <= 1000000)));
    alg_require((count($tree) == alg_add($n, 1)));
    alg_require((($index >= 0) && ($index < $n)));
    $index = alg_add($index, 1);
    while (($index <= $n)) {
        $tree[$index] = alg_add($tree[$index], $delta);
        $index = alg_add($index, ($index & alg_sub(0, $index)));
    }
    return 0;