Solved

Converting Zero-Fill Right Shift to .NET

Posted on 2004-09-16
8
1,371 Views
Last Modified: 2007-12-19
In Javascript, if I evaluate the following like so:

var i=-306674912;
alert(i>>>=1);

The zero-fill right-shift assignment operator (and thus the alert box) produces:

1994146192

How can I get this behavior in .NET? It doesn't have a ">>>+" operator or a ">>>" operator.

Thanks!

0
Comment
Question by:electricstory
  • 4
  • 4
8 Comments
 
LVL 4

Expert Comment

by:vigrid
ID: 12079880
Use the >> operator for zero-fill right shift and << operator for zero-fill left shift. C# code:

long i = 1;
for(int j = 0; j < 64; j++)
{
      Console.Write("i={0},", i);
      Console.WriteLine("\ti << {0} = {1}", j, i << j);
}

HTH
0
 

Author Comment

by:electricstory
ID: 12079898
Well, maybe I'm giving it the wrong name. But the ">>" operator isn't the same as the ">>>" operator. Try it. If you can get the same result as the javascript example above in .NET, you get the points.
0
 
LVL 4

Accepted Solution

by:
vigrid earned 500 total points
ID: 12080152
static void Main(string[] args)
{
  int i = -306674912;  // 11111111 11111111 11111111 11111111 11101101 10111000 10000011 00100000
  int k = 1994146192; // 00000000 00000000 00000000 00000000 01110110 11011100 01000001 10010000
  int j1 = ZFRS(i, 1);   // 00000000 00000000 00000000 00000000 00110110 11011100 01000001 10010000
}

private static int ZFRS(int i, int j)
{
  bool maskIt = (i < 0);
  i = i >> j;
  if(maskIt)
    i &= 0x7FFFFFFF;
  return i;
}
0
3 Use Cases for Connected Systems

Our Dev teams are like yours. They’re continually cranking out code for new features/bugs fixes, testing, deploying, testing some more, responding to production monitoring events and more. It’s complex. So, we thought you’d like to see what’s working for us.

 
LVL 4

Expert Comment

by:vigrid
ID: 12080160
int i = -306674912;  // 11111111 11111111 11111111 11111111 11101101 10111000 10000011 00100000
int k = 1994146192; // 00000000 00000000 00000000 00000000 01110110 11011100 01000001 10010000
int j1 = ZFRS(i, 1);   // 00000000 00000000 00000000 00000000 01110110 11011100 01000001 10010000

The comment was wrong. I left it after some tries and forgot to change it.

HTH
0
 

Author Comment

by:electricstory
ID: 12081142
You rock.
0
 

Author Comment

by:electricstory
ID: 12082071
Actually, if you're still looking in and feel so inclined, Vigrid, I can still use your help. Your mask only works for that one particular example. Positive numbers seem to be the same between >>> and the .net >>, but there's that left fill bit with negative numbers. Is there any (simple) way to perform that left fill every time a negative number comes up? I'll open a new question on it.

int i = -306674912;  // 11111111 11111111 11111111 11111111 11101101 10111000 10000011 00100000
int k = 1994146192; // 00000000 00000000 00000000 00000000 01110110 11011100 01000001 10010000
0
 
LVL 4

Expert Comment

by:vigrid
ID: 12091282
What do you expect to get from the method? Please just give me the input and needed output bits. Few examples would be great. I'm not so experienced in JavaScript, so I wasn't 100% sure if my solution will work every time.
0
 

Author Comment

by:electricstory
ID: 12092474
It looks like many operations result in an overflow error in .NET if you don't use longs. Maybe this is simpler than I think it is. Anyway, I've expanded your function, and this seems to work, though it's admitted kludgy (and I know I'm awful about naming variables). Thanks for your help; my grasp of hex was pretty shaky before this, but I think I'm getting it!

