wybr
| Crates.io | wybr |
| lib.rs | wybr |
| version | 0.0.5 |
| source | src |
| created_at | 2019-01-29 00:46:29.335674 |
| updated_at | 2023-01-31 16:48:45.643583 |
| description | Collection of preferential voting methods |
| homepage | |
| repository | https://gitlab.com/mbq/wybr |
| max_upload_size | |
| id | 111266 |
| size | 151,048 |
Miron Kursa (mbq)
documentation
README
Wybr
Wybr is a yet another Rust library implementing some methods of counting votes in preferential elections.
Capabilities
- Read a blt file, as specified in Algorithm 123 paper with OpenSTV extensions for equal votes.
- Tideman alternative count with common variants.
- Borda count with common variants, also usable as plurality voting.
- Nanson method.
- Baldwin method.
- Instant run-off.
- Meek STV count with fixed-point arithmetic, also with Warren variant and few quota options.
- Minimax count.
- Tideman ranked pairs method with common variants.
- Schulze count, in a basic, but most popular form (without advanced tie-breaking).
- Find Smith and Schwartz sets.
- Uses pseudo-random tie breaking in a reproducible way and inform user if the count is deterministic.
- Usable (hopefully) errors, no by-design panics.
Ugly parts
- Not battle tested nor audited.
- Fixed types for candidates and scores.
- Inefficient algorithms and data structures here and there.
- Hobby project.
- Poor documentation.