Thursday, March 12, 2026
HomeLanguagesJavaJava Guava | mod() method of IntMath Class

Java Guava | mod() method of IntMath Class

The mod(int x, int m) method of Guava’s IntMath class accepts two parameters x and m and used to calculate the value of x modulus under m.

Syntax :

public static int mod(int x, int m)

Parameters: This method accepts two parameters x and m which are of integer types and calculate x modulo m.

Return Value : The method returns x mod m that will be a non-negative value less than m.

Exception : The method mod(int x, int m) throws ArithmeticException if m <= 0.

Below examples illustrate the mod(int x, int m) method:

Example 1 :




// Java code to show implementation of
// mod(int x, int m) method of Guava's
// IntMath class
import java.math.RoundingMode;
import com.google.common.math.IntMath;
  
class GFG {
  
    // Driver code
    public static void main(String args[])
    {
        int x1 = -84;
        int m1 = 5;
  
        int ans1 = IntMath.mod(x1, m1);
  
        // Using mod(int x, int m)
        // method of Guava's IntMath class
        System.out.println(x1 + " mod " + m1 + " is : " + ans1);
  
        int x2 = 14;
        int m2 = 6;
  
        int ans2 = IntMath.mod(x2, m2);
  
        // Using mod(int x, int m)
        // method of Guava's IntMath class
        System.out.println(x2 + " mod " + m2 + " is : " + ans2);
    }
}


Output :

-84 mod 5 is : 1
14 mod 6 is : 2

Example 2 :




// Java code to show implementation of
// mod(int x, int m) method of Guava's
// IntMath class
import java.math.RoundingMode;
import com.google.common.math.IntMath;
  
class GFG {
  
    static int findMod(int x, int m)
    {
        try {
            // Using mod(int x, int m)
            // method of Guava's IntMath class
            // This should throw "ArithmeticException"
            // as m <= 0
            int ans = IntMath.mod(x, m);
  
            // Return the answer
            return ans;
        }
        catch (Exception e) {
            System.out.println(e);
            return -1;
        }
    }
  
    // Driver code
    public static void main(String args[])
    {
        int x = 14;
        int m = -3;
  
        try {
            // Function calling
            findMod(x, m);
        }
        catch (Exception e) {
            System.out.println(e);
        }
    }
}


Output :

java.lang.ArithmeticException: Modulus -3 must be > 0

Reference :
https://google.github.io/guava/releases/20.0/api/docs/com/google/common/math/IntMath.html#mod-int-int-

Dominic
Dominichttp://wardslaus.com
infosec,malicious & dos attacks generator, boot rom exploit philanthropist , wild hacker , game developer,
RELATED ARTICLES

3 COMMENTS

Most Popular

Dominic
32506 POSTS0 COMMENTS
Milvus
131 POSTS0 COMMENTS
Nango Kala
6882 POSTS0 COMMENTS
Nicole Veronica
12005 POSTS0 COMMENTS
Nokonwaba Nkukhwana
12099 POSTS0 COMMENTS
Shaida Kate Naidoo
7011 POSTS0 COMMENTS
Ted Musemwa
7255 POSTS0 COMMENTS
Thapelo Manthata
6967 POSTS0 COMMENTS
Umr Jansen
6956 POSTS0 COMMENTS