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 classimport 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 classimport 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
