probabilistic_machines 0.1.1 → 0.1.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 8c5cfb3b4e94463e5c61a5a8181c1bd713d0135b87839176d55b1a4ac9ed1fe9
-  data.tar.gz: a086f4a5d9cc1505c740bd4fb7be35b84283fae0fbbc5888e04ad44d0333ced9
+  metadata.gz: a0ba466616d31d7c063936a4ee5ce93e2e0fcf210ffb8f2666603e267d3d668a
+  data.tar.gz: 69aec066a74468805de0d73927e868b033a84d6d6d4e1ab026b4e045504cb739
 SHA512:
-  metadata.gz: 2619d85be86268533cc95d101d332ceb71e50139a24487d1fecb9f281d501a511fda27bdb9191e865b5a1dae265faa80f2e632bb5b1a5586a9817f7a817d85e2
-  data.tar.gz: 73164970f1cfa50eb8a1a976eddff1e053865af8f122393bcdd4b5cf8db133c1360ea03b09407d457a8bf245bf85685206962c70821f3e63e5d6493088a7b943
+  metadata.gz: 567247a350e6bc5647d4e669273cbb7272d8247be519c8f1b437f45a5798e7194e876095e6d7ad80a626b8ed444c2dc4888c77fadca43d0ad73717ca15479e9c
+  data.tar.gz: 56f3e5c29459775c205669a86ef94d6b160fa43bd2d09ad95310aaea9244961f1e7a97e5db6d74c32b5922b8dc92f9305108fb74719395840952d67f13da95ac

data/CHANGELOG.md

@@ -1,5 +1,20 @@
 # Changelog
 
+## [0.1.2](https://github.com/seuros/probabilistic_machines/compare/probabilistic_machines/v0.1.1...probabilistic_machines/v0.1.2) (2026-11-01)
+
+
+### Features
+
+* accept any cloneable key in HeavyHitters ([108ed8c](https://github.com/seuros/probabilistic_machines/commit/108ed8c79adeffeef708aa298baa7cc64d55d12b))
+* pass a rubygems OTP through the environment ([7a6cc44](https://github.com/seuros/probabilistic_machines/commit/7a6cc446dc737f44e46c4e41b0a76d1fc9b7f5cc))
+
+
+### Bug Fixes
+
+* a republished platform gem is skipped, not fatal ([6210171](https://github.com/seuros/probabilistic_machines/commit/6210171a4ae679293d9cc6cfbdd82a9d99611a6e))
+* collect the built gems whatever depth the download puts them at ([b377177](https://github.com/seuros/probabilistic_machines/commit/b377177879e2a922184eb3e5f9965e8f8c806f00))
+* the release tag carries the gem name, and the gate uses the aggregate output ([9b949b4](https://github.com/seuros/probabilistic_machines/commit/9b949b4dc257b4251ff7c8806d6c8efdb05ac26d))
+
 ## [0.1.1](https://github.com/seuros/probabilistic_machines/compare/probabilistic_machines-v0.1.0...probabilistic_machines/v0.1.1) (2026-11-01)
 
 

data/Cargo.lock

@@ -158,11 +158,11 @@ dependencies = [
 
 [[package]]
 name = "probabilistic-machines"
-version = "0.2.0"
+version = "0.3.0"
 
 [[package]]
 name = "probabilistic_machines_native"
-version = "0.1.1"
+version = "0.1.2"
 dependencies = [
  "bytes",
  "magnus",

data/ext/probabilistic_machines_native/core/Cargo.toml

@@ -1,6 +1,6 @@
 [package]
 name = "probabilistic-machines"
-version = "0.2.0"
+version = "0.3.0"
 edition.workspace = true
 rust-version.workspace = true
 authors = ["Abdelkader Boudih <oss@seuros.com>"]

data/ext/probabilistic_machines_native/core/src/topk.rs

@@ -28,6 +28,13 @@ pub struct Hitter<T> {
 /// insertions scan all `K` counters, which is the trade for needing no heap and
 /// no key ordering: keep `K` in the dozens-to-hundreds range.
 ///
+/// A key need only be [`Clone`] and [`Eq`], so owned keys work directly:
+/// `HeavyHitters<String, 64>` tracks layer names without interning them first.
+/// Cloning happens on insert and on [`merge`](Self::merge), never on a lookup,
+/// so a cheap key is worth having but a `String` is not a mistake. Interning to
+/// a `u32` id, or hashing with [`hash64`](crate::hash64) the way the Ruby
+/// binding does, keeps the table [`Copy`] and the scan cache-friendly.
+///
 /// ```
 /// use probabilistic_machines::HeavyHitters;
 ///
@@ -48,7 +55,7 @@ pub struct HeavyHitters<T, const K: usize> {
     observed: u64,
 }
 
-impl<T: Copy + Eq, const K: usize> HeavyHitters<T, K> {
+impl<T: Clone + Eq, const K: usize> HeavyHitters<T, K> {
     #[must_use]
     pub const fn new() -> Self {
         Self {
@@ -116,7 +123,7 @@ impl<T: Copy + Eq, const K: usize> HeavyHitters<T, K> {
             }
         }
         for hitter in other.hitters() {
-            self.absorb(hitter.key, hitter.count, hitter.overestimate);
+            self.absorb(hitter.key.clone(), hitter.count, hitter.overestimate);
         }
         self.observed = self.observed.saturating_add(other.observed);
     }
@@ -304,18 +311,18 @@ fn records_are_coherent(records: &[[u8; RECORD_LEN]], observed: u64) -> bool {
     })
 }
 
-impl<T: Copy + Eq, const K: usize> Default for HeavyHitters<T, K> {
+impl<T: Clone + Eq, const K: usize> Default for HeavyHitters<T, K> {
     fn default() -> Self {
         Self::new()
     }
 }
 
 #[cfg(feature = "alloc")]
-impl<T: Copy + Eq, const K: usize> HeavyHitters<T, K> {
+impl<T: Clone + Eq, const K: usize> HeavyHitters<T, K> {
     /// Tracked keys, most frequent first.
     #[must_use]
     pub fn ranked(&self) -> alloc::vec::Vec<Hitter<T>> {
-        let mut ranked: alloc::vec::Vec<Hitter<T>> = self.hitters().copied().collect();
+        let mut ranked: alloc::vec::Vec<Hitter<T>> = self.hitters().cloned().collect();
         ranked.sort_unstable_by_key(|hitter| core::cmp::Reverse(hitter.count));
         ranked
     }

data/ext/probabilistic_machines_native/ffi/Cargo.toml

@@ -1,6 +1,6 @@
 [package]
 name = "probabilistic_machines_native"
-version = "0.1.1"
+version = "0.1.2"
 edition.workspace = true
 rust-version.workspace = true
 authors = ["Abdelkader Boudih <oss@seuros.com>"]

data/lib/probabilistic_machines/version.rb

@@ -1,5 +1,5 @@
 # frozen_string_literal: true
 
 module ProbabilisticMachines
-  VERSION = '0.1.1'
+  VERSION = '0.1.2'
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: probabilistic_machines
 version: !ruby/object:Gem::Version
-  version: 0.1.1
+  version: 0.1.2
 platform: ruby
 authors:
 - Abdelkader Boudih