Results for “Std.FenwickTree.FenwickTree”

Use module:Std.List, kind:fn, or is:exact. Put a Pudu type after ::.

• Std.FenwickTree.FenwickTree

  A low-level Binary Indexed Tree for O(log n) prefix sums and point updates.

  type · Std.FenwickTree
• Std.FenwickTree.add&Std.FenwickTree.FenwickTree -> Int -> Int -> Option[Std.FenwickTree.FenwickTree]

  Adds delta to the 1-based element at index in O(log n) time.

  fn · Std.FenwickTree
• Std.FenwickTree.createInt -> Std.FenwickTree.FenwickTree

  Allocates a zero-initialized Fenwick tree for sequence length elementCount.

  fn · Std.FenwickTree
• Std.FenwickTree.findPrefix&Std.FenwickTree.FenwickTree -> Int -> Option[Int]

  Finds the smallest 1-based index whose prefix sum is >= targetSum in O(log n) time.

  fn · Std.FenwickTree
• Std.FenwickTree.fromArray&Array[Int] -> Std.FenwickTree.FenwickTree

  Builds a Fenwick tree in strict O(n) linear time from an array of initial values.

  fn · Std.FenwickTree
• Std.FenwickTree.get&Std.FenwickTree.FenwickTree -> Int -> Option[Int]

  Retrieves the single value at 1-based index in O(log n) time.

  fn · Std.FenwickTree
• Std.FenwickTree.prefixSum&Std.FenwickTree.FenwickTree -> Int -> Option[Int]

  Computes the prefix sum up to 1-based index in O(log n) time.

  fn · Std.FenwickTree
• Std.FenwickTree.rangeSum&Std.FenwickTree.FenwickTree -> Int -> Int -> Option[Int]

  Computes the range sum [left, right] inclusive in O(log n) time.

  fn · Std.FenwickTree
• Std.FenwickTree.set&Std.FenwickTree.FenwickTree -> Int -> Int -> Option[Std.FenwickTree.FenwickTree]

  Sets the 1-based element at index to value.

  fn · Std.FenwickTree
• Std.FenwickTree.size&Std.FenwickTree.FenwickTree -> Int

  Returns the number of elements in the tree.

  fn · Std.FenwickTree
• Std.FenwickTree.toArray&Std.FenwickTree.FenwickTree -> Array[Int]

  Materializes the tree values into a standard 0-indexed array.

  fn · Std.FenwickTree