3 commits

Author	SHA1	Message	Date
Aaron Fenyes	501cd74c96	Use B-tree collections instead of Fx hash ones ... This removes a dependency. Since the collections in question should usually be pretty small, it might also reduce memory overhead at little cost in speed. Here are some relevant performance discussions: https://users.rust-lang.org/t/hashmap-vs-btreemap/13804 https://www.reddit.com/r/rust/comments/7rgowj/hashmap_vs_btreemap/	2025-05-04 12:49:35 -07:00
Aaron Fenyes	c6b628d424	Store elements and regulators without keys ... Since we're no longer using storage keys to refer to elements and regulators, we don't need to store these items in keyed collections anymore. To keep element and regulator pointers in `BTreeSet` collections, we implement `Ord` for `Serial` trait objects. As a bonus, this lets us turn the element-wise regulator collections back into `BTreeSet`.	2025-05-04 12:32:37 -07:00
Vectornaut	b86f176151	feat: Continuous integration via Forgejo Actions/runners (#75) ... Adds a continuous integration workflow to the repository, using the [Forgejo Actions](https://forgejo.org/docs/next/user/actions/) framework. Concurrently, Aaron added a [wiki page](https://code.studioinfinity.org/glen/dyna3/wiki/Continuous-integration) to document the continuous integration system. In particular, this page explains how to [run continuous integration checks on a development machine](wiki/Continuous-integration#execution), either directly or in a container. Co-authored-by: Aaron Fenyes <aaron.fenyes@fareycircles.ooo> Co-authored-by: Glen Whitney <glen@studioinfinity.org> Reviewed-on: #75 Co-authored-by: Vectornaut <vectornaut@nobody@nowhere.net> Co-committed-by: Vectornaut <vectornaut@nobody@nowhere.net>	2025-04-02 20:31:42 +00:00