- Sort Score
- Result 10 results
- Languages All
Results 81 - 90 of 151 for aloop (0.04 sec)
-
android/guava-testlib/src/com/google/common/collect/testing/AbstractIteratorTester.java
throw new RuntimeException(Arrays.toString(stimuli), e); } } private void recurse(int level) { // We're going to reuse the stimuli array 3^steps times by overwriting it // in a recursive loop. Sneaky. if (level == stimuli.length) { // We've filled the array. compareResultsForThisListOfStimuli(); } else { // Keep recursing to fill the array.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Jun 11 16:13:05 UTC 2024 - 20.7K bytes - Viewed (0) -
src/runtime/mpallocbits.go
// in the pallocBits and returns the index. // // See find for an explanation of the searchIdx parameter. func (b *pallocBits) find1(searchIdx uint) uint { _ = b[0] // lift nil check out of loop for i := searchIdx / 64; i < uint(len(b)); i++ { x := b[i] if ^x == 0 { continue } return i*64 + uint(sys.TrailingZeros64(^x)) } return ^uint(0) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat May 18 15:13:43 UTC 2024 - 12.5K bytes - Viewed (0) -
internal/grid/muxclient.go
if !m.closed { gridLogIf(m.ctx, m.sendLocked(message{Op: OpUnblockSrvMux, MuxID: m.MuxID})) } m.respMu.Unlock() case <-m.ctx.Done(): // Client canceled. Don't block. // Next loop will catch it. case <-pingTimer: if !m.doPing(respHandler) { return } goto sendResp } case <-pingTimer: if !m.doPing(respHandler) { return } } }
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri Jun 07 15:51:52 UTC 2024 - 15.9K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/func.go
cachedPostorder []*Block // cached postorder traversal cachedIdom []*Block // cached immediate dominators cachedSdom SparseTree // cached dominator tree cachedLoopnest *loopnest // cached loop nest information cachedLineStarts *xposmap // cached map/set of xpos to integers auxmap auxmap // map from aux values to opaque ids used by CSE
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 25.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashMap.java
CompactHashing.tableSet(newTable, targetHash & newMask, targetEntryIndex + 1); } Object oldTable = requireTable(); int[] entries = requireEntries(); // Loop over `oldTable` to construct its replacement, ``newTable`. The entries do not move, so // the `keys` and `values` arrays do not need to change. But because the "short hash" now has a
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 28 18:11:09 UTC 2024 - 35.8K bytes - Viewed (0) -
src/cmd/cover/cover.go
// add calls to AddUint32/StoreUint32, and we don't want to // somehow create an infinite loop. // // Note that in the current implementation (Go 1.20) both // routines are assembly stubs that forward calls to the // internal/runtime/atomic equivalents, hence the infinite // loop scenario is purely theoretical (maybe if in some // future implementation one of these functions might be
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 14 19:41:17 UTC 2024 - 34.5K bytes - Viewed (0) -
pilot/pkg/model/sidecar.go
func (hc hostClassification) Matches(h host.Name) bool { // exact lookup is fast, so check that first if hc.exactHosts.Contains(h) { return true } // exactHosts not found, fallback to loop allHosts hIsWildCarded := h.IsWildCarded() for _, importedHost := range hc.allHosts { // If both are exact hosts, then fallback is not needed. // In this scenario it should be determined by exact lookup.
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed Jun 05 20:32:23 UTC 2024 - 38.4K bytes - Viewed (0) -
cmd/encryption-v1.go
partStart = i break } cumulativeSum += size encPartSize, _ := sio.EncryptedSize(uint64(size)) encCumulativeSum += int64(encPartSize) } // partStart is always found in the loop above, // because off is validated. sseDAREEncPackageBlockSize := int64(SSEDAREPackageBlockSize + SSEDAREPackageMetaSize) startPkgNum := (off - cumulativeSum) / SSEDAREPackageBlockSize
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Thu Jun 13 06:56:12 UTC 2024 - 37.1K bytes - Viewed (0) -
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();
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 17 15:27:58 UTC 2024 - 21.2K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/AbstractIteratorTester.java
} } } private void recurse(int level) { // We're going to reuse the stimuli array 3^steps times by overwriting it // in a recursive loop. Sneaky. if (level == stimuli.length) { // We've filled the array. compareResultsForThisListOfStimuli(); } else { // Keep recursing to fill the array.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Jun 11 16:13:05 UTC 2024 - 21.3K bytes - Viewed (0)