- Sort Score
- Result 10 results
- Languages All
Results 1 - 7 of 7 for Ismail (0.15 sec)
-
android/guava/src/com/google/common/collect/ImmutableSortedMap.java
* .put(1, "one") * .put(2, "two") * .put(3, "three") * .buildOrThrow(); * }</pre> * * <p>For <i>small</i> immutable sorted maps, the {@code ImmutableSortedMap.of()} methods are even * more convenient. * * <p>Builder instances can be reused - it is safe to call {@link #buildOrThrow} multiple times to
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 53.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Sets.java
* using a {@code LinkedHashSet} instead, at the cost of increased memory footprint, to get * deterministic iteration behavior. * * <p>This method is just a small convenience, either for {@code newHashSet(}{@link Arrays#asList * asList}{@code (...))}, or for creating an empty set then calling {@link Collections#addAll}.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 77.4K bytes - Viewed (0) -
android/guava/src/com/google/common/base/CharMatcher.java
* * <p>This implementation tries to be smart in a number of ways. It recognizes cases where the * negation is cheaper to precompute than the matcher itself; it tries to build small hash tables * for matchers that only match a few characters, and so on. In the worst-case scenario, it * constructs an eight-kilobyte bit array and queries that. In many situations this produces a
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 53.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMakerInternalMap.java
int threshold; /** The per-segment table. */ @CheckForNull volatile AtomicReferenceArray<E> table; /** * A counter of the number of reads since the last write, used to drain queues on a small * fraction of read operations. */ final AtomicInteger readCount = new AtomicInteger(); Segment(MapMakerInternalMap<K, V, E, S> map, int initialCapacity) { this.map = map;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 91.9K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
// Timed Get // There are a few design constraints to consider // * We want to be responsive to small timeouts, unpark() has non trivial latency overheads (I // have observed 12 micros on 64-bit linux systems to wake up a parked thread). So if the // timeout is small we shouldn't park(). This needs to be traded off with the cpu overhead of
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 63K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSortedMap.java
* .put(1, "one") * .put(2, "two") * .put(3, "three") * .buildOrThrow(); * }</pre> * * <p>For <i>small</i> immutable sorted maps, the {@code ImmutableSortedMap.of()} methods are even * more convenient. * * <p>Builder instances can be reused - it is safe to call {@link #buildOrThrow} multiple times to
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 50.3K bytes - Viewed (0) -
guava/src/com/google/common/base/CharMatcher.java
* * <p>This implementation tries to be smart in a number of ways. It recognizes cases where the * negation is cheaper to precompute than the matcher itself; it tries to build small hash tables * for matchers that only match a few characters, and so on. In the worst-case scenario, it * constructs an eight-kilobyte bit array and queries that. In many situations this produces a
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 53.8K bytes - Viewed (0)