Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 14 for divisor (0.04 sec)

  1. 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 Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 17.8K bytes
    - Viewed (0)
  2. 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 Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Feb 09 16:22:33 UTC 2025
    - 13.8K bytes
    - Viewed (0)
  3. android/guava-tests/test/com/google/common/primitives/UnsignedLongsTest.java

        for (int i = 0; i < 1000000; i++) {
          long dividend = r.nextLong();
          long divisor = r.nextLong();
          // Test that the Euclidean property is preserved:
          assertThat(
                  dividend
                      - (divisor * UnsignedLongs.divide(dividend, divisor)
                          + UnsignedLongs.remainder(dividend, divisor)))
              .isEqualTo(0);
        }
      }
    
      public void testParseLong() {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 12.8K bytes
    - Viewed (0)
  4. 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 Sep 09 11:13:09 UTC 2025
    - Last Modified: Fri Feb 14 15:13:11 UTC 2025
    - 37.3K bytes
    - Viewed (0)
  5. 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 Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 14.6K bytes
    - Viewed (0)
  6. guava/src/com/google/common/math/LongMath.java

        if (m <= 0) {
          throw new ArithmeticException("Modulus must be positive");
        }
        return Math.floorMod(x, m);
      }
    
      /**
       * Returns the greatest common divisor of {@code a, b}. Returns {@code 0} if {@code a == 0 && b ==
       * 0}.
       *
       * @throws IllegalArgumentException if {@code a < 0} or {@code b < 0}
       */
      public static long gcd(long a, long b) {
        /*
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 29 16:20:07 UTC 2025
    - 46.8K bytes
    - Viewed (0)
  7. src/main/resources/fess_message_pt_BR.properties

    errors.failed_to_upload_mapping_file = Não foi possível carregar o arquivo de mapeamento.
    errors.invalid_kuromoji_token={0} não é um token válido.
    errors.invalid_kuromoji_segmentation=O número de divisões de {0} não corresponde ao número de divisões de {1}.
    errors.invalid_str_is_included = {1} é inválido em {0}.
    errors.blank_password = A senha é obrigatória.
    errors.invalid_confirm_password = A confirmação da senha não corresponde.
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Jul 10 04:56:21 UTC 2025
    - 12.8K bytes
    - Viewed (0)
  8. src/test/java/jcifs/internal/dfs/DfsReferralResponseBufferTest.java

                bb.putShort((short) 0);
                bb.putShort((short) 0);
    
                buffer.decode(testBuffer, 0, testBuffer.length);
    
                assertEquals(7, buffer.getPathConsumed()); // 15 / 2 = 7 (integer division)
            }
        }
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 15.4K bytes
    - Viewed (0)
  9. .teamcity/src/main/kotlin/model/PerformanceTestBucketProvider.kt

                                    scenario.scenario
                            }
                        }.firstOrNull()
                        // Fallback for new performance tests (don't use 0 to avoid division by zero)
                        ?: PerformanceTestDuration(scenario.scenario, 1)
                })
                .entries
                .map { TestProjectDuration(it.key, it.value) }
                .sortedBy { -it.totalTime }
    Registered: Wed Sep 10 11:36:15 UTC 2025
    - Last Modified: Thu Jul 10 02:18:03 UTC 2025
    - 16.6K bytes
    - Viewed (0)
  10. android/guava-tests/test/com/google/common/math/IntMathTest.java

          }
        }
      }
    
      @AndroidIncompatible // slow
      @GwtIncompatible // Math.floorDiv gets wrong answers for negative divisors
      public void testDivNonZero() {
        for (int p : NONZERO_INTEGER_CANDIDATES) {
          for (int q : NONZERO_INTEGER_CANDIDATES) {
            for (RoundingMode mode : ALL_SAFE_ROUNDING_MODES) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 24.1K bytes
    - Viewed (0)
Back to top