- Sort Score
- Result 10 results
- Languages All
Results 91 - 100 of 199 for Shift2 (0.11 sec)
-
cmd/kubeadm/app/cmd/completion.go
} __kubeadm_compgen() { local completions w completions=( $(compgen "$@") ) || return $? # filter by given word as prefix while [[ "$1" = -* && "$1" != -- ]]; do shift shift done if [[ "$1" == -- ]]; then shift fi for w in "${completions[@]}"; do if [[ "${w}" = "$1"* ]]; then echo "${w}" fi done } __kubeadm_compopt() {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Dec 25 09:28:34 UTC 2023 - 8.1K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/analysis/passes/shift/dead.go
// Copyright 2017 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. package shift // Simplified dead code detector. // Used for skipping shift checks on unreachable arch-specific code. import ( "go/ast" "go/constant" "go/types" ) // updateDead puts unreachable "if" and "case" nodes into dead.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 06 18:23:38 UTC 2018 - 2.2K bytes - Viewed (0) -
src/main/java/jcifs/pac/PacDataInputStream.java
this.size = in.available(); } public void align ( int mask ) throws IOException { int position = this.size - this.dis.available(); int shift = position & mask - 1; if ( mask != 0 && shift != 0 ) this.dis.skip(mask - shift); } public int available () throws IOException { return this.dis.available(); }
Registered: Wed Jun 12 15:45:55 UTC 2024 - Last Modified: Sat Jul 21 21:19:58 UTC 2018 - 5.1K bytes - Viewed (0) -
guava/src/com/google/common/math/DoubleUtils.java
* top SIGNIFICAND_BITS + 1. * * It helps to consider the real number signif = absX * 2^(SIGNIFICAND_BITS - exponent). */ int shift = exponent - SIGNIFICAND_BITS - 1; long twiceSignifFloor = absX.shiftRight(shift).longValue(); long signifFloor = twiceSignifFloor >> 1; signifFloor &= SIGNIFICAND_MASK; // remove the implied bit /*
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Apr 28 15:37:52 UTC 2021 - 5.1K bytes - Viewed (0) -
test/fixedbugs/issue50854.go
//go:noinline func f(p int64, x, y int64) bool { return -x <= p && p <= y } //go:noinline func g(p int32, x, y int32) bool { return -x <= p && p <= y } // There are some more complicated patterns involving compares and shifts, try to trigger those. //go:noinline func h(p int64, x, y int64) bool { return -(x<<1) <= p && p <= y } //go:noinline func k(p int32, x, y int32) bool { return -(1<<x) <= p && p <= y } //go:noinline
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jan 27 19:52:52 UTC 2022 - 890 bytes - Viewed (0) -
hack/lib/verify-generated.sh
kube::verify::generated() { ( # a subshell prevents environment changes from leaking out of this function local failure_header=$1 shift local failure_tail=$1 shift kube::util::ensure_clean_working_dir # This sets up the environment, like GOCACHE, which keeps the worktree cleaner. kube::golang::setup_env
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Aug 22 18:39:23 UTC 2023 - 2.2K bytes - Viewed (0) -
src/vendor/golang.org/x/net/http2/hpack/huffman.go
codeLen -= 8 i := uint8(code >> codeLen) if cur.children[i] == nil { cur.children[i] = newInternalNode() } cur = cur.children[i] } shift := 8 - codeLen start, end := int(uint8(code<<shift)), int(1<<shift) leaves[sym].sym = byte(sym) leaves[sym].codeLen = codeLen for i := start; i < start+end; i++ { cur.children[i] = &leaves[sym] } } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Aug 05 19:54:32 UTC 2022 - 5.8K bytes - Viewed (0) -
android/guava/src/com/google/common/math/DoubleUtils.java
* top SIGNIFICAND_BITS + 1. * * It helps to consider the real number signif = absX * 2^(SIGNIFICAND_BITS - exponent). */ int shift = exponent - SIGNIFICAND_BITS - 1; long twiceSignifFloor = absX.shiftRight(shift).longValue(); long signifFloor = twiceSignifFloor >> 1; signifFloor &= SIGNIFICAND_MASK; // remove the implied bit /*
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Apr 28 15:37:52 UTC 2021 - 5.1K bytes - Viewed (0) -
src/net/interface_unix_test.go
} else { time.Sleep(3 * time.Millisecond) } ift2, err := Interfaces() if err != nil { ti.teardown() t.Fatal(err) } if len(ift2) <= len(ift1) { for _, ifi := range ift1 { t.Logf("before: %v", ifi) } for _, ifi := range ift2 { t.Logf("after: %v", ifi) } ti.teardown() t.Fatalf("got %v; want gt %v", len(ift2), len(ift1)) } for _, ifi := range ift2 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jul 18 23:51:35 UTC 2023 - 4.9K bytes - Viewed (0) -
test/codegen/issue42610.go
// asmcheck // Copyright 2020 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. // Don't allow 0 masks in shift lowering rules on ppc64x. // See issue 42610. package codegen func f32(a []int32, i uint32) { g := func(p int32) int32 { i = uint32(p) * (uint32(p) & (i & 1)) return 1 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jan 27 18:24:12 UTC 2023 - 623 bytes - Viewed (0)