- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 850 for Cmp (0.05 sec)
-
guava/src/com/google/common/collect/GeneralRange.java
int cmp = comparator.compare(getUpperEndpoint(), other.getUpperEndpoint()); if (cmp > 0 || (cmp == 0 && other.getUpperBoundType() == OPEN)) { upEnd = other.getUpperEndpoint(); upType = other.getUpperBoundType(); } } if (hasLowBound && hasUpBound) { int cmp = comparator.compare(lowEnd, upEnd);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 10.8K bytes - Viewed (0) -
src/internal/runtime/atomic/atomic_arm.s
MOVW ptr+0(FP), R1 MOVW old+4(FP), R2 MOVW new+8(FP), R3 casl: LDREX (R1), R0 CMP R0, R2 BNE casfail #ifndef GOARM_7 MOVB internal∕cpu·ARM+const_offsetARMHasV7Atomics(SB), R11 CMP $0, R11 BEQ 2(PC) #endif DMB MB_ISHST STREX R3, (R1), R0 CMP $0, R0 BNE casl MOVW $1, R0 #ifndef GOARM_7 CMP $0, R11 BEQ 2(PC) #endif DMB MB_ISH MOVB R0, ret+12(FP) RET casfail:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 5.7K bytes - Viewed (0) -
pkg/test/util/assert/assert.go
package assert import ( "fmt" "reflect" "strings" "time" "github.com/google/go-cmp/cmp" "github.com/google/go-cmp/cmp/cmpopts" "google.golang.org/protobuf/testing/protocmp" "istio.io/istio/pkg/ptr" "istio.io/istio/pkg/test" "istio.io/istio/pkg/test/util/retry" ) var compareErrors = cmp.Comparer(func(x, y error) bool { switch { case x == nil && y == nil: return true
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Mon Dec 18 17:21:50 UTC 2023 - 4.4K bytes - Viewed (0) -
src/cmd/go/testdata/script/work_edit.txt
! grep go go.work go work edit -go 1.18 cmp go.work go.work.want_go_118 go work edit -dropuse m cmp go.work go.work.want_dropuse_m go work edit -replace=x.1@v1.3.0=y.1@v1.4.0 -replace='x.1@v1.4.0 = ../z' cmp go.work go.work.want_add_replaces go work edit -use n -use ../a -use /b -use c -use c cmp go.work go.work.want_multiuse go work edit -dropuse /b -dropuse n cmp go.work go.work.want_multidropuse
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 13:52:10 UTC 2024 - 2.6K bytes - Viewed (0) -
src/slices/zsortordered.go
// Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. package slices import "cmp" // insertionSortOrdered sorts data[a:b] using insertion sort. func insertionSortOrdered[E cmp.Ordered](data []E, a, b int) { for i := a + 1; i < b; i++ { for j := i; j > a && cmp.Less(data[j], data[j-1]); j-- { data[j], data[j-1] = data[j-1], data[j] } } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 23 23:33:29 UTC 2023 - 12.4K bytes - Viewed (0) -
test/codegen/comparisons.go
// arm64:`CMN`,-`CMP` if a < -8 { c1 = 1 } // arm64:`CMN`,-`CMP` if a+1 == 0 { c2 = 1 } // arm64:`CMN`,-`CMP` if a+3 != 0 { c3 = 1 } // arm64:`CMN`,-`CMP` if a+b == 0 { c4 = 1 } // arm64:`CMN`,-`CMP` if b+c != 0 { c5 = 1 } // arm64:`CMN`,-`CMP` if a == -c { c6 = 1 } // arm64:`CMN`,-`CMP`
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 19 16:31:02 UTC 2024 - 15.2K bytes - Viewed (0) -
src/crypto/subtle/xor_ppc64x.s
STXVD2X VS32, (R3)(R8) STXVD2X VS33, (R3)(R9) ADD $32, R8 ADD $-32, R6 CMP R6, $8 BLE small // Case for 8 <= n < 32 bytes // Process 16 bytes if available xor16: CMP R6, $16 BLT xor8 LXVD2X (R4)(R8), VS32 LXVD2X (R5)(R8), VS33 XXLXOR VS32, VS33, VS32 STXVD2X VS32, (R3)(R8) ADD $16, R8 ADD $-16, R6 small: CMP R6, $0 BC 12,2,LR // BEQLR xor8: #ifdef GOPPC64_power10 SLD $56,R6,R17
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 18:17:17 UTC 2024 - 2.9K bytes - Viewed (0) -
src/sort/search.go
// } func Find(n int, cmp func(int) int) (i int, found bool) { // The invariants here are similar to the ones in Search. // Define cmp(-1) > 0 and cmp(n) <= 0 // Invariant: cmp(i-1) > 0, cmp(j) <= 0 i, j := 0, n for i < j { h := int(uint(i+j) >> 1) // avoid overflow when computing h // i ≤ h < j if cmp(h) > 0 { i = h + 1 // preserves cmp(i-1) > 0 } else {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 28 16:40:32 UTC 2023 - 5.7K bytes - Viewed (0) -
src/math/big/arith_ppc64x.s
ADD $-4, R11 // R11 = z_len - 4 BDNZ loop // We may have some elements to read CMP R11, $0 BEQ final tail: MOVDU 8(R8), R20 ADDZE R20, R24 ADD $-1, R11 MOVDU R24, 8(R10) CMP R11, $0 BEQ final MOVDU 8(R8), R20 ADDZE R20, R24 ADD $-1, R11 MOVDU R24, 8(R10) CMP R11, $0 BEQ final MOVD 8(R8), R20 ADDZE R20, R24 MOVD R24, 8(R10) final:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 18:17:17 UTC 2024 - 16.8K bytes - Viewed (0) -
src/internal/bytealg/index_ppc64x.s
ADD $20, R7, R9 // R+20 for all bytes to load CMP R9, LASTBYTE // Past end? Maybe check for extra? BLT index4loop // If not, continue loop CMP R7, LASTSTR // Check remainder BLE index2to16 // Process remainder BR notfound // Not found index5plus: CMP R6, $16 // Check for sep > 16 BGT index17plus // Handle large sep
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 21 16:47:45 UTC 2023 - 31.6K bytes - Viewed (0)