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

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Potentially problematic release.


This version of sop4py might be problematic. Click here for more details.

@@ -1,6 +1,6 @@
1
1
  Metadata-Version: 2.4
2
2
  Name: sop4py
3
- Version: 2.0.10
3
+ Version: 2.0.11
4
4
  Summary: Scalable Objects Persistence for Python. Release Candidate 1 (RC1) Release
5
5
  Author-email: Gerardo Recinto <gerardorecinto@yahoo.com>
6
6
  Classifier: Programming Language :: Python :: 3
@@ -246,7 +246,9 @@ class TestBtreeIndexSpecs(unittest.TestCase):
246
246
  ** Above is the same code of "sop/test_btree_idx.py" unit test file.
247
247
 
248
248
  # Navigation methods such as Find, First, Last then Fetch
249
- The navigate then fetch batch 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.
249
+ 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.
250
+
251
+ 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.
250
252
 
251
253
  There are few navigation methods such as:
252
254
  * First - this will position the cursor to the first item of the B-tree, as per the "key sort order".
@@ -16,7 +16,7 @@ sop/redis.py,sha256=M2gZEDAPntG2HpV74Uc1FDneCWVFvsf3nv3zZ1Zx-3A,1165
16
16
  sop/test_btree.py,sha256=dmzto0m_y81RsU7e6i1GIQjq_eGQ_lSj0Ayilh2IqNY,13093
17
17
  sop/test_btree_idx.py,sha256=4Nus9UzaYWqfX1DfPbbeFffhvelVeVsBbaqpJB-5RXs,2254
18
18
  sop/transaction.py,sha256=Rl92TCdHgYIrCZBIrncOcjDhoT1THKYX5mFHN1sr85c,5767
19
- sop4py-2.0.10.dist-info/METADATA,sha256=7EyNm19IIJX2ntYR7lXXmRLCFxEGdAj09_T-cJXzlUI,12642
20
- sop4py-2.0.10.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
21
- sop4py-2.0.10.dist-info/top_level.txt,sha256=Xg42qRXwoOKelr7Lc8cpmy9uuBU3LtD3tPLHVnt0aHs,4
22
- sop4py-2.0.10.dist-info/RECORD,,
19
+ sop4py-2.0.11.dist-info/METADATA,sha256=UM2qBRiFZqzl46fDz2DFNhN4V_nicNM4NRKIC7iglkM,13003
20
+ sop4py-2.0.11.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
21
+ sop4py-2.0.11.dist-info/top_level.txt,sha256=Xg42qRXwoOKelr7Lc8cpmy9uuBU3LtD3tPLHVnt0aHs,4
22
+ sop4py-2.0.11.dist-info/RECORD,,