Introduction
This library provides experimental code to speed up BTree difference and intersection functions, as used by the ZCatalog.
It’s been extracted out from experimental.catalogqueryplan now that the query plan implementation has been moved to ZCatalog itself.
Testing
To test, import the monkey patch in other tests, like CMFPlone:
import experimental.btree
and run the test.
Development
Development of this project takes place at: https://github.com/Jarn/experimental.btree
Changelog
1.1 - 2011-08-21
Update to Cython 0.15. [hannosch]
Correct small/big assignment if only the fist argument is a tree set. [hannosch]
Avoid intersection optimizations if both arguments are non-tree sets. [hannosch]
1.0 - 2011-07-29
Split off from experimental.catalogqueryplan. [hannosch]
1 maintainer
Release files for experimental.btree 1.1
For a detailed explanation of source distributions (sdists) and built distributions (wheels), please see the package formats documentation.
Source distribution (sdist)
| File | Size | Uploaded | |
|---|---|---|---|
| experimental.btree-1.1.zip | 45.6 kB | Details |
Release files / experimental.btree-1.1.zip
| Download URL | experimental.btree-1.1.zip |
|---|---|
| Size | 45.6 kB |
| Tags | Source |
|
SHA-256 checksum How to use checksums |
7a6cb5473623191ee192d2f2c5d51d18b57f1421b0c2c4603374cabee29e2b91
|
|
BLAKE2b-256 checksum How to use checksums |
186087ed7af690ec04ec88fd99b86c5752ae15c731764d5410088f4ce75050c7
|
| Upload date | |
|
Uploaded using Trusted Publishing? What is trusted publishing? |
No |
