blocks|key|493403|text|可以，停那儿吧。请参阅我编写的以下方法：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|493404|///+<summary>
///+Rotates+the+bits+in+an+array+of+bytes+to+the+left.
///+</summary>
///+<param+name="bytes">The+byte+array+to+rotate.</param>
public+static+void+RotateLeft(byte[]+bytes)
{
++++bool+carryFlag+=+ShiftLeft(bytes);

++++if+(carryFlag+==+true)
++++{
++++++++bytes[bytes.Length+-+1]+=+(byte)(bytes[bytes.Length+-+1]+%7C+0x01);
++++}
}

///+<summary>
///+Rotates+the+bits+in+an+array+of+bytes+to+the+right.
///+</summary>
///+<param+name="bytes">The+byte+array+to+rotate.</param>
public+static+void+RotateRight(byte[]+bytes)
{
++++bool+carryFlag+=+ShiftRight(bytes);

++++if+(carryFlag+==+true)
++++{
++++++++bytes[0]+=+(byte)(bytes[0]+%7C+0x80);
++++}
}

///+<summary>
///+Shifts+the+bits+in+an+array+of+bytes+to+the+left.
///+</summary>
///+<param+name="bytes">The+byte+array+to+shift.</param>
public+static+bool+ShiftLeft(byte[]+bytes)
{
++++bool+leftMostCarryFlag+=+false;

++++//+Iterate+through+the+elements+of+the+array+from+left+to+right.
++++for+(int+index+=+0;+index+<+bytes.Length;+index%2B%2B)
++++{
++++++++//+If+the+leftmost+bit+of+the+current+byte+is+1+then+we+have+a+carry.
++++++++bool+carryFlag+=+(bytes[index]+&+0x80)+>+0;

++++++++if+(index+>+0)
++++++++{
++++++++++++if+(carryFlag+==+true)
++++++++++++{
++++++++++++++++//+Apply+the+carry+to+the+rightmost+bit+of+the+current+bytes+neighbor+to+the+left.
++++++++++++++++bytes[index+-+1]+=+(byte)(bytes[index+-+1]+%7C+0x01);
++++++++++++}
++++++++}
++++++++else
++++++++{
++++++++++++leftMostCarryFlag+=+carryFlag;
++++++++}

++++++++bytes[index]+=+(byte)(bytes[index]+<<+1);
++++}

++++return+leftMostCarryFlag;
}

///+<summary>
///+Shifts+the+bits+in+an+array+of+bytes+to+the+right.
///+</summary>
///+<param+name="bytes">The+byte+array+to+shift.</param>
public+static+bool+ShiftRight(byte[]+bytes)+
{
++++bool+rightMostCarryFlag+=+false;
++++int+rightEnd+=+bytes.Length+-+1;

++++//+Iterate+through+the+elements+of+the+array+right+to+left.
++++for+(int+index+=+rightEnd;+index+>=+0;+index--)
++++{
++++++++//+If+the+rightmost+bit+of+the+current+byte+is+1+then+we+have+a+carry.
++++++++bool+carryFlag+=+(bytes[index]+&+0x01)+>+0;

++++++++if+(index+<+rightEnd)
++++++++{
++++++++++++if+(carryFlag+==+true)
++++++++++++{
++++++++++++++++//+Apply+the+carry+to+the+leftmost+bit+of+the+current+bytes+neighbor+to+the+right.
++++++++++++++++bytes[index+%2B+1]+=+(byte)(bytes[index+%2B+1]+%7C+0x80);
++++++++++++}
++++++++}
++++++++else
++++++++{
++++++++++++rightMostCarryFlag+=+carryFlag;
++++++++}

++++++++bytes[index]+=+(byte)(bytes[index]+>>+1);
++++}

++++return+rightMostCarryFlag;
}+|code-block|syntax|javascript|493405|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

Yes, you can. See the following methods I wrote:

