Java Integer Mod modPos(int divisor, int dividend)

Description

Calculates (value mod size).

License

Apache License

Parameter

Parameter	Description
divisor	a parameter
dividend	a parameter

Declaration

public static int modPos(int divisor, int dividend) 

Method Source Code

//package com.java2s;
/*/*  w w  w.j  a  va  2 s .  com*/
 * Copyright 2011 Mark McKay
 * 
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 * 
 *     http://www.apache.org/licenses/LICENSE-2.0
 * 
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

public class Main {
    /**
     * Calculates (value mod size).  If result is negative, maps to the 
     * equivalent positive remainder.  Ie, guarantees result always 
     * 0 <= result < dividend;
     * 
     * @param divisor
     * @param dividend
     * @return 
     */
    public static int modPos(int divisor, int dividend) {
        return divisor >= 0 ? divisor % dividend : ((divisor + 1) % dividend) - 1 + dividend;
    }
}

Related

1. modifyPublicPortCheckRange(String modifiedVal, int dashCnt)
2. modifyString(char firstCharacter, String srcString, int indexOfSubstring)
3. modInverse(int a, int n)
4. modInverse(int n, int mod)
5. modMultiply(long a, long b, int m)
6. modSubtract(long a, long b, int m)
7. modularExp(long base, long exp, int modulus)
8. modularInverses(int p)
9. modularInvert(int num, int modulus)