pigeonhole-db 1.1.0 → 1.1.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 6112428e9e5815a4ceab94e2ee520ef63d1ab237f87ffba0d1935183866b0daa
-  data.tar.gz: 6acd6dfa278a29c0df775973b451686c1afbd3730832a6a493e87da7b4354d17
+  metadata.gz: 051ba1f3253f01d8bd59cf337efe6e202641359a46218ca9a4d9065bcc3174a9
+  data.tar.gz: 5928e6cc99b9ff647b075ae0cc27e5887513c199e55f0e758e565a98de3d0ba4
 SHA512:
-  metadata.gz: 7381a5b7b08d209cfb4cd76b3fc0b9d3aba3b175811791b1abe1851bac9c47054196404c1d691b383272f2979a96984a9eda368b1c6846985517ac7d6eb459fa
-  data.tar.gz: 6f7ca4131bae8d28edc5f858d8a2ef6d3a6eaf24f1f7113b80f51f19ab5d844e68a5d264b8bc15c37cfed3bdabc3c0219cd5e8700061cbfd7dbbb462ef56293b
+  metadata.gz: f98d422fbcb95b31b070ad293784b32cfdefefab8fca2e46b032d1b3058e382b903e783523738ed53a2401bfe27e82edce947e4061d623294b4fc93ed5901d30
+  data.tar.gz: 526bbec10351aaed21d260295f7460d57a63051a5bf738442aeb39f1d8ace6827496053dc81f40cba76c4dbd96ae6a8efd7b68c380d4cb75c621aad933329974

data/Cargo.lock

@@ -367,7 +367,7 @@ checksum = "9f7c3e4beb33f85d45ae3e3a1792185706c8e16d043238c593331cc7cd313b50"
 
 [[package]]
 name = "pigeonhole"
