add: missing getters in v1 and v2 filters

Signed-off-by: qjerome <qjerome@rawsec.lu>

poppy/src/bloom.rs

@@ -332,8 +332,8 @@ impl BloomFilter {
     #[inline(always)]
     pub fn capacity(&self) -> usize {
         match self {
-            Self::V1(b) => b.capacity as usize,
-            Self::V2(b) => b.capacity as usize,
+            Self::V1(b) => b.capacity(),
+            Self::V2(b) => b.capacity(),
         }
     }
 
@@ -349,8 +349,8 @@ impl BloomFilter {
     #[inline(always)]
     pub fn fpp(&self) -> f64 {
         match self {
-            Self::V1(b) => b.fpp,
-            Self::V2(b) => b.fpp,
+            Self::V1(b) => b.fpp(),
+            Self::V2(b) => b.fpp(),
         }
     }
 
@@ -374,7 +374,10 @@ impl BloomFilter {
 
     /// Returns true if the filter is full
     pub fn is_full(&self) -> bool {
-        self.count_estimate() as usize == self.capacity()
+        match self {
+            Self::V1(b) => b.is_full(),
+            Self::V2(b) => b.is_full(),
+        }
     }
 
     /// Returns the blob of data joined to the filter

poppy/src/bloom/v1.rs

@@ -328,6 +328,22 @@ impl BloomFilter {
         self.bitset.len() * core::mem::size_of::<u64>()
     }
 
+    #[inline(always)]
+    pub fn fpp(&self) -> f64 {
+        self.fpp
+    }
+
+    #[inline(always)]
+    pub fn capacity(&self) -> usize {
+        self.capacity as usize
+    }
+
+    #[inline(always)]
+    /// Returns true if the filter is full
+    pub fn is_full(&self) -> bool {
+        self.count_estimate() as usize == self.capacity()
+    }
+
     #[inline(always)]
     pub fn has_same_params(&self, other: &Self) -> bool {
         self.flags == other.flags

poppy/src/bloom/v2.rs

@@ -468,6 +468,22 @@ impl BloomFilter {
         self.buckets.len() * Bucket::byte_size() + self.index_cache.byte_len()
     }
 
+    #[inline(always)]
+    pub fn fpp(&self) -> f64 {
+        self.fpp
+    }
+
+    #[inline(always)]
+    pub fn capacity(&self) -> usize {
+        self.capacity as usize
+    }
+
+    #[inline(always)]
+    /// Returns true if the filter is full
+    pub fn is_full(&self) -> bool {
+        self.count_estimate() as usize == self.capacity()
+    }
+
     /// this function estimates the number of common elements between two bloom filters
     /// without having to intersect them
     pub fn count_common_entries(&self, other: &Self) -> Result<usize, Error> {