- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 19 for BarTest (0.37 sec)
-
guava/src/com/google/common/primitives/UnsignedBytes.java
@GwtIncompatible @ElementTypesAreNonnullByDefault public final class UnsignedBytes { private UnsignedBytes() {} /** * The largest power of two that can be represented as an unsigned {@code byte}. * * @since 10.0 */ public static final byte MAX_POWER_OF_TWO = (byte) 0x80; /** * The largest value that fits into an unsigned byte. * * @since 13.0 */ public static final byte MAX_VALUE = (byte) 0xFF;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 18.3K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedBytes.java
@GwtIncompatible @ElementTypesAreNonnullByDefault public final class UnsignedBytes { private UnsignedBytes() {} /** * The largest power of two that can be represented as an unsigned {@code byte}. * * @since 10.0 */ public static final byte MAX_POWER_OF_TWO = (byte) 0x80; /** * The largest value that fits into an unsigned byte. * * @since 13.0 */ public static final byte MAX_VALUE = (byte) 0xFF;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 18.3K bytes - Viewed (0) -
src/vendor/golang.org/x/crypto/sha3/sha3.go
// spongeSqueezing indicates that the sponge is being squeezed. spongeSqueezing ) const ( // maxRate is the maximum size of the internal buffer. SHAKE-256 // currently needs the largest buffer. maxRate = 168 ) type state struct { // Generic sponge components. a [25]uint64 // main state of the hash rate int // the number of bytes of state to use
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 16:19:04 UTC 2024 - 5.4K bytes - Viewed (0) -
src/math/big/float.go
panic(ErrNaN{"NewFloat(NaN)"}) } return new(Float).SetFloat64(x) } // Exponent and precision limits. const ( MaxExp = math.MaxInt32 // largest supported exponent MinExp = math.MinInt32 // smallest supported exponent MaxPrec = math.MaxUint32 // largest (theoretically) supported precision; likely memory-limited ) // Internal representation: The mantissa bits x.mant of a nonzero finite
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jun 06 15:46:54 UTC 2024 - 44.5K bytes - Viewed (0) -
src/cmd/compile/internal/liveness/plive.go
} } } } // Next, find the offset of the largest pointer in the largest node. var maxArgs int64 if maxArgNode != nil { maxArgs = maxArgNode.FrameOffset() + types.PtrDataSize(maxArgNode.Type()) } // Size locals bitmaps to be stkptrsize sized. // We cannot shrink them to only hold the largest pointer, // because their size is used to calculate the beginning
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 15:22:22 UTC 2024 - 45.2K bytes - Viewed (0) -
pkg/scheduler/framework/plugins/noderesources/fit.go
handle: h, resourceAllocationScorer: *scorePlugin(args), }, nil } // computePodResourceRequest returns a framework.Resource that covers the largest // width in each resource dimension. Because init-containers run sequentially, we collect // the max in each dimension iteratively. In contrast, we sum the resource vectors for // regular containers since they run simultaneously.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jun 12 13:26:09 UTC 2024 - 20.2K bytes - Viewed (0) -
pkg/controller/statefulset/stateful_set_utils.go
return nil, err } return restoredSet, nil } // nextRevision finds the next valid revision number based on revisions. If the length of revisions // is 0 this is 1. Otherwise, it is 1 greater than the largest revision's Revision. This method // assumes that revisions has been sorted by Revision. func nextRevision(revisions []*apps.ControllerRevision) int64 { count := len(revisions) if count <= 0 { return 1 }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jun 05 19:06:41 UTC 2024 - 26.7K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/ir/tfl_ops.td
} def TFL_ArgMaxOp : TFL_Op<"arg_max", [ QuantizableResult, Pure]> { let summary = "ArgMax operator"; let description = [{ Returns the index with the largest value across dimensions of a tensor. }]; let arguments = ( ins TFL_TensorOf<[I1, F32, I32, I8, UI8, QI8, QUI8]>:$input, TFL_I32OrI64Tensor:$dim ); let results = (outs
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Jun 06 19:09:08 UTC 2024 - 186K bytes - Viewed (0) -
src/time/format.go
} v *= unit if f > 0 { // float64 is needed to be nanosecond accurate for fractions of hours. // v >= 0 && (f*unit/scale) <= 3.6e+12 (ns/h, h is the largest unit) v += uint64(float64(f) * (float64(unit) / scale)) if v > 1<<63 { // overflow return 0, errors.New("time: invalid duration " + quote(orig)) } } d += v if d > 1<<63 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 11 17:09:28 UTC 2024 - 49.3K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/ir/tf_generated_ops.td
def TF_TopKV2Op : TF_Op<"TopKV2", [Pure]> { let summary = [{ Finds values and indices of the `k` largest elements for the last dimension. }]; let description = [{ If the input is a vector (rank-1), finds the `k` largest entries in the vector and outputs their values and indices as vectors. Thus `values[j]` is the `j`-th largest entry in `input`, and its index is `indices[j]`.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jun 11 23:24:08 UTC 2024 - 793K bytes - Viewed (0)