refactor(path): replace ResolverPath with interned UstrPath

Cargo.toml

@@ -91,6 +91,12 @@ indexmap            = { version = "2.14.0", features = ["serde"] }
 json-strip-comments = "3.1.1"
 rustc-hash          = { version = "2.1.2", default-features = false, features = ["std"] }
 thiserror           = "2.0.18"
+# Backing table for `src/interner.rs`. `HashTable` is the piece that off-the-
+# shelf interners cannot offer: it looks up by a caller-supplied hash, so the
+# interner reuses the `FxHash` `ResolverPath` already computed instead of hashing
+# every path a second time. Version tracks what `indexmap` resolves to, so no
+# extra copy of hashbrown enters the graph.
+hashbrown = { version = "0.17.0", default-features = false, features = ["inline-more"] }
 
 pnp = { version = "0.12.9", optional = true }
 

deny.toml

@@ -92,7 +92,8 @@ allow = [
     "MIT",
     "Apache-2.0",
     "BSD-2-Clause",
-    "Unicode-3.0", 
+    "BSD-2-Clause-Patent",
+    "Unicode-3.0",
     "Zlib"
     #"Apache-2.0 WITH LLVM-exception",
 ]

examples/resolver.rs

@@ -40,10 +40,10 @@ async fn main() {
   };
 
   let mut sorted_file_deps = ctx.file_dependencies.iter().collect::<Vec<_>>();
-  sorted_file_deps.sort_by_key(|p| p.as_path());
+  sorted_file_deps.sort_by_key(|p| p.as_std_path());
   println!("file_deps: {:#?}", sorted_file_deps);
 
   let mut sorted_missing = ctx.missing_dependencies.iter().collect::<Vec<_>>();
-  sorted_missing.sort_by_key(|p| p.as_path());
+  sorted_missing.sort_by_key(|p| p.as_std_path());
   println!("missing_deps: {:#?}", sorted_missing);
 }