zzgandClaude Opus 5.5
411d78516c
Partitions are k consecutive primes (paper's Algorithm 1), one blake2b hash per key sized to cover the partition product plus 64 bits. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
22 lines
449 B
TOML
22 lines
449 B
TOML
[build-system]
|
|
requires = ["setuptools>=61"]
|
|
build-backend = "setuptools.build_meta"
|
|
|
|
[project]
|
|
name = "ohbf"
|
|
version = "0.1.0"
|
|
description = "One-Hashing Bloom Filter (Lu et al., IWQoS 2015), standard library only"
|
|
readme = "README.md"
|
|
requires-python = ">=3.11"
|
|
license = { text = "MIT" }
|
|
|
|
[project.optional-dependencies]
|
|
test = ["pytest"]
|
|
|
|
[tool.setuptools]
|
|
packages = ["ohbf"]
|
|
|
|
[tool.pytest.ini_options]
|
|
testpaths = ["tests"]
|
|
pythonpath = ["."]
|