2
0
Fork 0
mirror of https://github.com/kwsch/PKHeX synced 2025-02-01 14:13:30 +00:00
PKHeX/PKHeX.Core/Legality/Learnset/EggMoves.cs
Kurt 528d927a85 Handle self-form pointer
Logic is much more clear now.
2024-01-04 00:00:34 -08:00

186 lines
5.7 KiB
C#

using System;
using System.Runtime.InteropServices;
using static System.Buffers.Binary.BinaryPrimitives;
namespace PKHeX.Core;
/// <summary>
/// Stores the valid Move IDs the entry can be obtained with.
/// </summary>
public abstract class EggMoves(ushort[] moves)
{
public ReadOnlySpan<ushort> Moves => moves;
public bool GetHasEggMove(ushort move) => Moves.Contains(move);
}
/// <summary>
/// Specialized Egg Move storage for Generation 2.
/// </summary>
public sealed class EggMoves2 : EggMoves
{
private EggMoves2(ushort[] moves) : base(moves) { }
/// <summary>
/// Gets the Egg Moves from the Generation 2 encoded format.
/// </summary>
/// <param name="data">Encoded data</param>
/// <param name="count">Max Species ID</param>
public static EggMoves2[] GetArray(ReadOnlySpan<byte> data, ushort count)
{
var entries = new EggMoves2[count + 1];
var empty = entries[0] = new EggMoves2([]);
int baseOffset = ReadInt16LittleEndian(data) - (count * 2);
for (int i = 1; i < entries.Length; i++)
{
int start = ReadInt16LittleEndian(data[((i - 1) * 2)..]) - baseOffset;
var slice = data[start..];
int moveCount = slice.IndexOf<byte>(0xFF);
if (moveCount == 0)
{
entries[i] = empty;
continue;
}
var moves = new ushort[moveCount];
for (int m = 0; m < moves.Length; m++)
moves[m] = slice[m];
entries[i] = new EggMoves2(moves);
}
return entries;
}
}
/// <summary>
/// Specialized Egg Move storage for Generation 3-6.
/// </summary>
public sealed class EggMoves6 : EggMoves
{
private EggMoves6(ushort[] moves) : base(moves) { }
public static EggMoves6[] GetArray(BinLinkerAccessor entries)
{
var result = new EggMoves6[entries.Length];
var empty = result[0] = new EggMoves6([]);
for (int i = 1; i < result.Length; i++)
{
var data = entries[i];
int count = ReadInt16LittleEndian(data);
if (count == 0)
{
result[i] = empty;
continue;
}
var moves = MemoryMarshal.Cast<byte, ushort>(data).Slice(1, count).ToArray();
if (!BitConverter.IsLittleEndian)
ReverseEndianness(moves, moves);
result[i] = new EggMoves6(moves);
}
return result;
}
}
/// <summary>
/// Specialized Egg Move storage for Generation 7+.
/// </summary>
public sealed class EggMoves7 : EggMoves
{
/// <summary>
/// Points to the index where form data is, within the parent Egg Move object array.
/// </summary>
/// <remarks>This value is the same for all form entries for a given species.</remarks>
public readonly ushort FormTableIndex;
private EggMoves7(ushort[] moves, ushort formIndex = 0) : base(moves) => FormTableIndex = formIndex;
public static EggMoves7[] GetArray(BinLinkerAccessor entries)
{
var result = new EggMoves7[entries.Length];
var empty = result[0] = new EggMoves7([]);
for (int i = 1; i < result.Length; i++)
{
var data = entries[i];
int count = ReadInt16LittleEndian(data[2..]);
var formIndex = ReadUInt16LittleEndian(data);
if (count == 0)
{
// Might need to keep track of the Form Index for unavailable forms pointing to valid forms.
if (formIndex != 0)
result[i] = new EggMoves7([], formIndex);
else
result[i] = empty;
continue;
}
var moves = MemoryMarshal.Cast<byte, ushort>(data).Slice(2, count).ToArray();
if (!BitConverter.IsLittleEndian)
ReverseEndianness(moves, moves);
result[i] = new EggMoves7(moves, formIndex);
}
return result;
}
}
internal static class EggMovesExtensions
{
public static ReadOnlySpan<ushort> GetFormEggMoves(this EggMoves7[] table, ushort species, byte form)
{
if (species >= table.Length)
return [];
var entry = table[species];
// Sanity check species in the event it is out of range.
var baseIndex = entry.FormTableIndex;
if (species > baseIndex)
return [];
if (form == 0 || baseIndex == species) // no form data if pointing to self
return entry.Moves;
// Jump to the associated form's entry within the table.
return table.GetFormEntry(form, baseIndex);
}
private static ReadOnlySpan<ushort> GetFormEntry(this EggMoves7[] table, byte form, ushort baseIndex)
{
var index = form - 1u + baseIndex;
if (index >= table.Length)
return [];
var entry = table[index];
// Double-check that the entry is still associated to the species.
if (entry.FormTableIndex != baseIndex)
return [];
return entry.Moves;
}
}
/// <summary>
/// Raw Egg Move storage
/// </summary>
public static class EggMoves9
{
public static ushort[][] GetArray(BinLinkerAccessor entries)
{
var result = new ushort[entries.Length][];
var empty = result[0] = [];
for (int i = 1; i < result.Length; i++)
{
var data = entries[i];
if (data.Length == 0)
{
result[i] = empty;
continue;
}
var moves = MemoryMarshal.Cast<byte, ushort>(data).ToArray();
if (!BitConverter.IsLittleEndian)
ReverseEndianness(moves, moves);
result[i] = moves;
}
return result;
}
}