PKHeX/PKHeX.Core/Legality/Learnset/EggMoves.cs
Kurt 03182ebd3d Update 22.11.24
Adds support for Scarlet & Violet.

Co-Authored-By: SciresM <8676005+SciresM@users.noreply.github.com>
Co-Authored-By: Matt <17801814+sora10pls@users.noreply.github.com>
Co-Authored-By: Lusamine <30205550+Lusamine@users.noreply.github.com>
2022-11-24 17:42:17 -08:00

147 lines
4.4 KiB
C#

using System;
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
{
public readonly ushort[] Moves;
protected EggMoves(ushort[] moves) => Moves = moves;
public bool GetHasEggMove(ushort move) => Array.IndexOf(Moves, move) != -1;
}
/// <summary>
/// Specialized Egg Move storage for Generation 2.
/// </summary>
public sealed class EggMoves2 : EggMoves
{
private EggMoves2(ushort[] moves) : base(moves) { }
public static EggMoves2[] GetArray(ReadOnlySpan<byte> data, int count)
{
var entries = new EggMoves2[count + 1];
var empty = entries[0] = new EggMoves2(Array.Empty<ushort>());
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(Array.Empty<ushort>());
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 = new ushort[count];
var span = data[2..];
for (int j = 0; j < moves.Length; j++)
moves[j] = ReadUInt16LittleEndian(span[(j * 2)..]);
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>
public readonly int FormTableIndex;
private EggMoves7(ushort[] moves, int formIndex = 0) : base(moves) => FormTableIndex = formIndex;
public static EggMoves7[] GetArray(BinLinkerAccessor entries)
{
var result = new EggMoves7[entries.Length];
var empty = result[0] = new EggMoves7(Array.Empty<ushort>());
for (int i = 1; i < result.Length; i++)
{
var data = entries[i];
int count = ReadInt16LittleEndian(data[2..]);
int formIndex = ReadInt16LittleEndian(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(Array.Empty<ushort>(), formIndex);
else
result[i] = empty;
continue;
}
var moves = new ushort[count];
var span = data[4..];
for (int j = 0; j < moves.Length; j++)
moves[j] = ReadUInt16LittleEndian(span[(j * 2)..]);
result[i] = new EggMoves7(moves, formIndex);
}
return result;
}
}
/// <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] = Array.Empty<ushort>();
for (int i = 1; i < result.Length; i++)
{
var data = entries[i];
if (data.Length == 0)
{
result[i] = empty;
continue;
}
var moves = new ushort[data.Length >> 1];
for (int j = 0; j < data.Length; j+=2)
moves[j >> 1] = ReadUInt16LittleEndian(data[j..]);
result[i] = moves;
}
return result;
}
}