Java Integer Divide divideWithCeilingRoundingMode(int p, int q)

Description

divide With Ceiling Rounding Mode

License

Apache License

Declaration

public static int divideWithCeilingRoundingMode(int p, int q) 

Method Source Code

//package com.java2s;
/**/*  www . j  a  va2s . c o  m*/
 * Copyright 2017 Pivotal Software, Inc.
 * <p>
 * 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
 * <p>
 * http://www.apache.org/licenses/LICENSE-2.0
 * <p>
 * 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 {
    public static int divideWithCeilingRoundingMode(int p, int q) {
        if (q == 0) {
            throw new ArithmeticException("/ by zero"); // for GWT
        }
        int div = p / q;
        int rem = p - q * div; // equal to p % q

        if (rem == 0) {
            return div;
        }

        /*
         * Normal Java division rounds towards 0, consistently with RoundingMode.DOWN. We just have to
         * deal with the cases where rounding towards 0 is wrong, which typically depends on the sign of
         * p / q.
         *
         * signum is 1 if p and q are both nonnegative or both negative, and -1 otherwise.
         */
        int signum = 1 | ((p ^ q) >> (Integer.SIZE - 1));
        boolean increment = signum > 0;
        return increment ? div + signum : div;
    }
}

Related

1. divideRoundUp(int first, int second)
2. divideStringWithInt(String strDividend, int divisor)
3. divideToCeil(int numerator, int denominator)
4. divideToInt(String address)
5. divideUnsigned(int dividend, int divisor)
6. divideWithoutOverflow(int x, int y)
7. division(int i_Divisor, int i_Dividend)
8. divisor(int a, int b)
9. divisor(int m, int n)