- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 57 for sakeen (0.19 sec)
-
guava-testlib/src/com/google/common/testing/GcFinalization.java
/** * Testing utilities relating to garbage collection finalization. * * <p>Use this class to test code triggered by finalization, that is, one of the following * actions taken by the java garbage collection system: * * <ul> * <li>invoking the {@code finalize} methods of unreachable objects * <li>clearing weak references to unreachable referents
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.6K bytes - Viewed (0) -
guava/src/com/google/common/base/CaseFormat.java
this.wordSeparator = wordSeparator; } /** * Converts the specified {@code String str} from this format to the specified {@code format}. A * "best effort" approach is taken; if {@code str} does not conform to the assumed format, then * the behavior of this method is undefined but we make a reasonable effort at converting anyway. */ public final String to(CaseFormat format, String str) {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Dec 19 20:20:14 GMT 2022 - 6.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashing.java
* Sets {@code table[index]} to {@code entry}, where {@code table} is actually a {@code byte[]}, * {@code short[]}, or {@code int[]}. The value of {@code entry} should fit in the size of the * assigned array element, when seen as an unsigned value. So if {@code table} is a {@code byte[]} * then we should have {@code 0 ≤ entry ≤ 255}, and if {@code table} is a {@code short[]} then we
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Aug 02 21:41:22 GMT 2021 - 7.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/AbstractStreamingHasherTest.java
} // ensures that the number of invocations looks sane void assertInvariants(int expectedBytes) { // we should have seen as many bytes as the next multiple of chunk after expectedBytes - 1 assertEquals(out.toByteArray().length, ceilToMultiple(expectedBytes, chunkSize)); assertEquals(expectedBytes / chunkSize, processCalled);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 8.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashing.java
* Sets {@code table[index]} to {@code entry}, where {@code table} is actually a {@code byte[]}, * {@code short[]}, or {@code int[]}. The value of {@code entry} should fit in the size of the * assigned array element, when seen as an unsigned value. So if {@code table} is a {@code byte[]} * then we should have {@code 0 ≤ entry ≤ 255}, and if {@code table} is a {@code short[]} then we
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Aug 02 21:41:22 GMT 2021 - 7.1K bytes - Viewed (0) -
guava/src/com/google/common/cache/CacheBuilder.java
* value, you should always choose it explicitly. * * <p>The current implementation uses the concurrency level to create a fixed number of hashtable * segments, each governed by its own write lock. The segment lock is taken once for each explicit * write, and twice for each cache loading computation (once prior to loading the new value, and * once after loading completes). Much internal cache management is performed at the segment
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 51.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableMap.java
} } private static <K, V> Entry<K, V>[] lastEntryForEachKey(Entry<K, V>[] entries, int size) { Set<K> seen = new HashSet<>(); BitSet dups = new BitSet(); // slots that are overridden by a later duplicate key for (int i = size - 1; i >= 0; i--) { if (!seen.add(entries[i].getKey())) { dups.set(i); } } if (dups.isEmpty()) { return entries;
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 44.1K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Futures.java
*/ task.addListener(() -> scheduled.cancel(false), directExecutor()); return task; } /** * Returns a {@code Future} whose result is taken from the given primary {@code input} or, if the * primary input fails with the given {@code exceptionType}, from the result provided by the
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 59.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/ExecutionSequencer.java
* <li>If this field's value == null because of unsafe publication, we know that it isn't the * object associated with our thread, because if it was the publication wouldn't have been * unsafe and we'd have seen our thread as the value. This state is also why a new * ThreadConfinedTaskQueue object must be created for each inline execution, because * observing a null thread does not mean the object is safe to reuse.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 01 21:46:34 GMT 2024 - 22.1K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Ints.java
// (2) "Dolphin". If we're rotating an array a of size n by a distance of d, then element a[0] // ends up at a[d], which in turn ends up at a[2d], and so on until we get back to a[0]. // (All indices taken mod n.) If d and n are mutually prime, all elements will have been // moved at that point. Otherwise, we can rotate the cycle a[1], a[1 + d], a[1 + 2d], etc,
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 29.7K bytes - Viewed (0)