Expand description
Heuristic search for good quorum systems.
search tries every duplicate-free read expression over the given
nodes (shallow expressions first), computes the optimal strategy for
each, and returns the best one found before the timeout.
The number of candidate expressions grows faster than exponentially
with the number of nodes: a full search is practical up to about 6
nodes, so set SearchConfig::timeout for anything larger.
Structs§
- Search
Config - Configuration for
search. - Search
Result - Result of a successful search.
Functions§
- search
- Search for the quorum system over
nodesthat best meetsconfig.