Merge pull request #341 from cormacrelf/impl-eq

Implement Eq trait

Author: Kerollmops

roaring/src/bitmap/container.rs

@@ -13,7 +13,7 @@ pub const RUN_MAX_SIZE: u64 = 2048;
 #[cfg(not(feature = "std"))]
 use alloc::vec::Vec;
 
-#[derive(PartialEq, Clone)]
+#[derive(PartialEq, Eq, Clone)]
 pub(crate) struct Container {
     pub key: u16,
     pub store: Store,

roaring/src/bitmap/mod.rs

@@ -44,7 +44,7 @@ use alloc::vec::Vec;
 /// rb.insert(7);
 /// println!("total bits set to true: {}", rb.len());
 /// ```
-#[derive(PartialEq)]
+#[derive(PartialEq, Eq)]
 pub struct RoaringBitmap {
     containers: Vec<container::Container>,
 }

roaring/src/bitmap/store/mod.rs

@@ -846,11 +846,15 @@ impl PartialEq for Store {
                 run.len() == bitmap.len()
                     && run.iter_intervals().all(|&iv| bitmap.contains_range(iv.start()..=iv.end()))
             }
-            _ => false,
+            // Invariant: Array len <= 4096, bitmap len > 4096.
+            (Array(_), Bitmap(_)) | (Bitmap(_), Array(_)) => false,
         }
     }
 }
 
+// reflexivity: a == a.
+impl Eq for Store {}
+
 impl Iter<'_> {
     /// Advance the iterator to the first value greater than or equal to `n`.
     pub(crate) fn advance_to(&mut self, n: u16) {

roaring/src/treemap/mod.rs

@@ -36,7 +36,7 @@ pub use self::iter::{BitmapIter, IntoIter, Iter};
 /// rb.insert(7);
 /// println!("total bits set to true: {}", rb.len());
 /// ```
-#[derive(PartialEq)]
+#[derive(PartialEq, Eq)]
 pub struct RoaringTreemap {
     map: BTreeMap<u32, RoaringBitmap>,
 }