{"id":20402554,"url":"https://github.com/willdunklin/infinite-memory-calc","last_synced_at":"2026-04-16T22:32:06.389Z","repository":{"id":119680862,"uuid":"259486310","full_name":"willdunklin/infinite-memory-calc","owner":"willdunklin","description":"Unbounded Memory Calculator","archived":false,"fork":false,"pushed_at":"2020-05-05T05:47:02.000Z","size":147,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-05T01:45:10.594Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/willdunklin.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2020-04-28T00:07:36.000Z","updated_at":"2020-05-05T05:47:05.000Z","dependencies_parsed_at":null,"dependency_job_id":"96b18e79-b9d0-4d1d-bc5b-55bfd8469e0b","html_url":"https://github.com/willdunklin/infinite-memory-calc","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/willdunklin/infinite-memory-calc","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/willdunklin%2Finfinite-memory-calc","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/willdunklin%2Finfinite-memory-calc/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/willdunklin%2Finfinite-memory-calc/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/willdunklin%2Finfinite-memory-calc/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/willdunklin","download_url":"https://codeload.github.com/willdunklin/infinite-memory-calc/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/willdunklin%2Finfinite-memory-calc/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31907500,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-16T18:22:33.417Z","status":"ssl_error","status_checked_at":"2026-04-16T18:21:47.142Z","response_time":69,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-11-15T04:54:40.570Z","updated_at":"2026-04-16T22:32:06.365Z","avatar_url":"https://github.com/willdunklin.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Infinite Memory Calculator\n\nCalculator that processes unbounded numbers.\n\n## Documentation \n\n### Operations\n\nThis calculator supports two operations:\n- Addition (+)\n- Multiplication (*)\n\nAdditionally precedence can be forced with parentheses.\n\n### Precedence\n\nThe order of operations is consistent with normal standards. \n\nOperators from highest to lowest precedence:\n- Parentheses\n- Multiplication\n- Addition\n\n### Limitations\n\nNumbers are visually represented in multiples of four digits.\n\nSo: \n```\n4 = 0004\n```\nAnd \n```\n123456 = 00123456\n```\n\nOther than that visual quirk there are few functional limitations to this calculator.\n\n- The calculator only supports natural numbers.\n- The calculator only supports two operations.\n- Unclear handling of unbalanced parentheses.\n\n### Advantages\n\nThis calculator is incredibly robust with the features it does have.\n\nIt handles unknown characters gracefully and explicitly.\n\nIt is also very fast. Multiplying two 1000 digit numbers takes less than two seconds on Clarkson's Polaris under peak usage times.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwilldunklin%2Finfinite-memory-calc","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fwilldunklin%2Finfinite-memory-calc","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwilldunklin%2Finfinite-memory-calc/lists"}