{"id":15381549,"url":"https://github.com/riccardoscalco/glsl-gcd","last_synced_at":"2026-01-07T10:05:23.556Z","repository":{"id":48013195,"uuid":"189449931","full_name":"riccardoscalco/glsl-gcd","owner":"riccardoscalco","description":"Glsl implementation of the Euclid's algorithm for the calculation of the greatest common divisor.","archived":false,"fork":false,"pushed_at":"2022-03-23T14:15:52.000Z","size":91,"stargazers_count":0,"open_issues_count":9,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-16T09:42:15.990Z","etag":null,"topics":["gcd","glsl","glslify","hcf","math","webgl"],"latest_commit_sha":null,"homepage":null,"language":"GLSL","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/riccardoscalco.png","metadata":{"files":{"readme":"readme.md","changelog":null,"contributing":null,"funding":null,"license":"license","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2019-05-30T16:49:10.000Z","updated_at":"2019-11-10T22:19:23.000Z","dependencies_parsed_at":"2022-08-12T16:40:35.480Z","dependency_job_id":null,"html_url":"https://github.com/riccardoscalco/glsl-gcd","commit_stats":null,"previous_names":[],"tags_count":1,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/riccardoscalco%2Fglsl-gcd","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/riccardoscalco%2Fglsl-gcd/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/riccardoscalco%2Fglsl-gcd/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/riccardoscalco%2Fglsl-gcd/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/riccardoscalco","download_url":"https://codeload.github.com/riccardoscalco/glsl-gcd/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245936671,"owners_count":20696874,"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":["gcd","glsl","glslify","hcf","math","webgl"],"created_at":"2024-10-01T14:27:54.812Z","updated_at":"2026-01-07T10:05:23.503Z","avatar_url":"https://github.com/riccardoscalco.png","language":"GLSL","funding_links":[],"categories":[],"sub_categories":[],"readme":"# glsl-gcd\n\nGlsl implementation of the Euclid's algorithm for the calculation of the greatest common divisor.\n\n## Install\n\n```sh\nnpm install glsl-gcd\n```\n\n## Usage\n\n```glsl\n#pragma glslify: gcd = require(glsl-gcd)\n\nfloat d = gcd(9., 6.); // return 3.\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Friccardoscalco%2Fglsl-gcd","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Friccardoscalco%2Fglsl-gcd","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Friccardoscalco%2Fglsl-gcd/lists"}