<pre><code>/// &lt;summary&gt;
/// Rotates the bits in an array of bytes to the left.
/// &lt;/summary&gt;
/// &lt;param name="bytes"&gt;The byte array to rotate.&lt;/param&gt;
public static void RotateLeft(byte[] bytes)
{
 bool carryFlag = ShiftLeft(bytes);

 if (carryFlag == true)
 {
 bytes[bytes.Length - 1] = (byte)(bytes[bytes.Length - 1] | 0x01);
 }
}

/// &lt;summary&gt;
/// Rotates the bits in an array of bytes to the right.
/// &lt;/summary&gt;
/// &lt;param name="bytes"&gt;The byte array to rotate.&lt;/param&gt;
public static void RotateRight(byte[] bytes)
{
 bool carryFlag = ShiftRight(bytes);

 if (carryFlag == true)
 {
 bytes[0] = (byte)(bytes[0] | 0x80);
 }
}

/// &lt;summary&gt;
/// Shifts the bits in an array of bytes to the left.
/// &lt;/summary&gt;
/// &lt;param name="bytes"&gt;The byte array to shift.&lt;/param&gt;
public static bool ShiftLeft(byte[] bytes)
{
 bool leftMostCarryFlag = false;

 // Iterate through the elements of the array from left to right.
 for (int index = 0; index &lt; bytes.Length; index++)
 {
 // If the leftmost bit of the current byte is 1 then we have a carry.
 bool carryFlag = (bytes[index] &amp; 0x80) &gt; 0;

 if (index &gt; 0)
 {
 if (carryFlag == true)
 {
 // Apply the carry to the rightmost bit of the current bytes neighbor to the left.
 bytes[index - 1] = (byte)(bytes[index - 1] | 0x01);
 }
 }
 else
 {
 leftMostCarryFlag = carryFlag;
 }

 bytes[index] = (byte)(bytes[index] &lt;&lt; 1);
 }

 return leftMostCarryFlag;
}

/// &lt;summary&gt;
/// Shifts the bits in an array of bytes to the right.
/// &lt;/summary&gt;
/// &lt;param name="bytes"&gt;The byte array to shift.&lt;/param&gt;
public static bool ShiftRight(byte[] bytes) 
{
 bool rightMostCarryFlag = false;
 int rightEnd = bytes.Length - 1;

 // Iterate through the elements of the array right to left.
 for (int index = rightEnd; index &gt;= 0; index--)
 {
 // If the rightmost bit of the current byte is 1 then we have a carry.
 bool carryFlag = (bytes[index] &amp; 0x01) &gt; 0;

 if (index &lt; rightEnd)
 {
 if (carryFlag == true)
 {
 // Apply the carry to the leftmost bit of the current bytes neighbor to the right.
 bytes[index + 1] = (byte)(bytes[index + 1] | 0x80);
 }
 }
 else
 {
 rightMostCarryFlag = carryFlag;
 }

 bytes[index] = (byte)(bytes[index] &gt;&gt; 1);
 }

 return rightMostCarryFlag;
} 
</code></pre>

blocks|key|709225|text|只是为了笑。字节数组中的移位和旋转字节。(不是位移位)|type|unstyled|depth|inlineStyleRanges|entityRanges|data|709226|左移，零填充：|709227|mybytes.Skip(1).Concat(new+byte[]+{+0+}).ToArray();|offset|length|style|CODE|709228|右移，零填充：|709229|(new+byte[]+{0}).Concat(mybytes.Take(mybytes.Length+-+1)).ToArray();|709230|向左旋转：|709231|mybytes.Skip(1).Concat(mybytes.Take(1)).ToArray();|709232|向右旋转：|709233|mybytes.Skip(mbytes.Length+-+1).Concat(mbytes.Take(mbytes.Length+-+1)).ToArray();|709234|entityMap^0|0|0|0|1F|0|0|0|1W|0|0|0|1E|0|0|0|29|0^^$0|@$1|2|3|4|5|6|7|X|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|Y|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|Z|8|@$F|10|G|11|H|I]]|9|@]|A|$]]|$1|J|3|K|5|6|7|12|8|@]|9|@]|A|$]]|$1|L|3|M|5|6|7|13|8|@$F|14|G|15|H|I]]|9|@]|A|$]]|$1|N|3|O|5|6|7|16|8|@]|9|@]|A|$]]|$1|P|3|Q|5|6|7|17|8|@$F|18|G|19|H|I]]|9|@]|A|$]]|$1|R|3|S|5|6|7|1A|8|@]|9|@]|A|$]]|$1|T|3|U|5|6|7|1B|8|@$F|1C|G|1D|H|I]]|9|@]|A|$]]|$1|V|3|-4|5|6|7|1E|8|@]|9|@]|A|$]]]|W|$]]

