Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 3 of 3 for bLow (0.03 sec)

  1. android/guava-tests/test/com/google/common/collect/TreeRangeSetTest.java

                  continue;
                }
                for (int bLow = 0; bLow < 6; bLow++) {
                  for (int bHigh = 0; bHigh < 6; bHigh++) {
                    for (BoundType bLowType : BoundType.values()) {
                      for (BoundType bHighType : BoundType.values()) {
                        if ((bLow == bHigh && bLowType == OPEN && bHighType == OPEN) || bLow > bHigh) {
                          continue;
                        }
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Oct 28 16:03:47 UTC 2025
    - 24.4K bytes
    - Viewed (0)
  2. android/guava-tests/test/com/google/common/cache/CacheBuilderTest.java

        assertThat(map.segments[3].table.length()).isEqualTo(1);
      }
    
      public void testInitialCapacity_large() {
        CacheBuilder.newBuilder().initialCapacity(Integer.MAX_VALUE);
        // that the builder didn't blow up is enough;
        // don't actually create this monster!
      }
    
      public void testConcurrencyLevel_zero() {
        CacheBuilder<Object, Object> builder = CacheBuilder.newBuilder();
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Sep 30 22:03:28 UTC 2025
    - 25.4K bytes
    - Viewed (0)
  3. guava/src/com/google/common/base/FinalizableReferenceQueue.java

      final boolean threadStarted;
    
      /** Constructs a new queue. */
      public FinalizableReferenceQueue() {
        // We could start the finalizer lazily, but I'd rather it blow up early.
        queue = new ReferenceQueue<>();
        frqRef = new PhantomReference<>(this, queue);
        boolean threadStarted = false;
        try {
          startFinalizer.invoke(null, FinalizableReference.class, queue, frqRef);
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Sat Aug 09 01:14:59 UTC 2025
    - 14.7K bytes
    - Viewed (0)
Back to top