sop4py 2.0.9__py3-none-any.whl → 2.0.11__py3-none-any.whl

{sop4py-2.0.9.dist-info → sop4py-2.0.11.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: sop4py
-Version: 2.0.9
+Version: 2.0.11
 Summary: Scalable Objects Persistence for Python. Release Candidate 1 (RC1) Release
 Author-email: Gerardo Recinto <gerardorecinto@yahoo.com>
 Classifier: Programming Language :: Python :: 3
@@ -245,6 +245,18 @@ class TestBtreeIndexSpecs(unittest.TestCase):
 
 ** Above is the same code of "sop/test_btree_idx.py" unit test file.
 
+# Navigation methods such as Find, First, Last then Fetch
+B-tree fetch operations are all cursor oriented. That is, you position the cursor to the item you want to fetch then fetch a batch. Each fetch (or getXx) call will move the cursor forward or backward to allow you to easily navigate and retrieve items (records) from a B-tree. There are the navigation set of methods to help in traversing the B-tree.
+
+The navigate then fetch batch (pattern) using "PagingInfo" as shown in above section is quite handy, specially when you are working on a UI that allows enduser(s) to browse through a series of data pages and needs to work out the B-tree, slice and dice the items (across thru data pages) and allows enduser operations/data entry-management.
+
+There are few navigation methods such as:
+* First - this will position the cursor to the first item of the B-tree, as per the "key sort order".
+* Last - this will position the cursor to the last item of the B-tree.
+* Find/FindWithID - allows you to find an item with a given Key, or at least, an item nearby. When there is no exact match found for the Key, B-tree will position the cursor to the item with a similar Key (one compare unit greater than the Key sought for). This is very handy, for example, you can issue a Find, or FindWithID if there are duplicates by key and you have ID of the one you are interested in. Then use the fetch methods (see get_keys, get_items, get_values) with paging info describing relative offset (from current or few pages forward or backward, & how many) to fetch the batch of items.
+
+And also, there are other methods of the B-tree you can use to manage the items such as: Update, Remove, Upsert. All of these accepts an array or a batch of items (key &/or value pairs as appropriate). See btree.py of the sop4py's "sop" package for complete list.
+
 # SOP in Github
 SOP open source project (MIT license) is in github. You can checkout the "...sop/jsondb/" package which contains the Go code enabling general purpose JSON data management & the Python wrapper, coding guideline of which, was described above.
 

{sop4py-2.0.9.dist-info → sop4py-2.0.11.dist-info}/RECORD

@@ -16,7 +16,7 @@ sop/redis.py,sha256=M2gZEDAPntG2HpV74Uc1FDneCWVFvsf3nv3zZ1Zx-3A,1165
 sop/test_btree.py,sha256=dmzto0m_y81RsU7e6i1GIQjq_eGQ_lSj0Ayilh2IqNY,13093
 sop/test_btree_idx.py,sha256=4Nus9UzaYWqfX1DfPbbeFffhvelVeVsBbaqpJB-5RXs,2254
 sop/transaction.py,sha256=Rl92TCdHgYIrCZBIrncOcjDhoT1THKYX5mFHN1sr85c,5767
-sop4py-2.0.9.dist-info/METADATA,sha256=Yq1QL21sOOY0eKNQmDunycFA_DA_x-p9xxBbPyU6lx0,11165
-sop4py-2.0.9.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
-sop4py-2.0.9.dist-info/top_level.txt,sha256=Xg42qRXwoOKelr7Lc8cpmy9uuBU3LtD3tPLHVnt0aHs,4
-sop4py-2.0.9.dist-info/RECORD,,
+sop4py-2.0.11.dist-info/METADATA,sha256=UM2qBRiFZqzl46fDz2DFNhN4V_nicNM4NRKIC7iglkM,13003
+sop4py-2.0.11.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
+sop4py-2.0.11.dist-info/top_level.txt,sha256=Xg42qRXwoOKelr7Lc8cpmy9uuBU3LtD3tPLHVnt0aHs,4
+sop4py-2.0.11.dist-info/RECORD,,