- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 5,716 for tall (0.08 sec)
-
maven-model-builder/src/test/resources/poms/validation/raw-model/ok-ci-friendly-all-expressions.xml
Michael Osipov <******@****.***> 1608835827 +0100
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Thu Dec 24 18:50:27 UTC 2020 - 1.3K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/testers/ListSubListTester.java
assertEquals(0, tail.indexOf(list.get(1))); // The following assumes all elements are distinct. assertEquals(size - 1, copy.indexOf(list.get(size - 1))); assertEquals(size - 2, head.indexOf(list.get(size - 2))); assertEquals(size - 2, tail.indexOf(list.get(size - 1))); assertEquals(-1, head.indexOf(list.get(size - 1))); assertEquals(-1, tail.indexOf(list.get(0))); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 21 16:49:06 UTC 2024 - 13.4K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/testers/ListSubListTester.java
assertEquals(0, tail.indexOf(list.get(1))); // The following assumes all elements are distinct. assertEquals(size - 1, copy.indexOf(list.get(size - 1))); assertEquals(size - 2, head.indexOf(list.get(size - 2))); assertEquals(size - 2, tail.indexOf(list.get(size - 1))); assertEquals(-1, head.indexOf(list.get(size - 1))); assertEquals(-1, tail.indexOf(list.get(0))); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 21 16:49:06 UTC 2024 - 13.4K bytes - Viewed (0) -
src/runtime/mspanset.go
func (b *spanSet) reset() { head, tail := b.index.load().split() if head < tail { print("head = ", head, ", tail = ", tail, "\n") throw("attempt to clear non-empty span set") } top := head / spanSetBlockEntries if uintptr(top) < b.spineLen.Load() { // If the head catches up to the tail and the set is empty, // we may not clean up the block containing the head and tail
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 13.1K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
* we must return it in the following next() call even if it was in the process of being removed * when hasNext() was called. */ private @Nullable E nextItem; /** * Index of element returned by most recent call to next. Reset to -1 if this element is deleted * by a call to remove. */ private int lastRet; Itr() { lastRet = -1;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Apr 19 19:24:36 UTC 2023 - 22.5K bytes - Viewed (0) -
src/runtime/proflabel.go
// Copyright 2017 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. package runtime import "unsafe" var labelSync uintptr // runtime_setProfLabel should be an internal detail, // but widely used packages access it using linkname. // Notable members of the hall of shame include: // - github.com/cloudwego/localsession
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 16:25:21 UTC 2024 - 2.1K bytes - Viewed (0) -
src/runtime/symtab.go
f.frames = f.frameStore[:0] return f } // Next returns a [Frame] representing the next call frame in the slice // of PC values. If it has already returned all call frames, Next // returns a zero [Frame]. // // The more result indicates whether the next call to Next will return // a valid [Frame]. It does not necessarily indicate whether this call // returned one. // // See the [Frames] example for idiomatic usage.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 40K bytes - Viewed (0) -
src/testdata/Isaac.Newton-Opticks.txt
DEFIN. VII _The Light whose Rays are all alike Refrangible, I call Simple, Homogeneal and Similar; and that whose Rays are some more Refrangible than others, I call Compound, Heterogeneal and Dissimilar._ The former Light I call Homogeneal, not because I would affirm it so in all respects, but because the Rays which agree in Refrangibility, agree at least in all those their other Properties which I consider in the
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 01 16:16:21 UTC 2018 - 553.9K bytes - Viewed (0) -
src/runtime/cgo_sigaction.go
// // Mark the input as having been written before the call // and the output as read after. if msanenabled && new != nil { msanwrite(unsafe.Pointer(new), unsafe.Sizeof(*new)) } if asanenabled && new != nil { asanwrite(unsafe.Pointer(new), unsafe.Sizeof(*new)) } if _cgo_sigaction == nil || inForkedChild { sysSigaction(sig, new, old) } else { // We need to call _cgo_sigaction, which means we need a big enough stack
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 05 17:54:15 UTC 2022 - 3.3K bytes - Viewed (0) -
src/compress/bzip2/testdata/Isaac.Newton-Opticks.txt.bz2
Angles of Incidence, Reflexion, and Refraction._ DEFIN. VII _The Light whose Rays are all alike Refrangible, I call Simple, Homogeneal and Similar; and that whose Rays are some more Refrangible than others, I call Compound, Heterogeneal and Dissimilar._ The former Light I call Homogeneal, not because I would affirm it so in all respects, but because the Rays which agree in Refrangibility, agree at least in all those their other Properties which I consider in the following Discourse. DEFIN. VIII....
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Sep 24 18:26:02 UTC 2018 - 129.4K bytes - Viewed (0)