Insert a new dependency, returns false if the dependency was already in the map returns true if the dependency was newly inserted
(
&mut self,
target: &'a PhysicalSortExpr,
dep: &'a PhysicalSortExpr,
)
| 98 | /// returns false if the dependency was already in the map |
| 99 | /// returns true if the dependency was newly inserted |
| 100 | fn insert( |
| 101 | &mut self, |
| 102 | target: &'a PhysicalSortExpr, |
| 103 | dep: &'a PhysicalSortExpr, |
| 104 | ) -> bool { |
| 105 | self.seen.entry(target).or_default().insert(dep) |
| 106 | } |
| 107 | |
| 108 | /// This function recursively analyzes the dependencies of the given sort |
| 109 | /// expression within the given dependency map to construct lexicographical |