{"crate":{"id":"gcd","name":"gcd","updated_at":"2023-01-16T00:24:15.764581Z","versions":[704184,669600,470917,429693,208188,207784,129086,39503,20952],"keywords":[],"categories":["algorithms"],"badges":[],"created_at":"2016-01-18T18:32:22.952232Z","downloads":16675810,"recent_downloads":3383572,"default_version":"2.3.0","num_versions":9,"yanked":false,"max_version":"2.3.0","newest_version":"2.3.0","max_stable_version":"2.3.0","description":"Calculate the greatest common divisor","homepage":null,"documentation":"https://docs.rs/gcd/","repository":"https://github.com/frewsxcv/rust-gcd","links":{"version_downloads":"/api/v1/crates/gcd/downloads","versions":null,"owners":"/api/v1/crates/gcd/owners","owner_team":"/api/v1/crates/gcd/owner_team","owner_user":"/api/v1/crates/gcd/owner_user","reverse_dependencies":"/api/v1/crates/gcd/reverse_dependencies"},"exact_match":false,"trustpub_only":false},"versions":[{"id":704184,"crate":"gcd","num":"2.3.0","dl_path":"/api/v1/crates/gcd/2.3.0/download","readme_path":"/api/v1/crates/gcd/2.3.0/readme","updated_at":"2023-01-16T00:24:15.764581Z","created_at":"2023-01-16T00:24:15.764581Z","downloads":15481873,"features":{},"yanked":false,"yank_message":null,"lib_links":null,"license":"MIT/Apache-2.0","links":{"dependencies":"/api/v1/crates/gcd/2.3.0/dependencies","version_downloads":"/api/v1/crates/gcd/2.3.0/downloads","authors":"/api/v1/crates/gcd/2.3.0/authors"},"crate_size":8934,"published_by":{"id":227,"login":"frewsxcv","name":"Corey Farwell","avatar":"https://avatars.githubusercontent.com/u/416575?v=4","url":"https://github.com/frewsxcv","github_username_matches":true,"created_at":"2010-09-26T17:09:42Z"},"audit_actions":[{"action":"publish","user":{"id":227,"login":"frewsxcv","name":"Corey Farwell","avatar":"https://avatars.githubusercontent.com/u/416575?v=4","url":"https://github.com/frewsxcv","github_username_matches":true,"created_at":"2010-09-26T17:09:42Z"},"time":"2023-01-16T00:24:15.764581Z"}],"checksum":"1d758ba1b47b00caf47f24925c0074ecb20d6dfcffe7f6d53395c0465674841a","rust_version":null,"has_lib":true,"bin_names":[],"edition":"2021","description":"Calculate the greatest common divisor","homepage":null,"documentation":"https://docs.rs/gcd/","repository":"https://github.com/frewsxcv/rust-gcd","trustpub_data":null,"linecounts":{"languages":{"Rust":{"code_lines":232,"comment_lines":4,"files":1}},"total_code_lines":232,"total_comment_lines":4}},{"id":669600,"crate":"gcd","num":"2.2.0","dl_path":"/api/v1/crates/gcd/2.2.0/download","readme_path":"/api/v1/crates/gcd/2.2.0/readme","updated_at":"2022-11-23T18:28:47.174914Z","created_at":"2022-11-23T18:28:47.174914Z","downloads":142230,"features":{},"yanked":false,"yank_message":null,"lib_links":null,"license":"MIT/Apache-2.0","links":{"dependencies":"/api/v1/crates/gcd/2.2.0/dependencies","version_downloads":"/api/v1/crates/gcd/2.2.0/downloads","authors":"/api/v1/crates/gcd/2.2.0/authors"},"crate_size":8555,"published_by":{"id":227,"login":"frewsxcv","name":"Corey Farwell","avatar":"https://avatars.githubusercontent.com/u/416575?v=4","url":"https://github.com/frewsxcv","github_username_matches":true,"created_at":"2010-09-26T17:09:42Z"},"audit_actions":[{"action":"publish","user":{"id":227,"login":"frewsxcv","name":"Corey Farwell","avatar":"https://avatars.githubusercontent.com/u/416575?v=4","url":"https://github.com/frewsxcv","github_username_matches":true,"created_at":"2010-09-26T17:09:42Z"},"time":"2022-11-23T18:28:47.174914Z"}],"checksum":"a4b1b088ad0a967aa29540456b82fc8903f854775d33f71e9709c4efb3dfbfd2","rust_version":null,"has_lib":true,"bin_names":[],"edition":"2021","description":"Calculate the greatest common divisor","homepage":null,"documentation":"https://docs.rs/gcd/","repository":"https://github.com/frewsxcv/rust-gcd","trustpub_data":null,"linecounts":{"languages":{"Rust":{"code_lines":190,"comment_lines":10,"files":1}},"total_code_lines":190,"total_comment_lines":10}},{"id":470917,"crate":"gcd","num":"2.1.0","dl_path":"/api/v1/crates/gcd/2.1.0/download","readme_path":"/api/v1/crates/gcd/2.1.0/readme","updated_at":"2021-12-21T04:23:42.922576Z","created_at":"2021-12-21T04:23:42.922576Z","downloads":796683,"features":{},"yanked":false,"yank_message":null,"lib_links":null,"license":"MIT/Apache-2.0","links":{"dependencies":"/api/v1/crates/gcd/2.1.0/dependencies","version_downloads":"/api/v1/crates/gcd/2.1.0/downloads","authors":"/api/v1/crates/gcd/2.1.0/authors"},"crate_size":8470,"published_by":{"id":227,"login":"frewsxcv","name":"Corey Farwell","avatar":"https://avatars.githubusercontent.com/u/416575?v=4","url":"https://github.com/frewsxcv","github_username_matches":true,"created_at":"2010-09-26T17:09:42Z"},"audit_actions":[{"action":"publish","user":{"id":227,"login":"frewsxcv","name":"Corey Farwell","avatar":"https://avatars.githubusercontent.com/u/416575?v=4","url":"https://github.com/frewsxcv","github_username_matches":true,"created_at":"2010-09-26T17:09:42Z"},"time":"2021-12-21T04:23:42.922576Z"}],"checksum":"f37978dab2ca789938a83b2f8bc1ef32db6633af9051a6cd409eff72cbaaa79a","rust_version":null,"has_lib":true,"bin_names":[],"edition":null,"description":"Calculate the greatest common divisor","homepage":null,"documentation":"https://docs.rs/gcd/","repository":"https://github.com/frewsxcv/rust-gcd","trustpub_data":null,"linecounts":{"languages":{"Rust":{"code_lines":187,"comment_lines":10,"files":1}},"total_code_lines":187,"total_comment_lines":10}},{"id":429693,"crate":"gcd","num":"2.0.2","dl_path":"/api/v1/crates/gcd/2.0.2/download","readme_path":"/api/v1/crates/gcd/2.0.2/readme","updated_at":"2021-09-24T23:54:00.703182Z","created_at":"2021-09-24T23:54:00.703182Z","downloads":55003,"features":{},"yanked":false,"yank_message":null,"lib_links":null,"license":"MIT/Apache-2.0","links":{"dependencies":"/api/v1/crates/gcd/2.0.2/dependencies","version_downloads":"/api/v1/crates/gcd/2.0.2/downloads","authors":"/api/v1/crates/gcd/2.0.2/authors"},"crate_size":7028,"published_by":{"id":227,"login":"frewsxcv","name":"Corey Farwell","avatar":"https://avatars.githubusercontent.com/u/416575?v=4","url":"https://github.com/frewsxcv","github_username_matches":true,"created_at":"2010-09-26T17:09:42Z"},"audit_actions":[{"action":"publish","user":{"id":227,"login":"frewsxcv","name":"Corey Farwell","avatar":"https://avatars.githubusercontent.com/u/416575?v=4","url":"https://github.com/frewsxcv","github_username_matches":true,"created_at":"2010-09-26T17:09:42Z"},"time":"2021-09-24T23:54:00.703182Z"}],"checksum":"6c8763772808ee8fe3128f0fc424bed6d9942293fddbcfd595ecfa58a81fe00b","rust_version":null,"has_lib":true,"bin_names":[],"edition":null,"description":"Small Rust library (with no dependencies) for calculating greatest common divisor","homepage":null,"documentation":"https://docs.rs/gcd/","repository":"https://github.com/frewsxcv/rust-gcd","trustpub_data":null,"linecounts":{"languages":{"Rust":{"code_lines":64,"comment_lines":1,"files":1}},"total_code_lines":64,"total_comment_lines":1}},{"id":208188,"crate":"gcd","num":"2.0.1","dl_path":"/api/v1/crates/gcd/2.0.1/download","readme_path":"/api/v1/crates/gcd/2.0.1/readme","updated_at":"2020-01-31T01:06:43.460143Z","created_at":"2020-01-31T01:06:43.460143Z","downloads":168826,"features":{},"yanked":false,"yank_message":null,"lib_links":null,"license":"MIT/Apache-2.0","links":{"dependencies":"/api/v1/crates/gcd/2.0.1/dependencies","version_downloads":"/api/v1/crates/gcd/2.0.1/downloads","authors":"/api/v1/crates/gcd/2.0.1/authors"},"crate_size":6894,"published_by":{"id":227,"login":"frewsxcv","name":"Corey Farwell","avatar":"https://avatars.githubusercontent.com/u/416575?v=4","url":"https://github.com/frewsxcv","github_username_matches":true,"created_at":"2010-09-26T17:09:42Z"},"audit_actions":[{"action":"publish","user":{"id":227,"login":"frewsxcv","name":"Corey Farwell","avatar":"https://avatars.githubusercontent.com/u/416575?v=4","url":"https://github.com/frewsxcv","github_username_matches":true,"created_at":"2010-09-26T17:09:42Z"},"time":"2020-01-31T01:06:43.460143Z"}],"checksum":"1c7cd301bf2ab11ae4e5bdfd79c221d97a25e46c089144a62ee9d09cb32d2b92","rust_version":null,"has_lib":true,"bin_names":[],"edition":null,"description":"Small Rust library (with no dependencies) for calculating greatest common divisor","homepage":null,"documentation":"https://docs.rs/gcd/","repository":"https://github.com/frewsxcv/rust-gcd","trustpub_data":null,"linecounts":{"languages":{"Rust":{"code_lines":72,"comment_lines":2,"files":1}},"total_code_lines":72,"total_comment_lines":2}},{"id":207784,"crate":"gcd","num":"2.0.0","dl_path":"/api/v1/crates/gcd/2.0.0/download","readme_path":"/api/v1/crates/gcd/2.0.0/readme","updated_at":"2020-01-29T14:29:00.648427Z","created_at":"2020-01-29T14:29:00.648427Z","downloads":1664,"features":{},"yanked":false,"yank_message":null,"lib_links":null,"license":"MIT/Apache-2.0","links":{"dependencies":"/api/v1/crates/gcd/2.0.0/dependencies","version_downloads":"/api/v1/crates/gcd/2.0.0/downloads","authors":"/api/v1/crates/gcd/2.0.0/authors"},"crate_size":6844,"published_by":{"id":227,"login":"frewsxcv","name":"Corey Farwell","avatar":"https://avatars.githubusercontent.com/u/416575?v=4","url":"https://github.com/frewsxcv","github_username_matches":true,"created_at":"2010-09-26T17:09:42Z"},"audit_actions":[{"action":"publish","user":{"id":227,"login":"frewsxcv","name":"Corey Farwell","avatar":"https://avatars.githubusercontent.com/u/416575?v=4","url":"https://github.com/frewsxcv","github_username_matches":true,"created_at":"2010-09-26T17:09:42Z"},"time":"2020-01-29T14:29:00.648427Z"}],"checksum":"6b77d1740fd6e553e8214aff32e4c3240df2caaacca523bb7d9f65cb3083fe2f","rust_version":null,"has_lib":true,"bin_names":[],"edition":null,"description":"Small Rust library (with no dependencies) for calculating greatest common divisor","homepage":null,"documentation":"https://docs.rs/gcd/","repository":"https://github.com/frewsxcv/rust-gcd","trustpub_data":null,"linecounts":{"languages":{"Rust":{"code_lines":72,"comment_lines":2,"files":1}},"total_code_lines":72,"total_comment_lines":2}},{"id":129086,"crate":"gcd","num":"1.2.0","dl_path":"/api/v1/crates/gcd/1.2.0/download","readme_path":"/api/v1/crates/gcd/1.2.0/readme","updated_at":"2019-01-20T01:59:51.483327Z","created_at":"2019-01-20T01:59:51.483327Z","downloads":8119,"features":{},"yanked":false,"yank_message":null,"lib_links":null,"license":"MIT/Apache-2.0","links":{"dependencies":"/api/v1/crates/gcd/1.2.0/dependencies","version_downloads":"/api/v1/crates/gcd/1.2.0/downloads","authors":"/api/v1/crates/gcd/1.2.0/authors"},"crate_size":5991,"published_by":null,"audit_actions":[],"checksum":"c21a76e102bba7724d661dbbba5e483ec0707088be6a01cf3879229e75da4d9f","rust_version":null,"has_lib":true,"bin_names":[],"edition":null,"description":"Small Rust library (with no dependencies) for calculating greatest common divisor","homepage":null,"documentation":"https://docs.rs/gcd/","repository":"https://github.com/frewsxcv/rust-gcd","trustpub_data":null,"linecounts":{"languages":{"Rust":{"code_lines":36,"comment_lines":1,"files":1}},"total_code_lines":36,"total_comment_lines":1}},{"id":39503,"crate":"gcd","num":"1.1.0","dl_path":"/api/v1/crates/gcd/1.1.0/download","readme_path":"/api/v1/crates/gcd/1.1.0/readme","updated_at":"2017-11-30T02:57:57.821452Z","created_at":"2016-12-13T03:48:46.893120Z","downloads":2976,"features":{},"yanked":false,"yank_message":null,"lib_links":null,"license":"MIT/Apache-2.0","links":{"dependencies":"/api/v1/crates/gcd/1.1.0/dependencies","version_downloads":"/api/v1/crates/gcd/1.1.0/downloads","authors":"/api/v1/crates/gcd/1.1.0/authors"},"crate_size":5508,"published_by":null,"audit_actions":[],"checksum":"0896cb73353671dbe2b17312c97b55b7032831d28c809c703bece4a392b1df3a","rust_version":null,"has_lib":true,"bin_names":[],"edition":null,"description":"Small Rust library (with no dependencies) for calculating greatest common divisor","homepage":null,"documentation":null,"repository":"https://github.com/frewsxcv/rust-gcd","trustpub_data":null,"linecounts":{"languages":{"Rust":{"code_lines":36,"comment_lines":1,"files":1}},"total_code_lines":36,"total_comment_lines":1}},{"id":20952,"crate":"gcd","num":"1.0.0","dl_path":"/api/v1/crates/gcd/1.0.0/download","readme_path":"/api/v1/crates/gcd/1.0.0/readme","updated_at":"2017-11-30T04:06:28.819444Z","created_at":"2016-01-18T18:32:22.952232Z","downloads":2132,"features":{},"yanked":false,"yank_message":null,"lib_links":null,"license":"MIT/Apache-2.0","links":{"dependencies":"/api/v1/crates/gcd/1.0.0/dependencies","version_downloads":"/api/v1/crates/gcd/1.0.0/downloads","authors":"/api/v1/crates/gcd/1.0.0/authors"},"crate_size":5490,"published_by":null,"audit_actions":[],"checksum":"315acc8577b473cadafe81c5594401c79e45d9fcfc72c4bb810adb2273ff6cca","rust_version":null,"has_lib":true,"bin_names":[],"edition":null,"description":"Small Rust library (with no dependencies) for calculating greatest common divisor","homepage":null,"documentation":null,"repository":"https://github.com/frewsxcv/rust-gcd","trustpub_data":null,"linecounts":{"languages":{"Rust":{"code_lines":35,"comment_lines":1,"files":1}},"total_code_lines":35,"total_comment_lines":1}}],"keywords":[],"categories":[{"id":"algorithms","category":"Algorithms","slug":"algorithms","description":"Rust implementations of core algorithms such as hashing, sorting, searching, and more.","created_at":"2017-01-17T19:13:05.112025Z","crates_cnt":8576}]}