- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 46 for leftmost (0.12 sec)
-
test/chan/goroutines.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun Feb 19 06:44:02 UTC 2012 - 743 bytes - Viewed (0) -
src/crypto/rsa/pss.go
if em[emLen-1] != 0xbc { return ErrVerification } // 5. Let maskedDB be the leftmost emLen - hLen - 1 octets of EM, and // let H be the next hLen octets. db := em[:emLen-hLen-1] h := em[emLen-hLen-1 : emLen-1] // 6. If the leftmost 8 * emLen - emBits bits of the leftmost octet in // maskedDB are not all equal to zero, output "inconsistent" and // stop.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 00:11:18 UTC 2024 - 11K bytes - Viewed (0) -
src/cmd/cgo/internal/teststdio/testdata/chain.go
stdio.Stdout.WriteString(strconv.Itoa(v) + "\n") left <- 1 + v } } func main() { leftmost := make(chan int) var left chan int right := leftmost for i := 0; i < N; i++ { left, right = right, make(chan int) go link(left, right) } for i := 0; i < R; i++ { right <- 0 x := <-leftmost stdio.Stdout.WriteString(strconv.Itoa(x) + "\n") }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 12 11:59:56 UTC 2023 - 914 bytes - Viewed (0) -
src/internal/cpu/cpu_s390x.go
package cpu const CacheLinePadSize = 256 var HWCap uint // bitIsSet reports whether the bit at index is set. The bit index // is in big endian order, so bit index 0 is the leftmost bit. func bitIsSet(bits []uint64, index uint) bool { return bits[index/64]&((1<<63)>>(index%64)) != 0 } // function is the function code for the named function. type function uint8 const (
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 22 17:11:03 UTC 2020 - 5.9K bytes - Viewed (0) -
src/internal/bytealg/index_s390x.s
VCEQH V1, V2, V5 // compare even indices VCEQH V1, V4, V6 // compare odd indices VSEL V5, V6, V31, V7 // merge even and odd indices VFEEBS V16, V7, V17 // find leftmost index, set condition to 1 if found BLT foundV17 MOVD $16(R7), R7 // R7+=16 ADD $15, R7, R9 CMPBLE R9, R2, index2loop // continue if (R7+15) <= R2 (last index to search) CMPBLE R7, R2, index2to16 BR notfound
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun Mar 04 19:49:44 UTC 2018 - 5.5K bytes - Viewed (0) -
src/regexp/regexp.go
// begins as early as possible in the input (leftmost), and among those // it chooses the one that a backtracking search would have found first. // This so-called leftmost-first matching is the same semantics // that Perl, Python, and other implementations use, although this // package implements it without the expense of backtracking. // For POSIX leftmost-longest matching, see [CompilePOSIX].
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 26 20:50:01 UTC 2024 - 38.5K bytes - Viewed (0) -
src/vendor/golang.org/x/sys/cpu/cpu_s390x.go
{Name: "vx", Feature: &S390X.HasVX}, {Name: "vxe", Feature: &S390X.HasVXE}, } } // bitIsSet reports whether the bit at index is set. The bit index // is in big endian order, so bit index 0 is the leftmost bit. func bitIsSet(bits []uint64, index uint) bool { return bits[index/64]&((1<<63)>>(index%64)) != 0 } // facility is a bit index for the named facility. type facility uint8 const (
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Nov 02 15:41:00 UTC 2020 - 4.9K bytes - Viewed (0) -
src/index/suffixarray/sais.go
// so the caller must pretend that sa[-1] == len(text), as noted above. // The second difference is that the first leftmost LMS-substring start index // does not end an earlier LMS-substring, so as an optimization we can omit // that leftmost LMS-substring start index (the last one we wrote). // // Exception: if numLMS <= 1, the caller is not going to bother with
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 18 23:57:18 UTC 2024 - 32.4K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/publicsuffix/PublicSuffixDatabase.kt
} } // In theory, wildcard rules are not restricted to having the wildcard in the leftmost position. // In practice, wildcards are always in the leftmost position. For now, this implementation // cheats and does not attempt every possible permutation. Instead, it only considers wildcards // in the leftmost position. We assert this fact when we generate the public suffix file. If
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 11.7K bytes - Viewed (0) -
src/index/suffixarray/sais2.go
// so the caller must pretend that sa[-1] == len(text), as noted above. // The second difference is that the first leftmost LMS-substring start index // does not end an earlier LMS-substring, so as an optimization we can omit // that leftmost LMS-substring start index (the last one we wrote). // // Exception: if numLMS <= 1, the caller is not going to bother with
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 18 23:57:18 UTC 2024 - 52.3K bytes - Viewed (0)