beaver-db 0.16.0__tar.gz → 0.16.2__tar.gz

{beaver_db-0.16.0 → beaver_db-0.16.2}/PKG-INFO

@@ -1,7 +1,12 @@
 Metadata-Version: 2.4
 Name: beaver-db
-Version: 0.16.0
+Version: 0.16.2
 Summary: Fast, embedded, and multi-modal DB based on SQLite for AI-powered applications.
+Classifier: Programming Language :: Python :: 3
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Operating System :: OS Independent
+Classifier: Topic :: Database
+Classifier: Topic :: Software Development :: Libraries :: Application Frameworks
 Requires-Python: >=3.13
 Description-Content-Type: text/markdown
 License-File: LICENSE
@@ -11,6 +16,13 @@ Dynamic: license-file
 
 # beaver 🦫
 
+<!-- Project badges -->
+![PyPI - Version](https://img.shields.io/pypi/v/beaver-db)
+![PyPi - Python Version](https://img.shields.io/pypi/pyversions/beaver-db)
+![Github - Open Issues](https://img.shields.io/github/issues-raw/apiad/beaver)
+![PyPi - Downloads (Monthly)](https://img.shields.io/pypi/dm/beaver-db)
+![Github - Commits](https://img.shields.io/github/commit-activity/m/apiad/beaver)
+
 A fast, single-file, multi-modal database for Python, built with the standard `sqlite3` library.
 
 `beaver` is the **B**ackend for **E**mbedded, **A**ll-in-one **V**ector, **E**ntity, and **R**elationship storage. It's a simple, local, and embedded database designed to manage complex, modern data types without requiring a database server, built on top of SQLite.
@@ -236,8 +248,8 @@ def summarize(window):
     return {"mean": statistics.mean(values), "count": len(values)}
 
 live_summary = logs.live(
-    window_duration=timedelta(seconds=10),
-    sampling_period=timedelta(seconds=1),
+    window=timedelta(seconds=10),
+    period=timedelta(seconds=1),
     aggregator=summarize
 )
 
@@ -294,6 +306,7 @@ For more in-depth examples, check out the scripts in the `examples/` directory:
   - [`graph.py`](examples/graph.py): Shows how to create relationships between documents and perform multi-hop graph traversals.
   - [`kvstore.py`](examples/kvstore.py): A comprehensive demo of the namespaced dictionary feature.
   - [`list.py`](examples/list.py): Shows the full capabilities of the persistent list, including slicing and in-place updates.
+  - [`logs.py`](examples/logs.py): A short example showing how to build a realtime dashboard with the logging feature.
   - [`pqueue.py`](examples/pqueue.py): A practical example of using the persistent priority queue for task management.
   - [`producer_consumer.py`](examples/producer_consumer.py): A demonstration of the distributed task queue system in a multi-process environment.
   - [`publisher.py`](examples/publisher.py) and [`subscriber.py`](examples/subscriber.py): A pair of examples demonstrating inter-process message passing with the publish/subscribe system.
@@ -301,7 +314,7 @@ For more in-depth examples, check out the scripts in the `examples/` directory:
   - [`rerank.py`](examples/rerank.py): Shows how to combine results from vector and text search for more refined results.
   - [`stress_vectors.py`](examples/stress_vectors.py): A stress test for the vector search functionality.
   - [`textual_chat.py`](examples/textual_chat.py): A chat application built with `textual` and `beaver` to illustrate the use of several primitives (lists, dicts, and channels) at the same time.
-  - [`type_hints.py](examples/type_hints.py): Shows how to use type hints with `beaver` to get better IDE support and type safety.
+  - [`type_hints.py`](examples/type_hints.py): Shows how to use type hints with `beaver` to get better IDE support and type safety.
   - [`vector.py`](examples/vector.py): Demonstrates how to index and search vector embeddings, including upserts.
 
 ## Roadmap

beaver_db-0.16.0/beaver_db.egg-info/PKG-INFO → beaver_db-0.16.2/README.md

@@ -1,16 +1,12 @@
-Metadata-Version: 2.4
-Name: beaver-db
-Version: 0.16.0
-Summary: Fast, embedded, and multi-modal DB based on SQLite for AI-powered applications.
-Requires-Python: >=3.13
-Description-Content-Type: text/markdown
-License-File: LICENSE
-Requires-Dist: faiss-cpu>=1.12.0
-Requires-Dist: numpy>=2.3.3
-Dynamic: license-file
-
 # beaver 🦫
 
+<!-- Project badges -->
+![PyPI - Version](https://img.shields.io/pypi/v/beaver-db)
+![PyPi - Python Version](https://img.shields.io/pypi/pyversions/beaver-db)
+![Github - Open Issues](https://img.shields.io/github/issues-raw/apiad/beaver)
+![PyPi - Downloads (Monthly)](https://img.shields.io/pypi/dm/beaver-db)
+![Github - Commits](https://img.shields.io/github/commit-activity/m/apiad/beaver)
+
 A fast, single-file, multi-modal database for Python, built with the standard `sqlite3` library.
 
 `beaver` is the **B**ackend for **E**mbedded, **A**ll-in-one **V**ector, **E**ntity, and **R**elationship storage. It's a simple, local, and embedded database designed to manage complex, modern data types without requiring a database server, built on top of SQLite.
@@ -236,8 +232,8 @@ def summarize(window):
     return {"mean": statistics.mean(values), "count": len(values)}
 
 live_summary = logs.live(
-    window_duration=timedelta(seconds=10),
-    sampling_period=timedelta(seconds=1),
+    window=timedelta(seconds=10),
+    period=timedelta(seconds=1),
     aggregator=summarize
 )
 
@@ -294,6 +290,7 @@ For more in-depth examples, check out the scripts in the `examples/` directory:
   - [`graph.py`](examples/graph.py): Shows how to create relationships between documents and perform multi-hop graph traversals.
   - [`kvstore.py`](examples/kvstore.py): A comprehensive demo of the namespaced dictionary feature.
   - [`list.py`](examples/list.py): Shows the full capabilities of the persistent list, including slicing and in-place updates.
+  - [`logs.py`](examples/logs.py): A short example showing how to build a realtime dashboard with the logging feature.
   - [`pqueue.py`](examples/pqueue.py): A practical example of using the persistent priority queue for task management.
   - [`producer_consumer.py`](examples/producer_consumer.py): A demonstration of the distributed task queue system in a multi-process environment.
   - [`publisher.py`](examples/publisher.py) and [`subscriber.py`](examples/subscriber.py): A pair of examples demonstrating inter-process message passing with the publish/subscribe system.
@@ -301,7 +298,7 @@ For more in-depth examples, check out the scripts in the `examples/` directory:
   - [`rerank.py`](examples/rerank.py): Shows how to combine results from vector and text search for more refined results.
   - [`stress_vectors.py`](examples/stress_vectors.py): A stress test for the vector search functionality.
   - [`textual_chat.py`](examples/textual_chat.py): A chat application built with `textual` and `beaver` to illustrate the use of several primitives (lists, dicts, and channels) at the same time.
-  - [`type_hints.py](examples/type_hints.py): Shows how to use type hints with `beaver` to get better IDE support and type safety.
+  - [`type_hints.py`](examples/type_hints.py): Shows how to use type hints with `beaver` to get better IDE support and type safety.
   - [`vector.py`](examples/vector.py): Demonstrates how to index and search vector embeddings, including upserts.
 
 ## Roadmap

{beaver_db-0.16.0 → beaver_db-0.16.2}/beaver/lists.py

@@ -40,38 +40,40 @@ class ListManager[T]:
         Retrieves an item or slice from the list (e.g., `my_list[0]`, `my_list[1:3]`).
         """
         if isinstance(key, slice):
-            start, stop, step = key.indices(len(self))
-            if step != 1:
-                raise ValueError("Slicing with a step is not supported.")
-
-            limit = stop - start
-            if limit <= 0:
-                return []
-
-            cursor = self._conn.cursor()
-            cursor.execute(
-                "SELECT item_value FROM beaver_lists WHERE list_name = ? ORDER BY item_order ASC LIMIT ? OFFSET ?",
-                (self._name, limit, start),
-            )
-            results = [self._deserialize(row["item_value"]) for row in cursor.fetchall()]
-            cursor.close()
-            return results
+            with self._conn:
+                start, stop, step = key.indices(len(self))
+                if step != 1:
+                    raise ValueError("Slicing with a step is not supported.")
+
+                limit = stop - start
+                if limit <= 0:
+                    return []
+
+                cursor = self._conn.cursor()
+                cursor.execute(
+                    "SELECT item_value FROM beaver_lists WHERE list_name = ? ORDER BY item_order ASC LIMIT ? OFFSET ?",
+                    (self._name, limit, start),
+                )
+                results = [self._deserialize(row["item_value"]) for row in cursor.fetchall()]
+                cursor.close()
+                return results
 
         elif isinstance(key, int):
-            list_len = len(self)
-            if key < -list_len or key >= list_len:
-                raise IndexError("List index out of range.")
-
-            offset = key if key >= 0 else list_len + key
-
-            cursor = self._conn.cursor()
-            cursor.execute(
-                "SELECT item_value FROM beaver_lists WHERE list_name = ? ORDER BY item_order ASC LIMIT 1 OFFSET ?",
-                (self._name, offset),
-            )
-            result = cursor.fetchone()
-            cursor.close()
-            return self._deserialize(result["item_value"])
+            with self._conn:
+                list_len = len(self)
+                if key < -list_len or key >= list_len:
+                    raise IndexError("List index out of range.")
+
+                offset = key if key >= 0 else list_len + key
+
+                cursor = self._conn.cursor()
+                cursor.execute(
+                    "SELECT item_value FROM beaver_lists WHERE list_name = ? ORDER BY item_order ASC LIMIT 1 OFFSET ?",
+                    (self._name, offset),
+                )
+                result = cursor.fetchone()
+                cursor.close()
+                return self._deserialize(result["item_value"])
 
         else:
             raise TypeError("List indices must be integers or slices.")
@@ -81,13 +83,13 @@ class ListManager[T]:
         if not isinstance(key, int):
             raise TypeError("List indices must be integers.")
 
-        list_len = len(self)
-        if key < -list_len or key >= list_len:
-            raise IndexError("List index out of range.")
+        with self._conn:
+            list_len = len(self)
+            if key < -list_len or key >= list_len:
+                raise IndexError("List index out of range.")
 
-        offset = key if key >= 0 else list_len + key
+            offset = key if key >= 0 else list_len + key
 
-        with self._conn:
             cursor = self._conn.cursor()
             # Find the rowid of the item to update
             cursor.execute(
@@ -110,13 +112,13 @@ class ListManager[T]:
         if not isinstance(key, int):
             raise TypeError("List indices must be integers.")
 
-        list_len = len(self)
-        if key < -list_len or key >= list_len:
-            raise IndexError("List index out of range.")
+        with self._conn:
+            list_len = len(self)
+            if key < -list_len or key >= list_len:
+                raise IndexError("List index out of range.")
 
-        offset = key if key >= 0 else list_len + key
+            offset = key if key >= 0 else list_len + key
 
-        with self._conn:
             cursor = self._conn.cursor()
             # Find the rowid of the item to delete
             cursor.execute(
@@ -206,20 +208,20 @@ class ListManager[T]:
 
     def insert(self, index: int, value: T):
         """Inserts an item at a specific index."""
-        list_len = len(self)
-        if index <= 0:
-            self.prepend(value)
-            return
-        if index >= list_len:
-            self.push(value)
-            return
-
-        # Midpoint insertion for O(1) inserts
-        order_before = self._get_order_at_index(index - 1)
-        order_after = self._get_order_at_index(index)
-        new_order = order_before + (order_after - order_before) / 2.0
-
         with self._conn:
+            list_len = len(self)
+            if index <= 0:
+                self.prepend(value)
+                return
+            if index >= list_len:
+                self.push(value)
+                return
+
+            # Midpoint insertion for O(1) inserts
+            order_before = self._get_order_at_index(index - 1)
+            order_after = self._get_order_at_index(index)
+            new_order = order_before + (order_after - order_before) / 2.0
+
             self._conn.execute(
                 "INSERT INTO beaver_lists (list_name, item_order, item_value) VALUES (?, ?, ?)",
                 (self._name, new_order, self._serialize(value)),

beaver_db-0.16.0/README.md → beaver_db-0.16.2/beaver_db.egg-info/PKG-INFO

@@ -1,5 +1,28 @@
+Metadata-Version: 2.4
+Name: beaver-db
+Version: 0.16.2
+Summary: Fast, embedded, and multi-modal DB based on SQLite for AI-powered applications.
+Classifier: Programming Language :: Python :: 3
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Operating System :: OS Independent
+Classifier: Topic :: Database
+Classifier: Topic :: Software Development :: Libraries :: Application Frameworks
+Requires-Python: >=3.13
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: faiss-cpu>=1.12.0
+Requires-Dist: numpy>=2.3.3
+Dynamic: license-file
+
 # beaver 🦫
 
+<!-- Project badges -->
+![PyPI - Version](https://img.shields.io/pypi/v/beaver-db)
+![PyPi - Python Version](https://img.shields.io/pypi/pyversions/beaver-db)
+![Github - Open Issues](https://img.shields.io/github/issues-raw/apiad/beaver)
+![PyPi - Downloads (Monthly)](https://img.shields.io/pypi/dm/beaver-db)
+![Github - Commits](https://img.shields.io/github/commit-activity/m/apiad/beaver)
+
 A fast, single-file, multi-modal database for Python, built with the standard `sqlite3` library.
 
 `beaver` is the **B**ackend for **E**mbedded, **A**ll-in-one **V**ector, **E**ntity, and **R**elationship storage. It's a simple, local, and embedded database designed to manage complex, modern data types without requiring a database server, built on top of SQLite.
@@ -225,8 +248,8 @@ def summarize(window):
     return {"mean": statistics.mean(values), "count": len(values)}
 
 live_summary = logs.live(
-    window_duration=timedelta(seconds=10),
-    sampling_period=timedelta(seconds=1),
+    window=timedelta(seconds=10),
+    period=timedelta(seconds=1),
     aggregator=summarize
 )
 
@@ -283,6 +306,7 @@ For more in-depth examples, check out the scripts in the `examples/` directory:
   - [`graph.py`](examples/graph.py): Shows how to create relationships between documents and perform multi-hop graph traversals.
   - [`kvstore.py`](examples/kvstore.py): A comprehensive demo of the namespaced dictionary feature.
   - [`list.py`](examples/list.py): Shows the full capabilities of the persistent list, including slicing and in-place updates.
+  - [`logs.py`](examples/logs.py): A short example showing how to build a realtime dashboard with the logging feature.
   - [`pqueue.py`](examples/pqueue.py): A practical example of using the persistent priority queue for task management.
   - [`producer_consumer.py`](examples/producer_consumer.py): A demonstration of the distributed task queue system in a multi-process environment.
   - [`publisher.py`](examples/publisher.py) and [`subscriber.py`](examples/subscriber.py): A pair of examples demonstrating inter-process message passing with the publish/subscribe system.
@@ -290,7 +314,7 @@ For more in-depth examples, check out the scripts in the `examples/` directory:
   - [`rerank.py`](examples/rerank.py): Shows how to combine results from vector and text search for more refined results.
   - [`stress_vectors.py`](examples/stress_vectors.py): A stress test for the vector search functionality.
   - [`textual_chat.py`](examples/textual_chat.py): A chat application built with `textual` and `beaver` to illustrate the use of several primitives (lists, dicts, and channels) at the same time.
-  - [`type_hints.py](examples/type_hints.py): Shows how to use type hints with `beaver` to get better IDE support and type safety.
+  - [`type_hints.py`](examples/type_hints.py): Shows how to use type hints with `beaver` to get better IDE support and type safety.
   - [`vector.py`](examples/vector.py): Demonstrates how to index and search vector embeddings, including upserts.
 
 ## Roadmap

{beaver_db-0.16.0 → beaver_db-0.16.2}/pyproject.toml

@@ -1,6 +1,6 @@
 [project]
 name = "beaver-db"
-version = "0.16.0"
+version = "0.16.2"
 description = "Fast, embedded, and multi-modal DB based on SQLite for AI-powered applications."
 readme = "README.md"
 requires-python = ">=3.13"
@@ -8,6 +8,13 @@ dependencies = [
     "faiss-cpu>=1.12.0",
     "numpy>=2.3.3",
 ]
+classifiers = [
+    "Programming Language :: Python :: 3",
+    "License :: OSI Approved :: MIT License",
+    "Operating System :: OS Independent",
+    "Topic :: Database",
+    "Topic :: Software Development :: Libraries :: Application Frameworks",
+]
 
 [tool.hatch.build.targets.wheel]
 packages = ["beaver"]