Age | Commit message (Collapse) | Author | |
---|---|---|---|
2024-07-26 | Change main to use new numerics module. | Aryadev Chavali | |
2024-07-26 | A simple test, iterating 10 times and printing out the generated tree | Aryadev Chavali | |
Seems to work! | |||
2024-07-26 | Fix up indenting and empty children in to_string for node | Aryadev Chavali | |
2024-07-26 | Added to_string for Nodes | Aryadev Chavali | |
Recursive implementation with proper indenting! | |||
2024-07-26 | Added to_string for fractions | Aryadev Chavali | |
2024-07-26 | Rework binary tree to use indexes in nodes vector | Aryadev Chavali | |
An index is a pointer, and they don't change if the vector decides to reallocate internally unlike the bastardised pointers I was rolling up before. This simplifies design a bit. | |||
2024-07-26 | Added helper method to allocate nodes from the vector for me | Aryadev Chavali | |
The vector acts as an arena for the nodes to be allocated from, better and faster than allocating each child on the heap individually. | |||
2024-07-26 | Queue based iteration procedure | Aryadev Chavali | |
Pops an item off the queue and generate left and right children for it, if those are empty. Then push those children into the queue for the next iteration. NOTE: Because we're using a queue, this does a breadth first generation of the tree, which is what we want. | |||
2024-07-26 | Binary tree of fractions | Aryadev Chavali | |
Will be used in creating the cw tree. | |||
2024-07-26 | Simplify at constructor in Fraction | Aryadev Chavali | |
Let's just deal with simplified stuff anyway? | |||
2024-07-26 | Added comparators to Fraction struct | Aryadev Chavali | |
2024-07-26 | Extracted gcd algorithm into its own function | Aryadev Chavali | |
2024-07-26 | Simple fraction structure | Aryadev Chavali | |
Holds numerator and denominator. Can self simplify, but not automatically. | |||
2024-07-26 | Hello, world! | Aryadev Chavali | |