mirror of
https://github.com/kwsch/PKHeX
synced 2024-12-20 09:23:17 +00:00
94811d9052
Can break the filtering out into smaller methods such that the generator can return results with less strict filtering
185 lines
8.6 KiB
C#
185 lines
8.6 KiB
C#
using System;
|
|
using System.Collections.Generic;
|
|
using System.Linq;
|
|
using static PKHeX.Core.LegalityCheckStrings;
|
|
using static PKHeX.Core.LegalityAnalysis;
|
|
|
|
namespace PKHeX.Core
|
|
{
|
|
/// <summary>
|
|
/// Logic to verify the current <see cref="PKM.RelearnMoves"/>.
|
|
/// </summary>
|
|
public static class VerifyRelearnMoves
|
|
{
|
|
public static CheckResult[] VerifyRelearn(PKM pkm, LegalInfo info)
|
|
{
|
|
if (info.Generation < 6 || pkm.VC1)
|
|
return VerifyRelearnNone(pkm, info);
|
|
|
|
switch (info.EncounterMatch)
|
|
{
|
|
case EncounterLink l:
|
|
return VerifyRelearnSpecifiedMoveset(pkm, info, l.RelearnMoves);
|
|
case MysteryGift g:
|
|
return VerifyRelearnSpecifiedMoveset(pkm, info, g.RelearnMoves);
|
|
case EncounterStatic s:
|
|
return VerifyRelearnSpecifiedMoveset(pkm, info, s.Relearn);
|
|
case EncounterEgg e:
|
|
return VerifyRelearnEggBase(pkm, info, e);
|
|
case EncounterSlot z when pkm.RelearnMove1 != 0 && z.Permissions.DexNav && EncounterSlotGenerator.IsDexNavValid(pkm):
|
|
return VerifyRelearnDexNav(pkm, info);
|
|
}
|
|
return VerifyRelearnNone(pkm, info);
|
|
}
|
|
|
|
private static CheckResult[] VerifyRelearnSpecifiedMoveset(PKM pkm, LegalInfo info, int[] moves)
|
|
{
|
|
CheckResult[] res = new CheckResult[4];
|
|
int[] RelearnMoves = pkm.RelearnMoves;
|
|
// Get gifts that match
|
|
|
|
for (int i = 0; i < 4; i++)
|
|
res[i] = moves[i] != RelearnMoves[i]
|
|
? new CheckResult(Severity.Invalid, string.Format(V178, MoveStrings[moves[i]]), CheckIdentifier.RelearnMove)
|
|
: new CheckResult(CheckIdentifier.RelearnMove);
|
|
|
|
info.RelearnBase = moves;
|
|
return res;
|
|
}
|
|
private static CheckResult[] VerifyRelearnDexNav(PKM pkm, LegalInfo info)
|
|
{
|
|
CheckResult[] res = new CheckResult[4];
|
|
int[] RelearnMoves = pkm.RelearnMoves;
|
|
|
|
// DexNav Pokémon can have 1 random egg move as a relearn move.
|
|
res[0] = !Legal.GetValidRelearn(pkm, Legal.GetBaseEggSpecies(pkm),true).Contains(RelearnMoves[0])
|
|
? new CheckResult(Severity.Invalid, V183, CheckIdentifier.RelearnMove)
|
|
: new CheckResult(CheckIdentifier.RelearnMove);
|
|
|
|
// All other relearn moves must be empty.
|
|
for (int i = 1; i < 4; i++)
|
|
res[i] = RelearnMoves[i] != 0
|
|
? new CheckResult(Severity.Invalid, V184, CheckIdentifier.RelearnMove)
|
|
: new CheckResult(CheckIdentifier.RelearnMove);
|
|
|
|
// Update the relearn base moves if the first relearn move is okay.
|
|
info.RelearnBase = res[0].Valid
|
|
? RelearnMoves
|
|
: new int[4];
|
|
|
|
return res;
|
|
}
|
|
private static CheckResult[] VerifyRelearnNone(PKM pkm, LegalInfo info)
|
|
{
|
|
CheckResult[] res = new CheckResult[4];
|
|
int[] RelearnMoves = pkm.RelearnMoves;
|
|
|
|
// No relearn moves should be present.
|
|
for (int i = 0; i < 4; i++)
|
|
res[i] = RelearnMoves[i] != 0
|
|
? new CheckResult(Severity.Invalid, V184, CheckIdentifier.RelearnMove)
|
|
: new CheckResult(CheckIdentifier.RelearnMove);
|
|
|
|
info.RelearnBase = new int[4];
|
|
return res;
|
|
}
|
|
private static CheckResult[] VerifyRelearnEggBase(PKM pkm, LegalInfo info, EncounterEgg e)
|
|
{
|
|
int[] RelearnMoves = pkm.RelearnMoves;
|
|
CheckResult[] res = new CheckResult[4];
|
|
// Level up moves cannot be inherited if Ditto is the parent
|
|
// that means genderless species and male only species except Nidoran and Volbet (they breed with female nidoran and illumise) could not have level up moves as an egg
|
|
bool inheritLvlMoves = Legal.GetCanInheritMoves(pkm, e);
|
|
|
|
// Obtain level1 moves
|
|
var baseMoves = Legal.GetBaseEggMoves(pkm, e.Species, e.Game, 1);
|
|
int baseCt = Math.Min(4, baseMoves.Length);
|
|
|
|
// Obtain Inherited moves
|
|
var inheritMoves = Legal.GetValidRelearn(pkm, e.Species, inheritLvlMoves, e.Game).ToList();
|
|
int reqBase = GetRequiredBaseMoves(RelearnMoves, baseMoves, baseCt, inheritMoves);
|
|
|
|
// Check if the required amount of Base Egg Moves are present.
|
|
FlagBaseEggMoves(res, reqBase, baseMoves, RelearnMoves);
|
|
|
|
// Non-Base moves that can magically appear in the regular movepool
|
|
if (Legal.LightBall.Contains(pkm.Species))
|
|
inheritMoves.Add(344); // Volt Tackle
|
|
|
|
// If any splitbreed moves are invalid, flag accordingly
|
|
var splitMoves = e.SplitBreed ? Legal.GetValidRelearn(pkm, Legal.GetBaseEggSpecies(pkm), inheritLvlMoves, e.Game).ToList() : new List<int>();
|
|
|
|
// Inherited moves appear after the required base moves.
|
|
// If the pkm is capable of split-species breeding and any inherited move is from the other split scenario, flag accordingly.
|
|
bool splitInvalid = FlagInvalidInheritedMoves(res, reqBase, e, RelearnMoves, inheritMoves, splitMoves);
|
|
if (splitInvalid)
|
|
FlagSplitbreedMoves(res, reqBase, e, pkm);
|
|
|
|
info.RelearnBase = baseMoves;
|
|
return res;
|
|
}
|
|
private static void FlagBaseEggMoves(CheckResult[] res, int required, IReadOnlyList<int> baseMoves, IReadOnlyList<int> RelearnMoves)
|
|
{
|
|
for (int i = 0; i < required; i++)
|
|
{
|
|
if (!baseMoves.Contains(RelearnMoves[i]))
|
|
{
|
|
FlagRelearnMovesMissing(res, required, baseMoves, i);
|
|
return;
|
|
}
|
|
res[i] = new CheckResult(Severity.Valid, V179, CheckIdentifier.RelearnMove);
|
|
}
|
|
}
|
|
private static void FlagRelearnMovesMissing(CheckResult[] res, int required, IReadOnlyList<int> baseMoves, int start)
|
|
{
|
|
for (int z = start; z < required; z++)
|
|
res[z] = new CheckResult(Severity.Invalid, V180, CheckIdentifier.RelearnMove);
|
|
|
|
// provide the list of suggested base moves for the last required slot
|
|
string em = string.Join(", ", getMoveNames(baseMoves));
|
|
res[required - 1].Comment += string.Format(Environment.NewLine + V181, em);
|
|
}
|
|
private static bool FlagInvalidInheritedMoves(CheckResult[] res, int required, EncounterEgg e, IReadOnlyList<int> RelearnMoves, IReadOnlyList<int> inheritMoves, IReadOnlyList<int> splitMoves)
|
|
{
|
|
bool splitInvalid = false;
|
|
for (int i = required; i < 4; i++)
|
|
{
|
|
if (RelearnMoves[i] == 0) // empty
|
|
res[i] = new CheckResult(Severity.Valid, V167, CheckIdentifier.RelearnMove);
|
|
else if (inheritMoves.Contains(RelearnMoves[i])) // inherited
|
|
res[i] = new CheckResult(Severity.Valid, V172, CheckIdentifier.RelearnMove);
|
|
else if (e.SplitBreed && splitMoves.Contains(RelearnMoves[i])) // inherited
|
|
splitInvalid = true;
|
|
else // not inheritable, flag
|
|
res[i] = new CheckResult(Severity.Invalid, V182, CheckIdentifier.RelearnMove);
|
|
}
|
|
|
|
return splitInvalid;
|
|
}
|
|
private static void FlagSplitbreedMoves(CheckResult[] res, int required, EncounterEgg e, PKM pkm)
|
|
{
|
|
var splitSpecies = Legal.GetBaseEggSpecies(pkm, e.SplitBreed ? 0 : 1);
|
|
for (int i = required; i < 4; i++)
|
|
{
|
|
if (res[i] != null)
|
|
continue;
|
|
|
|
string message = string.Format(V379, SpeciesStrings[splitSpecies], SpeciesStrings[e.Species]);
|
|
res[i] = new CheckResult(Severity.Invalid, message, CheckIdentifier.RelearnMove);
|
|
}
|
|
}
|
|
|
|
private static int GetRequiredBaseMoves(int[] RelearnMoves, IReadOnlyList<int> baseMoves, int baseCt, IReadOnlyList<int> inheritMoves)
|
|
{
|
|
var inherited = RelearnMoves.Where(m => m != 0 && (!baseMoves.Contains(m) || inheritMoves.Contains(m))).ToList();
|
|
int inheritCt = inherited.Count;
|
|
|
|
// Get required amount of base moves
|
|
int unique = baseMoves.Union(inherited).Count();
|
|
int reqBase = inheritCt == 4 || baseCt + inheritCt > 4 ? 4 - inheritCt : baseCt;
|
|
if (RelearnMoves.Count(m => m != 0) < Math.Min(4, baseMoves.Count))
|
|
reqBase = Math.Min(4, unique);
|
|
return reqBase;
|
|
}
|
|
}
|
|
}
|