commit 0d330f20c29fccd339094d9a272fed8f4cb07a82
author Haibo Huang <hhb@google.com> Fri Apr 17 20:30:09 2020 -0700
committer Haibo Huang <hhb@google.com> Fri Apr 17 20:30:09 2020 -0700
tree fa3987a191be7a1f1d9ad370dd1086920d5e1234
parent e42c505f54ac2e7b2ca7d0197304cac1b4f605e9

Upgrade rust/crates/regex to 1.3.7

Test: None
Change-Id: I26e69e1c8997da756f5da7bbd70727375ccf1d5d

src/sparse.rs

diff --git a/src/sparse.rs b/src/sparse.rs
index 9d48eee..bc1b2b5 100644
--- a/src/sparse.rs
+++ b/src/sparse.rs
@@ -1,3 +1,4 @@
+use std::fmt;
 use std::ops::Deref;
 use std::slice;
 
@@ -11,7 +12,7 @@
 /// Note though that we don't actually use uninitialized memory. We generally
 /// reuse allocations, so the initial allocation cost is bareable. However,
 /// its other properties listed above are extremely useful.
-#[derive(Clone, Debug)]
+#[derive(Clone)]
 pub struct SparseSet {
     /// Dense contains the instruction pointers in the order in which they
     /// were inserted.
@@ -60,6 +61,12 @@
     }
 }
 
+impl fmt::Debug for SparseSet {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        write!(f, "SparseSet({:?})", self.dense)
+    }
+}
+
 impl Deref for SparseSet {
     type Target = [usize];