mirror of
https://github.com/kwsch/PKHeX
synced 2024-11-24 04:53:08 +00:00
62d08d7c30
split some methods with optional parameters=null add more xmldoc replace some magic numbers -> enum/const references consolidate common array operations (span soon maybe?)
55 lines
No EOL
1.6 KiB
C#
55 lines
No EOL
1.6 KiB
C#
using System;
|
|
using System.Collections.Generic;
|
|
|
|
namespace PKHeX.Core
|
|
{
|
|
/// <summary>
|
|
/// Byte array reusable logic
|
|
/// </summary>
|
|
public static class ArrayUtil
|
|
{
|
|
public static bool IsRangeAll(this byte[] data, int value, int offset, int length)
|
|
{
|
|
int start = offset + length - 1;
|
|
int end = offset;
|
|
for (int i = start; i >= end; i--)
|
|
{
|
|
if (data[i] != value)
|
|
return false;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
public static byte[] Slice(this byte[] src, int offset, int length)
|
|
{
|
|
byte[] data = new byte[length];
|
|
Buffer.BlockCopy(src, offset, data, 0, data.Length);
|
|
return data;
|
|
}
|
|
|
|
public static bool WithinRange(int value, int min, int max) => min <= value && value < max;
|
|
|
|
public static byte[][] Split(this byte[] data, int size)
|
|
{
|
|
byte[][] result = new byte[data.Length / size][];
|
|
for (int i = 0; i < data.Length; i += size)
|
|
result[i / size] = data.Slice(i, size);
|
|
return result;
|
|
}
|
|
|
|
public static IEnumerable<byte[]> EnumerateSplit(byte[] bin, int size, int start = 0)
|
|
{
|
|
for (int i = start; i < bin.Length; i += size)
|
|
yield return bin.Slice(i, size);
|
|
}
|
|
|
|
public static IEnumerable<byte[]> EnumerateSplit(byte[] bin, int size, int start, int end)
|
|
{
|
|
if (end < 0)
|
|
end = bin.Length;
|
|
for (int i = start; i < end; i += size)
|
|
yield return bin.Slice(i, size);
|
|
}
|
|
}
|
|
} |