Results for “Std.IntervalTree.Interval”

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

• Std.IntervalTree.Interval

  Closed 1D interval where low <= high.

  type · Std.IntervalTree
• Std.IntervalTree.intervalInt -> Int -> Option[Std.IntervalTree.Interval]

  Validates and constructs an interval where low <= high.

  fn · Std.IntervalTree
• Std.IntervalTree.emptyStd.IntervalTree.IntervalTree

  Creates an empty interval tree.

  fn · Std.IntervalTree
• Std.IntervalTree.findOverlaps&Std.IntervalTree.IntervalTree -> Std.IntervalTree.Interval -> Array[Std.IntervalTree.Interval]

  Finds all intervals in the tree that overlap with the query interval.

  fn · Std.IntervalTree
• Std.IntervalTree.fromIntervals&Array[Std.IntervalTree.Interval] -> Std.IntervalTree.IntervalTree

  Builds a balanced interval tree from an array of intervals in O(n log n) time.

  fn · Std.IntervalTree
• Std.IntervalTree.hasOverlap&Std.IntervalTree.IntervalTree -> Std.IntervalTree.Interval -> Bool

  Tests whether any interval in the tree overlaps with the query interval.

  fn · Std.IntervalTree
• Std.IntervalTree.insert&Std.IntervalTree.IntervalTree -> Std.IntervalTree.Interval -> Std.IntervalTree.IntervalTree

  Inserts an interval into the tree and updates subtree maximum endpoints.

  fn · Std.IntervalTree
• Std.IntervalTree.isEmpty&Std.IntervalTree.IntervalTree -> Bool

  Returns whether the tree contains no intervals.

  fn · Std.IntervalTree
• Std.IntervalTree.pointQuery&Std.IntervalTree.IntervalTree -> Int -> Array[Std.IntervalTree.Interval]

  Stabbing query finding all intervals containing the given point.

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

  Returns the number of intervals stored in the tree.

  fn · Std.IntervalTree
• Std.IntervalTree.toIntervals&Std.IntervalTree.IntervalTree -> Array[Std.IntervalTree.Interval]

  Materializes all intervals sorted by low endpoint in O(n) time.

  fn · Std.IntervalTree