Fix matching perf regression

Introduced in ae8af88, this bug caused the default impl of search for patterns to bypass the discriminator index.

CHANGELOG.md

@@ -2,7 +2,7 @@
 
 ## [Unreleased] - ReleaseDate
 - Change the API of `make` to have mutable access to the e-graph for some [advanced uses cases](https://github.com/egraphs-good/egg/pull/277).
-
+- Fix an e-matching performance regression introduced in [this commit](https://github.com/egraphs-good/egg/commit/ae8af8815231e4aba1b78962f8c07ce837ee1c0e#diff-1d06da761111802c793c6e5ca704bfa0d6336d0becf87fddff02d81548a838ab).
 
 ## [0.9.5] - 2023-06-29
 - Fixed a few edge cases in proof size optimization that caused egg to crash.

src/rewrite.rs

@@ -186,14 +186,9 @@ where
 
     /// Search the whole [`EGraph`], returning a list of all the
     /// [`SearchMatches`] where something was found.
-    /// This just calls [`search_eclass`] on each eclass.
-    ///
-    /// [`search_eclass`]: Searcher::search_eclass
+    /// This just calls [`Searcher::search_with_limit`] with a big limit.
     fn search(&self, egraph: &EGraph<L, N>) -> Vec<SearchMatches<L>> {
-        egraph
-            .classes()
-            .filter_map(|e| self.search_eclass(egraph, e.id))
-            .collect()
+        self.search_with_limit(egraph, usize::MAX)
     }
 
     /// Similar to [`search`], but return at most `limit` many matches.