- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 69 for Shift (0.06 sec)
-
android/guava/src/com/google/common/hash/Murmur3_32HashFunction.java
} } long buffer = 0; int shift = 0; for (; i < utf16Length; i++) { char c = input.charAt(i); if (c < 0x80) { buffer |= (long) c << shift; shift += 8; len++; } else if (c < 0x800) { buffer |= charToTwoUtf8Bytes(c) << shift; shift += 16; len += 2;
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Apr 14 16:36:11 UTC 2025 - 11.8K bytes - Viewed (0) -
src/cmd/asm/internal/lex/lex.go
// a rune/ScanToken value for them - ugly but simple. LSH ScanToken = -1000 - iota // << Left shift. RSH // >> Logical right shift. ARR // -> Used on ARM for shift type 3, arithmetic right shift. ROT // @> Used on ARM for shift type 4, rotate right. Include // included file started here
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Tue Aug 29 18:31:05 UTC 2023 - 4.1K bytes - Viewed (0) -
src/cmd/asm/internal/asm/expr_test.go
{"3%0", "modulo by zero"}, {"(1<<63)%0", "modulo of value with high bit set"}, {"3<<-4", "negative left shift count"}, {"3<<(1<<63)", "negative left shift count"}, {"3>>-4", "negative right shift count"}, {"3>>(1<<63)", "negative right shift count"}, {"(1<<63)>>2", "right shift of value with high bit set"}, {"(1<<62)>>2", ""}, {`'\x80'`, "illegal UTF-8 encoding for character constant"},
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Tue Aug 29 07:48:38 UTC 2023 - 3.2K bytes - Viewed (0) -
src/cmd/asm/internal/asm/testdata/armerror.s
MOVB R0>>8, R2 // ERROR "illegal shift" MOVH R0<<16, R2 // ERROR "illegal shift" MOVBS R0->8, R2 // ERROR "illegal shift" MOVHS R0<<24, R2 // ERROR "illegal shift" MOVBU R0->24, R2 // ERROR "illegal shift" MOVHU R0@>1, R2 // ERROR "illegal shift" XTAB R0>>8, R2 // ERROR "illegal shift" XTAH R0<<16, R2 // ERROR "illegal shift"
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Oct 23 15:18:14 UTC 2024 - 14.5K bytes - Viewed (0) -
src/cmd/asm/internal/asm/testdata/arm64error.s
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Mar 26 10:48:50 UTC 2025 - 37.9K bytes - Viewed (0) -
src/main/assemblies/files/fess
do case $1 in --help) ARGV="$ARGV -h"; shift;; --*=*) properties="$properties -Dfess.${1#--}" shift 1 ;; --*) [ $# -le 1 ] && { echo "Option requires an argument: '$1'." shift continue } properties="$properties -Dfess.${1#--}=$2" shift 2 ;; *) ARGV="$ARGV $1" ; shift
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Sun Jan 15 06:32:15 UTC 2023 - 5.4K bytes - Viewed (0) -
src/cmd/asm/internal/arch/arm64.go
} } return 0, false } // ARM64RegisterShift constructs an ARM64 register with shift operation. func ARM64RegisterShift(reg, op, count int16) (int64, error) { // the base register of shift operations must be general register. if reg > arm64.REG_R31 || reg < arm64.REG_R0 { return 0, errors.New("invalid register for shift operation") } return int64(reg&31)<<16 | int64(op)<<22 | int64(uint16(count)), nil }
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Fri Feb 14 15:13:11 UTC 2025 - 10.3K bytes - Viewed (0) -
guava/src/com/google/common/hash/Murmur3_32HashFunction.java
} } long buffer = 0; int shift = 0; for (; i < utf16Length; i++) { char c = input.charAt(i); if (c < 0x80) { buffer |= (long) c << shift; shift += 8; len++; } else if (c < 0x800) { buffer |= charToTwoUtf8Bytes(c) << shift; shift += 16; len += 2;
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Apr 14 16:36:11 UTC 2025 - 11.8K bytes - Viewed (0) -
src/cmd/asm/internal/asm/parse.go
} case lex.LSH: p.next() shift := p.factor() if int64(shift) < 0 { p.errorf("negative left shift count") } return value << shift case lex.RSH: p.next() shift := p.term() if int64(shift) < 0 { p.errorf("negative right shift count") } if int64(value) < 0 { p.errorf("right shift of value with high bit set") } value >>= shift
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Fri Feb 14 15:13:11 UTC 2025 - 37.3K bytes - Viewed (0) -
guava/src/com/google/common/math/BigIntegerMath.java
sqrt0 = sqrtApproxWithDoubles(x); } else { int shift = (log2 - DoubleUtils.SIGNIFICAND_BITS) & ~1; // even! /* * We have that x / 2^shift < 2^54. Our initial approximation to sqrtFloor(x) will be * 2^(shift/2) * sqrtApproxWithDoubles(x / 2^shift). */ sqrt0 = sqrtApproxWithDoubles(x.shiftRight(shift)).shiftLeft(shift >> 1); }
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 18.8K bytes - Viewed (0)