roughly 0.1.0

Probabilistic data structures for Rust — because sometimes close enough is good enough.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61

# THIS FILE IS AUTOMATICALLY GENERATED BY CARGO
#
# When uploading crates to the registry Cargo will automatically
# "normalize" Cargo.toml files for maximal compatibility
# with all versions of Cargo and also rewrite `path` dependencies
# to registry (e.g., crates.io) dependencies.
#
# If you are reading this file be aware that the original Cargo.toml
# will likely look very different (and much more reasonable).
# See Cargo.toml.orig for the original contents.

[package]
edition = "2021"
name = "roughly"
version = "0.1.0"
authors = ["suryanox"]
build = false
exclude = [
    "benches/",
    "tests/",
    ".github/",
]
autolib = false
autobins = false
autoexamples = false
autotests = false
autobenches = false
description = "Probabilistic data structures for Rust — because sometimes close enough is good enough."
homepage = "https://github.com/suryanox/roughly"
documentation = "https://docs.rs/roughly"
readme = "README.md"
keywords = [
    "bloom-filter",
    "hyperloglog",
    "count-min-sketch",
    "probabilistic",
    "approximate",
]
categories = [
    "data-structures",
    "algorithms",
]
license = "MIT"
repository = "https://github.com/suryanox/roughly"

[features]
default = ["std"]
serde = ["dep:serde"]
std = []

[lib]
name = "roughly"
path = "src/lib.rs"

[dependencies.ahash]
version = "0.8"

[dependencies.serde]
version = "1.0"
features = ["derive"]
optional = true