- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 582 for loom (0.13 sec)
-
okhttp/src/main/kotlin/okhttp3/internal/http/HttpHeaders.kt
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 7.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/BloomFilterTest.java
public void testNoRaceConditions() throws Exception { final BloomFilter<Integer> bloomFilter = BloomFilter.create(Funnels.integerFunnel(), 15_000_000, 0.01); // This check has to be BEFORE the loop because the random insertions can // flip GOLDEN_PRESENT_KEY to true even if it wasn't explicitly inserted // (false positive). assertThat(bloomFilter.mightContain(GOLDEN_PRESENT_KEY)).isFalse();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Nov 09 22:49:56 GMT 2023 - 21.3K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/BloomFilterStrategies.java
@ElementTypesAreNonnullByDefault enum BloomFilterStrategies implements BloomFilter.Strategy { /** * See "Less Hashing, Same Performance: Building a Better Bloom Filter" by Adam Kirsch and Michael * Mitzenmacher. The paper argues that this trick doesn't significantly deteriorate the * performance of a Bloom filter (yet only needs two 32bit hash functions). */ MURMUR128_MITZ_32() { @Override public <T extends @Nullable Object> boolean put(
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 10.7K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Utf8.java
int utf16Length = sequence.length(); int utf8Length = utf16Length; int i = 0; // This loop optimizes for pure ASCII. while (i < utf16Length && sequence.charAt(i) < 0x80) { i++; } // This loop optimizes for chars less than 0x800. for (; i < utf16Length; i++) { char c = sequence.charAt(i); if (c < 0x800) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 10 14:11:51 GMT 2023 - 7K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AggregateFuture.java
// Note that if all the futures on the list are done prior to completing this loop, the last // call to addListener() will callback to setOneValue(), transitively call our cleanup // listener, and set this.futures to null. // This is not actually a problem, since the foreach only needs this.futures to be non-null // at the beginning of the loop. int i = 0;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 01 21:46:34 GMT 2024 - 15.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/io/testdata/alice_in_wonderland.txt
`only, as it's asleep, I suppose it doesn't mind.' The table was a large one, but the three were all crowded together at one corner of it: `No room! No room!' they cried out when they saw Alice coming. `There's PLENTY of room!' said Alice indignantly, and she sat down in a large arm-chair at one end of the table. `Have some wine,' the March Hare said in an encouraging tone.
Plain Text - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Apr 21 02:27:51 GMT 2017 - 145.2K bytes - Viewed (0) -
src/main/java/jcifs/smb1/netbios/NameServicePacket.java
addrEntry = new NbtAddress[rDataLength / 6]; end = srcIndex + rDataLength; /* Apparently readRDataWireFormat can return 0 if resultCode != 0 in which case this will look indefinitely. Putting this else clause around the loop might fix that. But I would need to see a capture to confirm. if (resultCode != 0) { srcIndex += rDataLength; } else { */ for( addrIndex = 0; srcIndex < end; addrIndex++ ) {
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Fri Mar 22 20:39:42 GMT 2019 - 12.4K bytes - Viewed (0) -
tensorflow/c/experimental/filesystem/plugins/gcs/ram_file_block_cache.cc
lra_list_.erase(block->lra_iterator); lra_list_.push_front(key); block->lra_iterator = lra_list_.begin(); block->timestamp = timer_seconds_(); } } }); // Loop until either block content is successfully fetched, or our request // encounters an error. absl::MutexLock l(&block->mu); TF_SetStatus(status, TF_OK, ""); while (true) { switch (block->state) {
C++ - Registered: Tue Apr 23 12:39:09 GMT 2024 - Last Modified: Thu Jul 16 01:39:09 GMT 2020 - 11.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/io/testdata/alice_in_wonderland.txt
`only, as it's asleep, I suppose it doesn't mind.' The table was a large one, but the three were all crowded together at one corner of it: `No room! No room!' they cried out when they saw Alice coming. `There's PLENTY of room!' said Alice indignantly, and she sat down in a large arm-chair at one end of the table. `Have some wine,' the March Hare said in an encouraging tone.
Plain Text - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Mon Oct 29 21:35:03 GMT 2012 - 145.2K bytes - Viewed (0) -
src/cmd/asm/internal/lex/input.go
// Macro has arguments. Scan list of formals. acceptArg := true args = []string{} // Zero length but not nil. Loop: for { tok = in.Stack.Next() switch tok { case ')': tok = in.Stack.Next() // First token of macro definition. break Loop case ',': if acceptArg { in.Error("bad syntax in definition for macro:", name) } acceptArg = true
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Tue Aug 29 07:48:38 GMT 2023 - 12.6K bytes - Viewed (0)