glsl-gcd
v1.0.1
Published
glsl implementation of the Euclid's algorithm for the calculation of the greatest common divisor.
Downloads
15
Maintainers
Readme
glsl-gcd
Glsl implementation of the Euclid's algorithm for the calculation of the greatest common divisor.
Install
npm install glsl-gcd
Usage
#pragma glslify: gcd = require(glsl-gcd)
float d = gcd(9., 6.); // return 3.