data: /intervals/ for structures for intervals

ti-basic-optimizer/src/data/intervals/interval_tree.rs

@@ -0,0 +1,25 @@
+//! # Interval Tree
+//! Interval Tree implementation
+//!
+//! This just does a linear scan for stabbing queries. This is a great target for optimizing the compiler.
+
+use std::ops::Range;
+
+#[derive(Debug)]
+pub struct IntervalTree<T: Ord + Clone> {
+    data: Vec<Range<T>>,
+}
+
+impl<T: Ord + Clone> IntervalTree<T> {
+    pub fn new(mut ranges: Vec<Range<T>>) -> Self {
+        Self { data: ranges }
+    }
+
+    pub fn stab(&self, point: T) -> Vec<Range<T>> {
+        self.data
+            .iter()
+            .filter(|&range| range.contains(&point))
+            .cloned()
+            .collect()
+    }
+}

ti-basic-optimizer/src/data/intervals/mod.rs

@@ -0,0 +1,5 @@
+pub mod interval_tree;
+pub use interval_tree::IntervalTree;
+
+pub mod partition_map;
+pub use partition_map::PartitionMap;

ti-basic-optimizer/src/data/partition_map.rs → ti-basic-optimizer/src/data/intervals/partition_map.rs

@@ -3,6 +3,9 @@
 //! Map from non-overlapping half-open `[begin, end)` subsets of a range to arbitrary
 //! data. The subsets must cover the entire set.
 
+/// Map from non-overlapping half-open `[begin, end)` subsets of a range to arbitrary
+/// data. The subsets must cover the entire set.
+#[derive(Debug)]
 pub struct PartitionMap<K: Ord + Sized, V: Sized> {
     pub breaks: Vec<K>,
     pub values: Vec<V>,

ti-basic-optimizer/src/data/mod.rs

@@ -4,4 +4,4 @@ pub mod graphviz;
 
 pub mod graph_like;
 
-pub mod partition_map;
+pub mod intervals;