- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 553 for Shift1 (0.1 sec)
-
src/math/big/arith_test.go
{argshlVUIn, 7, 0, 1, 1, argshlVUr1, 0, "partial overlap by 6 Words of shlVU and shift of 1"}, {argshlVUIn, 7, 0, 1, _W - 1, argshlVUrWm1, 32, "partial overlap by 6 Words of shlVU and shift of _W - 1"}, {argshlVUIn, 7, 0, 2, 0, argshlVUr0, 0, "partial overlap by 5 Words of shlVU and shift of 0"}, {argshlVUIn, 7, 0, 2, 1, argshlVUr1, 0, "partial overlap by 5 Words of shlVU and shift of 1"},
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 02 14:43:52 UTC 2022 - 19.9K bytes - Viewed (0) -
src/compress/flate/testdata/huffman-text-shift.wb.expect
Klaus Post <******@****.***> 1457448890 +0100
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 11 17:40:52 UTC 2016 - 231 bytes - Viewed (0) -
src/cmd/compile/internal/types2/expr.go
case *Map: return "map" case *Chan: return "chan" default: return check.sprintf("%s", typ) // catch-all } } // If e != nil, it must be the shift expression; it may be nil for non-constant shifts. func (check *Checker) shift(x, y *operand, e syntax.Expr, op syntax.Operator) { // TODO(gri) This function seems overly complex. Revisit. var xval constant.Value if x.mode == constant_ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 02:09:54 UTC 2024 - 51.7K bytes - Viewed (0) -
src/cmd/internal/obj/arm64/doc.go
The instructions are MOVK(W), MOVZ(W) and MOVN(W), the assembly syntax is "op $(uimm16<<shift), <Rd>". The <uimm16> is the 16-bit unsigned immediate, in the range 0 to 65535; For the 32-bit variant, the <shift> is 0 or 16, for the 64-bit variant, the <shift> is 0, 16, 32 or 48. The current Go assembler does not accept zero shifts, such as "op $0, Rd" and "op $(0<<(16|32|48)), Rd" instructions. Examples:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Aug 07 00:21:42 UTC 2023 - 9.6K bytes - Viewed (0) -
src/compress/flate/deflatefast.go
e.table[i] = tableEntry{} } e.cur = maxMatchOffset + 1 return } // Shift down everything in the table that isn't already too far away. for i := range e.table[:] { v := e.table[i].offset - e.cur + maxMatchOffset + 1 if v < 0 { // We want to reset e.cur to maxMatchOffset + 1, so we need to shift // all table entries down by (e.cur - (maxMatchOffset + 1)).
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 19 18:48:17 UTC 2020 - 9.4K bytes - Viewed (0) -
src/compress/flate/testdata/huffman-text-shift.dyn.expect
Klaus Post <******@****.***> 1457448890 +0100
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 11 17:40:52 UTC 2016 - 231 bytes - Viewed (0) -
src/cmd/compile/internal/test/testdata/gen/arithConstGen.go
fncCnst1.Execute(w, fd) fd.Number = number } fncCnst2.Execute(w, fd) } } // signed test cases if len(s.i) > 0 { // don't generate tests for shifts by signed integers if o.name == "lsh" || o.name == "rsh" { continue } for _, i := range s.i { fd.Number = fmt.Sprintf("%d", i) fd.FNumber = strings.Replace(fd.Number, "-", "Neg", -1)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Sep 20 02:13:02 UTC 2022 - 8.3K bytes - Viewed (0) -
staging/src/k8s.io/apimachinery/pkg/apis/meta/v1/generated.pb.go
iNdEx := 0 for iNdEx < l { preIndex := iNdEx var wire uint64 for shift := uint(0); ; shift += 7 { if shift >= 64 { return ErrIntOverflowGenerated } if iNdEx >= l { return io.ErrUnexpectedEOF } b := dAtA[iNdEx] iNdEx++ wire |= uint64(b&0x7F) << shift if b < 0x80 { break } } fieldNum := int32(wire >> 3)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Mar 01 06:06:37 UTC 2024 - 281.4K bytes - Viewed (0) -
staging/src/k8s.io/api/events/v1/generated.pb.go
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Mar 01 06:06:37 UTC 2024 - 35.6K bytes - Viewed (0) -
staging/src/k8s.io/api/storage/v1alpha1/generated.pb.go
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Mar 01 06:06:37 UTC 2024 - 76.5K bytes - Viewed (0)