- Sort Score
- Num 10 results
- Language All
Results 1141 - 1150 of 1,829 for Text (0.06 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
android/guava/src/com/google/common/collect/CompactHashing.java
int hash = smearedHash(key); int tableIndex = hash & mask; int next = tableGet(table, tableIndex); if (next == UNSET) { return -1; } int hashPrefix = getHashPrefix(hash, mask); int lastEntryIndex = -1; do { int entryIndex = next - 1; int entry = entries[entryIndex]; if (getHashPrefix(entry, mask) == hashPrefix
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Dec 26 20:08:09 GMT 2025 - 7.1K bytes - Click Count (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/Tags.kt
val thisMinusKey = when { key == this.key -> { next } // Subtract this! else -> { val nextMinusKey = next.plus(key, null) when { nextMinusKey === next -> this // Same as the following line, but with fewer allocations.Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Tue Jan 27 09:00:39 GMT 2026 - 3.9K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/CompactHashSet.java
* part of the smeared hash of the element not covered by the hashtable mask, whereas the low bits * are the "next" pointer (pointing to the next entry in the bucket chain), which will always be * less than or equal to the hashtable mask. * * <pre> * hash = aaaaaaaa * mask = 00000fff * next = 00000bbb * entry = aaaaabbb * </pre> *
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Jul 08 18:32:10 GMT 2025 - 23.9K bytes - Click Count (0) -
android/guava/src/com/google/common/base/AbstractIterator.java
T result = uncheckedCastNullableTToT(next); next = null; return result; } @Override public final void remove() { throw new UnsupportedOperationException(); }
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sun Dec 22 03:38:46 GMT 2024 - 2.4K bytes - Click Count (0) -
src/main/java/org/codelibs/fess/app/pager/GroupPager.java
} /** * Checks whether a next page exists in the pagination. * * @return true if a next page exists, false otherwise */ public boolean isExistNextPage() { return existNextPage; } /** * Sets the flag indicating whether a next page exists. * * @param existNextPage true if a next page exists, false otherwise */Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Thu Jul 17 08:28:31 GMT 2025 - 7K bytes - Click Count (0) -
src/test/java/jcifs/smb/DirFileEntryAdapterIteratorTest.java
SmbResource result = iterator.next(); assertNotNull(result, "Should still be able to get element"); assertEquals("file1.txt", result.getName()); assertFalse(iterator.hasNext(), "Should not have more elements"); // Verify delegate.next() was only called once verify(mockDelegate, times(1)).next(); } /**Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 07:14:38 GMT 2025 - 14.4K bytes - Click Count (0) -
cmd/erasure-decode.go
p.readers = tmp // next is the next non-preferred index. next := 0 for i, ok := range prefer { if !ok || p.readers[i] == nil { continue } if i == next { next++ continue } // Move reader with index i to index next. // Do this by swapping next and i p.readers[next], p.readers[i] = p.readers[i], p.readers[next] p.readerToBuf[next] = i p.readerToBuf[i] = next next++Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Thu Aug 29 01:40:52 GMT 2024 - 9.5K bytes - Click Count (0) -
guava-testlib/test/com/google/common/collect/testing/IteratorTesterTest.java
throw new IllegalStateException(); } iterator.remove(); } } public void testCanCatchJdkBug6529795InTargetIterator() { try { /* Choose 4 steps to get sequence [next, next, next, remove] */ new IteratorTester<Integer>( 4, MODIFIABLE, newArrayList(1, 2), IteratorTester.KnownOrder.KNOWN_ORDER) { @Override protected Iterator<Integer> newTargetIterator() {
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Aug 06 18:32:41 GMT 2025 - 10.3K bytes - Click Count (0) -
src/main/java/jcifs/smb1/smb1/DfsReferral.java
public long expiration; /** The next DFS referral in the chain */ DfsReferral next; /** Map containing DFS referral entries */ Map map; /** The cache key for this referral */ String key = null; /** * Constructs a new DfsReferral instance */ public DfsReferral() { this.next = this; } void append(final DfsReferral dr) {Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sat Aug 16 01:32:48 GMT 2025 - 2.5K bytes - Click Count (0) -
guava/src/com/google/common/collect/CompactHashMap.java
* part of the smeared hash of the key not covered by the hashtable mask, whereas the low bits are * the "next" pointer (pointing to the next entry in the bucket chain), which will always be less * than or equal to the hashtable mask. * * <pre> * hash = aaaaaaaa * mask = 00000fff * next = 00000bbb * entry = aaaaabbb * </pre> *
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Jul 08 18:32:10 GMT 2025 - 39.6K bytes - Click Count (0)