test: add a test showing the worst case in the resolver

Author: x-hgg-x

crates/resolver-tests/tests/resolve.rs

@@ -4,8 +4,8 @@ use cargo::util::GlobalContext;
 
 use resolver_tests::{
     helpers::{
-        assert_contains, assert_same, dep, dep_kind, dep_loc, dep_req, loc_names, names, pkg_id,
-        pkg_loc, registry, ToPkgId,
+        assert_contains, assert_same, dep, dep_kind, dep_loc, dep_req, loc_names, names, pkg,
+        pkg_dep, pkg_dep_with, pkg_id, pkg_loc, registry, ToDep, ToPkgId,
     },
     pkg, resolve, resolve_with_global_context,
 };
@@ -937,6 +937,46 @@ fn large_conflict_cache() {
     let _ = resolve(root_deps, &reg);
 }
 
+#[test]
+fn resolving_worst_case() {
+    let mut reg = Vec::new();
+
+    // increase in resolve time is at least cubic over `N`
+    const V: usize = 50;
+    const N: usize = 50; // <-- we should have `N >= V` to reproduce slowdown
+    const C: usize = 3; // <-- we should have `C >= 2` to reproduce slowdown
+
+    reg.push(pkg_dep_with(("cc", "1.0.0"), vec![], &[("f", &[])]));
+    for v in 1..V {
+        reg.push(pkg(("cc", format!("1.0.{v}"))));
+    }
+
+    reg.push(pkg_dep(
+        ("solana-core", "1.0.0"),
+        vec![
+            dep("cc"), // <-- needed to reproduce slowdown
+            dep_req("solana-1", "1.0.0"),
+        ],
+    ));
+
+    for n in 0..N {
+        let version = format!("1.0.{n}");
+        for c in 1..C {
+            reg.push(pkg_dep(
+                (format!("solana-{c}"), &version),
+                vec![dep_req(&format!("solana-{}", c + 1), &version)],
+            ));
+        }
+        reg.push(pkg_dep(
+            (format!("solana-{C}"), &version),
+            vec![dep_req("cc", "1.0.0").with(&["f"])],
+        ));
+    }
+
+    let deps = vec![dep("solana-core")];
+    let _ = resolve(deps, &reg);
+}
+
 #[test]
 fn cyclic_good_error_message() {
     let input = vec![