- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 46 for leftmost (0.21 sec)
-
src/hash/crc32/crc32_s390x.s
// 2. T2(x) = floor( T1(x) / x^32 ) GF2MUL P(x) // 3. C(x) = R(x) XOR T2(x) mod x^32 // // Note: To compensate the division by x^32, use the vector unpack // instruction to move the leftmost word into the leftmost doubleword // of the vector register. The rightmost doubleword is multiplied // with zero to not contribute to the intermediate results. // T1(x) = floor( R(x) / x^32 ) GF2MUL u VUPLLF V1, V2
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 20 00:49:17 UTC 2021 - 7.6K bytes - Viewed (0) -
okhttp/src/test/java/okhttp3/internal/publicsuffix/PublicSuffixListGenerator.kt
*/ private fun assertWildcardRule(rule: String) { check(rule.startsWith(WILDCARD_CHAR)) { """Wildcard Assertion Failure: '$rule' A wildcard rule was added with a wildcard that is not in leftmost position! We'll need to change the ${PublicSuffixDatabase::class.java.name} to handle this.""" } check(rule.indexOf(WILDCARD_CHAR, 1) == -1) { """Wildcard Assertion Failure: '$rule'
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Thu Apr 18 01:24:38 UTC 2024 - 6K bytes - Viewed (0) -
tensorflow/cc/gradients/linalg_grad.cc
// the ellipsis is not present), and the negative index if it occurs after the // ellipsis. E.g. index of `b` in `ab...cd`, is `1`, but that of `c` is `-2`. // // For multiple occurrences, returns the leftmost one. If not found, returns // absl::nullopt. // // Parameters: // subscripts: A string denoting the einsum subscript (e.g. `ab...cd`) // label: The single character axis label.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Mar 07 23:11:54 UTC 2022 - 20.4K bytes - Viewed (0) -
src/regexp/backtrack.go
freeBitState(b) return nil } pos += advance } if len(b.cap) > 0 { b.cap[0] = pos } if re.tryBacktrack(b, i, uint32(re.prog.Start), pos) { // Match must be leftmost; done. goto Match } _, width = i.step(pos) } freeBitState(b) return nil } Match: dstCap = append(dstCap, b.matchcap...) freeBitState(b) return dstCap
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Sep 14 17:25:39 UTC 2023 - 8.8K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/CertificatePinner.kt
* no pinning will be enforced if additional prefixes are present, or if no prefixes are present. * * Note that any other form is unsupported. You may not use asterisks in any position other than * the leftmost label. * * If multiple patterns match a hostname, any match is sufficient. For example, suppose pin A * applies to `*.publicobject.com` and pin B applies to `api.publicobject.com`. Handshakes for
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 14.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TopKSelector.java
*/ @SuppressWarnings("nullness") // TODO: b/316358623 - Remove after checker fix. private void trim() { int left = 0; int right = 2 * k - 1; int minThresholdPosition = 0; // The leftmost position at which the greatest of the k lower elements // -- the new value of threshold -- might be found. int iterations = 0; int maxIterations = IntMath.log2(right - left, RoundingMode.CEILING) * 3;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 11.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/TopKSelector.java
*/ @SuppressWarnings("nullness") // TODO: b/316358623 - Remove after checker fix. private void trim() { int left = 0; int right = 2 * k - 1; int minThresholdPosition = 0; // The leftmost position at which the greatest of the k lower elements // -- the new value of threshold -- might be found. int iterations = 0; int maxIterations = IntMath.log2(right - left, RoundingMode.CEILING) * 3;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 11.2K bytes - Viewed (0) -
android/guava/src/com/google/common/net/InternetDomainName.java
registrySuffixIndexLocal = findSuffixOfType(Optional.of(PublicSuffixType.REGISTRY)); } return registrySuffixIndexLocal; } /** * Returns the index of the leftmost part of the suffix, or -1 if not found. Note that the value * defined as a suffix may not produce {@code true} results from {@link #isPublicSuffix()} or
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Feb 05 20:47:23 UTC 2024 - 28K bytes - Viewed (0) -
src/cmd/internal/obj/s390x/a.out.go
AMOVHBR AMOVHZ AMOVW AMOVWZ AMOVD AMOVDBR // conditional moves AMOVDEQ AMOVDGE AMOVDGT AMOVDLE AMOVDLT AMOVDNE ALOCR ALOCGR // find leftmost one AFLOGR // population count APOPCNT // integer bitwise AAND AANDW AOR AORW AXOR AXORW ASLW ASLD ASRW ASRAW ASRD ASRAD ARLL
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Sep 05 16:41:03 UTC 2023 - 12.4K bytes - Viewed (0) -
src/net/addrselect.go
return scopeSiteLocal } return scopeGlobal } // commonPrefixLen reports the length of the longest prefix (looking // at the most significant, or leftmost, bits) that the // two addresses have in common, up to the length of a's prefix (i.e., // the portion of the address not including the interface ID). // // If a or b is an IPv4 address as an IPv6 address, the IPv4 addresses
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 09 00:24:06 UTC 2024 - 9.7K bytes - Viewed (0)