Git import: a deletion's dependencies need its file's graph built 73d592e763ab

The batched rendering leaves graphs deferred, and referenced_changes
reads a file's graph to find who inserted the live atoms after a
deleted one. The nodes a change deletes from are built before that.

refs #25

Author

Andy McCall @andymccall <[email protected]>

When

1 month ago · 2026-10-04 02:15 UTC

Signature

✔ signed by Andy McCall

Hash

73d592e763abec60d9d504caf0407322a8401fdf2fd9c4c8dc9aa5d26f1fd4ce

Depends on

2306a4d24779 79ab8528ff62 c3069537d7c5

Depended on by

nothing yet

In bookmarks

agents-in-readme bare-hashes carried-not-removed carry-identical doctor-trust identical-sides keyless-tags main merge-remote-bookmark only-help-103 paths-for-resolutions-and-amend push-notes show-stat subrepo-pin-state switch-says

In tags

v0.10.0 v0.11.0 v0.4.0 v0.4.1 v0.4.2 v0.4.3 v0.4.4 v0.4.5 v0.4.6 v0.5.0 v0.5.1 v0.6.0 v0.7.0 v0.8.0 v0.9.0

Edits

1 atom, 0 tree operations, 1 file

Browse the tree at this change

1076 unchanged lines

                },

            };

            let t = std::time::Instant::now();

            // A deletion depends on whoever inserted the live atoms after

            // it, which only the file's graph knows: build the few the

            // batched rendering left deferred.

            let need: Vec<NodeId> = change

                .edits

                .iter()

                .filter(|e| matches!(e, Edit::Delete { .. }))

                .map(|e| e.node())

                .filter(|n| !base.is_built(n))

                .collect();

            if !need.is_empty() {

                self.load_graphs_of(&mut base, &need)?;

            }

            deps.extend(referenced_changes(&change, &base));

            crate::timing::add("store: referenced", t.elapsed());

            change.deps = deps.into_iter().collect();

484 unchanged lines