mirror of
https://github.com/kwsch/PKHeX
synced 2024-11-28 06:50:23 +00:00
9b55c015b6
Fix getValidPreEvolutions not decrementing level (the evo level is the actual value, not 1 for levelup. Did some performance analysis and optimized a little; the Valid Moves are now only obtained once instead of 4 times in a loop; used a list to hold the moves instead of constantly ToArray() which is a little computation intensive.
142 lines
4.5 KiB
C#
142 lines
4.5 KiB
C#
using System.Linq;
|
|
|
|
namespace PKHeX
|
|
{
|
|
public enum Severity
|
|
{
|
|
Indeterminate = -2,
|
|
Invalid = -1,
|
|
Fishy = 0,
|
|
Valid = 1,
|
|
NotImplemented = 2,
|
|
}
|
|
public class LegalityCheck
|
|
{
|
|
public Severity Judgement = Severity.Invalid;
|
|
public string Comment;
|
|
public bool Valid => Judgement >= Severity.Fishy;
|
|
|
|
public LegalityCheck() { }
|
|
public LegalityCheck(Severity s, string c)
|
|
{
|
|
Judgement = s;
|
|
Comment = c;
|
|
}
|
|
}
|
|
public class LegalityAnalysis
|
|
{
|
|
public bool Valid = false;
|
|
public LegalityCheck EC, Nickname, PID, IDs, IVs, EVs;
|
|
public string Report => getLegalityReport();
|
|
|
|
private readonly PK6 pk6;
|
|
public LegalityAnalysis(PK6 pk)
|
|
{
|
|
pk6 = pk;
|
|
}
|
|
|
|
public bool[] getMoveValidity(int[] Moves, int[] RelearnMoves)
|
|
{
|
|
if (Moves.Length != 4)
|
|
return new bool[4];
|
|
|
|
bool[] res = { true, true, true, true };
|
|
if (!pk6.Gen6)
|
|
return res;
|
|
|
|
int[] validMoves = Legal.getValidMoves(pk6);
|
|
if (pk6.Species == 235)
|
|
{
|
|
for (int i = 0; i < 4; i++)
|
|
res[i] = !Legal.InvalidSketch.Contains(Moves[i]);
|
|
}
|
|
else
|
|
{
|
|
for (int i = 0; i < 4; i++)
|
|
res[i] = Moves[i] != Legal.Struggle && validMoves.Concat(RelearnMoves).Contains(Moves[i]);
|
|
}
|
|
if (Moves[0] == 0)
|
|
res[0] = false;
|
|
|
|
return res;
|
|
}
|
|
public bool[] getRelearnValidity(int[] Moves)
|
|
{
|
|
if (Moves.Length != 4)
|
|
return new bool[4];
|
|
|
|
bool[] res = {true, true, true, true};
|
|
if (!pk6.Gen6)
|
|
goto noRelearn;
|
|
|
|
bool egg = Legal.EggLocations.Contains(pk6.Egg_Location) && pk6.Met_Level == 1;
|
|
bool evnt = pk6.FatefulEncounter && pk6.Met_Location > 40000;
|
|
bool eventEgg = pk6.FatefulEncounter && (pk6.Egg_Location > 40000 || pk6.Egg_Location == 30002) && pk6.Met_Level == 1;
|
|
int[] relearnMoves = Legal.getValidRelearn(pk6, 0);
|
|
if (evnt || eventEgg)
|
|
{
|
|
if (evnt)
|
|
{
|
|
// Get WC6's that match
|
|
WC6[] vwc6 = Legal.WC6DB.Where(wc6 =>
|
|
wc6.CardID == pk6.SID &&
|
|
wc6.TID == pk6.TID &&
|
|
wc6.Species == pk6.Species &&
|
|
wc6.OT == pk6.OT_Name).ToArray();
|
|
|
|
// Iterate over all
|
|
foreach (WC6 wc6 in vwc6)
|
|
{
|
|
for (int i = 0; i < 4; i++)
|
|
res[i] = wc6.RelearnMoves[i] == Moves[i];
|
|
if (res.All(b=>b)) // At least one card matches the relearn moves.
|
|
return res;
|
|
}
|
|
}
|
|
}
|
|
else if (egg)
|
|
{
|
|
if (Legal.SplitBreed.Contains(pk6.Species))
|
|
{
|
|
res = new bool[4];
|
|
for (int i = 0; i < 4; i++)
|
|
res[i] = relearnMoves.Contains(Moves[i]);
|
|
if (!res.Any(move => !move))
|
|
return res;
|
|
|
|
// Try Next Species up
|
|
Legal.getValidRelearn(pk6, 1);
|
|
for (int i = 0; i < 4; i++)
|
|
res[i] = relearnMoves.Contains(Moves[i]);
|
|
return res;
|
|
}
|
|
|
|
if (Legal.LightBall.Contains(pk6.Species))
|
|
relearnMoves = relearnMoves.Concat(new[] {344}).ToArray();
|
|
for (int i = 0; i < 4; i++)
|
|
res[i] &= relearnMoves.Contains(Moves[i]);
|
|
return res;
|
|
}
|
|
else if (Moves[0] != 0) // DexNav only?
|
|
{
|
|
// Check DexNav
|
|
for (int i = 0; i < 4; i++)
|
|
res[i] &= Moves[i] == 0;
|
|
if (Legal.getDexNavValid(pk6))
|
|
res[0] = relearnMoves.Contains(Moves[0]);
|
|
|
|
return res;
|
|
}
|
|
|
|
// Should have no relearn moves.
|
|
noRelearn:
|
|
for (int i = 0; i < 4; i++)
|
|
res[i] = Moves[i] == 0;
|
|
return res;
|
|
}
|
|
private string getLegalityReport()
|
|
{
|
|
return null;
|
|
}
|
|
}
|
|
}
|