mirror of
https://github.com/RHeavenStudioPlus/HeavenStudioPlus.git
synced 2024-11-10 03:35:10 +00:00
50 lines
1.8 KiB
C#
50 lines
1.8 KiB
C#
|
using System;
|
||
|
using System.Collections;
|
||
|
using System.Collections.Generic;
|
||
|
|
||
|
namespace HeavenStudio.Util
|
||
|
{
|
||
|
public static class BitwiseUtils
|
||
|
{
|
||
|
/// <summary>
|
||
|
/// Returns the value of the lowest set bit in the given integer.
|
||
|
/// </summary>
|
||
|
/// <param name="num">The integer to check.</param>
|
||
|
public static int FirstSetBit(int num)
|
||
|
{
|
||
|
return num & (-num);
|
||
|
}
|
||
|
|
||
|
/// <summary>
|
||
|
/// Returns true if the wanted bit is set in the given integer.
|
||
|
/// </summary>
|
||
|
/// <param name="num">The integer to check.</param>
|
||
|
/// <param name="want">The bit(s) to check for.</param>
|
||
|
public static bool WantCurrent(int num, int want)
|
||
|
{
|
||
|
return (num & want) == want;
|
||
|
}
|
||
|
|
||
|
/// <summary>
|
||
|
/// Returns true if the wanted bit is set in the first integer, and not in the second.
|
||
|
/// </summary>
|
||
|
/// <param name="num1">The first integer to check.</param>
|
||
|
/// <param name="num2">The second integer to check.</param>
|
||
|
/// <param name="want">The bit(s) to check for.</param>
|
||
|
public static bool WantCurrentAndNotLast(int num1, int num2, int want)
|
||
|
{
|
||
|
return ((num1 & want) == want) && ((num2 & want) != want);
|
||
|
}
|
||
|
|
||
|
/// <summary>
|
||
|
/// Returns true if the wanted bit is not set in the first integer, but set in the second.
|
||
|
/// </summary>
|
||
|
/// <param name="num1">The first integer to check.</param>
|
||
|
/// <param name="num2">The second integer to check.</param>
|
||
|
/// <param name="want">The bit(s) to check for.</param>
|
||
|
public static bool WantNotCurrentAndLast(int num1, int num2, int want)
|
||
|
{
|
||
|
return ((num1 & want) != want) && ((num2 & want) == want);
|
||
|
}
|
||
|
}
|
||
|
}
|