-version = "1.1.0"
+version = "1.1.1"
 dependencies = [
  "arc-swap",
  "futures-core",
@@ -380,14 +380,14 @@ dependencies = [
 
 [[package]]
 name = "pigeonhole-cache"
-version = "2.0.0"
+version = "2.0.1"
 dependencies = [
  "pigeonhole-io",
 ]
 
 [[package]]
 name = "pigeonhole-compaction"
-version = "2.0.0"
+version = "2.0.1"
 dependencies = [
  "pigeonhole-cache",
  "pigeonhole-format",
@@ -398,7 +398,7 @@ dependencies = [
 
 [[package]]
 name = "pigeonhole-engine"
-version = "2.0.0"
+version = "2.0.1"
 dependencies = [
  "arc-swap",
  "loom",
@@ -417,7 +417,7 @@ dependencies = [
 
 [[package]]
 name = "pigeonhole-format"
-version = "2.0.0"
+version = "2.0.1"
 dependencies = [
  "crc-fast",
  "foldhash",
@@ -429,7 +429,7 @@ dependencies = [
 
 [[package]]
 name = "pigeonhole-io"
-version = "2.0.0"
+version = "2.0.1"
 dependencies = [
  "io-uring",
  "libc",
@@ -440,7 +440,7 @@ dependencies = [
 
 [[package]]
 name = "pigeonhole-memory"
-version = "1.1.0"
+version = "1.1.1"
 dependencies = [
  "getrandom 0.3.4",
  "pigeonhole",
@@ -451,7 +451,7 @@ dependencies = [
 
 [[package]]
 name = "pigeonhole-memtable"
-version = "2.0.0"
+version = "2.0.1"
 dependencies = [
  "pigeonhole-format",
  "pigeonhole-io",
@@ -459,7 +459,7 @@ dependencies = [
 
 [[package]]
 name = "pigeonhole-pager"
-version = "2.0.0"
+version = "2.0.1"
 dependencies = [
  "pigeonhole-format",
  "pigeonhole-io",
@@ -467,7 +467,7 @@ dependencies = [
 
 [[package]]
 name = "pigeonhole-ruby"
-version = "1.1.0"
+version = "1.1.1"
 dependencies = [
  "magnus",
  "pigeonhole",
@@ -479,14 +479,14 @@ dependencies = [
 
 [[package]]
 name = "pigeonhole-runtime"
-version = "2.0.0"
+version = "2.0.1"
 dependencies = [
  "pigeonhole-io",
 ]
 
 [[package]]
 name = "pigeonhole-shm"
-version = "2.0.0"
+version = "2.0.1"
 dependencies = [
  "pigeonhole-format",
  "pigeonhole-io",
@@ -494,7 +494,7 @@ dependencies = [
 
 [[package]]
 name = "pigeonhole-sst"
-version = "2.0.0"
+version = "2.0.1"
 dependencies = [
  "pigeonhole-cache",
  "pigeonhole-format",
@@ -503,7 +503,7 @@ dependencies = [
 
 [[package]]
 name = "pigeonhole-text"
-version = "1.1.0"
+version = "1.1.1"
 dependencies = [
  "levenshtein_automata",
  "pigeonhole",
@@ -513,7 +513,7 @@ dependencies = [
 
 [[package]]
 name = "pigeonhole-vector"
-version = "1.1.0"
+version = "1.1.1"
 dependencies = [
  "futures-core",
  "pigeonhole",
@@ -521,7 +521,7 @@ dependencies = [
 
 [[package]]
 name = "pigeonhole-wal"
-version = "2.0.0"
+version = "2.0.1"
 dependencies = [
  "pigeonhole-format",
  "pigeonhole-io",

data/Cargo.toml

@@ -5,16 +5,16 @@ features = ["bytes"]
 version = "0.9"
 [dependencies.pigeonhole]
 path = "vendor/pigeonhole"
-version = "1.1.0"
+version = "1.1.1"
 [dependencies.pigeonhole-memory]
 path = "vendor/memory"
-version = "1.1.0"
+version = "1.1.1"
 [dependencies.pigeonhole-text]
 path = "vendor/text"
-version = "1.1.0"
+version = "1.1.1"
 [dependencies.pigeonhole-vector]
 path = "vendor/vector"
-version = "1.1.0"
+version = "1.1.1"
 [dependencies.rb-sys]
 version = "0.9"
 [lib]
@@ -37,7 +37,7 @@ name = "pigeonhole-ruby"
 publish = false
 repository = "https://github.com/CodingAnarchy/pigeonhole"
 rust-version = "1.96"
-version = "1.1.0"
+version = "1.1.1"
 [profile.release]
 codegen-units = 1
 lto = "thin"

data/lib/pigeonhole/version.rb

@@ -2,5 +2,5 @@
 
 module Pigeonhole
   # The gem's version: the `pigeonhole` crate's.
-  VERSION = "1.1.0"
+  VERSION = "1.1.1"
 end

data/vendor/bundle/ruby/3.4.0/extensions/x86_64-linux/3.4.0/prism-1.9.0/gem_make.out

@@ -6,12 +6,12 @@ checking for whether -fvisibility=hidden is accepted as CFLAGS... yes
 creating Makefile
 
 current directory: /home/runner/work/pigeonhole/pigeonhole/crates/ruby/vendor/bundle/ruby/3.4.0/gems/prism-1.9.0/ext/prism
-make DESTDIR\= sitearchdir\=./.gem.20261104-2345-sni2nw sitelibdir\=./.gem.20261104-2345-sni2nw clean
+make DESTDIR\= sitearchdir\=./.gem.20261105-2189-n76o6p sitelibdir\=./.gem.20261105-2189-n76o6p clean
 
 current directory: /home/runner/work/pigeonhole/pigeonhole/crates/ruby/vendor/bundle/ruby/3.4.0/gems/prism-1.9.0/ext/prism
-make DESTDIR\= sitearchdir\=./.gem.20261104-2345-sni2nw sitelibdir\=./.gem.20261104-2345-sni2nw
-compiling api_pack.c
+make DESTDIR\= sitearchdir\=./.gem.20261105-2189-n76o6p sitelibdir\=./.gem.20261105-2189-n76o6p
 compiling api_node.c
+compiling api_pack.c
 compiling extension.c
 compiling ./../../src/diagnostic.c
 compiling ./../../src/encoding.c
@@ -37,8 +37,8 @@ compiling ./../../src/util/pm_strpbrk.c
 linking shared-object prism/prism.so
 
 current directory: /home/runner/work/pigeonhole/pigeonhole/crates/ruby/vendor/bundle/ruby/3.4.0/gems/prism-1.9.0/ext/prism
-make DESTDIR\= sitearchdir\=./.gem.20261104-2345-sni2nw sitelibdir\=./.gem.20261104-2345-sni2nw install
-/usr/bin/install -c -m 0755 prism.so ./.gem.20261104-2345-sni2nw/prism
+make DESTDIR\= sitearchdir\=./.gem.20261105-2189-n76o6p sitelibdir\=./.gem.20261105-2189-n76o6p install
+/usr/bin/install -c -m 0755 prism.so ./.gem.20261105-2189-n76o6p/prism
 
 current directory: /home/runner/work/pigeonhole/pigeonhole/crates/ruby/vendor/bundle/ruby/3.4.0/gems/prism-1.9.0/ext/prism
-make DESTDIR\= sitearchdir\=./.gem.20261104-2345-sni2nw sitelibdir\=./.gem.20261104-2345-sni2nw clean
+make DESTDIR\= sitearchdir\=./.gem.20261105-2189-n76o6p sitelibdir\=./.gem.20261105-2189-n76o6p clean

data/vendor/bundle/ruby/3.4.0/extensions/x86_64-linux/3.4.0/rbs-4.2.0/gem_make.out

@@ -9,10 +9,10 @@ checking for whether -DNDEBUG is accepted as CFLAGS... yes
 creating Makefile
 
 current directory: /home/runner/work/pigeonhole/pigeonhole/crates/ruby/vendor/bundle/ruby/3.4.0/gems/rbs-4.2.0/ext/rbs_extension
-make DESTDIR\= sitearchdir\=./.gem.20261104-2345-3suy1i sitelibdir\=./.gem.20261104-2345-3suy1i clean
+make DESTDIR\= sitearchdir\=./.gem.20261105-2189-ggqkev sitelibdir\=./.gem.20261105-2189-ggqkev clean
 
 current directory: /home/runner/work/pigeonhole/pigeonhole/crates/ruby/vendor/bundle/ruby/3.4.0/gems/rbs-4.2.0/ext/rbs_extension
-make DESTDIR\= sitearchdir\=./.gem.20261104-2345-3suy1i sitelibdir\=./.gem.20261104-2345-3suy1i
+make DESTDIR\= sitearchdir\=./.gem.20261105-2189-ggqkev sitelibdir\=./.gem.20261105-2189-ggqkev
 compiling ./../../src/ast.c
 compiling ./../../src/lexer.c
 compiling ./../../src/lexstate.c
@@ -34,8 +34,8 @@ compiling rbs_string_bridging.c
 linking shared-object rbs_extension.so
 
 current directory: /home/runner/work/pigeonhole/pigeonhole/crates/ruby/vendor/bundle/ruby/3.4.0/gems/rbs-4.2.0/ext/rbs_extension
-make DESTDIR\= sitearchdir\=./.gem.20261104-2345-3suy1i sitelibdir\=./.gem.20261104-2345-3suy1i install
-/usr/bin/install -c -m 0755 rbs_extension.so ./.gem.20261104-2345-3suy1i
+make DESTDIR\= sitearchdir\=./.gem.20261105-2189-ggqkev sitelibdir\=./.gem.20261105-2189-ggqkev install
+/usr/bin/install -c -m 0755 rbs_extension.so ./.gem.20261105-2189-ggqkev
 
 current directory: /home/runner/work/pigeonhole/pigeonhole/crates/ruby/vendor/bundle/ruby/3.4.0/gems/rbs-4.2.0/ext/rbs_extension
-make DESTDIR\= sitearchdir\=./.gem.20261104-2345-3suy1i sitelibdir\=./.gem.20261104-2345-3suy1i clean
+make DESTDIR\= sitearchdir\=./.gem.20261105-2189-ggqkev sitelibdir\=./.gem.20261105-2189-ggqkev clean

data/vendor/cache/Cargo.toml

@@ -2,7 +2,7 @@
 
 [dependencies.pigeonhole-io]
 path = "../io"
-version = "=2.0.0"
+version = "=2.0.1"
 [lints.rust.unexpected_cfgs]
 check-cfg = ["cfg(loom)", "cfg(engine_loom)", "cfg(io_loom)", "cfg(pigeonhole_sim)"]
 level = "warn"
@@ -17,5 +17,5 @@ name = "pigeonhole-cache"
 readme = "README.md"
 repository = "https://github.com/CodingAnarchy/pigeonhole"
 rust-version = "1.96"
-version = "2.0.0"
+version = "2.0.1"
 [target."cfg(loom)"]

data/vendor/compaction/Cargo.toml

@@ -2,19 +2,19 @@
 
 [dependencies.pigeonhole-cache]
 path = "../cache"
-version = "=2.0.0"
+version = "=2.0.1"
 [dependencies.pigeonhole-format]
 path = "../format"
-version = "=2.0.0"
+version = "=2.0.1"
 [dependencies.pigeonhole-io]
 path = "../io"
-version = "=2.0.0"
+version = "=2.0.1"
 [dependencies.pigeonhole-pager]
 path = "../pager"
-version = "=2.0.0"
+version = "=2.0.1"
 [dependencies.pigeonhole-sst]
 path = "../sst"
-version = "=2.0.0"
+version = "=2.0.1"
 [lints.rust.unexpected_cfgs]
 check-cfg = ["cfg(loom)", "cfg(engine_loom)", "cfg(io_loom)", "cfg(pigeonhole_sim)"]
 level = "warn"
@@ -29,4 +29,4 @@ name = "pigeonhole-compaction"
 readme = "README.md"
 repository = "https://github.com/CodingAnarchy/pigeonhole"
 rust-version = "1.96"
-version = "2.0.0"
+version = "2.0.1"

data/vendor/engine/Cargo.toml

@@ -4,34 +4,34 @@
 version = "1"
 [dependencies.pigeonhole-cache]
 path = "../cache"
-version = "=2.0.0"
+version = "=2.0.1"
 [dependencies.pigeonhole-compaction]
 path = "../compaction"
-version = "=2.0.0"
+version = "=2.0.1"
 [dependencies.pigeonhole-format]
 path = "../format"
-version = "=2.0.0"
+version = "=2.0.1"
 [dependencies.pigeonhole-io]
 path = "../io"
-version = "=2.0.0"
+version = "=2.0.1"
 [dependencies.pigeonhole-memtable]
 path = "../memtable"
-version = "=2.0.0"
+version = "=2.0.1"
 [dependencies.pigeonhole-pager]
 path = "../pager"
-version = "=2.0.0"
+version = "=2.0.1"
 [dependencies.pigeonhole-runtime]
 path = "../runtime"
-version = "=2.0.0"
+version = "=2.0.1"
 [dependencies.pigeonhole-shm]
 path = "../shm"
-version = "=2.0.0"
+version = "=2.0.1"
 [dependencies.pigeonhole-sst]
 path = "../sst"
-version = "=2.0.0"
+version = "=2.0.1"
 [dependencies.pigeonhole-wal]
 path = "../wal"
-version = "=2.0.0"
+version = "=2.0.1"
 [dependencies.smallvec]
 version = "1"
 [features]
@@ -50,7 +50,7 @@ name = "pigeonhole-engine"
 readme = "README.md"
 repository = "https://github.com/CodingAnarchy/pigeonhole"
 rust-version = "1.96"
-version = "2.0.0"
+version = "2.0.1"
 [target."cfg(engine_loom)".dependencies.loom]
 version = "0.7"
 [target."cfg(unix)"]

data/vendor/engine/src/engine.rs

@@ -2693,6 +2693,15 @@ impl Engine {
             .value
             .take()
             .map(|p| (p, Arc::clone(&snapshot.view.ssts)));
+        // The read's column limit counts only the columns that pass the predicate (the
+        // resolver counts a column when its newest version passes), so it leaves the read
+        // with the predicate, and the search counts the passing columns itself (simp724's A1
+        // on #1286).
+        let column_limit = if filter.is_some() {
+            std::mem::take(&mut read.columns_per_row)
+        } else {
+            0
+        };
         Ok(match &spec.input {
             crate::ReadInput::Ranges(ranges) => {
                 let [(lo, hi)] = ranges.as_slice() else {
@@ -2703,7 +2712,7 @@ impl Engine {
                 let mut scan = ScanSpec::new(lo.clone(), hi.clone());
                 scan.read = read;
                 let cursor = self.scan_async(snapshot, table, scan)?;
-                read::knn::PendingNearest::scan(cursor, query, k, filter)
+                read::knn::PendingNearest::scan(cursor, query, k, filter, column_limit)
             }
             crate::ReadInput::Keys(keys) => {
                 let cursor = crate::KeyCursor::over(
@@ -2715,7 +2724,14 @@ impl Engine {
                     Arc::clone(keys),
                     Arc::clone(&self.inner.shared),
                 )?;
-                read::knn::PendingNearest::keys(cursor, Arc::clone(keys), query, k, filter)
+                read::knn::PendingNearest::keys(
+                    cursor,
+                    Arc::clone(keys),
+                    query,
+                    k,
+                    filter,
+                    column_limit,
+                )
             }
         })
     }

data/vendor/engine/src/read/knn.rs

@@ -240,6 +240,11 @@ pub struct PendingNearest {
     /// so the cells it drops count toward a poll's budget (#1237's rule), with the SSTs to
     /// read a separated value from.
     filter: Option<Filter>,
+    /// The read's column limit when `filter` left the read (0: none), and the columns that
+    /// passed it in the current row: the resolver counts only passing columns, so the search
+    /// does too (simp724's A1 on #1286).
+    column_limit: u32,
+    columns: u32,
     /// The row being read (its key in a buffer reused from row to row), if one is.
     row: Vec<u8>,
     in_row: bool,
@@ -263,8 +268,9 @@ impl PendingNearest {
         query: Prepared,
         k: usize,
         filter: Option<Filter>,
+        column_limit: u32,
     ) -> Self {
-        Self::with(Source::Scan(cursor), query, k, filter)
+        Self::with(Source::Scan(cursor), query, k, filter, column_limit)
     }
 
     pub(crate) fn keys(
@@ -273,16 +279,31 @@ impl PendingNearest {
         query: Prepared,
         k: usize,
         filter: Option<Filter>,
+        column_limit: u32,
     ) -> Self {
-        Self::with(Source::Keys { cursor, keys }, query, k, filter)
+        Self::with(
+            Source::Keys { cursor, keys },
+            query,
+            k,
+            filter,
+            column_limit,
+        )
     }
 
-    fn with(source: Source, query: Prepared, k: usize, filter: Option<Filter>) -> Self {
+    fn with(
+        source: Source,
+        query: Prepared,
+        k: usize,
+        filter: Option<Filter>,
+        column_limit: u32,
+    ) -> Self {
         Self {
             source,
             visitor: KnnVisitor::typed(query, Arc::new(KnnSkips::default())),
             top: TopK::new(k),
             filter,
+            column_limit,
+            columns: 0,
             row: Vec::new(),
             in_row: false,
             done: false,
@@ -315,18 +336,29 @@ impl PendingNearest {
                     return Poll::Ready(Ok(()));
                 }
                 self.in_row = true;
+                self.columns = 0;
             }
             let row = self.row.as_slice();
-            let (visitor, top, filter) = (&mut self.visitor, &mut self.top, self.filter.as_ref());
-            let ended = match &mut self.source {
-                Source::Scan(c) => {
-                    c.counted(|c| read_row(c, row, &mut budget, visitor, top, filter))
-                }
-                Source::Keys { cursor, .. } => {
-                    cursor.counted(|c| read_row(c, row, &mut budget, visitor, top, filter))
-                }
+            let mut r = RowRead {
+                row,
+                budget: &mut budget,
+                visitor: &mut self.visitor,
+                top: &mut self.top,
+                filter: self.filter.as_ref(),
+                column_limit: self.column_limit,
+                columns: &mut self.columns,
+            };
+            let end = match &mut self.source {
+                Source::Scan(c) => c.counted(|c| r.read(c)),
+                Source::Keys { cursor, .. } => cursor.counted(|c| r.read(c)),
             }?;
-            if ended {
+            if end == RowEnd::Limit
+                && let Source::Keys { cursor, .. } = &mut self.source
+            {
+                // The rest of the key goes unread; a scan's next row drops it itself.
+                cursor.skip_rest_of_key();
+            }
+            if end != RowEnd::Budget {
                 self.in_row = false;
             } else {
                 // The budget ran out mid-row: yield, keeping the row's place.
@@ -354,43 +386,71 @@ impl RowCells for super::keys::KeyCursor {
     }
 }
 
-/// Scores the current row's cells into `top` within `budget` cells: whether the row ended.
-/// Cells `filter` drops count toward the budget too, and never reach the visitor.
-fn read_row(
-    cells: &mut impl RowCells,
-    row: &[u8],
-    budget: &mut u32,
-    visitor: &mut KnnVisitor,
-    top: &mut TopK<Score>,
-    filter: Option<&Filter>,
-) -> crate::Result<bool> {
-    use super::reduce::{CellRef, Reducer};
-    loop {
-        if *budget == 0 {
-            return Ok(false);
-        }
-        let Some(c) = cells.next_cell()? else {
-            return Ok(true);
-        };
-        *budget -= 1;
-        if let Some((p, ssts)) = filter {
-            let kept = match pigeonhole_compaction::blob_pointer(c.stored) {
-                Some(ptr) => p.matches(&ssts.read_pointer(&ptr)?),
-                None => p.matches(c.stored),
-            };
-            if !kept {
-                continue;
+/// Where a row's read stopped.
+#[derive(Debug, Clone, Copy, PartialEq, Eq)]
+enum RowEnd {
+    /// The poll's cell budget ran out: the row goes on next poll.
+    Budget,
+    /// The row's cells ran out.
+    Ended,
+    /// The column limit is reached: the rest of the row is skipped.
+    Limit,
+}
+
+/// One row's read into `top`, within the poll's `budget` cells.
+struct RowRead<'a> {
+    row: &'a [u8],
+    budget: &'a mut u32,
+    visitor: &'a mut KnnVisitor,
+    top: &'a mut TopK<Score>,
+    filter: Option<&'a Filter>,
+    column_limit: u32,
+    columns: &'a mut u32,
+}
+
+impl RowRead<'_> {
+    /// Scores the current row's cells. Cells `filter` drops count toward the budget too,
+    /// and never reach the visitor; with a column limit, only the cells it keeps count
+    /// toward the limit (one version per column).
+    fn read(&mut self, cells: &mut impl RowCells) -> crate::Result<RowEnd> {
+        use super::reduce::{CellRef, Reducer};
+        let row = self.row;
+        loop {
+            if *self.budget == 0 {
+                return Ok(RowEnd::Budget);
             }
-        }
-        if let Visit::Emit(score) = visitor.visit(row, c.family, c.qualifier, c.ts, c.stored) {
-            let cell = CellRef {
-                row,
-                family_rank: 0,
-                family: c.family,
-                qualifier: c.qualifier,
-                ts: c.ts,
+            let Some(c) = cells.next_cell()? else {
+                return Ok(RowEnd::Ended);
             };
-            let _ = top.push(cell, score);
+            *self.budget -= 1;
+            if let Some((p, ssts)) = self.filter {
+                let kept = match pigeonhole_compaction::blob_pointer(c.stored) {
+                    Some(ptr) => p.matches(&ssts.read_pointer(&ptr)?),
+                    None => p.matches(c.stored),
+                };
+                if !kept {
+                    continue;
+                }
+                if self.column_limit != 0 {
+                    if *self.columns == self.column_limit {
+                        return Ok(RowEnd::Limit);
+                    }
+                    *self.columns += 1;
+                }
+            }
+            let visited = self
+                .visitor
+                .visit(row, c.family, c.qualifier, c.ts, c.stored);
+            if let Visit::Emit(score) = visited {
+                let cell = CellRef {
+                    row,
+                    family_rank: 0,
+                    family: c.family,
+                    qualifier: c.qualifier,
+                    ts: c.ts,
+                };
+                let _ = self.top.push(cell, score);
+            }
         }
     }
 }

data/vendor/engine/src/read.rs

@@ -1121,11 +1121,12 @@ impl ScanCursor {
             self.recycle_lanes();
             return Ok(Some(false));
         }
-        // Drop whatever is left of the current row.
+        // Drop whatever is left of the current row. A lane whose cell was handed out last
+        // still holds it (pending, in this row) with the rest of the row behind it unread:
+        // it is skipped with the others, never left to hand that rest out as a next row
+        // (a reader that stops a row early: an async search at its column limit, #1286).
         if self.in_row {
-            if let Some(i) = self.last_lane.take() {
-                self.lanes[i].pending = false;
-            }
+            self.last_lane = None;
             self.skip_current_row()?;
             self.in_row = false;
         }

data/vendor/format/Cargo.toml

@@ -37,4 +37,4 @@ name = "pigeonhole-format"
 readme = "README.md"
 repository = "https://github.com/CodingAnarchy/pigeonhole"
 rust-version = "1.96"
-version = "2.0.0"
+version = "2.0.1"

data/vendor/io/Cargo.toml

@@ -2,7 +2,7 @@
 
 [dependencies.pigeonhole-format]
 path = "../format"
-version = "=2.0.0"
+version = "=2.0.1"
 [lints.rust.unexpected_cfgs]
 check-cfg = ["cfg(loom)", "cfg(engine_loom)", "cfg(io_loom)", "cfg(pigeonhole_sim)"]
 level = "warn"
@@ -17,7 +17,7 @@ name = "pigeonhole-io"
 readme = "README.md"
 repository = "https://github.com/CodingAnarchy/pigeonhole"
 rust-version = "1.96"
-version = "2.0.0"
+version = "2.0.1"
 [target."cfg(io_loom)".dependencies.loom]
 version = "0.7"
 [target."cfg(target_os = \"linux\")".dependencies.io-uring]

data/vendor/memory/Cargo.toml

@@ -4,13 +4,13 @@
 version = "0.3"
 [dependencies.pigeonhole]
 path = "../pigeonhole"
-version = "1.1.0"
+version = "1.1.1"
 [dependencies.pigeonhole-text]
 path = "../text"
-version = "1.1.0"
+version = "1.1.1"
 [dependencies.pigeonhole-vector]
 path = "../vector"
-version = "1.1.0"
+version = "1.1.1"
 [dependencies.twox-hash]
 default-features = false
 features = ["std", "xxhash3_64", "xxhash3_128"]
@@ -31,4 +31,4 @@ name = "pigeonhole-memory"
 readme = "README.md"
 repository = "https://github.com/CodingAnarchy/pigeonhole"
 rust-version = "1.96"
-version = "1.1.0"
+version = "1.1.1"

data/vendor/memtable/Cargo.toml

@@ -2,10 +2,10 @@
 
 [dependencies.pigeonhole-format]
 path = "../format"
-version = "=2.0.0"
+version = "=2.0.1"
 [dependencies.pigeonhole-io]
 path = "../io"
-version = "=2.0.0"
+version = "=2.0.1"
 [lints.rust.unexpected_cfgs]
 check-cfg = ["cfg(loom)", "cfg(engine_loom)", "cfg(io_loom)", "cfg(pigeonhole_sim)"]
 level = "warn"
@@ -20,5 +20,5 @@ name = "pigeonhole-memtable"
 readme = "README.md"
 repository = "https://github.com/CodingAnarchy/pigeonhole"
 rust-version = "1.96"
-version = "2.0.0"
+version = "2.0.1"
 [target."cfg(loom)"]

data/vendor/pager/Cargo.toml

@@ -2,10 +2,10 @@
 
 [dependencies.pigeonhole-format]
 path = "../format"
-version = "=2.0.0"
+version = "=2.0.1"
 [dependencies.pigeonhole-io]
 path = "../io"
-version = "=2.0.0"
+version = "=2.0.1"
 [lints.rust.unexpected_cfgs]
 check-cfg = ["cfg(loom)", "cfg(engine_loom)", "cfg(io_loom)", "cfg(pigeonhole_sim)"]
 level = "warn"
@@ -20,4 +20,4 @@ name = "pigeonhole-pager"
 readme = "README.md"
 repository = "https://github.com/CodingAnarchy/pigeonhole"
 rust-version = "1.96"
-version = "2.0.0"
+version = "2.0.1"

data/vendor/pigeonhole/Cargo.toml

@@ -8,16 +8,16 @@ optional = true
 version = "0.3"
 [dependencies.pigeonhole-engine]
 path = "../engine"
-version = "=2.0.0"
+version = "=2.0.1"
 [dependencies.pigeonhole-format]
 path = "../format"
-version = "=2.0.0"
+version = "=2.0.1"
 [dependencies.pigeonhole-io]
 path = "../io"
-version = "=2.0.0"
+version = "=2.0.1"
 [dependencies.pigeonhole-shm]
 path = "../shm"
-version = "=2.0.0"
+version = "=2.0.1"
 [dependencies.smallvec]
 version = "1"
 [features]
@@ -39,4 +39,4 @@ name = "pigeonhole"
 readme = "README.md"
 repository = "https://github.com/CodingAnarchy/pigeonhole"
 rust-version = "1.96"
-version = "1.1.0"
+version = "1.1.1"

data/vendor/pigeonhole/README.md

@@ -39,7 +39,7 @@ cargo add pigeonhole
 or `pigeonhole = "1"` in `Cargo.toml`. Requires Rust 1.96 (2024 edition). API docs are on
 [docs.rs](https://docs.rs/pigeonhole). See the
 [changelog](https://github.com/CodingAnarchy/pigeonhole/blob/main/CHANGELOG.md) and the
-[1.1.0 release](https://github.com/CodingAnarchy/pigeonhole/releases/tag/v1.1.0).
+[1.1.1 release](https://github.com/CodingAnarchy/pigeonhole/releases/tag/v1.1.1).
 
 ## Quickstart
 

data/vendor/runtime/Cargo.toml

@@ -2,7 +2,7 @@
 
 [dependencies.pigeonhole-io]
 path = "../io"
-version = "=2.0.0"
+version = "=2.0.1"
 [lints.rust.unexpected_cfgs]
 check-cfg = ["cfg(loom)", "cfg(engine_loom)", "cfg(io_loom)", "cfg(pigeonhole_sim)"]
 level = "warn"
@@ -17,5 +17,5 @@ name = "pigeonhole-runtime"
 readme = "README.md"
 repository = "https://github.com/CodingAnarchy/pigeonhole"
 rust-version = "1.96"
-version = "2.0.0"
+version = "2.0.1"
 [target."cfg(loom)"]

data/vendor/shm/Cargo.toml

@@ -2,10 +2,10 @@
 
 [dependencies.pigeonhole-format]
 path = "../format"
-version = "=2.0.0"
+version = "=2.0.1"
 [dependencies.pigeonhole-io]
 path = "../io"
-version = "=2.0.0"
+version = "=2.0.1"
 [lints.rust.unexpected_cfgs]
 check-cfg = ["cfg(loom)", "cfg(engine_loom)", "cfg(io_loom)", "cfg(pigeonhole_sim)"]
 level = "warn"
@@ -20,5 +20,5 @@ name = "pigeonhole-shm"
 readme = "README.md"
 repository = "https://github.com/CodingAnarchy/pigeonhole"
 rust-version = "1.96"
-version = "2.0.0"
+version = "2.0.1"
 [target."cfg(unix)"]

data/vendor/sst/Cargo.toml

@@ -2,13 +2,13 @@
 
 [dependencies.pigeonhole-cache]
 path = "../cache"
-version = "=2.0.0"
+version = "=2.0.1"
 [dependencies.pigeonhole-format]
 path = "../format"
-version = "=2.0.0"
+version = "=2.0.1"
 [dependencies.pigeonhole-io]
 path = "../io"
-version = "=2.0.0"
+version = "=2.0.1"
 [lints.rust.unexpected_cfgs]
 check-cfg = ["cfg(loom)", "cfg(engine_loom)", "cfg(io_loom)", "cfg(pigeonhole_sim)"]
 level = "warn"
@@ -23,4 +23,4 @@ name = "pigeonhole-sst"
 readme = "README.md"
 repository = "https://github.com/CodingAnarchy/pigeonhole"
 rust-version = "1.96"
-version = "2.0.0"
+version = "2.0.1"

data/vendor/text/Cargo.toml

@@ -4,7 +4,7 @@
 version = "0.2.1"
 [dependencies.pigeonhole]
 path = "../pigeonhole"
-version = "1.1.0"
+version = "1.1.1"
 [dependencies.unicode-normalization]
 version = "0.1"
 [dependencies.unicode-segmentation]
@@ -23,4 +23,4 @@ name = "pigeonhole-text"
 readme = "README.md"
 repository = "https://github.com/CodingAnarchy/pigeonhole"
 rust-version = "1.96"
-version = "1.1.0"
+version = "1.1.1"

data/vendor/vector/Cargo.toml

@@ -6,7 +6,7 @@ optional = true
 version = "0.3"
 [dependencies.pigeonhole]
 path = "../pigeonhole"
-version = "1.1.0"
+version = "1.1.1"
 [features]
 __unstable-hooks = []
 async = ["pigeonhole/async", "dep:futures-core"]
@@ -25,4 +25,4 @@ name = "pigeonhole-vector"
 readme = "README.md"
 repository = "https://github.com/CodingAnarchy/pigeonhole"
 rust-version = "1.96"
-version = "1.1.0"
+version = "1.1.1"

data/vendor/wal/Cargo.toml

@@ -2,10 +2,10 @@
 
 [dependencies.pigeonhole-format]
 path = "../format"
-version = "=2.0.0"
+version = "=2.0.1"
 [dependencies.pigeonhole-io]
 path = "../io"
-version = "=2.0.0"
+version = "=2.0.1"
 [features]
 sim-hooks = []
 [lints.rust.unexpected_cfgs]
@@ -22,4 +22,4 @@ name = "pigeonhole-wal"
 readme = "README.md"
 repository = "https://github.com/CodingAnarchy/pigeonhole"
 rust-version = "1.96"
-version = "2.0.0"
+version = "2.0.1"

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: pigeonhole-db
 version: !ruby/object:Gem::Version
-  version: 1.1.0
+  version: 1.1.1
 platform: ruby
 authors:
 - Matt Tanous