Just for grins. shifting and rotating bytes in a byte array. (not bitshifting)

shift left, zero fill:

<code>mybytes.Skip(1).Concat(new byte[] { 0 }).ToArray();</code>

shift right, zero fill: 

<code>(new byte[] {0}).Concat(mybytes.Take(mybytes.Length - 1)).ToArray();</code>

rotate left: 

<code>mybytes.Skip(1).Concat(mybytes.Take(1)).ToArray();</code>

rotate right: 

<code>mybytes.Skip(mbytes.Length - 1).Concat(mbytes.Take(mbytes.Length - 1)).ToArray();</code>

blocks|key|493545|text|看起来你是在一个字节数组中存储大量的位上执行位操作。考虑使用BitArray类和BitVector32结构。根据您对bits所做的操作，您可以创建一个这样的类。请注意，移位在O(1)而不是O(n)中起作用。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|493546|public+class+BitRing+:+IEnumerable<bool>
{
++++private+readonly+BitArray+m_InnerBitArray;

++++private+int+m_StarIndex;

++++public+BitRing(byte[]+bytes)
++++{
++++++++m_InnerBitArray+=+new+BitArray(bytes);
++++++++m_StarIndex+=+0;
++++}

++++public+void+ShiftLeft()
++++{
++++++++m_StarIndex%2B%2B;
++++}

++++public+void+ShiftRight()
++++{
++++++++m_StarIndex--;
++++}

++++public+bool+this[int+i]
++++{
++++++++get
++++++++{
++++++++++++int+index+=+GetIndex(i);
++++++++++++return+m_InnerBitArray[index];
++++++++}

++++++++set
++++++++{
++++++++++++int+index+=+GetIndex(i);
++++++++++++m_InnerBitArray[index]+=+value;
++++++++}
++++}

++++private+int+GetIndex(int+i)
++++{
++++++++return+i+-+m_StarIndex%25m_InnerBitArray.Count;
++++}

++++public+IEnumerator<bool>+GetEnumerator()
++++{
++++++++for+(int+i+=+m_StarIndex;+i+<+m_InnerBitArray.Count;+i%2B%2B)
++++++++{
++++++++++++yield+return+m_InnerBitArray[i];
++++++++}

++++++++for+(int+i+=+0;+i+<+m_StarIndex;+i%2B%2B)
++++++++{
++++++++++++yield+return+m_InnerBitArray[i];
++++++++}
++++}

++++IEnumerator+IEnumerable.GetEnumerator()
++++{
++++++++return+GetEnumerator();
++++}
}|code-block|syntax|javascript|493547|entityMap|0|LINK|mutability|MUTABLE|url|http://msdn.microsoft.com/en-us/library/system.collections.bitarray.aspx|1|http://msdn.microsoft.com/en-us/library/system.collections.specialized.bitvector32.aspx^0|U|8|0|14|B|1|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@$A|T|B|U|1|V]|$A|W|B|X|1|Y]]|C|$]]|$1|D|3|E|5|F|7|Z|8|@]|9|@]|C|$G|H]]|$1|I|3|-4|5|6|7|10|8|@]|9|@]|C|$]]]|J|$K|$5|L|M|N|C|$O|P]]|Q|$5|L|M|N|C|$O|R]]]]

It seems you are performing bit operations on large amount of bits storing them in a byte array. Consider using <a href="http://msdn.microsoft.com/en-us/library/system.collections.bitarray.aspx" rel="nofollow">BitArray</a> class and <a href="http://msdn.microsoft.com/en-us/library/system.collections.specialized.bitvector32.aspx" rel="nofollow">BitVector32</a> Structure. Depending on what you are doing with bits you can create a class like this. Note that shifting works in O(1) instead of O(n).

