- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 64 for shift (0.21 sec)
-
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); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 18.9K bytes - Viewed (0) -
okhttp-tls/src/main/kotlin/okhttp3/tls/internal/der/DerWriter.kt
val sink = sink() val bitCount = 64 - java.lang.Long.numberOfLeadingZeros(v) val byteCount = (bitCount + 6) / 7 for (shift in (byteCount - 1) * 7 downTo 0 step 7) { val lastBit = if (shift == 0) 0 else 0b1000_0000 sink.writeByte(((v shr shift) and 0b0111_1111).toInt() or lastBit) } } override fun toString(): String = path.joinToString(separator = " / ")
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 5.7K bytes - Viewed (0) -
src/cmd/asm/internal/asm/testdata/arm64error.s
Others - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Dec 08 03:28:17 GMT 2023 - 37.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
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Wed Feb 21 14:34:57 GMT 2024 - 36.9K 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"},
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Tue Aug 29 07:48:38 GMT 2023 - 3.2K 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
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Tue Aug 29 18:31:05 GMT 2023 - 4.1K bytes - Viewed (0) -
src/test/java/org/codelibs/core/io/CopyUtilTest.java
* @throws Exception */ @Test public void testFileToFile_Encoding() throws Exception { int result = copy(inputFile, "UTF-8", outputFile, "Shift_JIS"); assertThat(result, is(urlString.length())); result = copy(outputFile, "Shift_JIS", writer); assertThat(writer.toString(), is(urlString)); } /** * @throws Exception */ @Test
Java - Registered: Fri May 03 20:58:11 GMT 2024 - Last Modified: Thu Mar 07 01:59:08 GMT 2024 - 4.6K bytes - Viewed (0) -
okhttp/src/main/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?>?
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 8.3K bytes - Viewed (0) -
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 = Math.min(length, 8); for (int i = 0; i < limit; i++) { // Shift value left while iterating logically through the array.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 9.7K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/http2/Hpack.kt
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 22.5K bytes - Viewed (1)