tests: don't create workspaces in RevsetGraphIterator tests
@@ -23,8 +23,8 @@ use test_case::test_case;
#[test_case(true ; "skip transitive edges")]
fn test_graph_iterator_linearized(skip_transitive_edges: bool) {
let settings = testutils::user_settings();
- let test_workspace = testutils::init_workspace(&settings, true);
- let repo = &test_workspace.repo;
+ let test_repo = testutils::init_repo(&settings, true);
+ let repo = &test_repo.repo;
// Tests that a fork and a merge becomes a single edge:
// D
@@ -65,8 +65,8 @@ fn test_graph_iterator_linearized(skip_transitive_edges: bool) {
#[test_case(true ; "skip transitive edges")]
fn test_graph_iterator_virtual_octopus(skip_transitive_edges: bool) {
let settings = testutils::user_settings();
- let test_workspace = testutils::init_workspace(&settings, true);
- let repo = &test_workspace.repo;
+ let test_repo = testutils::init_repo(&settings, true);
+ let repo = &test_repo.repo;
// Tests that merges outside the set can result in more parent edges than there
// was in the input: F
@@ -125,8 +125,8 @@ fn test_graph_iterator_virtual_octopus(skip_transitive_edges: bool) {
#[test_case(true ; "skip transitive edges")]
fn test_graph_iterator_simple_fork(skip_transitive_edges: bool) {
let settings = testutils::user_settings();
- let test_workspace = testutils::init_workspace(&settings, true);
- let repo = &test_workspace.repo;
+ let test_repo = testutils::init_repo(&settings, true);
+ let repo = &test_repo.repo;
// Tests that the branch with "C" gets emitted correctly:
// E
@@ -173,8 +173,8 @@ fn test_graph_iterator_simple_fork(skip_transitive_edges: bool) {
#[test_case(true ; "skip transitive edges")]
fn test_graph_iterator_multiple_missing(skip_transitive_edges: bool) {
let settings = testutils::user_settings();
- let test_workspace = testutils::init_workspace(&settings, true);
- let repo = &test_workspace.repo;
+ let test_repo = testutils::init_repo(&settings, true);
+ let repo = &test_repo.repo;
// Tests that we get missing edges to "a" and "c" and not just one missing edge
// to the root.
@@ -227,8 +227,8 @@ fn test_graph_iterator_multiple_missing(skip_transitive_edges: bool) {
#[test_case(true ; "skip transitive edges")]
fn test_graph_iterator_edge_to_ancestor(skip_transitive_edges: bool) {
let settings = testutils::user_settings();
- let test_workspace = testutils::init_workspace(&settings, true);
- let repo = &test_workspace.repo;
+ let test_repo = testutils::init_repo(&settings, true);
+ let repo = &test_repo.repo;
// Tests that we get both an edge from F to D and to D's ancestor C if we keep
// transitive edges and only the edge from F to D if we skip transitive
@@ -292,8 +292,8 @@ fn test_graph_iterator_edge_to_ancestor(skip_transitive_edges: bool) {
#[test_case(true ; "skip transitive edges")]
fn test_graph_iterator_edge_escapes_from_(skip_transitive_edges: bool) {
let settings = testutils::user_settings();
- let test_workspace = testutils::init_workspace(&settings, true);
- let repo = &test_workspace.repo;
+ let test_repo = testutils::init_repo(&settings, true);
+ let repo = &test_repo.repo;
// Tests a more complex case for skipping transitive edges.
// J
