forked from mirrors/jj
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. |
||
|---|---|---|
| .. | ||
| gen-protos | ||
| src | ||
| tests | ||
| testutils | ||
| build.rs | ||
| Cargo.toml | ||