Merge pull request #22 from TrevorHansen/om5

Use a map that is faster with integer keys
egraphs-good · Dec 13, 2023 · 361d935 · 361d935
2 parents 934bab7 + 86db1e8
commit 361d935
Show file tree

Hide file tree

Showing 2 changed files with 4 additions and 2 deletions.
diff --git a/Cargo.toml b/Cargo.toml
@@ -18,6 +18,7 @@ pico-args = { version = "0.5.0", features = ["eq-separator"] }
 anyhow = "1.0.71"
 coin_cbc = { version = "0.1.6", optional = true }
 im-rc = "15.1.0"
+rustc-hash = "1.1.0"
 
 rpds = "1.1.0"
 [dependencies.egraph-serialize]

diff --git a/src/extract/greedy_dag.rs b/src/extract/greedy_dag.rs
@@ -1,7 +1,8 @@
 use super::*;
+use rustc_hash::FxHashMap;
 
 struct CostSet {
-    costs: std::collections::HashMap<ClassId, Cost>,
+    costs: FxHashMap<ClassId, Cost>,
     total: Cost,
     choice: NodeId,
 }
@@ -25,7 +26,7 @@ impl Extractor for GreedyDagExtractor {
             'node_loop: for (node_id, node) in &nodes {
                 let cid = egraph.nid_to_cid(node_id);
                 let mut cost_set = CostSet {
-                    costs: std::collections::HashMap::new(),
+                    costs: FxHashMap::default(),
                     total: Cost::default(),
                     choice: node_id.clone(),
                 };