<pre><code>public class BitRing : IEnumerable&lt;bool&gt;
{
 private readonly BitArray m_InnerBitArray;

 private int m_StarIndex;

 public BitRing(byte[] bytes)
 {
 m_InnerBitArray = new BitArray(bytes);
 m_StarIndex = 0;
 }

 public void ShiftLeft()
 {
 m_StarIndex++;
 }

 public void ShiftRight()
 {
 m_StarIndex--;
 }

 public bool this[int i]
 {
 get
 {
 int index = GetIndex(i);
 return m_InnerBitArray[index];
 }

 set
 {
 int index = GetIndex(i);
 m_InnerBitArray[index] = value;
 }
 }

 private int GetIndex(int i)
 {
 return i - m_StarIndex%m_InnerBitArray.Count;
 }

 public IEnumerator&lt;bool&gt; GetEnumerator()
 {
 for (int i = m_StarIndex; i &lt; m_InnerBitArray.Count; i++)
 {
 yield return m_InnerBitArray[i];
 }

 for (int i = 0; i &lt; m_StarIndex; i++)
 {
 yield return m_InnerBitArray[i];
 }
 }

 IEnumerator IEnumerable.GetEnumerator()
 {
 return GetEnumerator();
 }
}
</code></pre>

blocks|key|493586|text|Linq方式：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|493587|static+class+Shifter
{
++++public+static+byte[]+ShiftLeft(this+byte[]+array,+int+n)
++++{
++++++++var+a+=+array.Select(x+=>+(byte)(x+>>+8+-+n+%25+8)).Concat(new+byte[(7+%2B+n)+/+8]).Select((x,+i)+=>+new+Tuple<int,+byte>(i+-+(n+%25+8+==+0+?+0+:+1),+x));
++++++++var+b+=+array.Select(x+=>+(byte)(x+<<+n+%25+8)).Concat(new+byte[n+/+8]).Select((x,+i)+=>+new+Tuple<int,+byte>(i,+x));

++++++++return+(from+x+in+a+
++++++++++++++++join+y+in+b+on+x.Item1+equals+y.Item1+into+yy
++++++++++++++++from+y+in+yy.DefaultIfEmpty()
++++++++++++++++select+(byte)(x.Item2+%7C+(y+==+null+?+0+:+y.Item2))).ToArray();
++++}

++++public+static+byte[]+ShiftRight(this+byte[]+array,+int+n)
++++{
++++++++return+(new+byte[n/8]).Concat(ShiftLeft(array,+(8+-+(n%258))%258)).ToArray();
++++}
}|code-block|syntax|javascript|493588|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

Linq way:

<pre><code>static class Shifter
{
 public static byte[] ShiftLeft(this byte[] array, int n)
 {
 var a = array.Select(x =&gt; (byte)(x &gt;&gt; 8 - n % 8)).Concat(new byte[(7 + n) / 8]).Select((x, i) =&gt; new Tuple&lt;int, byte&gt;(i - (n % 8 == 0 ? 0 : 1), x));
 var b = array.Select(x =&gt; (byte)(x &lt;&lt; n % 8)).Concat(new byte[n / 8]).Select((x, i) =&gt; new Tuple&lt;int, byte&gt;(i, x));

 return (from x in a 
 join y in b on x.Item1 equals y.Item1 into yy
 from y in yy.DefaultIfEmpty()
 select (byte)(x.Item2 | (y == null ? 0 : y.Item2))).ToArray();
 }

 public static byte[] ShiftRight(this byte[] array, int n)
 {
 return (new byte[n/8]).Concat(ShiftLeft(array, (8 - (n%8))%8)).ToArray();
 }
}
</code></pre>

blocks|key|493658|text|我对此进行了更多的思考，并意识到这可能更适合这个问题：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|493659|public+static+void+Main()
{
++++byte[]+bytes+=+new+byte[]+{+0xFF,+0x01,+0x80,+0x81+};

++++Stack<bool>+bitStack+=+CreateBitStack(bytes);

++++ShiftLeftExpand(bitStack,+1);

++++byte[]+newBytes+=+CreateByteArray(bitStack);
}

