{"id":21107547,"url":"https://github.com/thomwiggers/factorial","last_synced_at":"2025-07-08T16:31:43.047Z","repository":{"id":51801662,"uuid":"139699976","full_name":"thomwiggers/factorial","owner":"thomwiggers","description":"Compute factorials in Rust","archived":false,"fork":false,"pushed_at":"2023-11-23T11:07:46.000Z","size":48,"stargazers_count":10,"open_issues_count":1,"forks_count":4,"subscribers_count":4,"default_branch":"main","last_synced_at":"2024-04-24T14:58:36.685Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"Rust","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/thomwiggers.png","metadata":{"files":{"readme":"README.md","changelog":"CHANGELOG.md","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}},"created_at":"2018-07-04T09:28:07.000Z","updated_at":"2023-11-23T12:25:30.000Z","dependencies_parsed_at":"2023-11-22T18:33:00.632Z","dependency_job_id":"a7a36c58-53e5-4b88-8d9a-41ca2dda16f6","html_url":"https://github.com/thomwiggers/factorial","commit_stats":{"total_commits":40,"total_committers":7,"mean_commits":5.714285714285714,"dds":0.55,"last_synced_commit":"487ba0f067003ec43398b3d19c86a2c467ca0b11"},"previous_names":[],"tags_count":3,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thomwiggers%2Ffactorial","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thomwiggers%2Ffactorial/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thomwiggers%2Ffactorial/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thomwiggers%2Ffactorial/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/thomwiggers","download_url":"https://codeload.github.com/thomwiggers/factorial/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":225449670,"owners_count":17476095,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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-20T00:40:40.854Z","updated_at":"2024-11-20T00:40:41.422Z","avatar_url":"https://github.com/thomwiggers.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Compute factorials\n\nThis crate provides some convenient and safe methods to compute the factorial\nwith an efficient method. More precisely it uses the prime swing algorithm to\ncompute the factorial. See [this paper](https://oeis.org/A000142/a000142.pdf)\nfor more detail.\n\nIt can compute the factorial in `O(n (log n loglog n)^2)` operations of\nmultiplication. The time complexity of this algorithm depends on the time\ncomplexity of the multiplication algorithm used.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fthomwiggers%2Ffactorial","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fthomwiggers%2Ffactorial","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fthomwiggers%2Ffactorial/lists"}