dataspec: add histogram merge operation

lib/dataspec/Cargo.toml

@@ -10,3 +10,4 @@ license = { workspace = true }
 [dependencies]
 histogram = { workspace = true }
 serde = { workspace = true }
+thiserror = "1.0.47"

lib/dataspec/src/histogram.rs

@@ -1,4 +1,5 @@
 use serde::{Deserialize, Serialize};
+use thiserror::Error;
 
 use histogram::Histogram as _Histogram;
 
@@ -9,7 +10,7 @@ use histogram::Histogram as _Histogram;
 /// of the Histogram. It stores an individual vector for each field
 /// of non-zero buckets. Assuming index[0] = n, (index[0], count[0])
 /// corresponds to the nth bucket.
-#[derive(Default, Serialize, Deserialize)]
+#[derive(Debug, Default, PartialEq, Serialize, Deserialize)]
 pub struct Histogram {
     /// parameters representing the resolution and the range of
     /// the histogram tracking request latencies
@@ -22,6 +23,71 @@ pub struct Histogram {
     pub count: Vec<u32>,
 }
 
+/// Errors returned for operations on histograms.
+#[non_exhaustive]
+#[derive(Error, Debug, PartialEq)]
+pub enum Error {
+    #[error("histograms with different parameters can't be merged")]
+    MismatchedParams,
+}
+
+impl Histogram {
+    fn add_bucket(&mut self, idx: usize, n: u32) {
+        self.index.push(idx);
+        self.count.push(n);
+    }
+
+    /// Merges two Histograms and returns the results in a new Histogram.
+    ///
+    /// Both histograms must have the same configuration parameters.
+    /// Buckets which have values in both histograms are allowed to wrap.
+    pub fn merge(&self, h: &Histogram) -> Result<Histogram, Error> {
+        if self.m != h.m || self.r != h.r || self.n != h.n {
+            return Err(Error::MismatchedParams);
+        }
+
+        let mut histogram = Histogram {
+            m: self.m,
+            r: self.r,
+            n: self.n,
+            index: Vec::new(),
+            count: Vec::new(),
+        };
+
+        // Sort and merge buckets from both histograms
+        let (mut i, mut j) = (0, 0);
+        while i < self.index.len() && j < h.index.len() {
+            let (k1, v1) = (self.index[i], self.count[i]);
+            let (k2, v2) = (h.index[j], h.count[j]);
+
+            if k1 == k2 {
+                histogram.add_bucket(k1, v1 + v2);
+                (i, j) = (i + 1, j + 1);
+            } else if k1 < k2 {
+                histogram.add_bucket(k1, v1);
+                i += 1;
+            } else {
+                histogram.add_bucket(k2, v2);
+                j += 1;
+            }
+        }
+
+        // Fill remaining values, if any, from the left histogram
+        if i < self.index.len() {
+            histogram.index.extend(&self.index[i..self.index.len()]);
+            histogram.count.extend(&self.count[i..self.count.len()]);
+        }
+
+        // Fill remaining values, if any, from the left histogram
+        if j < h.index.len() {
+            histogram.index.extend(&h.index[i..h.index.len()]);
+            histogram.count.extend(&h.count[i..h.count.len()]);
+        }
+
+        return Ok(histogram);
+    }
+}
+
 impl From<&_Histogram> for Histogram {
     fn from(histogram: &_Histogram) -> Self {
         let mut index = Vec::new();
@@ -46,3 +112,50 @@ impl From<&_Histogram> for Histogram {
         }
     }
 }
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn merge() {
+        let h1 = Histogram {
+            m: 0,
+            r: 7,
+            n: 32,
+            index: vec![1, 3, 5],
+            count: vec![6, 12, 7],
+        };
+
+        let h2 = Histogram {
+            m: 0,
+            r: 7,
+            n: 32,
+            index: Vec::new(),
+            count: Vec::new(),
+        };
+
+        let h3 = Histogram {
+            m: 0,
+            r: 7,
+            n: 32,
+            index: vec![2, 3, 4, 11],
+            count: vec![5, 7, 3, 15],
+        };
+
+        let h = h1.merge(&Histogram::default());
+        assert_eq!(h, Err(Error::MismatchedParams));
+
+        let h = h1.merge(&h2).unwrap();
+        assert_eq!(h.index, vec![1, 3, 5]);
+        assert_eq!(h.count, vec![6, 12, 7]);
+
+        let h = h2.merge(&h3).unwrap();
+        assert_eq!(h.index, vec![2, 3, 4, 11]);
+        assert_eq!(h.count, vec![5, 7, 3, 15]);
+
+        let h = h1.merge(&h3).unwrap();
+        assert_eq!(h.index, vec![1, 2, 3, 4, 5, 11]);
+        assert_eq!(h.count, vec![6, 5, 19, 3, 7, 15]);
+    }
+}