scruby 0.7.1__py3-none-any.whl → 0.7.2__py3-none-any.whl

scruby/constants.py

@@ -4,10 +4,10 @@ The module contains the following variables:
 
 - `DB_ROOT` - Path to root directory of database. `By default = "ScrubyDB"` (*in root of project*).
 - `LENGTH_REDUCTION_HASH` - The length of the hash reduction on the left side.
-    - `0` - 4294967296 keys (by default).
-    - `2` - 16777216 keys.
-    - `4` - 65536 keys.
-    - `6` - 256 keys (main purpose is tests).
+    - `0` - 4294967296 branches in collection (by default).
+    - `2` - 16777216 branches in collectionю
+    - `4` - 65536 branches in collectionю
+    - `6` - 256 branches in collection (main purpose is tests).
 """
 
 from __future__ import annotations
@@ -24,8 +24,8 @@ from typing import Literal
 DB_ROOT: str = "ScrubyDB"
 
 # The length of the hash reduction on the left side.
-# 0 = 4294967296 keys (by default).
-# 2 = 16777216 keys.
-# 4 = 65536 keys.
-# 6 = 256 keys (main purpose is tests).
+# 0 = 4294967296 branches in collection (by default).
+# 2 = 16777216 branches in collectionю
+# 4 = 65536 branches in collectionю
+# 6 = 256 branches in collection (main purpose is tests).
 LENGTH_REDUCTION_HASH: Literal[0, 2, 4, 6] = 0

scruby/db.py

@@ -204,7 +204,7 @@ class Scruby[T]:
 
         The search is based on the effect of a quantum loop.
         The search effectiveness depends on the number of processor threads.
-        Ideally, hundreds and even thousands of streams are required.
+        Ideally, hundreds and even thousands of threads are required.
 
         Args:
             filter_fn: A function that execute the conditions of filtering.

{scruby-0.7.1.dist-info → scruby-0.7.2.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: scruby
-Version: 0.7.1
+Version: 0.7.2
 Summary: A fast key-value storage library.
 Project-URL: Homepage, https://github.com/kebasyaty/scruby
 Project-URL: Repository, https://github.com/kebasyaty/scruby
@@ -160,7 +160,7 @@ if __name__ == "__main__":
 
 The search is based on the effect of a quantum loop.
 The search effectiveness depends on the number of processor threads.
-Ideally, hundreds and even thousands of streams are required.
+Ideally, hundreds and even thousands of threads are required.
 """
 
 import anyio
@@ -171,7 +171,8 @@ from scruby import Scruby, constants
 from pprint import pprint as pp
 
 constants.DB_ROOT = "ScrubyDB"  # By default = "ScrubyDB"
-constants.LENGTH_REDUCTION_HASH = 6  # 256 keys (main purpose is tests).
+constants.LENGTH_REDUCTION_HASH = 6  # 256 branches in collection
+                                     # (main purpose is tests).
 
 class User(BaseModel):
     """Model of User."""

scruby-0.7.2.dist-info/RECORD

@@ -0,0 +1,8 @@
+scruby/__init__.py,sha256=myX7sG-7oAQZGdgfZtTGXYCCraTeuwi7SjBoltftpnM,648
+scruby/constants.py,sha256=GbB-O0qaVdi5EHUp-zRAppFXLR-oHxpXUFVAOCpS0C8,1022
+scruby/db.py,sha256=84DRrw21jiAmEsxjOOJnAfFvfE8hNdaJ-TB9BQtM0CQ,8114
+scruby/py.typed,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+scruby-0.7.2.dist-info/METADATA,sha256=b_02kOWP7dScGNwKtvVwQrv7CPiIHHIJ33OxMMz5Ink,8673
+scruby-0.7.2.dist-info/WHEEL,sha256=qtCwoSJWgHk21S1Kb4ihdzI2rlJ1ZKaIurTj_ngOhyQ,87
+scruby-0.7.2.dist-info/licenses/LICENSE,sha256=2zZINd6m_jNYlowdQImlEizyhSui5cBAJZRhWQURcEc,1095
+scruby-0.7.2.dist-info/RECORD,,

scruby-0.7.1.dist-info/RECORD

@@ -1,8 +0,0 @@
-scruby/__init__.py,sha256=myX7sG-7oAQZGdgfZtTGXYCCraTeuwi7SjBoltftpnM,648
-scruby/constants.py,sha256=XcBbK_gkDC0makWE34M8gUotwj3smi2sWY4mMnfzUt4,874
-scruby/db.py,sha256=FkYBsVYERtauTlWjl8b8cDTTIaH1w7lOzAneWUtNLDE,8114
-scruby/py.typed,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-scruby-0.7.1.dist-info/METADATA,sha256=qkiNaSRnF2pnWMImFLsAz16MMRD_amaDImy9DbFwNoM,8616
-scruby-0.7.1.dist-info/WHEEL,sha256=qtCwoSJWgHk21S1Kb4ihdzI2rlJ1ZKaIurTj_ngOhyQ,87
-scruby-0.7.1.dist-info/licenses/LICENSE,sha256=2zZINd6m_jNYlowdQImlEizyhSui5cBAJZRhWQURcEc,1095
-scruby-0.7.1.dist-info/RECORD,,