- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 188 for near (0.03 sec)
-
android/guava-tests/test/com/google/common/math/MathTesting.java
return x.negate(); } }; /* * This list contains values that attempt to provoke overflow in integer operations. It contains * positive values on or near 2^N for N near multiples of 8 (near byte boundaries). */ static final ImmutableSet<Integer> POSITIVE_INTEGER_CANDIDATES; static final Iterable<Integer> NEGATIVE_INTEGER_CANDIDATES;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Oct 10 19:45:10 UTC 2022 - 11.2K bytes - Viewed (0) -
test/tighten.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 16 01:01:38 UTC 2023 - 513 bytes - Viewed (0) -
src/runtime/race/race_linux_test.go
} atomic.AddUint64(a, 1) if *a != 2 { t.Fatalf("bad atomic value: %v, want 2", *a) } } func TestAtomicPageBoundary(t *testing.T) { // Test that atomic access near (but not cross) a page boundary // doesn't fault. See issue 60825. // Mmap two pages of memory, and make the second page inaccessible, // so we have an address at the end of a page. pagesize := syscall.Getpagesize()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 16 14:09:02 UTC 2023 - 1.9K bytes - Viewed (0) -
guava/src/com/google/common/math/BigDecimalMath.java
* * <p>For the case of {@link RoundingMode#HALF_EVEN}, this implementation uses the IEEE 754 * default rounding mode: if the two nearest representable values are equally near, the one with * the least significant bit zero is chosen. (In such cases, both of the nearest representable * values are even integers; this method returns the one that is a multiple of a greater power of * two.) *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 23 18:45:50 UTC 2023 - 3.1K bytes - Viewed (0) -
releasenotes/notes/external-name.yaml
* `DestinationRule` can no longer apply to `ExternalName` services. Instead, create rules where the `host` references service. These changes are off-by-default in this release, but will be on-by-default in the near future.
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Fri Oct 27 03:08:29 UTC 2023 - 2.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/fmahash_test.go
// The hash-dependence on file path name is dodged by specifying "all hashes ending in 1" plus "all hashes ending in 0" // i.e., all hashes. This will print all the FMAs; this test is only interested in one of them (that should appear near the end). cmd.Env = append(cmd.Env, "GOCOMPILEDEBUG=fmahash=1/0", "GOOS=linux", "GOARCH=arm64", "HOME="+tmpdir) t.Logf("%v", cmd) t.Logf("%v", cmd.Env) b, e := cmd.CombinedOutput() if e != nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 14 21:57:53 UTC 2024 - 1.8K bytes - Viewed (0) -
android/guava/src/com/google/common/math/BigDecimalMath.java
* * <p>For the case of {@link RoundingMode#HALF_EVEN}, this implementation uses the IEEE 754 * default rounding mode: if the two nearest representable values are equally near, the one with * the least significant bit zero is chosen. (In such cases, both of the nearest representable * values are even integers; this method returns the one that is a multiple of a greater power of * two.) *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 23 18:45:50 UTC 2023 - 3.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
this.predecessor = null; this.successor = null; return result; } /* * For discussion of the safety of the following methods for operating on predecessors and * successors, see the comments near the end of CompactHashMap, noting that the methods here call * requirePredecessors() and requireSuccessors(), which are defined at the end of this file. */ private int getPredecessor(int entry) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Feb 05 21:38:59 UTC 2024 - 9.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
this.predecessor = null; this.successor = null; return result; } /* * For discussion of the safety of the following methods for operating on predecessors and * successors, see the comments near the end of CompactHashMap, noting that the methods here call * requirePredecessors() and requireSuccessors(), which are defined at the end of this file. */ private int getPredecessor(int entry) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Feb 05 21:38:59 UTC 2024 - 9.5K bytes - Viewed (0) -
samples/tlssurvey/src/main/kotlin/okhttp3/survey/RunSurvey.kt
val survey = CipherSuiteSurvey(clients = clients, ianaSuites = ianaSuitesNew, orderBy = orderBy) survey.printGoogleSheet() } fun rest(clients: List<Client>): List<SuiteId> { // combine all ciphers to get these near the top return clients.flatMap { it.enabled }
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Wed Apr 10 19:46:48 UTC 2024 - 3.5K bytes - Viewed (0)