Find the Greatest Common Divisor using Euclidean Algorithm
- gcd
- euclidean-algorithm
- npm
- npm-package
103,113 visible repositories in the index
6,481–6,493 of 6,493 · Most stars
Find the Greatest Common Divisor using Euclidean Algorithm
The repository host gives no description.
A special data structure where items can be found by their position or key. Written in pure Lua.
VSCode extension for Ada.
Parse configuration values into given struct from environment, files, json, bytes, or other input convertible to bytes
Vertx-MongoDB-Effect enables interaction with MongoDB in a purely functional and reactive style, seamlessly integrating with Vertx-effect. This library requires familiarity with Vertx-effect, as both frameworks share a foundational reliance on immutability and persistent data structures provided by json-values.
An unofficial tttruck.com API to find foodtrucks
Adds numbered shortcuts to the output git status, and much more
Bluesky bot suite for ShopSavvy — reactive mention bot, custom feed generator, daily deal poster
Deno Deploy template for ShopSavvy Data API - product search and price comparison with Hono router
MQTT bridge for ShopSavvy price data
CDK Constructs
The repository host gives no description.