public+static+void+ShiftLeftExpand(Stack<bool>+bitStack,+int+count)
{
++++while+(count--+>+0)
++++{
++++++++bitStack.Push(false);
++++}
}

public+static+Stack<bool>+CreateBitStack(byte[]+bytes)
{
++++Stack<bool>+bitStack+=+new+Stack<bool>(bytes.Length+*+8);

++++for+(int+bytePosition+=+0;+bytePosition+<+bytes.Length;+bytePosition%2B%2B)
++++{
++++++++for+(int+bitPosition+=+7;+bitPosition+>=+0;+bitPosition--)
++++++++{
++++++++++++int+bitMask+=+0x01+<<+bitPosition;
++++++++++++bitStack.Push((bytes[bytePosition]+&+bitMask)+>+0);
++++++++}
++++}

++++return+bitStack;
}

public+static+byte[]+CreateByteArray(Stack<bool>+bitStack)
{
++++int+newArrayLength+=+(int)Math.Ceiling(bitStack.Count+/+8.0);
++++byte[]+bytes+=+new+byte[newArrayLength];
++++int+bitCounter+=+0;
++++while+(bitStack.Count+>+0)
++++{
++++++++bool?+bitValue+=+bitStack.Pop();

++++++++int+bitPosition+=+bitCounter+%25+8;
++++++++int+bytePosition+=+newArrayLength+-+1+-+bitCounter+/+8;

++++++++if+(bitValue+==+true)
++++++++{
++++++++++++bytes[bytePosition]+=+(byte)(bytes[bytePosition]+%7C+(0x01+<<+bitPosition));
++++++++}

++++++++bitCounter%2B%2B;
++++}

++++return+bytes;
}|code-block|syntax|javascript|493660|可以应用类似的技术来执行右移位。|493661|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|M|8|@]|9|@]|A|$]]|$1|I|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|J|$]]

I've given it some more thought and realized that this probably fits the question better:

<pre><code>public static void Main()
{
 byte[] bytes = new byte[] { 0xFF, 0x01, 0x80, 0x81 };

 Stack&lt;bool&gt; bitStack = CreateBitStack(bytes);

 ShiftLeftExpand(bitStack, 1);

 byte[] newBytes = CreateByteArray(bitStack);
}

public static void ShiftLeftExpand(Stack&lt;bool&gt; bitStack, int count)
{
 while (count-- &gt; 0)
 {
 bitStack.Push(false);
 }
}

public static Stack&lt;bool&gt; CreateBitStack(byte[] bytes)
{
 Stack&lt;bool&gt; bitStack = new Stack&lt;bool&gt;(bytes.Length * 8);

 for (int bytePosition = 0; bytePosition &lt; bytes.Length; bytePosition++)
 {
 for (int bitPosition = 7; bitPosition &gt;= 0; bitPosition--)
 {
 int bitMask = 0x01 &lt;&lt; bitPosition;
 bitStack.Push((bytes[bytePosition] &amp; bitMask) &gt; 0);
 }
 }

 return bitStack;
}

public static byte[] CreateByteArray(Stack&lt;bool&gt; bitStack)
{
 int newArrayLength = (int)Math.Ceiling(bitStack.Count / 8.0);
 byte[] bytes = new byte[newArrayLength];
 int bitCounter = 0;
 while (bitStack.Count &gt; 0)
 {
 bool? bitValue = bitStack.Pop();

 int bitPosition = bitCounter % 8;
 int bytePosition = newArrayLength - 1 - bitCounter / 8;

 if (bitValue == true)
 {
 bytes[bytePosition] = (byte)(bytes[bytePosition] | (0x01 &lt;&lt; bitPosition));
 }

 bitCounter++;
 }

 return bytes;
}
</code></pre>

A similar technique can be applied to perform the right shift.

