Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 5 of 5 for multiplyExact (0.35 seconds)

  1. android/guava/src/com/google/common/math/LongMath.java

       *
       * <p><b>Note:</b> this method is now unnecessary and should be treated as deprecated; use {@link
       * Math#multiplyExact(long, long)} instead. Note that if both arguments are {@code int} values,
       * writing {@code Math.multiplyExact(a, b)} will call the {@link Math#multiplyExact(int, int)}
       * overload, not {@link Math#multiplyExact(long, long)}. Also note that multiplying two {@code
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 09 23:01:02 GMT 2026
    - 46.8K bytes
    - Click Count (0)
  2. android/guava/src/com/google/common/math/IntMath.java

       * Math#multiplyExact(int, int)} instead.
       *
       * @throws ArithmeticException if {@code a * b} overflows in signed {@code int} arithmetic
       */
      @InlineMe(replacement = "Math.multiplyExact(a, b)")
      public static int checkedMultiply(int a, int b) {
        return Math.multiplyExact(a, b);
      }
    
      /**
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Jan 29 22:14:05 GMT 2026
    - 26.1K bytes
    - Click Count (0)
  3. android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java

      /** Returns ~2x the old capacity if small; ~1.5x otherwise. */
      private int calculateNewCapacity() {
        int oldCapacity = queue.length;
        int newCapacity =
            (oldCapacity < 64) ? (oldCapacity + 1) * 2 : Math.multiplyExact(oldCapacity / 2, 3);
        return capAtMaximumSize(newCapacity, maximumSize);
      }
    
      /** There's no reason for the queueSize to ever be more than maxSize + 1 */
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 16 13:11:08 GMT 2026
    - 34K bytes
    - Click Count (0)
  4. guava/src/com/google/common/collect/MinMaxPriorityQueue.java

      /** Returns ~2x the old capacity if small; ~1.5x otherwise. */
      private int calculateNewCapacity() {
        int oldCapacity = queue.length;
        int newCapacity =
            (oldCapacity < 64) ? (oldCapacity + 1) * 2 : Math.multiplyExact(oldCapacity / 2, 3);
        return capAtMaximumSize(newCapacity, maximumSize);
      }
    
      /** There's no reason for the queueSize to ever be more than maxSize + 1 */
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 16 13:11:08 GMT 2026
    - 34K bytes
    - Click Count (0)
  5. android/guava/src/com/google/common/hash/BloomFilter.java

           */
          @SuppressWarnings("EnumOrdinal")
          Strategy strategy = BloomFilterStrategies.values()[strategyOrdinal];
    
          LockFreeBitArray dataArray = new LockFreeBitArray(Math.multiplyExact(dataLength, 64L));
          for (int i = 0; i < dataLength; i++) {
            dataArray.putData(i, din.readLong());
          }
    
          return new BloomFilter<>(dataArray, numHashFunctions, funnel, strategy);
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 10 22:28:12 GMT 2026
    - 27.6K bytes
    - Click Count (0)
Back to Top