- Sort Score
- Num 10 results
- Language All
Results 1 - 10 of 36 for Shift (0.04 seconds)
-
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"
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Wed Oct 23 15:18:14 GMT 2024 - 14.5K bytes - Click Count (0) -
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;Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Mar 19 18:53:45 GMT 2026 - 11.8K bytes - Click Count (0) -
src/cmd/asm/internal/asm/testdata/arm64error.s
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Tue Feb 24 21:29:25 GMT 2026 - 38.5K bytes - Click Count (0) -
android/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); }
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Aug 07 16:05:33 GMT 2025 - 18.8K bytes - Click Count (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
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Tue Feb 17 19:57:47 GMT 2026 - 37.3K bytes - Click Count (0) -
apache-maven/src/assembly/maven/bin/mvn.cmd
@REM POM location, if supplied. set FILE_ARG= :arg_loop if "%~1" == "-f" ( set "FILE_ARG=%~2" shift goto process_file_arg ) if "%~1" == "--file" ( set "FILE_ARG=%~2" shift goto process_file_arg ) @REM If none of the above, skip the argument shift if not "%~1" == "" ( goto arg_loop ) else ( goto findBaseDir ) :process_file_arg
Created: Sun Apr 05 03:35:12 GMT 2026 - Last Modified: Wed Dec 10 16:40:06 GMT 2025 - 10.7K bytes - Click Count (3) -
android/guava/src/com/google/common/hash/LittleEndianByteArray.java
long result = 0; // Due to the way we shift, we can stop iterating once we've run out of data, the rest // of the result already being filled with zeros. // This loop is critical to performance, so please check HashBenchmark if altering it. int limit = min(length, 8); for (int i = 0; i < limit; i++) { // Shift value left while iterating logically through the array.Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Apr 01 17:27:13 GMT 2026 - 10.1K bytes - Click Count (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/http2/Hpack.kt
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Sun Mar 15 09:02:18 GMT 2026 - 23.2K bytes - Click Count (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/http2/Huffman.kt
if (child == null) { child = Node() children[childIndex] = child } node = child } val shift = 8 - accumulatorBitCount val start = (code shl shift) and 0xff val end = 1 shl shift node.children!!.fill(terminal, start, start + end) } private class Node { /** Null if terminal. */ val children: Array<Node?>?
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Wed Mar 19 19:25:20 GMT 2025 - 11K bytes - Click Count (0) -
src/main/java/jcifs/smb/SID.java
ret.append(Hexdump.toHexString(this.identifier_authority, 0, 6)); } else { long shift = 0; long id = 0; for (int i = 5; i > 1; i--) { id += (this.identifier_authority[i] & 0xFFL) << shift; shift += 8; } ret.append(id); } for (int i = 0; i < this.sub_authority_count; i++) {
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sat Aug 16 01:32:48 GMT 2025 - 16K bytes - Click Count (0)