blocks|key|493729|text|左移：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|493730|for+(int+i+=+byteArray.Length+-+1;+i+>=+0;+i--)+byteArray[i]+=+(byte)((byteArray[i]+<<+1)+%7C+((i+==+0)+?+0+:+byteArray[i+-+1]+>>+7));|code-block|syntax|javascript|493731|右移：|493732|for+(int+i+=+0;+i+<=+byteArray.Length+-+1;+i%2B%2B)+byteArray[i]+=+(byte)((byteArray[i]+>>+1)+%7C+((i+==+byteArray.Length+-+1)+?+0+:+byteArray[i+%2B+1]+<<+7));|493733|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|M|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|N|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|O|8|@]|9|@]|A|$]]|$1|I|3|J|5|D|7|P|8|@]|9|@]|A|$E|F]]|$1|K|3|-4|5|6|7|Q|8|@]|9|@]|A|$]]]|L|$]]

Shift left:

<pre><code>for (int i = byteArray.Length - 1; i &gt;= 0; i--) byteArray[i] = (byte)((byteArray[i] &lt;&lt; 1) | ((i == 0) ? 0 : byteArray[i - 1] &gt;&gt; 7));
</code></pre>

Shift right:

<pre><code>for (int i = 0; i &lt;= byteArray.Length - 1; i++) byteArray[i] = (byte)((byteArray[i] &gt;&gt; 1) | ((i == byteArray.Length - 1) ? 0 : byteArray[i + 1] &lt;&lt; 7));
</code></pre>

blocks|key|709606|text|这两个函数将字节数组中的位移位指定的量，并根据需要将它们移位到相邻的字节中。可选的是，它们可以将位从数组的一端包装到另一端。注意，它们创建了一个新的数组，但是可以很容易地修改代码来修改传递的“array”。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|709607|public+static+byte[]+ShiftRight(byte[]+array,+int+shift,+bool+wrap+=+false)+{
++++if(shift+<+0)+{
++++++++throw+new+ArgumentOutOfRangeException("shift");
++++}+else+if(shift+==+0)+{
++++++++return+(byte[])array.Clone();
++++}+else+{
++++++++if(wrap)+shift+%25=+(array.Length+*+8);
++++++++if(shift+>=+(array.Length+*+8))+return+new+byte[array.Length];
++++++++var+offset+=+(shift+/+8);
++++++++shift+%25=+8;
++++++++var+ʀ+=+new+byte[array.Length];
++++++++for(var+ɪ+=+0;+ɪ+<+ʀ.Length;+ɪ%2B%2B)+{
++++++++++++var+indexL_ɪ+=+(ɪ+%2B+offset);
++++++++++++var+indexH_ɪ+=+(ɪ+%2B+offset+%2B+1);
++++++++++++if(wrap)+{
++++++++++++++++if(indexL_ɪ+>=+array.Length)+indexL_ɪ+-=+array.Length;
++++++++++++++++if(indexH_ɪ+>=+array.Length)+indexH_ɪ+-=+array.Length;
++++++++++++}
++++++++++++if(indexL_ɪ+<+array.Length)+ʀ[ɪ]+=+(byte)(array[indexL_ɪ]+>>+shift);
++++++++++++if(indexH_ɪ+<+array.Length)+ʀ[ɪ]+%7C=+(byte)(array[indexH_ɪ]+<<+(8+-+shift));
++++++++}
++++++++return+ʀ;
++++}
}

public+static+byte[]+ShiftLeft(byte[]+array,+int+shift,+bool+wrap+=+false)+{
++++if(shift+<+0)+{
++++++++throw+new+ArgumentOutOfRangeException("shift");
++++}+else+if(shift+==+0)+{
++++++++return+(byte[])array.Clone();
++++}+else+{
++++++++if(wrap)+shift+%25=+(array.Length+*+8);
++++++++if(shift+>=+(array.Length+*+8))+return+new+byte[array.Length];
++++++++var+offset+=+(shift+/+8);
++++++++shift+%25=+8;
++++++++for(var+ɪ+=+0;+ɪ+<+ʀ.Length;+ɪ%2B%2B)+{
++++++++++++var+indexL_ɪ+=+(ɪ+-+offset+-+1);
++++++++++++var+indexH_ɪ+=+(ɪ+-+offset);
++++++++++++if(wrap)+{
++++++++++++++++if(indexL_ɪ+<+0)+indexL_ɪ+%2B=+array.Length;
++++++++++++++++if(indexH_ɪ+<+0)+indexH_ɪ+%2B=+array.Length;
++++++++++++}
++++++++++++if(indexL_ɪ+>=+0)+ʀ[ɪ]+=+(byte)(array[indexL_ɪ]+>>+(8+-+shift));
++++++++++++if(indexH_ɪ+>=+0)+ʀ[ɪ]+%7C=+(byte)(array[indexH_ɪ]+<<+shift);
++++++++}
++++++++return+ʀ;
++++}
}|code-block|syntax|javascript|709608|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

