v0.2.19

This release adds faster scoring/replaying of chains, as well as storing of CRS information in dual graphs. This is planned to be the last v0.2 release; the next release will be v0.3 and will contain massive speedups (15-16x) in chain run times.

If you use GerryChain, you may be interested in plan-evaluation-processing (docs), our production-tested plan evaluation tools that we use for our public reports and litigation work. In the future, this may be packaged as a submodule in GerryChain itself.

Cheers!

What's Changed

• Use slots in Partition by @pjrule in #363
• Add seed and freeze test to loudly detect when breaking changes are made by @InnovativeInventor in #378
• Add neighborhood flips caching by @InnovativeInventor in #373
• More slots by @InnovativeInventor in #374
• Add option to disable cut_edges updater with use_cut_edges flag by @InnovativeInventor in #375
• Replace references to assignment[node] to assignment.mapping[node] to reduce getitem overhead by @InnovativeInventor in #382
• Refactor out Assignment.update (replace with Assignment.update_flows) to prevent double-calculating flows by @InnovativeInventor in #383
• Cache flow_from_changes by @InnovativeInventor in #384
• Simplify Assignment iterators by @InnovativeInventor in #385
• Frozen graph implementation! by @InnovativeInventor in #386
• Add projection information to serialized dual graph. by @jenni-niels in #388

New Contributors

• @jenni-niels made their first contribution in #388

Full Changelog: 0.2.18...v0.2.19