scruby 0.11.0__py3-none-any.whl → 0.11.1__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 scruby might be problematic. Click here for more details.

Files changed (5) hide show
  1. scruby/__init__.py +5 -5
  2. {scruby-0.11.0.dist-info → scruby-0.11.1.dist-info}/METADATA +19 -16
  3. {scruby-0.11.0.dist-info → scruby-0.11.1.dist-info}/RECORD +5 -5
  4. {scruby-0.11.0.dist-info → scruby-0.11.1.dist-info}/WHEEL +0 -0
  5. {scruby-0.11.0.dist-info → scruby-0.11.1.dist-info}/licenses/LICENSE +0 -0
scruby/__init__.py CHANGED
@@ -1,8 +1,7 @@
1
- """A fast key-value storage library.
1
+ """Asynchronous library for building and managing a hybrid database, by scheme of key-value.
2
2
 
3
- Scruby is a fast key-value storage asynchronous library that provides an
4
- ordered mapping from string keys to string values.
5
- The library uses fractal-tree addressing.
3
+ The library uses fractal-tree addressing and
4
+ the search for documents based on the effect of a quantum loop.
6
5
 
7
6
  The database consists of collections.
8
7
  The maximum size of the one collection is 16**8=4294967296 branches,
@@ -11,7 +10,8 @@ each branch can store one or more keys.
11
10
  The value of any key in collection can be obtained in 8 steps,
12
11
  thereby achieving high performance.
13
12
 
14
- In the future, to search by value of key, the use of a quantum loop is supposed.
13
+ The effectiveness of the search for documents based on a quantum loop,
14
+ requires a large number of processor threads.
15
15
  """
16
16
 
17
17
  from __future__ import annotations
{scruby-0.11.0.dist-info → scruby-0.11.1.dist-info}/METADATA RENAMED
@@ -1,6 +1,6 @@
1
1
  Metadata-Version: 2.4
2
2
  Name: scruby
3
- Version: 0.11.0
3
+ Version: 0.11.1
4
4
  Summary: A fast key-value storage library.
5
5
  Project-URL: Homepage, https://github.com/kebasyaty/scruby
6
6
  Project-URL: Repository, https://github.com/kebasyaty/scruby
@@ -43,7 +43,7 @@ Description-Content-Type: text/markdown
43
43
  </p>
44
44
  <p>
45
45
  <h1>Scruby</h1>
46
- <h3>A fast key-value storage library.</h3>
46
+ <h3>Asynchronous library for building and managing a hybrid database,<br>by scheme of key-value.</h3>
47
47
  <p align="center">
48
48
  <a href="https://github.com/kebasyaty/scruby/actions/workflows/test.yml" alt="Build Status"><img src="https://github.com/kebasyaty/scruby/actions/workflows/test.yml/badge.svg" alt="Build Status"></a>
49
49
  <a href="https://kebasyaty.github.io/scruby/" alt="Docs"><img src="https://img.shields.io/badge/docs-available-brightgreen.svg" alt="Docs"></a>
@@ -65,20 +65,23 @@ Description-Content-Type: text/markdown
65
65
  <a href="https://github.com/kebasyaty/scruby/releases/" alt="GitHub release"><img src="https://img.shields.io/github/release/kebasyaty/scruby" alt="GitHub release"></a>
66
66
  </p>
67
67
  <p align="center">
68
- Scruby is a fast key-value storage asynchronous library that provides an
69
- <br>
70
- ordered mapping from string keys to string values.
71
- <br>
72
- The library uses fractal-tree addressing.
73
- <br>
74
- The database consists of collections.
75
- <br>
76
- The maximum size of the one collection is 16**8=4294967296 branches,
77
- each branch can store one or more keys.
78
- <br>
79
- The value of any key in collection can be obtained in 8 steps, thereby achieving high performance.
80
- <br>
81
- In the future, to search by value of key, the use of a quantum loop is supposed.
68
+ The library uses fractal-tree addressing and
69
+ <br>
70
+ the search for documents based on the effect of a quantum loop.
71
+ <br>
72
+ The database consists of collections.
73
+ <br>
74
+ The maximum size of the one collection is 16\*\*8=4294967296 branches,
75
+ <br>
76
+ each branch can store one or more keys.
77
+ <br>
78
+ The value of any key in collection can be obtained in 8 steps,
79
+ <br>
80
+ thereby achieving high performance.
81
+ <br>
82
+ The effectiveness of the search for documents based on a quantum loop,
83
+ <br>
84
+ requires a large number of processor threads.
82
85
  </p>
83
86
  </p>
84
87
  </div>
{scruby-0.11.0.dist-info → scruby-0.11.1.dist-info}/RECORD RENAMED
@@ -1,9 +1,9 @@
1
- scruby/__init__.py,sha256=wFwUS1KcLxfIopXOVS8gPue9fNzIIU2cVj_RgK5drz4,849
1
+ scruby/__init__.py,sha256=GOVcjXmcOEDBbJQJDJlQq-x3M-VGJaMSN278EXsl2po,884
2
2
  scruby/constants.py,sha256=3LZfcxcuRqwzoB0-iogLMjKBZRdxfWJmTbyPwVRhQgY,1007
3
3
  scruby/db.py,sha256=Q7J4OKS2emiF0KzZClSjpBBLjohnccZ81T4pgoWNxqA,20269
4
4
  scruby/errors.py,sha256=aHQri4LNcFVQrSHwjyzb1fL8O49SwjYEU4QgMOo4uyA,622
5
5
  scruby/py.typed,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
6
- scruby-0.11.0.dist-info/METADATA,sha256=yS9LDAYAqmxxn8cXHKbO7BmPEsX4o7th3VVFtgr9aoo,10824
7
- scruby-0.11.0.dist-info/WHEEL,sha256=qtCwoSJWgHk21S1Kb4ihdzI2rlJ1ZKaIurTj_ngOhyQ,87
8
- scruby-0.11.0.dist-info/licenses/LICENSE,sha256=2zZINd6m_jNYlowdQImlEizyhSui5cBAJZRhWQURcEc,1095
9
- scruby-0.11.0.dist-info/RECORD,,
6
+ scruby-0.11.1.dist-info/METADATA,sha256=Dn9WBqLzI312HlhMx4PGIVpmysCc6IUSPqXjXDuAOQY,10926
7
+ scruby-0.11.1.dist-info/WHEEL,sha256=qtCwoSJWgHk21S1Kb4ihdzI2rlJ1ZKaIurTj_ngOhyQ,87
8
+ scruby-0.11.1.dist-info/licenses/LICENSE,sha256=2zZINd6m_jNYlowdQImlEizyhSui5cBAJZRhWQURcEc,1095
9
+ scruby-0.11.1.dist-info/RECORD,,