These two functions will shift the bits in an array of bytes the specified amount, shifting them into neighboring bytes as needed. Optionally, they can wrap the bits from one end of the array to the other. Note that they create a new array, but the code can be easily changed to modify the passed 'array' instead...
<pre><code>public static byte[] ShiftRight(byte[] array, int shift, bool wrap = false) {
 if(shift &lt; 0) {
 throw new ArgumentOutOfRangeException(&quot;shift&quot;);
 } else if(shift == 0) {
 return (byte[])array.Clone();
 } else {
 if(wrap) shift %= (array.Length * 8);
 if(shift &gt;= (array.Length * 8)) return new byte[array.Length];
 var offset = (shift / 8);
 shift %= 8;
 var ʀ = new byte[array.Length];
 for(var ɪ = 0; ɪ &lt; ʀ.Length; ɪ++) {
 var indexL_ɪ = (ɪ + offset);
 var indexH_ɪ = (ɪ + offset + 1);
 if(wrap) {
 if(indexL_ɪ &gt;= array.Length) indexL_ɪ -= array.Length;
 if(indexH_ɪ &gt;= array.Length) indexH_ɪ -= array.Length;
 }
 if(indexL_ɪ &lt; array.Length) ʀ[ɪ] = (byte)(array[indexL_ɪ] &gt;&gt; shift);
 if(indexH_ɪ &lt; array.Length) ʀ[ɪ] |= (byte)(array[indexH_ɪ] &lt;&lt; (8 - shift));
 }
 return ʀ;
 }
}

public static byte[] ShiftLeft(byte[] array, int shift, bool wrap = false) {
 if(shift &lt; 0) {
 throw new ArgumentOutOfRangeException(&quot;shift&quot;);
 } else if(shift == 0) {
 return (byte[])array.Clone();
 } else {
 if(wrap) shift %= (array.Length * 8);
 if(shift &gt;= (array.Length * 8)) return new byte[array.Length];
 var offset = (shift / 8);
 shift %= 8;
 for(var ɪ = 0; ɪ &lt; ʀ.Length; ɪ++) {
 var indexL_ɪ = (ɪ - offset - 1);
 var indexH_ɪ = (ɪ - offset);
 if(wrap) {
 if(indexL_ɪ &lt; 0) indexL_ɪ += array.Length;
 if(indexH_ɪ &lt; 0) indexH_ɪ += array.Length;
 }
 if(indexL_ɪ &gt;= 0) ʀ[ɪ] = (byte)(array[indexL_ɪ] &gt;&gt; (8 - shift));
 if(indexH_ɪ &gt;= 0) ʀ[ɪ] |= (byte)(array[indexH_ɪ] &lt;&lt; shift);
 }
 return ʀ;
 }
}
</code></pre>

In C#, is there a way to right/left shift an entire byte array (and subsequently adding a byte to a particular side for the last bit isn't lost)?

I know this sounds like a weird request, but I'd still like to know if its possible and/or how to begin doing it.

c# - left shift an entire byte array

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

在C#中，有没有办法向右/向左移动整个字节数组(然后将一个字节添加到特定的一侧，以便最后一位不会丢失)？我知道这听起来像是一个奇怪的请求，但我仍然想知道它是否可能和/或如何开始这样做。

问c#左移整个字节数组
EN

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问c#左移整个字节数组EN

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问c#左移整个字节数组
EN