Scribd Logo
Upload

Welcome to Scribd!

  • 90 views

    Bit Shifting in Visual Basic 6

    Uploaded by

    rukati shoja
    Bit shifting in Visual Basic 6 can be implemented by repeatedly multiplying or dividing by 2 to shift bits left or right. The document provides an example of code that shifts a single bit to the left of a 32-bit value by masking the top two bits before multiplying, and then manipulating the bits to rotate the most significant bit into the least significant position. While not the most efficient approach, this method demonstrates how bit shifting can be simulated in VB6 without a native operator.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Bit Shifting in Visual Basic 6

    Uploaded by

    rukati shoja
    90 views2 pages
    Bit shifting in Visual Basic 6 can be implemented by repeatedly multiplying or dividing by 2 to shift bits left or right. The document provides an example of code that shifts a single bit to the left of a 32-bit value by masking the top two bits before multiplying, and then manipulating the bits to rotate the most significant bit into the least significant position. While not the most efficient approach, this method demonstrates how bit shifting can be simulated in VB6 without a native operator.

    Original Description:

    Bit Shifting In Visual Basic

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Bit shifting in Visual Basic 6 can be implemented by repeatedly multiplying or dividing by 2 to shift bits left or right. The document provides an example of code that shifts a single bit to the left of a 32-bit value by masking the top two bits before multiplying, and then manipulating the bits to rotate the most significant bit into the least significant position. While not the most efficient approach, this method demonstrates how bit shifting can be simulated in VB6 without a native operator.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    90 views2 pages

    Bit Shifting in Visual Basic 6

    Uploaded by

    rukati shoja
    Bit shifting in Visual Basic 6 can be implemented by repeatedly multiplying or dividing by 2 to shift bits left or right. The document provides an example of code that shifts a single bit to the left of a 32-bit value by masking the top two bits before multiplying, and then manipulating the bits to rotate the most significant bit into the least significant position. While not the most efficient approach, this method demonstrates how bit shifting can be simulated in VB6 without a native operator.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 2

    Bit Shifting in Visual Basic 6

    by Dermot Hogan
    Monday 22 May 2006.

    In Visual Basic 6 there isn’t a ‘bit shift’ operator. However, you can implement something that
    does the same job quite easily.
    One of the problems with Visual Basic 6 (VB 6) is its lack of operators. An operator is often
    ‘syntactic sugar’ – that is, there is another way of expressing the operation using a function
    call. For example, the C && operator (AndAlso in VB .NET) can be simply replaced by two If
    statements. On the other hand, some operations are fundamental in that they are executed
    by machine instructions – division and multiplication, say. If these aren’t in the language,
    there’s not much you can do about it.
    But there are other operators which, while not in VB 6, can be reasonably easily simulated.
    Bit shifting is one such. Bit shifts are the movement of the bits in a word or a byte by a given
    number of places left or right. They aren’t commonly used in database applications, but they
    are used in cryptography, image processing and communications. The trick to implementing
    a bit shift function in VB 6 is to realise that it can be implemented by repeatedly using a
    multiply or divide by 2. Incidentally, in the processor hardware, it’s the other way round – a
    multiply or divide is performed by repeated bit shifts.
    The key idea is that a shift right by one bit is performed by an integer divide by 2, while a
    shift left is performed by an integer multiply by 2. But having done that, the question remains
    of what to do with the bit that you have shifted. There are actually two options: either throw it
    away or ‘rotate’ it into the top or bottom of the word. Here, I’ll ‘rotate’ the bit.
    In practice, you have to watch that you don’t cause an ‘overflow’ – a VB 6 exception resulting
    from the transition from a positive to a negative quantity when you shift to the left. In the
    code below, I’ve handled this by ‘masking’ the top two bits of a 32 bit word before multiplying
    (the code shifts a single bit to the left):

    c = inputValue(0) And &HC0000000


    inputValue(0) = inputValue(0) And &H3FFFFFFF
    inputValue(0) = inputValue(0) * 2

    ' rotate Most Significant Bit (MSB) into Least Significant Bit (LSB)
    If c And &H80000000 Then
    inputValue(0) = inputValue(0) Or 1
    End If

    ' set Most Significant Bit


    If c And &H40000000 Then
    inputValue(0) = inputValue(0) Or &H80000000
    Else
    inputValue(0) = inputValue(0) And &H7FFFFFFF
    End If
    The code example in the associated zip file allows you to input a number (in hexadecimal)
    and shift it by a number of bits. The example actually uses a 64-bit ‘word’ (just an extension
    of the above example). If you wish, you can extend it to any number of bits in a fairly obvious
    manner.
    Lastly, is this the most efficient way of doing it? Probably not – if you can divide or multiply
    by 2, you can do so by any power of 2 and so reduce the number of loop iterations. But the
    cost of this is increased complexity and hence debugging time.
    Just a simple shift left or right. Remember, the input and output are hexadecimal

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy