mirror of
https://github.com/kwsch/PKHeX
synced 2024-12-23 10:53:10 +00:00
3c232505e5
In this pull request I've changed a ton of method signatures to reflect the more-narrow types of Species, Move# and Form; additionally, I've narrowed other large collections that stored lists of species / permitted values, and reworked them to be more performant with the latest API spaghetti that PKHeX provides. Roamer met locations, usually in a range of [max-min]<64, can be quickly checked using a bitflag operation on a UInt64. Other collections (like "Is this from Colosseum or XD") were eliminated -- shadow state is not transferred COLO<->XD, so having a Shadow ID or matching the met location from a gift/wild encounter is a sufficient check for "originated in XD".
92 lines
2.7 KiB
C#
92 lines
2.7 KiB
C#
using System;
|
|
|
|
namespace PKHeX.Core;
|
|
|
|
/// <summary>
|
|
/// Top-level current move verifier.
|
|
/// </summary>
|
|
internal static class LearnVerifier
|
|
{
|
|
private static readonly MoveResult Duplicate = new(LearnMethod.Duplicate);
|
|
private static readonly MoveResult EmptyInvalid = new(LearnMethod.EmptyInvalid);
|
|
|
|
public static void Verify(Span<MoveResult> result, PKM pk, IEncounterTemplate enc, EvolutionHistory history)
|
|
{
|
|
// Clear any existing parse results.
|
|
result.Clear();
|
|
|
|
// Load moves.
|
|
Span<ushort> current = stackalloc ushort[4];
|
|
pk.GetMoves(current);
|
|
|
|
// Verify the moves.
|
|
VerifyMoves(result, current, pk, enc, history);
|
|
|
|
// Finalize the checks.
|
|
Finalize(result, current);
|
|
}
|
|
|
|
private static void VerifyMoves(Span<MoveResult> result, ReadOnlySpan<ushort> current, PKM pk, IEncounterTemplate enc, EvolutionHistory history)
|
|
{
|
|
if (pk.IsEgg)
|
|
LearnVerifierEgg.Verify(result, current, enc, pk);
|
|
else
|
|
LearnVerifierHistory.Verify(result, current, enc, pk, history);
|
|
}
|
|
|
|
private static void Finalize(Span<MoveResult> result, ReadOnlySpan<ushort> current)
|
|
{
|
|
// Flag duplicate move indexes.
|
|
VerifyNoEmptyDuplicates(result, current);
|
|
|
|
// Can't have empty first move.
|
|
if (current[0] == 0)
|
|
result[0] = EmptyInvalid;
|
|
}
|
|
|
|
private static void VerifyNoEmptyDuplicates(Span<MoveResult> result, ReadOnlySpan<ushort> current)
|
|
{
|
|
bool emptySlot = false;
|
|
for (int i = 0; i < result.Length; i++)
|
|
{
|
|
var move = current[i];
|
|
if (move == 0)
|
|
{
|
|
emptySlot = true;
|
|
continue;
|
|
}
|
|
|
|
// If an empty slot was noted for a prior move, flag the empty slots.
|
|
if (emptySlot)
|
|
{
|
|
FlagEmptySlotsBeforeIndex(result, current, i);
|
|
emptySlot = false;
|
|
continue;
|
|
}
|
|
|
|
// Check for same move in next move slots
|
|
FlagDuplicateMovesAfterIndex(result, current, i, move);
|
|
}
|
|
}
|
|
|
|
private static void FlagDuplicateMovesAfterIndex(Span<MoveResult> result, ReadOnlySpan<ushort> current, int index, ushort move)
|
|
{
|
|
for (int i = result.Length - 1; i > index; i--)
|
|
{
|
|
if (current[i] != move)
|
|
continue;
|
|
result[index] = Duplicate;
|
|
return;
|
|
}
|
|
}
|
|
|
|
private static void FlagEmptySlotsBeforeIndex(Span<MoveResult> result, ReadOnlySpan<ushort> current, int index)
|
|
{
|
|
for (int i = index - 1; i >= 0; i--)
|
|
{
|
|
if (current[i] != 0)
|
|
return;
|
|
result[i] = EmptyInvalid;
|
|
}
|
|
}
|
|
}
|