prollytree 0.3.2

A prolly (probabilistic) tree for efficient storage, retrieval, and modification of ordered data.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64

ProllyTree Python Documentation
================================

Welcome to the ProllyTree Python bindings documentation. ProllyTree is a probabilistic tree data structure that combines B-trees and Merkle trees to provide efficient data access with cryptographic verification.

.. toctree::
   :maxdepth: 2
   :caption: Contents:

   quickstart
   api
   examples
   advanced

Key Features
------------

* **Probabilistic Balancing**: Uses content-based hashing for automatic tree balancing
* **Merkle Tree Properties**: Provides cryptographic verification of data integrity
* **Efficient Storage**: Optimized for both memory and disk storage
* **Version Control**: Git-like versioned key-value storage with commit history
* **SQL Support**: Query your data using SQL with GlueSQL integration

Quick Example
-------------

.. code-block:: python

   from prollytree import ProllyTree

   # Create a new tree
   tree = ProllyTree()

   # Insert some data
   tree.insert(b"key1", b"value1")
   tree.insert(b"key2", b"value2")

   # Find data
   value = tree.find(b"key1")
   print(value)  # b"value1"

Installation
------------

Install ProllyTree using pip:

.. code-block:: bash

   pip install prollytree

Or build from source:

.. code-block:: bash

   git clone https://github.com/zhangfengcdt/prollytree
   cd prollytree
   ./python/build_python.sh --all-features --install

Indices and tables
==================

* :ref:`genindex`
* :ref:`modindex`
* :ref:`search`