(&self, change_id: NodeId)
| 297 | } |
| 298 | |
| 299 | fn has_change_in_graph(&self, change_id: NodeId) -> PristineResult<bool> { |
| 300 | let start_key = encode_vertex(change_id.get(), 0, 0); |
| 301 | let end_key = encode_vertex(change_id.get(), u64::MAX, u64::MAX); |
| 302 | let has = self |
| 303 | .graph |
| 304 | .range::<&[u8; 24]>(&start_key..=&end_key)? |
| 305 | .next() |
| 306 | .transpose()? |
| 307 | .is_some(); |
| 308 | Ok(has) |
| 309 | } |
| 310 | } |
| 311 | |
| 312 | impl<'txn, 'a> TreeTxnT for CachedWriteGraphTxn<'txn, 'a> { |
nothing calls this directly
no test coverage detected