| Age | Commit message (Collapse) | Author | Files | Lines | |
|---|---|---|---|---|---|
| 2024-05-30 | Write tests for parser. | Rose Hogenson | 4 | -211/+427 | |
| 2024-05-30 | Write tests for eval. | Rose Hogenson | 1 | -1/+89 | |
| 2024-05-30 | Fix exponential for i128. | Rose Hogenson | 1 | -4/+4 | |
| 2024-05-30 | Use i128. | Rose Hogenson | 2 | -7/+7 | |
| Why not? | |||||
| 2024-05-30 | Fix exponentiation. | Rose Hogenson | 1 | -17/+21 | |
| 2024-05-30 | Add arcsin, arccos, arctan. | Rose Hogenson | 2 | -11/+44 | |
| 2024-05-30 | Fix unary minus. | Rose Hogenson | 1 | -1/+1 | |
| Unary minus needs to bind more closely than ^, in order to parse -2^2 correctly. | |||||
| 2024-05-29 | Remove an unused dependency. | Rose Hogenson | 2 | -56/+0 | |
| 2024-05-29 | Allow prefix minus. | Rose Hogenson | 1 | -7/+7 | |
| 2024-05-29 | Get rid of BigInt. | Rose Hogenson | 5 | -227/+77 | |
| Too much trouble, tbh. Who needs more than 64 bits anyway? | |||||
| 2024-05-29 | Fix rounding. | Rose Hogenson | 1 | -10/+7 | |
| 2024-05-29 | Use a stack for the parser. | Rose Hogenson | 1 | -144/+175 | |
| I don't have much experience writing parsers with a stack, but it seems pretty straightforward: the stack just records what you've seen so far, and you simplify down some prefix of the stack whenever the precedence decreases. | |||||
| 2024-05-28 | License with GPLv3. | Rose Hogenson | 2 | -0/+675 | |
| 2024-05-28 | Fix a performance issue in the UI. | Rose Hogenson | 2 | -13/+40 | |
| 2024-05-28 | Implement modulo. | Rose Hogenson | 3 | -2/+22 | |
| 2024-05-28 | Use num crate. | Rose Hogenson | 5 | -18/+59 | |
| 2024-05-27 | Simplify the threading code. | Rose Hogenson | 1 | -23/+21 | |
| 2024-05-27 | Fix order of operations. | Rose Hogenson | 2 | -39/+64 | |
| PEMDAS | |||||
| 2024-05-27 | Fix backtracking in the parser. | Rose Hogenson | 1 | -70/+103 | |
| 2024-05-27 | Rewrite in Rust. | Rose Hogenson | 9 | -0/+1524 | |
