libdictenstein 0.1.0

High-performance dictionary data structures (trie, DAWG, double-array trie, suffix automaton, lock-free durable persistent ART) behind one trait API; pairs with liblevenshtein for fuzzy matching
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21

# Proptest configuration for libdictenstein
# See: https://proptest-rs.github.io/proptest/proptest-config/index.html

[default]
# Number of test cases per property
cases = 256

# Fork tests into separate processes for isolation
fork = true

# Verbosity level (0-2)
verbose = 1

# Maximum shrinking iterations when finding minimal failing case
max_shrink_iters = 10000

# Timeout per test case in milliseconds
timeout = 30000

# Directory for regression test files
failure_persistence = "proptest-regressions"