The notation “x modulo y” (y must be finite and nonzero) computes a value k of the same sign as y (or zero) such that abs(k) < abs(y) and x-k = q × y for some integer q. Donald Knuth described floored ...

This repository contains the source code that was extracted from my Pull Request on the Elixir core language. It adds the Modulo.mod/2 macro, which is a guard-safe implementation of the floored ...