PKHeX/PKHeX.Core/Legality/LearnSource/Sources/LearnSource2C.cs
Kurt 9166d0eb64
Refactoring: Move Source (Legality) (#3560)
Rewrites a good amount of legality APIs pertaining to:
* Legal moves that can be learned
* Evolution chains & cross-generation paths
* Memory validation with forgotten moves

In generation 8, there are 3 separate contexts an entity can exist in: SW/SH, BD/SP, and LA. Not every entity can cross between them, and not every entity from generation 7 can exist in generation 8 (Gogoat, etc). By creating class models representing the restrictions to cross each boundary, we are able to better track and validate data.

The old implementation of validating moves was greedy: it would iterate for all generations and evolutions, and build a full list of every move that can be learned, storing it on the heap. Now, we check one game group at a time to see if the entity can learn a move that hasn't yet been validated. End result is an algorithm that requires 0 allocation, and a smaller/quicker search space.

The old implementation of storing move parses was inefficient; for each move that was parsed, a new object is created and adjusted depending on the parse. Now, move parse results are `struct` and store the move parse contiguously in memory. End result is faster parsing and 0 memory allocation.

* `PersonalTable` objects have been improved with new API methods to check if a species+form can exist in the game.
* `IEncounterTemplate` objects have been improved to indicate the `EntityContext` they originate in (similar to `Generation`).
* Some APIs have been extended to accept `Span<T>` instead of Array/IEnumerable
2022-08-03 16:15:27 -07:00

137 lines
4.5 KiB
C#

using System;
using System.Diagnostics.CodeAnalysis;
using static PKHeX.Core.LearnMethod;
using static PKHeX.Core.LearnEnvironment;
using static PKHeX.Core.LearnSource2;
namespace PKHeX.Core;
/// <summary>
/// Exposes information about how moves are learned in <see cref="C"/>.
/// </summary>
public sealed class LearnSource2C : ILearnSource, IEggSource
{
public static readonly LearnSource2C Instance = new();
private static readonly PersonalTable2 Personal = PersonalTable.C;
private static readonly EggMoves2[] EggMoves = Legal.EggMovesC;
private static readonly Learnset[] Learnsets = Legal.LevelUpC;
private const int MaxSpecies = Legal.MaxSpeciesID_2;
private const LearnEnvironment Game = C;
private const int CountTMHM = 57;
public Learnset GetLearnset(int species, int form) => Learnsets[species];
public bool TryGetPersonal(int species, int form, [NotNullWhen(true)] out PersonalInfo? pi)
{
pi = null;
if (species > Legal.MaxSpeciesID_2)
return false;
pi = Personal[species];
return true;
}
public bool GetIsEggMove(int species, int form, int move)
{
if ((uint)species > MaxSpecies)
return false;
var moves = EggMoves[species];
return moves.GetHasEggMove(move);
}
public ReadOnlySpan<int> GetEggMoves(int species, int form)
{
if ((uint)species > MaxSpecies)
return ReadOnlySpan<int>.Empty;
return EggMoves[species].Moves;
}
public MoveLearnInfo GetCanLearn(PKM pk, PersonalInfo pi, EvoCriteria evo, int move, MoveSourceType types = MoveSourceType.All, LearnOption option = LearnOption.Current)
{
if (types.HasFlagFast(MoveSourceType.Machine) && GetIsTM(pi, move))
return new(TMHM, Game);
if (types.HasFlagFast(MoveSourceType.SpecialTutor) && GetIsSpecialTutor(pk, evo.Species, move))
return new(Tutor, Game);
if (types.HasFlagFast(MoveSourceType.LevelUp))
{
var learn = GetLearnset(evo.Species, evo.Form);
var level = learn.GetLevelLearnMove(move);
if (level != -1 && evo.LevelMin <= level && level <= evo.LevelMax)
return new(LevelUp, Game, (byte)level);
}
return default;
}
private static bool GetIsSpecialTutor(PKM pk, int species, int move)
{
if (!ParseSettings.AllowGen2Crystal(pk))
return false;
var tutor = Array.IndexOf(Tutors_GSC, move);
if (tutor == -1)
return false;
var info = PersonalTable.C[species];
return info.TMHM[CountTMHM + tutor];
}
private static bool GetIsTM(PersonalInfo info, int move)
{
var index = Array.IndexOf(TMHM_GSC, move);
if (index == -1)
return false;
return info.TMHM[index];
}
public void GetAllMoves(Span<bool> result, PKM pk, EvoCriteria evo, MoveSourceType types = MoveSourceType.All)
{
if (!TryGetPersonal(evo.Species, evo.Form, out var pi))
return;
if (types.HasFlagFast(MoveSourceType.LevelUp))
{
bool removeVC = pk.Format == 1 || pk.VC1;
var learn = GetLearnset(evo.Species, evo.Form);
var min = ParseSettings.AllowGen2MoveReminder(pk) ? 1 : evo.LevelMin;
(bool hasMoves, int start, int end) = learn.GetMoveRange(evo.LevelMax, min);
if (hasMoves)
{
var moves = learn.Moves;
for (int i = end; i >= start; i--)
{
var move = moves[i];
if (!removeVC || move < Legal.MaxMoveID_1)
result[move] = true;
}
}
}
if (types.HasFlagFast(MoveSourceType.Machine))
{
var flags = pi.TMHM;
var moves = TMHM_GSC;
for (int i = 0; i < moves.Length; i++)
{
if (flags[i])
result[moves[i]] = true;
}
}
if (types.HasFlagFast(MoveSourceType.SpecialTutor))
{
var flags = pi.TMHM;
for (int i = CountTMHM; i < flags.Length; i++)
{
if (flags[i])
result[Tutors_GSC[i - CountTMHM]] = true;
}
}
}
public static void GetEncounterMoves(IEncounterTemplate enc, Span<int> init)
{
var species = enc.Species;
var learn = Learnsets[species];
learn.SetEncounterMoves(enc.LevelMin, init);
}
}