Lines Matching defs:divisor

36 //   dividend and divisor combinations are tested
42 static int divi(int dividend, int divisor) { return dividend / divisor; }
43 static int modi(int dividend, int divisor) { return dividend % divisor; }
44 static long divl(long dividend, long divisor) { return dividend / divisor; }
45 static long modl(long dividend, long divisor) { return dividend % divisor; }
58 value = Integer.decode(System.getProperty("divisor"));
71 public int divisor() { return DIVISOR; }
76 int quo0 = s.divi(dividend, divisor());
77 int rem0 = s.modi(dividend, divisor());
81 System.out.println("Computed: " + dividend + " / " + divisor() + " = " +
82 quo + ", " + dividend + " % " + divisor() + " = " + rem );
83 System.out.println("expected: " + dividend + " / " + divisor() + " = " +
84 quo0 + ", " + dividend + " % " + divisor() + " = " + rem0);
90 if (java.lang.Math.abs(rem) >= java.lang.Math.abs(divisor())) {
94 if ((quo * divisor()) + rem != dividend) {
106 long quo0 = s.divl(dividend, divisor());
107 long rem0 = s.modl(dividend, divisor());
111 System.out.println("Computed: " + dividend + " / " + divisor() + " = " +
112 quo + ", " + dividend + " % " + divisor() + " = " + rem );
113 System.out.println("expected: " + dividend + " / " + divisor() + " = " +
114 quo0 + ", " + dividend + " % " + divisor() + " = " + rem0);
120 if (java.lang.Math.abs(rem) >= java.lang.Math.abs(divisor())) {
124 if ((quo * divisor()) + rem != dividend) {
125 System.out.println(" (" + quo + " * " + divisor() + ") + " + rem + " != "
136 if (divisor() == 0) return;
161 System.out.println("divisor " + divisor() + ": " +
182 System.out.println("divisor " + divisor() + ": " +
188 // Reload this class with the "divisor" property set to the input parameter.
191 public static void test_divisor(int divisor,
193 System.setProperty("divisor", "" + divisor);
206 // Test every divisor between -100 and 100.