diff options
author | Aryadev Chavali <aryadev@aryadevchavali.com> | 2024-07-26 03:13:24 +0100 |
---|---|---|
committer | Aryadev Chavali <aryadev@aryadevchavali.com> | 2024-07-26 03:13:24 +0100 |
commit | 4cc1af94f67a0a7427fc0f42fbb97a091b859141 (patch) | |
tree | cca380e5295c18393265757bc0480125ce612d7b /src/numerics.hpp | |
parent | 84c07870e461ecd1761797304b4ee0aca5bb231e (diff) | |
download | cw_tree-4cc1af94f67a0a7427fc0f42fbb97a091b859141.tar.gz cw_tree-4cc1af94f67a0a7427fc0f42fbb97a091b859141.tar.bz2 cw_tree-4cc1af94f67a0a7427fc0f42fbb97a091b859141.zip |
`iterate` now computes highest value fraction it generated.
Not very useful, but isn't a massive performance waster (I think) and
it will be useful when thinking about colour schemes in graphics.
Diffstat (limited to 'src/numerics.hpp')
-rw-r--r-- | src/numerics.hpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/numerics.hpp b/src/numerics.hpp index f095368..9fdaf56 100644 --- a/src/numerics.hpp +++ b/src/numerics.hpp @@ -54,7 +54,7 @@ struct NodeAllocator }; word_t gcd(word_t a, word_t b); -void iterate(std::queue<word_t> &queue, NodeAllocator &allocator); +Fraction iterate(std::queue<word_t> &queue, NodeAllocator &allocator); std::string to_string(const Fraction &); std::string to_string(const NodeAllocator &, const word_t, int depth = 1); |