https://github.com/willdunklin/infinite-memory-calc
Unbounded Memory Calculator
https://github.com/willdunklin/infinite-memory-calc
Last synced: 2 months ago
JSON representation
Unbounded Memory Calculator
- Host: GitHub
- URL: https://github.com/willdunklin/infinite-memory-calc
- Owner: willdunklin
- Created: 2020-04-28T00:07:36.000Z (about 6 years ago)
- Default Branch: master
- Last Pushed: 2020-05-05T05:47:02.000Z (about 6 years ago)
- Last Synced: 2025-03-05T01:45:10.594Z (over 1 year ago)
- Language: C
- Homepage:
- Size: 144 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Infinite Memory Calculator
Calculator that processes unbounded numbers.
## Documentation
### Operations
This calculator supports two operations:
- Addition (+)
- Multiplication (*)
Additionally precedence can be forced with parentheses.
### Precedence
The order of operations is consistent with normal standards.
Operators from highest to lowest precedence:
- Parentheses
- Multiplication
- Addition
### Limitations
Numbers are visually represented in multiples of four digits.
So:
```
4 = 0004
```
And
```
123456 = 00123456
```
Other than that visual quirk there are few functional limitations to this calculator.
- The calculator only supports natural numbers.
- The calculator only supports two operations.
- Unclear handling of unbalanced parentheses.
### Advantages
This calculator is incredibly robust with the features it does have.
It handles unknown characters gracefully and explicitly.
It is also very fast. Multiplying two 1000 digit numbers takes less than two seconds on Clarkson's Polaris under peak usage times.