Private Shared Function ZFRS(ByVal l As Long, ByVal j As Integer) As Long
        Dim maskIt As Boolean = (l < 0)
        l = l >> j
        If (maskIt) Then
            Dim int As Integer = 0
            Do While Hex(l).Substring(int, 1) = "F"
                int += 1
                If int = 15 Then Exit Do
            Loop
            Dim strText As String = Hex(l)

            Dim strHex As String


            If int <> 8 Then

                Dim intZero As Integer
                Dim strHexDigit As String

                'For every four shift bits, you'll have a hex 0; add it to your shift digit
                For intZero = 0 To Math.Floor(j / 4) - 1
                    strHexDigit += "0"
                Next
                Dim strFinalDigit As String = strText.Substring(8 + intZero, 1)

                'otherwise, put in zeroes in front of the last hex digit
                Dim lFinalDigit As Long

                Dim intMod As Integer
                If j >= 4 Then
                    intMod = j Mod 4
                Else
                    'intMod = 0
                    intMod = j
                End If

                Dim strAddDigit, strOffset As String
                For intZero = 0 To intMod - 1
                    strOffset += "0"
                Next

                Select Case strfinaldigit
                    Case "1"
                        strAddDigit += "0001"
                    Case "2"
                        strAddDigit += "0010"
                    Case "3"
                        strAddDigit += "0011"
                    Case "4"
                        strAddDigit += "0100"
                    Case "5"
                        strAddDigit += "0101"
                    Case "6"
                        strAddDigit += "0110"
                    Case "7"
                        strAddDigit += "0111"
                    Case "8"
                        strAddDigit += "1000"
                    Case "9"
                        strAddDigit += "1001"
                    Case "A"
                        strAddDigit += "1010"
                    Case "B"
                        strAddDigit += "1011"
                    Case "C"
                        strAddDigit += "1100"
                    Case "D"
                        strAddDigit += "1101"
                    Case "E"
                        strAddDigit += "1110"
                    Case "F"
                        strAddDigit += "1111"
                End Select

                If Not strOffset Is Nothing Then
                    strAddDigit = strOffset + strAddDigit.Substring(strOffset.Length, (4 - strOffset.Length))
                End If

                Select Case strAddDigit
                    Case "0001"
                        strAddDigit = "1"
                    Case "0010"
                        strAddDigit = "2"
                    Case "0011"
                        strAddDigit = "3"
                    Case "0100"
                        strAddDigit = "4"
                    Case "0101"
                        strAddDigit = "5"
                    Case "0110"
                        strAddDigit = "6"
                    Case "0111"
                        strAddDigit = "7"
                    Case "1000"
                        strAddDigit = "8"
                    Case "1001"
                        strAddDigit = "9"
                    Case "1010"
                        strAddDigit = "A"
                    Case "1011"
                        strAddDigit = "B"
                    Case "1100"
                        strAddDigit = "C"
                    Case "1101"
                        strAddDigit = "D"
                    Case "1110"
                        strAddDigit = "E"
                    Case "1111"
                        strAddDigit = "F"
                End Select

                strFinalDigit = strAddDigit

                strHex = strHexDigit & strFinalDigit
                int = 9 + (strHex.Length - 1)
            Else
                strHex = "7"
                int = 9
            End If
            strHex += Hex(l).Substring(int)
            If strHex.Length = 8 And strHex.Substring(0, 1) = "F" Then
                strHex = "7" & strHex.Substring(1)
            End If
            l = Int64.Parse(strHex, Globalization.NumberStyles.HexNumber)

        ElseIf Hex(l).Length > 8 Then ' the number is positive

            Dim strText As String = Hex(l)
            Dim strHex As String
            'find out what's in the left-most 32-bit positions. You've already shifted it over, so fill in w/ zeroes

            Dim intZero As Integer
            Dim strHexDigit As String

            'For every four shift bits, you'll have a hex 0; append it to your shift digit
            For intZero = 0 To Math.Floor(j / 4) - 1
                strHexDigit += "0"
            Next
            Dim strFinalDigit As String = strText.Substring((Hex(l).Length - 8) + intZero, 1)

            'otherwise, put in zeroes in front of the last hex digit
            Dim lFinalDigit As Long

            Dim intMod As Integer
            If j >= 4 Then
                intMod = j Mod 4
            Else
                intMod = j
            End If

            Dim strAddDigit, strOffset As String
            For intZero = 0 To intMod - 1
                strOffset += "0"
            Next

            Select Case strfinaldigit
                Case "1"
                    strAddDigit += "0001"
                Case "2"
                    strAddDigit += "0010"
                Case "3"
                    strAddDigit += "0011"
                Case "4"
                    strAddDigit += "0100"
                Case "5"
                    strAddDigit += "0101"
                Case "6"
                    strAddDigit += "0110"
                Case "7"
                    strAddDigit += "0111"
                Case "8"
                    strAddDigit += "1000"
                Case "9"
                    strAddDigit += "1001"
                Case "A"
                    strAddDigit += "1010"
                Case "B"
                    strAddDigit += "1011"
                Case "C"
                    strAddDigit += "1100"
                Case "D"
                    strAddDigit += "1101"
                Case "E"
                    strAddDigit += "1110"
                Case "F"
                    strAddDigit += "1111"
            End Select

            If Not strOffset Is Nothing Then
                strAddDigit = strOffset + strAddDigit.Substring(strOffset.Length, (4 - strOffset.Length))
            End If

            Select Case strAddDigit
                Case "0001"
                    strAddDigit = "1"
                Case "0010"
                    strAddDigit = "2"
                Case "0011"
                    strAddDigit = "3"
                Case "0100"
                    strAddDigit = "4"
                Case "0101"
                    strAddDigit = "5"
                Case "0110"
                    strAddDigit = "6"
                Case "0111"
                    strAddDigit = "7"
                Case "1000"
                    strAddDigit = "8"
                Case "1001"
                    strAddDigit = "9"
                Case "1010"
                    strAddDigit = "A"
                Case "1011"
                    strAddDigit = "B"
                Case "1100"
                    strAddDigit = "C"
                Case "1101"
                    strAddDigit = "D"
                Case "1110"
                    strAddDigit = "E"
                Case "1111"
                    strAddDigit = "F"
            End Select


            strFinalDigit = strAddDigit

            'add strHexdigit to the beginning of strFinalDigit
            strHex = strHexDigit & strFinalDigit
            Dim int As Integer = Hex(l).Length
            int = int - (7 - (strHex.Length - 1))

            strHex += Hex(l).Substring(int)
            l = Int64.Parse(strHex, Globalization.NumberStyles.HexNumber)


        End If

        Return l

    End Function
0

Featured Post

3 Use Cases for Connected Systems

Our Dev teams are like yours. They’re continually cranking out code for new features/bugs fixes, testing, deploying, testing some more, responding to production monitoring events and more. It’s complex. So, we thought you’d like to see what’s working for us.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

In my previous two articles we discussed Binary Serialization (http://www.experts-exchange.com/A_4362.html) and XML Serialization (http://www.experts-exchange.com/A_4425.html). In this article we will try to know more about SOAP (Simple Object Acces…
Wouldn’t it be nice if you could test whether an element is contained in an array by using a Contains method just like the one available on List objects? Wouldn’t it be good if you could write code like this? (CODE) In .NET 3.5, this is possible…
Finds all prime numbers in a range requested and places them in a public primes() array. I've demostrated a template size of 30 (2 * 3 * 5) but larger templates can be built such 210  (2 * 3 * 5 * 7) or 2310  (2 * 3 * 5 * 7 * 11). The larger templa…

821 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question