- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 5,923 for Fits (0.05 sec)
-
src/cmd/internal/obj/ppc64/doc.go
6. Shift instructions The simple scalar shifts on PPC64 expect a shift count that fits in 5 bits for 32-bit values or 6 bit for 64-bit values. If the shift count is a constant value greater than the max then the assembler sets it to the max for that size (31 for 32 bit values, 63 for 64 bit values). If the shift count is in a register, then only the low 5 or 6 bits of the register will be used as the shift count. The
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 21 16:47:45 UTC 2023 - 11.3K bytes - Viewed (0) -
src/cmd/internal/test2json/test2json.go
// and the converter writes JSON output to w. type Converter struct { w io.Writer // JSON output stream pkg string // package to name in events mode Mode // mode bits start time.Time // time converter started testName string // name of current test, for output attribution report []*event // pending test result reports (nested for subtests)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 09 17:33:07 UTC 2022 - 14.5K bytes - Viewed (0) -
src/go/printer/nodes.go
prevSize := size const infinity = 1e6 // larger than any source line size = p.nodeSize(x, infinity) pair, isPair := x.(*ast.KeyValueExpr) if size <= infinity && prev.IsValid() && next.IsValid() { // x fits on a single line if isPair { size = p.nodeSize(pair.Key, infinity) // size <= infinity } } else { // size too large or we don't have good layout information size = 0 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Oct 17 18:53:17 UTC 2023 - 52.6K bytes - Viewed (0) -
cluster/gce/gci/configure-kubeapiserver.sh
# Lumberjack doesn't offer any way to disable size-based rotation. It also # has an in-memory counter that doesn't notice if you truncate the file. # 2000000000 (in MiB) is a large number that fits in 31 bits. If the log # grows at 10MiB/s (~30K QPS), it will rotate after ~6 years if apiserver # never restarts. Please manually restart apiserver before this time. params+=" --audit-log-maxsize=2000000000"
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Jun 07 11:08:30 UTC 2024 - 25.8K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedBytes.java
} /** * Sorts the array, treating its elements as unsigned bytes. * * @since 23.1 */ public static void sort(byte[] array) { checkNotNull(array); sort(array, 0, array.length); } /** * Sorts the array between {@code fromIndex} inclusive and {@code toIndex} exclusive, treating its * elements as unsigned bytes. * * @since 23.1 */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 18.3K bytes - Viewed (0) -
pkg/scheduler/framework/plugins/defaultpreemption/default_preemption_test.go
st.MakePod().Name("p2").UID("p2").Node("node2").Priority(midPriority).Obj(), }, expected: [][]candidate{{}}, expectedNumFilterCalled: []int32{2}, }, { name: "a pod that fits with no preemption", registerPlugins: []tf.RegisterPluginFunc{ tf.RegisterFilterPlugin("TrueFilter", tf.NewTrueFilterPlugin), }, nodeNames: []string{"node1", "node2"}, testPods: []*v1.Pod{
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri May 31 15:52:16 UTC 2024 - 82.8K bytes - Viewed (0) -
pkg/scheduler/framework/plugins/podtopologyspread/filtering_test.go
// but in this unit test, we don't run NodeAffinity/TaintToleration Predicate, so node-b and node-x are // still expected to be fits; // the fact that node-a fits can prove the underlying logic works name: "incoming pod has nodeAffinity, pods spread as 2/~1~/~0~/3, hence node-a fits", pod: st.MakePod().Name("p").Label("foo", ""). NodeAffinityIn("node", []string{"node-a", "node-y"}).
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Feb 28 10:42:29 UTC 2024 - 143.1K bytes - Viewed (0) -
src/compress/flate/huffman_bit_writer.go
if w.err != nil { return } w.bits |= uint64(c.code) << w.nbits w.nbits += uint(c.len) if w.nbits >= 48 { bits := w.bits w.bits >>= 48 w.nbits -= 48 n := w.nbytes bytes := w.bytes[n : n+6] bytes[0] = byte(bits) bytes[1] = byte(bits >> 8) bytes[2] = byte(bits >> 16) bytes[3] = byte(bits >> 24) bytes[4] = byte(bits >> 32) bytes[5] = byte(bits >> 40) n += 6
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Sep 29 22:59:14 UTC 2022 - 18.4K bytes - Viewed (0) -
src/slices/slices.go
// Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. // Package slices defines various functions useful with slices of any type. package slices import ( "cmp" "math/bits" "unsafe" ) // Equal reports whether two slices are equal: the same length and all // elements equal. If the lengths are different, Equal returns false.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 29 14:01:59 UTC 2024 - 13.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/magic.go
// So RotRight(x, k) == ⎣x/(2^k)⎦ <= ⎣a/(2^k)⎦ // // If x does not end in k zero bits, then RotRight(x, k) // has some non-zero bits in the k highest bits. // ⎣x/(2^k)⎦ has all zeroes in the k highest bits, // so RotRight(x, k) > ⎣x/(2^k)⎦ // // Finally, if x > a and has k trailing zero bits, then RotRight(x, k) == ⎣x/(2^k)⎦
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 26 19:58:25 UTC 2024 - 15.8K bytes - Viewed (0)