Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 3 of 3 for wezen (0.15 sec)

  1. android/guava/src/com/google/common/util/concurrent/AbstractFuture.java

        // don't execute 'immediately'.  By checking isDone here we avoid that.
        // A corollary to all that is that we don't need to check isDone inside the loop because if we
        // get into the loop we know that we weren't done when we entered and therefore we aren't under
        // an obligation to execute 'immediately'.
        if (!isDone()) {
          Listener oldHead = listeners;
          if (oldHead != Listener.TOMBSTONE) {
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Mon Apr 22 21:17:24 GMT 2024
    - 63K bytes
    - Viewed (0)
  2. android/guava-tests/test/com/google/common/math/LongMathTest.java

          }
        }
      }
    
    
      @GwtIncompatible // Slow
      public void testBinomial_exhaustiveNotOverflowing() {
        // Tests all of the inputs to LongMath.binomial that won't cause it to overflow, that weren't
        // tested in the previous method, for k >= 3.
        for (int k = 3; k < LongMath.biggestBinomials.length; k++) {
          for (int n = 70; n <= LongMath.biggestBinomials[k]; n++) {
    Java
    - Registered: Fri May 03 12:43:13 GMT 2024
    - Last Modified: Mon Mar 04 20:15:57 GMT 2024
    - 32.5K bytes
    - Viewed (0)
  3. guava-tests/test/com/google/common/math/LongMathTest.java

          }
        }
      }
    
    
      @GwtIncompatible // Slow
      public void testBinomial_exhaustiveNotOverflowing() {
        // Tests all of the inputs to LongMath.binomial that won't cause it to overflow, that weren't
        // tested in the previous method, for k >= 3.
        for (int k = 3; k < LongMath.biggestBinomials.length; k++) {
          for (int n = 70; n <= LongMath.biggestBinomials[k]; n++) {
    Java
    - Registered: Fri Apr 12 12:43:09 GMT 2024
    - Last Modified: Mon Mar 04 20:15:57 GMT 2024
    - 32.5K bytes
    - Viewed (0)
Back to top