mirror of
https://github.com/martinvonz/jj.git
synced 2024-10-28 01:16:57 +00:00
30160f4d20
I was thinking of replacing `RevsetIterator` by a regular `Iterator<Item=IndexEntry>`. However, that would make it easier to pass in an iterator that produces revisions in a non-topological order into `RevsetGraphIterator`, which would produce unexpected results (it would result in nodes that are not connected to their parents, if their parents had already been emitted). I think it makes sense to instead pass in a revset into `RevsetGraphIterator`. Incidentally, it will also be useful to have the full revset available in `RevsetGraphIterator` if we rewrite the algorithm to be more similar to Mercurial's and Sapling's algorithm, which involves asking the revset if it contains parent revisions. |
||
|---|---|---|
| .. | ||
| test_bad_locking.rs | ||
| test_commit_builder.rs | ||
| test_commit_concurrent.rs | ||
| test_conflicts.rs | ||
| test_diff_summary.rs | ||
| test_git.rs | ||
| test_index.rs | ||
| test_init.rs | ||
| test_load_repo.rs | ||
| test_merge_trees.rs | ||
| test_mut_repo.rs | ||
| test_operations.rs | ||
| test_refs.rs | ||
| test_revset.rs | ||
| test_revset_graph_iterator.rs | ||
| test_rewrite.rs | ||
| test_view.rs | ||
| test_working_copy.rs | ||
| test_working_copy_concurrent.rs | ||
| test_working_copy_sparse.rs | ||
| test_workspace.rs | ||