(
&self,
)
| 137 | /// IntervalsView: A lazy view over Intervals objects for each node. |
| 138 | #[getter] |
| 139 | fn intervals( |
| 140 | &self, |
| 141 | ) -> LazyNodeState< |
| 142 | 'static, |
| 143 | ArrowMap<Map<HistoryOp<'static, DynamicGraph>, PyIntervals>, IntervalsStruct>, |
| 144 | DynamicGraph, |
| 145 | DynamicGraph, |
| 146 | DynNodeFilter, |
| 147 | > { |
| 148 | let op = self.inner.op.clone().map(|hist| hist.intervals().into()); |
| 149 | LazyNodeState::new(op.into_arrow_node_op(), self.inner.nodes()) |
| 150 | } |
| 151 | |
| 152 | /// Get the earliest time entry. |
| 153 | /// |
nothing calls this directly
no test coverage detected