- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 67 for shifts (0.1 sec)
-
okhttp-tls/src/main/kotlin/okhttp3/tls/internal/der/DerWriter.kt
sink.writeByte(0b1000_0000 or lengthByteCount) for (shift in (lengthByteCount - 1) * 8 downTo 0 step 8) { sink.writeByte((length shr shift).toInt()) } } // Write the payload. sink.writeAll(content) } /** * Execute [block] with a new namespace for type hints. Type hints from the enclosing type are no * longer usable by the current type's members. */
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 5.7K bytes - Viewed (0) -
docs/extensions/fan-out/README.md
## Overview MinIO implements an S3 extension to perform multiple concurrent fan-out upload operations. A perfect use case scenario for performing fan-out operations of incoming TSB (Time Shift Buffer's). TSBs are a method of facilitating time-shifted playback of television signaling, and media content.
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Thu May 25 05:51:07 UTC 2023 - 1.4K 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 Nov 05 11:13:11 UTC 2024 - Last Modified: Tue Aug 29 18:31:05 UTC 2023 - 4.1K bytes - Viewed (0) -
test-site/activator
-h|-help) usage; exit 1 ;; -v|-verbose) verbose=1 && shift ;; -d|-debug) debug=1 && shift ;; -mem) require_arg integer "$1" "$2" && app_mem="$2" && shift 2 ;; -jvm-debug) if echo "$2" | grep -E ^[0-9]+$ > /dev/null; then addDebugger "$2" && shift else addDebugger 9999 fi shift ;;
Registered: Fri Nov 08 09:08:12 UTC 2024 - Last Modified: Mon Apr 20 08:41:37 UTC 2015 - 9.3K 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 Nov 05 11:13:11 UTC 2024 - Last Modified: Tue Aug 29 07:48:38 UTC 2023 - 3.2K 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 Oct 31 13:40:30 UTC 2024 - Last Modified: Sun Jan 15 06:32:15 UTC 2023 - 5.4K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedLong.java
// So we can ignore the bottom 11, except for rounding. We can unsigned-shift right 1, aka // unsigned-divide by 2, and convert that. Then we'll get exactly half of the desired double // value. But in the specific case where the bottom two bits of the original number are 01, we // want to replace that with 1 in the shifted value for correct rounding. return (double) ((value >>> 1) | (value & 1)) * 2.0; }
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Apr 22 13:09:25 UTC 2021 - 8.9K bytes - Viewed (0) -
guava/src/com/google/common/primitives/UnsignedLong.java
// So we can ignore the bottom 11, except for rounding. We can unsigned-shift right 1, aka // unsigned-divide by 2, and convert that. Then we'll get exactly half of the desired double // value. But in the specific case where the bottom two bits of the original number are 01, we // want to replace that with 1 in the shifted value for correct rounding. return (double) ((value >>> 1) | (value & 1)) * 2.0; }
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Apr 22 13:09:25 UTC 2021 - 8.9K 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: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:26:48 UTC 2024 - 5.1K bytes - Viewed (0) -
test-site/activator.bat
Registered: Fri Nov 08 09:08:12 UTC 2024 - Last Modified: Mon Apr 20 08:41:37 UTC 2015 - 7.2K bytes - Viewed (0)