/// <summary>
/// Gets the specified unsigned integer mask, with bits left - 1 to middle set.
/// </summary>
/// <param name="left">1 more than the first bit to set.</param>
/// <param name="middle">The last bit to set.</param>
/// <returns>The mask.</returns>
private static int GetMask(int left, int middle)
{
// Build new mask.
int mask = 0;
for (int set = left - 1; set >= middle; set--)
{
mask = BitManipulationGetSetClearBit1Complete.SetClearBit(mask, set);
}
return(mask);
}
/// <summary>
/// Swaps the odd and even numbered bits in the specified value and return it.
/// </summary>
/// <param name="num">The value to update.</param>
/// <returns>The updated value.</returns>
public static int SwapOddEvenBits(int num)
{
// Determine the max index.
var indexmax = (sizeof(int) * 8) - 1;
// Swap all bits.
for (int i = 0; i <= indexmax - 1; i += 2)
{
// Get current values.
var setEven = BitManipulationGetSetClearBit1Complete.GetBit(num, i);
var setOdd = BitManipulationGetSetClearBit1Complete.GetBit(num, i + 1);
// Update values.
num = BitManipulationGetSetClearBit1Complete.SetClearBit(num, i + 1, setEven);
num = BitManipulationGetSetClearBit1Complete.SetClearBit(num, i, setOdd);
}
// Return result.
return(num);
}
/// <summary>
/// Gets and returns the next highest number that matches the bit count
/// of the passed in value.
/// </summary>
/// <param name="num">The value.</param>
/// <returns>The next highest number or -1 if no matching number.</returns>
public static int GetNext(int num)
{
// Error check.
if (num < 0)
{
throw new ArgumentException("A positive number must be specified.");
}
// Initialize temp value.
var current = num;
// First determine the count of 0's in the right-most bits.
// Continue while the bit in the 0 position is 0 and there
// are non-zero bits left.
var count0 = 0;
while (((current & 1) == 0) && current != 0)
{
count0++;
// Note: Shift in 0's.
current = (int)((uint)current >> 1);
}
// Note that 'current' is reused in the next loop starting
// with it's value at the end of this loop.
// Determine the count of 1's in the right-most bits starting
// after any 0's (found in the above loop).
var count1 = 0;
while ((current & 1) == 1)
{
count1++;
// Note: Shift in 0's.
current = (int)((uint)current >> 1);
}
// Error Check
//
// Either:
// All zeros - count0 + count1 = 0
//
// All 1's except the sign bit - count0 + count1 = 31 (Sign bit can't be changed).
//
// All 1's in the left-most bits (except the sign bit) (Sign bit can't be changed)
// , all 0's int the right-most bits.
// (i.e.)
// 01..1100..00
// count0 + count1 = 31
//
// Note that count1 + count2 = 32 would only be possible for negative #'s because the
// sign bit would be 1.
if ((count0 + count1 == 31) || (count0 + count1 == 0))
{
return(-1);
}
// Determine posSet & set this bit.
var posSet = count0 + count1;
num = BitManipulationGetSetClearBit1Complete.SetClearBit(num, posSet);
// Clear all bits to the right of p.
var maskClear = BitManipulationCreateSimpleMask1Complete.CreateSimpleMask(31, posSet);
num &= maskClear;
// Determine the # of bits to set to make the #'s match again, note that we reduce
// this by 1 because we set one bit.
var bitsToSetCount = count1 - 1;
// If there are bits to set, set them.
// Note that if 0, we found just 1 set bit, when we cleared the bit this was
// accounted for.
if (bitsToSetCount > 0)
{
var maskSet = BitManipulationCreateSimpleMask1Complete.CreateSimpleMask(bitsToSetCount - 1, 0);
num |= maskSet;
}
// Done.
return(num);
}
/// <summary>
/// Gets and returns the next lowest number that matches the bit count
/// of the passed in value.
/// </summary>
/// <param name="num">The value.</param>
/// <returns>The next lowest number or -1 if no matching number.</returns>
public static int GetPrev(int num)
{
// Error check.
if (num < 0)
{
throw new ArgumentException("A positive number must be specified.");
}
// Initialize temp value.
var current = num;
// First determine the count of 1's in the right-most bits.
var count1 = 0;
while ((current & 1) == 1)
{
count1++;
// Note: Shift in 0's.
current = (int)((uint)current >> 1);
}
// Determine the count of 0's in the right-most bits starting
// after any 1's (found in the above loop).
// Continue while the bit in the 0 position is 1 and there
// are non-zero bits left.
var count0 = 0;
while (((current & 1) == 0) && current != 0)
{
count0++;
// Note: Shift in 0's.
current = (int)((uint)current >> 1);
}
// Note that 'current' is reused in the next loop starting
// with it's value at the end of this loop.
// Error Check
//
// All 1's in the left-most bits, all 0's in the right most bits. (i.e.)
// 0..1
// current == 0;
if (current == 0)
{
return(-1);
}
// Determine posSet & clear this bit.
var posClear = count0 + count1;
num = BitManipulationGetSetClearBit1Complete.SetClearBit(num, posClear, false);
// Clear all bits to the right of posClear.
var maskClear = BitManipulationCreateSimpleMask1Complete.CreateSimpleMask(31, posClear);
num &= maskClear;
// Determine the # of bits to set to make the #'s match again, note that we increment
// this by 1 because we cleared one bit.
var bitsToSetCount = count1 + 1;
// If there are bits to set, set them.
// Note that if 0, we found just 1 set bit, when we cleared the bit this was
// accounted for.
if (bitsToSetCount > 0)
{
var maskSet = BitManipulationCreateSimpleMask1Complete.CreateSimpleMask(posClear - 1, posClear - 1 - bitsToSetCount + 1);
num |= maskSet;
}
// Done.
return(num);
}