2022-06-18 18:04:24 +00:00
|
|
|
namespace PKHeX.Core;
|
|
|
|
|
|
|
|
/// <summary>
|
|
|
|
/// Shadow Pokémon Encounter found in <see cref="GameVersion.CXD"/>
|
|
|
|
/// </summary>
|
|
|
|
/// <inheritdoc cref="EncounterStatic"/>
|
|
|
|
/// <param name="ID">Initial Shadow Gauge value.</param>
|
|
|
|
/// <param name="Gauge">Initial Shadow Gauge value.</param>
|
|
|
|
/// <param name="Locks">Team Specification with required <see cref="Species"/>, <see cref="Nature"/> and Gender.</param>
|
|
|
|
// ReSharper disable NotAccessedPositionalProperty.Global
|
|
|
|
public sealed record EncounterStaticShadow(GameVersion Version, byte ID, short Gauge, TeamLock[] Locks) : EncounterStatic(Version)
|
2018-03-09 05:18:32 +00:00
|
|
|
{
|
2022-06-18 18:04:24 +00:00
|
|
|
// ReSharper restore NotAccessedPositionalProperty.Global
|
|
|
|
public override int Generation => 3;
|
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 23:15:27 +00:00
|
|
|
public override EntityContext Context => EntityContext.Gen3;
|
2022-06-18 18:04:24 +00:00
|
|
|
|
2019-09-10 07:21:51 +00:00
|
|
|
/// <summary>
|
2022-06-18 18:04:24 +00:00
|
|
|
/// Originates from the EReader scans (Japanese Only)
|
2019-09-10 07:21:51 +00:00
|
|
|
/// </summary>
|
2022-08-22 02:15:02 +00:00
|
|
|
public bool EReader => Location == 128; // @ Card e Room (Japanese games only)
|
2020-09-13 21:40:10 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
protected override bool IsMatchLocation(PKM pk)
|
|
|
|
{
|
|
|
|
if (pk.Format != 3)
|
|
|
|
return true; // transfer location verified later
|
2018-08-03 03:11:42 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
var met = pk.Met_Location;
|
|
|
|
if (met == Location)
|
|
|
|
return true;
|
2020-08-30 17:23:22 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
// XD can re-battle with Miror B
|
|
|
|
// Realgam Tower, Rock, Oasis, Cave, Pyrite Town
|
|
|
|
return Version == GameVersion.XD && met is (59 or 90 or 91 or 92 or 113);
|
|
|
|
}
|
2020-08-30 17:23:22 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
protected override bool IsMatchLevel(PKM pk, EvoCriteria evo)
|
|
|
|
{
|
|
|
|
if (pk.Format != 3) // Met Level lost on PK3=>PK4
|
|
|
|
return Level <= evo.LevelMax;
|
2020-09-13 21:40:10 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
return pk.Met_Level == Level;
|
|
|
|
}
|
2020-09-13 21:40:10 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
protected override void ApplyDetails(ITrainerInfo tr, EncounterCriteria criteria, PKM pk)
|
|
|
|
{
|
|
|
|
base.ApplyDetails(tr, criteria, pk);
|
|
|
|
((IRibbonSetEvent3)pk).RibbonNational = true;
|
|
|
|
}
|
2020-09-13 21:40:10 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
protected override void SetPINGA(PKM pk, EncounterCriteria criteria)
|
|
|
|
{
|
|
|
|
if (!EReader)
|
|
|
|
SetPINGA_Regular(pk, criteria);
|
|
|
|
else
|
|
|
|
SetPINGA_EReader(pk);
|
|
|
|
}
|
2021-01-31 03:42:58 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
private void SetPINGA_Regular(PKM pk, EncounterCriteria criteria)
|
|
|
|
{
|
|
|
|
var pi = pk.PersonalInfo;
|
|
|
|
int gender = criteria.GetGender(-1, pi);
|
|
|
|
int nature = (int)criteria.GetNature(Nature.Random);
|
|
|
|
int ability = criteria.GetAbilityFromNumber(0);
|
|
|
|
|
|
|
|
// Ensure that any generated specimen has valid Shadow Locks
|
|
|
|
// This can be kinda slow, depending on how many locks / how strict they are.
|
|
|
|
// Cancel this operation if too many attempts are made to prevent infinite loops.
|
|
|
|
int ctr = 0;
|
|
|
|
const int max = 100_000;
|
|
|
|
do
|
2022-02-09 17:26:10 +00:00
|
|
|
{
|
2022-06-18 18:04:24 +00:00
|
|
|
PIDGenerator.SetRandomWildPID(pk, 3, nature, ability, gender, PIDType.CXD);
|
|
|
|
var pidiv = MethodFinder.Analyze(pk);
|
|
|
|
var result = LockFinder.IsAllShadowLockValid(this, pidiv, pk);
|
|
|
|
if (result)
|
|
|
|
break;
|
2022-02-09 17:26:10 +00:00
|
|
|
}
|
2022-06-18 18:04:24 +00:00
|
|
|
while (++ctr <= max);
|
2021-01-31 03:42:58 +00:00
|
|
|
|
|
|
|
#if DEBUG
|
2022-06-18 18:04:24 +00:00
|
|
|
System.Diagnostics.Debug.Assert(ctr < 100_000);
|
2021-01-31 03:42:58 +00:00
|
|
|
#endif
|
2022-06-18 18:04:24 +00:00
|
|
|
}
|
2021-01-31 03:42:58 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
private void SetPINGA_EReader(PKM pk)
|
|
|
|
{
|
|
|
|
// E-Reader have all IVs == 0
|
2022-08-22 00:34:32 +00:00
|
|
|
for (int i = 0; i < 6; i++)
|
2022-06-18 18:04:24 +00:00
|
|
|
pk.SetIV(i, 0);
|
|
|
|
|
|
|
|
// All E-Reader shadows are actually nature/gender locked.
|
|
|
|
var locked = Locks[0].Locks[^1];
|
|
|
|
var (nature, gender) = locked.GetLock;
|
|
|
|
|
|
|
|
// Ensure that any generated specimen has valid Shadow Locks
|
|
|
|
// This can be kinda slow, depending on how many locks / how strict they are.
|
|
|
|
// Cancel this operation if too many attempts are made to prevent infinite loops.
|
|
|
|
int ctr = 0;
|
|
|
|
const int max = 100_000;
|
|
|
|
do
|
2022-02-09 17:26:10 +00:00
|
|
|
{
|
2022-06-18 18:04:24 +00:00
|
|
|
var seed = Util.Rand32();
|
|
|
|
PIDGenerator.SetValuesFromSeedXDRNG_EReader(pk, seed);
|
|
|
|
if (pk.Nature != nature || pk.Gender != gender)
|
|
|
|
continue;
|
|
|
|
var pidiv = new PIDIV(PIDType.CXD, seed);
|
|
|
|
var result = LockFinder.IsAllShadowLockValid(this, pidiv, pk);
|
|
|
|
if (result)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
while (++ctr <= max);
|
2022-02-09 17:26:10 +00:00
|
|
|
|
|
|
|
#if DEBUG
|
2022-06-18 18:04:24 +00:00
|
|
|
System.Diagnostics.Debug.Assert(ctr < 100_000);
|
2022-02-09 17:26:10 +00:00
|
|
|
#endif
|
2018-10-21 02:03:04 +00:00
|
|
|
}
|
2020-08-30 17:23:22 +00:00
|
|
|
}
|