MCPcopy Create free account
hub / github.com/atomicdotdev/atomic / visit

Function visit

atomic-repository/src/repository/deferred_tree.rs:330–382  ·  view source on GitHub ↗
(
        txn: &T,
        change: Hash,
        groups: &HashMap<Hash, Vec<DeferredTreeOp>>,
        visiting: &mut HashSet<Hash>,
        visited: &mut HashSet<Hash>,
        ordered: &mut Vec<Defer

Source from the content-addressed store, hash-verified

328 ops: &[DeferredTreeOp],
329) -> Result<Vec<DeferredTreeOp>, RepositoryError> {
330 fn visit<T: GraphTxnT>(
331 txn: &T,
332 change: Hash,
333 groups: &HashMap<Hash, Vec<DeferredTreeOp>>,
334 visiting: &mut HashSet<Hash>,
335 visited: &mut HashSet<Hash>,
336 ordered: &mut Vec<DeferredTreeOp>,
337 ) -> Result<(), RepositoryError> {
338 if visited.contains(&change) {
339 return Ok(());
340 }
341 if !visiting.insert(change) {
342 return Err(RepositoryError::InvalidOperation {
343 message: format!(
344 "deferred TREE lifecycle contains a dependency cycle at {}",
345 change.to_base32()
346 ),
347 });
348 }
349
350 let change_id = txn
351 .get_internal(&change)
352 .map_err(|e| RepositoryError::Database(e.to_string()))?
353 .ok_or_else(|| RepositoryError::InvalidOperation {
354 message: format!(
355 "deferred TREE lifecycle references unknown change {}",
356 change.to_base32()
357 ),
358 })?;
359 // Raw dependency rows: legacy repositories predate the index and the
360 // indexed read fails closed on them (dev #196/#206 parity). Raw rows
361 // are populated for indexed changes and empty for unindexed ones —
362 // exact for cycle detection.
363 for dependency in txn
364 .get_change_deps(change_id)
365 .map_err(|e| RepositoryError::Database(e.to_string()))?
366 {
367 if groups.contains_key(&dependency) {
368 visit(txn, dependency, groups, visiting, visited, ordered)?;
369 }
370 }
371
372 visiting.remove(&change);
373 visited.insert(change);
374 ordered.extend(
375 groups
376 .get(&change)
377 .expect("visited deferred TREE change has an operation group")
378 .iter()
379 .cloned(),
380 );
381 Ok(())
382 }
383
384 let mut group_order = Vec::new();
385 let mut groups: HashMap<Hash, Vec<DeferredTreeOp>> = HashMap::new();

Callers 3

causally_order_tree_opsFunction · 0.70

Calls 9

contains_keyMethod · 0.80
extendMethod · 0.80
removeMethod · 0.65
getMethod · 0.65
containsMethod · 0.45
insertMethod · 0.45
get_internalMethod · 0.45
get_change_depsMethod · 0.45
iterMethod · 0.45

Tested by

no test coverage detected