Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 46 for definitely (0.22 sec)

  1. android/guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java

      private static BigInteger oldSlowFactorial(int n1, int n2) {
        assert n1 <= n2;
        if (IntMath.log2(n2, CEILING) * (n2 - n1) < Long.SIZE - 1) {
          // the result will definitely fit into a long
          long result = 1;
          for (int i = n1 + 1; i <= n2; i++) {
            result *= i;
          }
          return BigInteger.valueOf(result);
        }
    
        /*
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 3.5K bytes
    - Viewed (0)
  2. guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java

      private static BigInteger oldSlowFactorial(int n1, int n2) {
        assert n1 <= n2;
        if (IntMath.log2(n2, CEILING) * (n2 - n1) < Long.SIZE - 1) {
          // the result will definitely fit into a long
          long result = 1;
          for (int i = n1 + 1; i <= n2; i++) {
            result *= i;
          }
          return BigInteger.valueOf(result);
        }
    
        /*
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 3.5K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/util/concurrent/TimeoutFuture.java

       *
       * The initial write to delegateRef is made definitely visible via the semantics of
       * addListener/SES.schedule. The later racy write in cancel() is not guaranteed to be observed,
       * however that is fine since the correctness is based on the atomic state in our base class. The
       * initial write to timer is never definitely visible to Fire.run since it is assigned after
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 8K bytes
    - Viewed (0)
  4. guava-gwt/src-super/com/google/common/base/super/com/google/common/base/Platform.java

     */
    final class Platform {
      static CharMatcher precomputeCharMatcher(CharMatcher matcher) {
        // CharMatcher.precomputed() produces CharMatchers that are maybe a little
        // faster (and that's debatable), but definitely more memory-hungry. We're
        // choosing to turn .precomputed() into a no-op in GWT, because it doesn't
        // seem to be a worthwhile tradeoff in a browser.
        return matcher;
      }
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Feb 03 21:52:39 UTC 2025
    - 2.2K bytes
    - Viewed (0)
  5. android/guava/src/com/google/common/util/concurrent/AggregateFutureState.java

          // Some Android 5.0.x Samsung devices have bugs in JDK reflection APIs that cause
          // getDeclaredField to throw a NoSuchFieldException when the field is definitely there.
          // For these users fallback to a suboptimal implementation, based on synchronized. This will
          // be a definite performance hit to those users.
          thrownReflectionFailure = reflectionFailure;
          helper = new SynchronizedAtomicHelper();
        }
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 8.5K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/util/concurrent/InterruptibleTask.java

    @GwtCompatible
    @ReflectionSupport(value = ReflectionSupport.Level.FULL)
    // Some Android 5.0.x Samsung devices have bugs in JDK reflection APIs that cause
    // getDeclaredField to throw a NoSuchFieldException when the field is definitely there.
    // Since this class only needs CAS on one field, we can avoid this bug by extending AtomicReference
    // instead of using an AtomicReferenceFieldUpdater. This reference stores Thread instances
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 10K bytes
    - Viewed (0)
  7. guava/src/com/google/common/math/BigIntegerMath.java

         *
         * We start out with a double-precision approximation, which may be higher or lower than the
         * true value. Therefore, we perform at least one Newton iteration to get a guess that's
         * definitely >= floor(sqrt(x)), and then continue the iteration until we reach a fixed point.
         */
        BigInteger sqrt0;
        int log2 = log2(x, FLOOR);
        if (log2 < Double.MAX_EXPONENT) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 18.8K bytes
    - Viewed (0)
  8. android/guava/src/com/google/common/collect/FilteredEntryMultimap.java

          Collection<V> collection = unfiltered.asMap().get(key);
          if (collection == null) {
            return null;
          }
          @SuppressWarnings("unchecked") // it's definitely equal to a K
          K k = (K) key;
          List<V> result = new ArrayList<>();
          Iterator<V> itr = collection.iterator();
          while (itr.hasNext()) {
            V v = itr.next();
            if (satisfies(k, v)) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 12.3K bytes
    - Viewed (0)
  9. android/guava/src/com/google/common/hash/BloomFilter.java

     * with one-sided error: if it claims that an element is contained in it, this might be in error,
     * but if it claims that an element is <i>not</i> contained in it, then this is definitely true.
     *
     * <p>If you are unfamiliar with Bloom filters, this nice <a
     * href="http://llimllib.github.io/bloomfilter-tutorial/">tutorial</a> may help you understand how
     * they work.
     *
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Aug 31 13:15:26 UTC 2025
    - 26.9K bytes
    - Viewed (0)
  10. guava/src/com/google/common/collect/FilteredEntryMultimap.java

          Collection<V> collection = unfiltered.asMap().get(key);
          if (collection == null) {
            return null;
          }
          @SuppressWarnings("unchecked") // it's definitely equal to a K
          K k = (K) key;
          List<V> result = new ArrayList<>();
          Iterator<V> itr = collection.iterator();
          while (itr.hasNext()) {
            V v = itr.next();
            if (satisfies(k, v)) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 12.3K bytes
    - Viewed (0)
Back to top