| Age | Commit message (Collapse) | Author | Files | Lines | |
|---|---|---|---|---|---|
| 2025-01-06 | Bump dependencies.HEADmain | Rose Hogenson | 1 | -1/+1 | |
| 2024-06-07 | Bring back bigint. | Rose Hogenson | 1 | -7/+4 | |
| 2024-05-31 | Add a README | Rose Hogenson | 1 | -0/+4 | |
| 2024-05-31 | Slightly simplify the lexer. | Rose Hogenson | 1 | -0/+5 | |
| 2024-05-30 | Add bytecode. | Rose Hogenson | 1 | -91/+167 | |
| A recursive AST is kind of annoying to evaluate without recursion. Bytecode is cooler anyway. | |||||
| 2024-05-30 | Write tests for parser. | Rose Hogenson | 1 | -137/+253 | |
| 2024-05-30 | Use i128. | Rose Hogenson | 1 | -1/+1 | |
| Why not? | |||||
| 2024-05-30 | Add arcsin, arccos, arctan. | Rose Hogenson | 1 | -11/+32 | |
| 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 | Allow prefix minus. | Rose Hogenson | 1 | -7/+7 | |
| 2024-05-29 | Get rid of BigInt. | Rose Hogenson | 1 | -2/+1 | |
| Too much trouble, tbh. Who needs more than 64 bits anyway? | |||||
| 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 | Implement modulo. | Rose Hogenson | 1 | -0/+4 | |
| 2024-05-28 | Use num crate. | Rose Hogenson | 1 | -9/+9 | |
| 2024-05-27 | Fix order of operations. | Rose Hogenson | 1 | -38/+48 | |
| PEMDAS | |||||
| 2024-05-27 | Fix backtracking in the parser. | Rose Hogenson | 1 | -70/+103 | |
| 2024-05-27 | Rewrite in Rust. | Rose Hogenson | 1 | -0/+202 | |
 |
index : qc | |
| A minimalist desktop calculator app written in blazingly fast™ Rust |
| aboutsummaryrefslogtreecommitdiffstats |