- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 11 for nonnegative (0.23 sec)
-
src/runtime/error.go
// That means we'd need 65 bits to encode all possible indexes, from -2^63 to 2^64-1. // Instead, we keep track of whether x should be interpreted as signed or unsigned. // y is known to be nonnegative and to fit in an int. signed bool code boundsErrorCode } type boundsErrorCode uint8 const ( boundsIndex boundsErrorCode = iota // s[x], 0 <= x < len(s) failed
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 19:10:41 UTC 2024 - 9.9K bytes - Viewed (0) -
src/crypto/internal/edwards25519/field/fe.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 11.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ConcurrentHashMultiset.java
} // Query Operations /** * Returns the number of occurrences of {@code element} in this multiset. * * @param element the element to look for * @return the nonnegative number of occurrences of the element */ @Override public int count(@CheckForNull Object element) { AtomicInteger existingCounter = Maps.safeGet(countMap, element);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 20.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/ConcurrentHashMultiset.java
} // Query Operations /** * Returns the number of occurrences of {@code element} in this multiset. * * @param element the element to look for * @return the nonnegative number of occurrences of the element */ @Override public int count(@CheckForNull Object element) { AtomicInteger existingCounter = Maps.safeGet(countMap, element);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 20.9K bytes - Viewed (0) -
guava/src/com/google/common/primitives/UnsignedLongs.java
x >>>= shift; } while (x != 0); } else { // Separate off the last digit using unsigned division. That will leave // a number that is nonnegative as a signed integer. long quotient; if ((radix & 1) == 0) { // Fast path for the usual case where the radix is even. quotient = (x >>> 1) / (radix >>> 1); } else {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 17.6K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedLongs.java
x >>>= shift; } while (x != 0); } else { // Separate off the last digit using unsigned division. That will leave // a number that is nonnegative as a signed integer. long quotient; if ((radix & 1) == 0) { // Fast path for the usual case where the radix is even. quotient = (x >>> 1) / (radix >>> 1); } else {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 17.6K bytes - Viewed (0) -
src/internal/abi/type.go
if n.Bytes == nil { return false } _, l := n.ReadVarint(1) return l == 1 && *n.Data(2) == '_' } // writeVarint writes n to buf in varint form. Returns the // number of bytes written. n must be nonnegative. // Writes at most 10 bytes. func writeVarint(buf []byte, n int) int { for i := 0; ; i++ { b := byte(n & 0x7f) n >>= 7 if n == 0 { buf[i] = b return i + 1 } buf[i] = b | 0x80
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 17 21:09:59 UTC 2024 - 21.8K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/analysis/side_effect_analysis.cc
#include "tensorflow/compiler/mlir/tensorflow/ir/tf_types.h" namespace mlir { namespace TF { namespace { // A collection of Resource IDs. Note that `kUnknownResourceId` is smaller than // all other resource IDs which are nonnegative (see check above) so it will // always be the first element of a `ResourceIdSet` (we make use of this). using ResourceIdSet = llvm::SmallSet<ResourceId, 8>;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed May 15 09:04:13 UTC 2024 - 41.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multisets.java
static final Comparator<Entry<?>> INSTANCE = new DecreasingCount(); @Override public int compare(Entry<?> entry1, Entry<?> entry2) { return entry2.getCount() - entry1.getCount(); // subtracting two nonnegative integers } } /** * An {@link AbstractMultiset} with additional default implementations, some of them linear-time * implementations in terms of {@code elementSet} and {@code entrySet}.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun Jun 02 13:36:19 UTC 2024 - 41.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/Multisets.java
static final Comparator<Entry<?>> INSTANCE = new DecreasingCount(); @Override public int compare(Entry<?> entry1, Entry<?> entry2) { return entry2.getCount() - entry1.getCount(); // subtracting two nonnegative integers } } /** * An {@link AbstractMultiset} with additional default implementations, some of them linear-time * implementations in terms of {@code elementSet} and {@code entrySet}.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 41.4K bytes - Viewed (0)