Java Integer Divide divisorMod(int a, int n)

Description

Modulus, divisor-style.

License

Open Source License

Parameter

Parameter	Description
a	a
n	n

Return

the modulus

Declaration

public static int divisorMod(int a, int n) 

Method Source Code

//package com.java2s;
/*//from w  ww  .  j  a  v a 2  s . c  o m
 * WorldEdit, a Minecraft world manipulation toolkit
 * Copyright (C) sk89q <http://www.sk89q.com>
 * Copyright (C) WorldEdit team and contributors
 *
 * This program is free software: you can redistribute it and/or modify it
 * under the terms of the GNU Lesser General Public License as published by the
 * Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License
 * for more details.
 *
 * You should have received a copy of the GNU Lesser General Public License
 * along with this program. If not, see <http://www.gnu.org/licenses/>.
 */

public class Main {
    /**
     * Modulus, divisor-style.
     *
     * @param a a
     * @param n n
     * @return the modulus
     */
    public static int divisorMod(int a, int n) {
        return (int) (a - n * Math.floor(Math.floor(a) / n));
    }
}

Related

1. divideWithCeilingRoundingMode(int p, int q)
2. divideWithoutOverflow(int x, int y)
3. division(int i_Divisor, int i_Dividend)
4. divisor(int a, int b)
5. divisor(int m, int n)
6. divRoundUp(int a, int b)
7. divUp(int dividend, int divisor)