To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

From Wikipedia, the free encyclopedia

Logical shift operators in various programming languages and processors
Language or processor Left Right
Ada[1] Shift_Left Shift_Right
Batch,[2] C, C++, Go, Swift (unsigned types only);
Standard ML, Verilog, PHP, Python[3]
<< >>
D, Java, JavaScript, Julia << >>>
F# (unsigned types only) <<< >>>
Fortran LSHIFT RSHIFT
OCaml lsl lsr
Object Pascal, Delphi, x86 assembly, Kotlin, Powershell shl shr
VHSIC Hardware Description Language (VHDL), MIPS sll srl
PowerPC slw srw


In computer science, a logical shift is a bitwise operation that shifts all the bits of its operand. The two base variants are the logical left shift and the logical right shift. This is further modulated by the number of bit positions a given value shall be shifted, such as shift left by 1 or shift right by n. Unlike an arithmetic shift, a logical shift does not preserve a number's sign bit or distinguish a number's exponent from its significand (mantissa); every bit in the operand is simply moved a given number of bit positions, and the vacant bit-positions are filled, usually with zeros, and possibly ones (contrast with a circular shift).

A logical shift is often used when its operand is being treated as a sequence of bits instead of as a number.

Logical shifts can be useful as efficient ways to perform multiplication or division of unsigned integers by powers of two. Shifting left by n bits on a signed or unsigned binary number has the effect of multiplying it by 2n. Shifting right by n bits on an unsigned binary number has the effect of dividing it by 2n (rounding towards 0).

Logical right shift differs from arithmetic right shift. Thus, many languages have different operators for them. For example, in Java and JavaScript, the logical right shift operator is >>>, but the arithmetic right shift operator is >>. (Java has only one left shift operator (<<), because left shift via logic and arithmetic have the same effect.)

The programming languages C, C++, and Go, however, have only one right shift operator, >>. Most C and C++ implementations, and Go, choose which right shift to perform depending on the type of integer being shifted: signed integers are shifted using the arithmetic shift, and unsigned integers are shifted using the logical shift.

All currently relevant C standards (ISO/IEC 9899:1999 to 2011) leave a definition gap for cases where the number of shifts is equal to or bigger than the number of bits in the operands in a way that the result is undefined. This helps allow C compilers to emit efficient code for various platforms by allowing direct use of the native shift instructions which have differing behavior. For example, shift-left-word in PowerPC chooses the more-intuitive behavior where shifting by the bit width or above gives zero,[4] whereas SHL in x86 chooses to mask the shift amount to the lower bits to reduce the maximum execution time of the instructions, and as such a shift by the bit width doesn't change the value.[5]

Some languages, such as the .NET Framework and LLVM, also leave shifting by the bit width and above unspecified (.NET)[6] or undefined (LLVM).[7] Others choose to specify the behavior of their most common target platforms, such as C# which specifies the x86 behavior.[8]

YouTube Encyclopedic

  • 1/3
    Views:
    41 526
    17 960
    46 714
  • Left and Right Shift
  • Shift Micro Operations
  • 31. Arithmetic Left shift and Right shift operations and their properties

Transcription

Example

If the bit sequence 0001 0111 (decimal 23) is logically shifted by one bit position, then:

Shift left yields: 0010 1110 (decimal 46)
Logical left shift one bit
Logical left shift one bit
Shift right yields: 0000 1011 (decimal 11)
Logical right shift one bit
Logical right shift one bit

Note: MSB = Most Significant Bit, LSB = Least Significant Bit

References

  1. ^ Annotated Ada Reference Manual
  2. ^ https://ss64.com/nt/set.html
  3. ^ "BitwiseOperators - Python Wiki". wiki.python.org. Retrieved 2018-01-24.
  4. ^ "PowerPC Instruction Set: slw". pds.twi.tudelft.nl. Retrieved 9 April 2016.
  5. ^ "x86 Instruction Set Reference". x86.renejeschke.de. Retrieved 9 April 2016.
  6. ^ "Opcodes.Shl Field". msdn.microsoft.com. Microsoft. Retrieved 9 April 2016.
  7. ^ "LLVM Language Reference Manual - shl Instruction". llvm.org. LLVM Project. Retrieved 9 April 2016.
  8. ^ "<< Operator (C# Reference)". msdn.microsoft.com. Microsoft. Retrieved 9 April 2016.
This page was last edited on 12 December 2020, at 14:22
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.