- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 54 for logkit (0.57 sec)
-
android/guava-tests/test/com/google/common/util/concurrent/FluentFutureTest.java
import java.util.concurrent.ScheduledExecutorService; import java.util.concurrent.TimeoutException; import junit.framework.TestCase; /** * Tests for {@link FluentFuture}. The tests cover only the basics for the API. The actual logic is * tested in {@link FuturesTest}. */ @ElementTypesAreNonnullByDefault @GwtCompatible(emulated = true) public class FluentFutureTest extends TestCase { public void testFromFluentFuture() {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 13 14:28:25 GMT 2024 - 5.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/base/AsciiTest.java
assertFalse(Ascii.equalsIgnoreCase("x", "")); assertTrue(Ascii.equalsIgnoreCase(LOWER, UPPER)); assertTrue(Ascii.equalsIgnoreCase(UPPER, LOWER)); // Create new strings here to avoid early-out logic. assertTrue(Ascii.equalsIgnoreCase(new String(IGNORED), new String(IGNORED))); // Compare to: "\u00c1".equalsIgnoreCase("\u00e1") == true assertFalse(Ascii.equalsIgnoreCase("\u00c1", "\u00e1"));
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 5.5K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
* </ul> * * <p>Note that detection of potential deadlock does not necessarily indicate that deadlock will * happen, as it is possible that higher level application logic prevents the cyclic lock * acquisition from occurring. One example of a false positive is: * * <pre> * LockA -> LockB -> LockC * LockA -> LockC -> LockB * </pre> *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 35.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
requireLinks()[i] = value; } /* * We don't define getPredecessor+getSuccessor and setPredecessor+setSuccessor here because * they're defined above -- including logic to add and subtract 1 to map between the values stored * in the predecessor/successor arrays and the indexes in the elements array that they identify. */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
return requireNonNull(successor); } /* * We don't define getPredecessor+getSuccessor and setPredecessor+setSuccessor here because * they're defined above -- including logic to add and subtract 1 to map between the values stored * in the predecessor/successor arrays and the indexes in the elements array that they identify. */
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.7K bytes - Viewed (0) -
guava/src/com/google/common/cache/Cache.java
* </ul> * * <p>Among the further improvements that {@code LoadingCache} can provide but this method cannot: * * <ul> * <li>consolidation of the loader logic to {@linkplain CacheBuilder#build(CacheLoader) a single * authoritative location} * <li>{@linkplain LoadingCache#refresh refreshing of entries}, including {@linkplain
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Sun Aug 07 02:38:22 GMT 2022 - 7.9K bytes - Viewed (1) -
android/guava/src/com/google/common/math/LongMath.java
if (a == 0) { // 0 % b == 0, so b divides a, but the converse doesn't hold. // BigInteger.gcd is consistent with this decision. return b; } else if (b == 0) { return a; // similar logic } /* * Uses the binary GCD algorithm; see http://en.wikipedia.org/wiki/Binary_GCD_algorithm. This is * >60% faster than the Euclidean algorithm in benchmarks. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 44.6K bytes - Viewed (0) -
guava-gwt/src-super/com/google/common/cache/super/com/google/common/cache/LocalCache.java
throw new UnsupportedOperationException(); } @Override public String toString() { return getKey() + "=" + getValue(); } } // TODO(fry): Separate logic for consistency between emul and nonemul implementation. // TODO(fry): Look into Maps.KeySet and Maps.Values, which can ideally be reused here but are // currently only package visible.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 27 19:19:19 GMT 2024 - 21.6K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/AbstractIteratorTester.java
import java.util.NoSuchElementException; import java.util.Set; import java.util.Stack; import junit.framework.AssertionFailedError; import org.checkerframework.checker.nullness.qual.Nullable; /** * Most of the logic for {@link IteratorTester} and {@link ListIteratorTester}. * * @param <E> the type of element returned by the iterator * @param <I> the type of the iterator ({@link Iterator} or {@link ListIterator})
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedSet.java
public ImmutableSortedSet<E> tailSet(E fromElement, boolean inclusive) { return tailSetImpl(checkNotNull(fromElement), inclusive); } /* * These methods perform most headSet, subSet, and tailSet logic, besides * parameter validation. */ abstract ImmutableSortedSet<E> headSetImpl(E toElement, boolean inclusive); abstract ImmutableSortedSet<E> subSetImpl(
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 36.9K bytes - Viewed (0)