Results for “Std.FenwickTree.findPrefix”

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

• 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