Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 22 for divisors (0.06 sec)

  1. guava-tests/benchmark/com/google/common/primitives/UnsignedLongsBenchmark.java

          int j = i & ARRAY_MASK;
          tmp += UnsignedLongs.divide(longs[j], divisors[j]);
        }
        return tmp;
      }
    
      @Benchmark
      long remainder(int reps) {
        long tmp = 0;
        for (int i = 0; i < reps; i++) {
          int j = i & ARRAY_MASK;
          tmp += UnsignedLongs.remainder(longs[j], divisors[j]);
        }
        return tmp;
      }
    
      @Benchmark
      long parseUnsignedLong(int reps) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Dec 04 17:37:03 UTC 2017
    - 4.3K bytes
    - Viewed (0)
  2. android/guava-tests/benchmark/com/google/common/primitives/UnsignedLongsBenchmark.java

          int j = i & ARRAY_MASK;
          tmp += UnsignedLongs.divide(longs[j], divisors[j]);
        }
        return tmp;
      }
    
      @Benchmark
      long remainder(int reps) {
        long tmp = 0;
        for (int i = 0; i < reps; i++) {
          int j = i & ARRAY_MASK;
          tmp += UnsignedLongs.remainder(longs[j], divisors[j]);
        }
        return tmp;
      }
    
      @Benchmark
      long parseUnsignedLong(int reps) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Dec 04 17:37:03 UTC 2017
    - 4.3K bytes
    - Viewed (0)
  3. docs/distributed/DESIGN.md

    available, let's say for example if there are 32 servers and 32 drives which is a total of 1024 drives. In this scenario 16 becomes the erasure set size. This is decided based on the greatest common divisor (GCD) of acceptable erasure set sizes ranging from *4 to 16*.
    
    - *If total drives has many common divisors the algorithm chooses the minimum amounts of erasure sets possible for a erasure set size of any N*.  In the example with 1024 drives - 4, 8, 16 are GCD factors. With 16 drives we get a total...
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Aug 15 23:04:20 UTC 2023
    - 8K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/primitives/UnsignedInts.java

      }
    
      /**
       * Returns dividend % divisor, where the dividend and divisor are treated as unsigned 32-bit
       * quantities.
       *
       * <p><b>Java 8+ users:</b> use {@link Integer#remainderUnsigned(int, int)} instead.
       *
       * @param dividend the dividend (numerator)
       * @param divisor the divisor (denominator)
       * @throws ArithmeticException if divisor is 0
       */
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 21:17:54 UTC 2024
    - 13.7K bytes
    - Viewed (0)
  5. guava/src/com/google/common/primitives/UnsignedInts.java

      }
    
      /**
       * Returns dividend % divisor, where the dividend and divisor are treated as unsigned 32-bit
       * quantities.
       *
       * <p><b>Java 8+ users:</b> use {@link Integer#remainderUnsigned(int, int)} instead.
       *
       * @param dividend the dividend (numerator)
       * @param divisor the divisor (denominator)
       * @throws ArithmeticException if divisor is 0
       */
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 21:17:54 UTC 2024
    - 13.7K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/primitives/UnsignedLongs.java

       * @param divisor the divisor (denominator)
       * @throws ArithmeticException if divisor is 0
       * @since 11.0
       */
      public static long remainder(long dividend, long divisor) {
        if (divisor < 0) { // i.e., divisor >= 2^63:
          if (compare(dividend, divisor) < 0) {
            return dividend; // dividend < divisor
          } else {
            return dividend - divisor; // dividend >= divisor
          }
        }
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Aug 12 21:04:48 UTC 2024
    - 17.6K bytes
    - Viewed (0)
  7. android/guava-tests/test/com/google/common/primitives/UnsignedIntsTest.java

        for (int i = 0; i < 1000000; i++) {
          int dividend = r.nextInt();
          int divisor = r.nextInt();
          // Test that the Euclidean property is preserved:
          assertThat(
                  dividend
                      - (divisor * UnsignedInts.divide(dividend, divisor)
                          + UnsignedInts.remainder(dividend, divisor)))
              .isEqualTo(0);
        }
      }
    
      public void testParseInt() {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 02:56:12 UTC 2024
    - 12.5K bytes
    - Viewed (0)
  8. src/cmd/asm/internal/asm/parse.go

    				p.errorf("divide of value with high bit set")
    			}
    			divisor := p.factor()
    			if divisor == 0 {
    				p.errorf("division by zero")
    			} else {
    				value /= divisor
    			}
    		case '%':
    			p.next()
    			divisor := p.factor()
    			if int64(value) < 0 {
    				p.errorf("modulo of value with high bit set")
    			}
    			if divisor == 0 {
    				p.errorf("modulo by zero")
    			} else {
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Wed Sep 04 18:16:59 UTC 2024
    - 36.9K bytes
    - Viewed (0)
  9. cmd/endpoint-ellipses.go

    }
    
    // Supported set sizes this is used to find the optimal
    // single set size.
    var setSizes = []uint64{2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16}
    
    // getDivisibleSize - returns a greatest common divisor of
    // all the ellipses sizes.
    func getDivisibleSize(totalSizes []uint64) (result uint64) {
    	gcd := func(x, y uint64) uint64 {
    		for y != 0 {
    			x, y = y, x%y
    		}
    		return x
    	}
    	result = totalSizes[0]
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Wed Aug 14 17:11:51 UTC 2024
    - 14.7K bytes
    - Viewed (0)
  10. misc/cgo/gmp/gmp.go

    func DivModInt(q, r, x, y *Int) {
    	q.doinit()
    	r.doinit()
    	x.doinit()
    	y.doinit()
    	C.mpz_tdiv_qr(&q.i[0], &r.i[0], &x.i[0], &y.i[0])
    }
    
    // GcdInt sets d to the greatest common divisor of a and b,
    // which must be positive numbers.
    // If x and y are not nil, GcdInt sets x and y such that d = a*x + b*y.
    // If either a or b is not positive, GcdInt sets d = x = y = 0.
    func GcdInt(d, x, y, a, b *Int) {
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Mon Apr 11 16:34:30 UTC 2022
    - 9.5K bytes
    - Viewed (0)
Back to top