< > BotCompany Repo | #1002512 // mod - better modulo that always gives positive numbers

JavaX fragment (include)

// better modulo that gives positive numbers always
static int mod(int n, int m) {
  ret (n % m + m) % m;
}

static long mod(long n, long m) {
  ret (n % m + m) % m;
}

static BigInt mod(BigInt n, int m) {
  ret n.mod(bigint(m));
}

static double mod(double n, double m) {
  ret (n % m + m) % m;
}

download  show line numbers  debug dex  old transpilations   

Travelled to 19 computer(s): aoiabmzegqzx, bhatertpkbcr, cbybwowwnfue, cfunsshuasjs, ekrmjmnbrukm, elmgxqgtpvxh, gjtlkbvenryc, gwrvuhgaqvyk, ishqpsrjomds, lpdgvwnxivlt, mowyntqkapby, mqqgnosmbjvj, podlckwnjdmb, pyentgdyhuwx, pzhvpgtvlbxg, tslmcundralx, tvejysmllsmz, vouqrxazstgt, wnsclhtenguj

1 comment(s) hidden. show