2022-06-18 18:04:24 +00:00
|
|
|
using System;
|
2022-01-03 05:35:59 +00:00
|
|
|
using static System.Buffers.Binary.BinaryPrimitives;
|
2015-11-22 21:38:16 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
namespace PKHeX.Core;
|
|
|
|
|
|
|
|
/// <summary>
|
|
|
|
/// Generation 6 Mystery Gift Template File
|
|
|
|
/// </summary>
|
|
|
|
public sealed class WC6 : DataMysteryGift, IRibbonSetEvent3, IRibbonSetEvent4, ILangNick, IContestStats, IContestStatsMutable, INature, IMemoryOT
|
2015-11-22 21:38:16 +00:00
|
|
|
{
|
2022-06-18 18:04:24 +00:00
|
|
|
public const int Size = 0x108;
|
|
|
|
public const uint EonTicketConst = 0x225D73C2;
|
|
|
|
public override int Generation => 6;
|
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.Gen6;
|
2022-06-18 18:04:24 +00:00
|
|
|
|
|
|
|
public WC6() : this(new byte[Size]) { }
|
|
|
|
public WC6(byte[] data) : base(data) { }
|
|
|
|
|
|
|
|
public int RestrictLanguage { get; set; } // None
|
|
|
|
public byte RestrictVersion { get; set; } // Permit All
|
|
|
|
|
|
|
|
public bool CanBeReceivedByVersion(int v)
|
2015-11-22 21:38:16 +00:00
|
|
|
{
|
2022-06-18 18:04:24 +00:00
|
|
|
if (v is < (int)GameVersion.X or > (int)GameVersion.OR)
|
|
|
|
return false;
|
|
|
|
if (RestrictVersion == 0)
|
|
|
|
return true; // no data
|
|
|
|
var bitIndex = v - (int) GameVersion.X;
|
|
|
|
var bit = 1 << bitIndex;
|
|
|
|
return (RestrictVersion & bit) != 0;
|
|
|
|
}
|
2015-11-22 21:38:16 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
// General Card Properties
|
|
|
|
public override int CardID
|
|
|
|
{
|
|
|
|
get => ReadUInt16LittleEndian(Data.AsSpan(0));
|
|
|
|
set => WriteUInt16LittleEndian(Data.AsSpan(0), (ushort)value);
|
|
|
|
}
|
2018-05-12 15:13:39 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
public override string CardTitle
|
|
|
|
{
|
|
|
|
// Max len 36 char, followed by null terminator
|
|
|
|
get => StringConverter6.GetString(Data.AsSpan(2, 0x4A));
|
|
|
|
set => StringConverter6.SetString(Data.AsSpan(2, 0x4A), value.AsSpan(), 36, StringConverterOption.ClearZero);
|
|
|
|
}
|
2018-08-10 04:53:39 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
internal uint RawDate
|
|
|
|
{
|
|
|
|
get => ReadUInt32LittleEndian(Data.AsSpan(0x4C));
|
|
|
|
set => WriteUInt32LittleEndian(Data.AsSpan(0x4C), value);
|
|
|
|
}
|
2018-07-28 05:26:27 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
private uint Year
|
|
|
|
{
|
|
|
|
get => RawDate / 10000;
|
|
|
|
set => RawDate = SetDate(value, Month, Day);
|
|
|
|
}
|
2018-08-10 04:53:39 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
private uint Month
|
|
|
|
{
|
|
|
|
get => RawDate % 10000 / 100;
|
|
|
|
set => RawDate = SetDate(Year, value, Day);
|
|
|
|
}
|
2018-08-10 04:53:39 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
private uint Day
|
|
|
|
{
|
|
|
|
get => RawDate % 100;
|
|
|
|
set => RawDate = SetDate(Year, Month, value);
|
|
|
|
}
|
2018-08-10 04:53:39 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
public static uint SetDate(uint year, uint month, uint day) => (year * 10000) + (month * 100) + day;
|
2018-08-10 04:53:39 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
/// <summary>
|
|
|
|
/// Gets or sets the date of the card.
|
|
|
|
/// </summary>
|
|
|
|
public DateTime? Date
|
|
|
|
{
|
|
|
|
get
|
2018-08-10 04:53:39 +00:00
|
|
|
{
|
2022-06-18 18:04:24 +00:00
|
|
|
// Check to see if date is valid
|
|
|
|
if (!DateUtil.IsDateValid(Year, Month, Day))
|
|
|
|
return null;
|
2018-08-10 04:53:39 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
return new DateTime((int)Year, (int)Month, (int)Day);
|
2018-08-10 04:53:39 +00:00
|
|
|
}
|
2022-06-18 18:04:24 +00:00
|
|
|
set
|
2016-08-10 14:02:31 +00:00
|
|
|
{
|
2022-06-18 18:04:24 +00:00
|
|
|
if (value.HasValue)
|
2016-08-10 14:02:31 +00:00
|
|
|
{
|
2022-06-18 18:04:24 +00:00
|
|
|
// Only update the properties if a value is provided.
|
|
|
|
Year = (ushort)value.Value.Year;
|
|
|
|
Month = (byte)value.Value.Month;
|
|
|
|
Day = (byte)value.Value.Day;
|
2016-08-10 14:02:31 +00:00
|
|
|
}
|
2022-06-18 18:04:24 +00:00
|
|
|
else
|
2016-08-10 14:02:31 +00:00
|
|
|
{
|
2022-06-18 18:04:24 +00:00
|
|
|
// Clear the Met Date.
|
|
|
|
// If code tries to access MetDate again, null will be returned.
|
|
|
|
Year = 0;
|
|
|
|
Month = 0;
|
|
|
|
Day = 0;
|
2016-08-10 14:02:31 +00:00
|
|
|
}
|
|
|
|
}
|
2022-06-18 18:04:24 +00:00
|
|
|
}
|
2016-08-10 14:02:31 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
public int CardLocation { get => Data[0x50]; set => Data[0x50] = (byte)value; }
|
2015-11-22 21:38:16 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
public int CardType { get => Data[0x51]; set => Data[0x51] = (byte)value; }
|
|
|
|
public override bool GiftUsed { get => Data[0x52] >> 1 > 0; set => Data[0x52] = (byte)((Data[0x52] & ~2) | (value ? 2 : 0)); }
|
|
|
|
public bool MultiObtain { get => Data[0x53] == 1; set => Data[0x53] = value ? (byte)1 : (byte)0; }
|
2015-11-22 21:38:16 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
// Item Properties
|
|
|
|
public override bool IsItem { get => CardType == 1; set { if (value) CardType = 1; } }
|
2018-08-10 04:53:39 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
public override int ItemID {
|
|
|
|
get => ReadUInt16LittleEndian(Data.AsSpan(0x68));
|
|
|
|
set => WriteUInt16LittleEndian(Data.AsSpan(0x68), (ushort)value); }
|
2018-08-10 04:53:39 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
public override int Quantity {
|
|
|
|
get => ReadUInt16LittleEndian(Data.AsSpan(0x70));
|
|
|
|
set => WriteUInt16LittleEndian(Data.AsSpan(0x70), (ushort)value); }
|
2018-05-12 15:13:39 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
// Pokémon Properties
|
|
|
|
public override bool IsEntity { get => CardType == 0; set { if (value) CardType = 0; } }
|
|
|
|
public override bool IsShiny => Shiny.IsShiny();
|
2022-01-06 00:46:23 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
public override Shiny Shiny => IsEgg ? Shiny.Random : PIDType switch
|
|
|
|
{
|
|
|
|
ShinyType6.FixedValue => GetShinyXor() switch
|
2022-01-06 00:46:23 +00:00
|
|
|
{
|
2022-06-18 18:04:24 +00:00
|
|
|
0 => Shiny.AlwaysSquare,
|
|
|
|
<= 15 => Shiny.AlwaysStar,
|
|
|
|
_ => Shiny.Never,
|
|
|
|
},
|
|
|
|
ShinyType6.Random => Shiny.Random,
|
|
|
|
ShinyType6.Never => Shiny.Never,
|
|
|
|
ShinyType6.Always => Shiny.Always,
|
|
|
|
_ => throw new ArgumentOutOfRangeException(),
|
|
|
|
};
|
|
|
|
|
|
|
|
private int GetShinyXor()
|
|
|
|
{
|
|
|
|
// Player owned anti-shiny fixed PID
|
|
|
|
if (TID == 0 && SID == 0)
|
|
|
|
return int.MaxValue;
|
|
|
|
|
|
|
|
var pid = PID;
|
|
|
|
var psv = (int)((pid >> 16) ^ (pid & 0xFFFF));
|
|
|
|
var tsv = TID ^ SID;
|
|
|
|
return psv ^ tsv;
|
|
|
|
}
|
2022-01-06 00:46:23 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
public override int TID { get => ReadUInt16LittleEndian(Data.AsSpan(0x68)); set => WriteUInt16LittleEndian(Data.AsSpan(0x68), (ushort)value); }
|
|
|
|
public override int SID { get => ReadUInt16LittleEndian(Data.AsSpan(0x6A)); set => WriteUInt16LittleEndian(Data.AsSpan(0x6A), (ushort)value); }
|
|
|
|
public int OriginGame { get => Data[0x6C]; set => Data[0x6C] = (byte)value; }
|
|
|
|
public uint EncryptionConstant { get => ReadUInt32LittleEndian(Data.AsSpan(0x70)); set => WriteUInt32LittleEndian(Data.AsSpan(0x70), value); }
|
|
|
|
public override int Ball { get => Data[0x76]; set => Data[0x76] = (byte)value; }
|
|
|
|
public override int HeldItem { get => ReadUInt16LittleEndian(Data.AsSpan(0x78)); set => WriteUInt16LittleEndian(Data.AsSpan(0x78), (ushort)value); }
|
|
|
|
|
|
|
|
public int Move1 { get => ReadUInt16LittleEndian(Data.AsSpan(0x7A)); set => WriteUInt16LittleEndian(Data.AsSpan(0x7A), (ushort)value); }
|
|
|
|
public int Move2 { get => ReadUInt16LittleEndian(Data.AsSpan(0x7C)); set => WriteUInt16LittleEndian(Data.AsSpan(0x7C), (ushort)value); }
|
|
|
|
public int Move3 { get => ReadUInt16LittleEndian(Data.AsSpan(0x7E)); set => WriteUInt16LittleEndian(Data.AsSpan(0x7E), (ushort)value); }
|
|
|
|
public int Move4 { get => ReadUInt16LittleEndian(Data.AsSpan(0x80)); set => WriteUInt16LittleEndian(Data.AsSpan(0x80), (ushort)value); }
|
2022-01-06 00:46:23 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
public override int Species { get => ReadUInt16LittleEndian(Data.AsSpan(0x82)); set => WriteUInt16LittleEndian(Data.AsSpan(0x82), (ushort)value); }
|
|
|
|
public override int Form { get => Data[0x84]; set => Data[0x84] = (byte)value; }
|
|
|
|
public int Language { get => Data[0x85]; set => Data[0x85] = (byte)value; }
|
2018-08-10 04:53:39 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
public string Nickname
|
|
|
|
{
|
|
|
|
get => StringConverter6.GetString(Data.AsSpan(0x86, 0x1A));
|
|
|
|
set => StringConverter6.SetString(Data.AsSpan(0x86, 0x1A), value.AsSpan(), 12, StringConverterOption.ClearZero);
|
|
|
|
}
|
2018-08-10 04:53:39 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
public int Nature { get => (sbyte)Data[0xA0]; set => Data[0xA0] = (byte)value; }
|
|
|
|
public override int Gender { get => Data[0xA1]; set => Data[0xA1] = (byte)value; }
|
|
|
|
public override int AbilityType { get => Data[0xA2]; set => Data[0xA2] = (byte)value; }
|
|
|
|
public ShinyType6 PIDType { get => (ShinyType6)Data[0xA3]; set => Data[0xA3] = (byte)value; }
|
|
|
|
public override int EggLocation { get => ReadUInt16LittleEndian(Data.AsSpan(0xA4)); set => WriteUInt16LittleEndian(Data.AsSpan(0xA4), (ushort)value); }
|
|
|
|
public int MetLocation { get => ReadUInt16LittleEndian(Data.AsSpan(0xA6)); set => WriteUInt16LittleEndian(Data.AsSpan(0xA6), (ushort)value); }
|
|
|
|
|
|
|
|
public byte CNT_Cool { get => Data[0xA9]; set => Data[0xA9] = value; }
|
|
|
|
public byte CNT_Beauty { get => Data[0xAA]; set => Data[0xAA] = value; }
|
|
|
|
public byte CNT_Cute { get => Data[0xAB]; set => Data[0xAB] = value; }
|
|
|
|
public byte CNT_Smart { get => Data[0xAC]; set => Data[0xAC] = value; }
|
|
|
|
public byte CNT_Tough { get => Data[0xAD]; set => Data[0xAD] = value; }
|
|
|
|
public byte CNT_Sheen { get => Data[0xAE]; set => Data[0xAE] = value; }
|
|
|
|
|
|
|
|
public int IV_HP { get => Data[0xAF]; set => Data[0xAF] = (byte)value; }
|
|
|
|
public int IV_ATK { get => Data[0xB0]; set => Data[0xB0] = (byte)value; }
|
|
|
|
public int IV_DEF { get => Data[0xB1]; set => Data[0xB1] = (byte)value; }
|
|
|
|
public int IV_SPE { get => Data[0xB2]; set => Data[0xB2] = (byte)value; }
|
|
|
|
public int IV_SPA { get => Data[0xB3]; set => Data[0xB3] = (byte)value; }
|
|
|
|
public int IV_SPD { get => Data[0xB4]; set => Data[0xB4] = (byte)value; }
|
|
|
|
|
|
|
|
public int OTGender { get => Data[0xB5]; set => Data[0xB5] = (byte)value; }
|
|
|
|
|
|
|
|
public override string OT_Name
|
|
|
|
{
|
|
|
|
get => StringConverter6.GetString(Data.AsSpan(0xB6, 0x1A));
|
|
|
|
set => StringConverter6.SetString(Data.AsSpan(0xB6, 0x1A), value.AsSpan(), 12, StringConverterOption.ClearZero);
|
|
|
|
}
|
2018-08-10 04:53:39 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
public override byte Level { get => Data[0xD0]; set => Data[0xD0] = value; }
|
|
|
|
public override bool IsEgg { get => Data[0xD1] == 1; set => Data[0xD1] = value ? (byte)1 : (byte)0; }
|
|
|
|
public uint PID { get => ReadUInt32LittleEndian(Data.AsSpan(0xD4)); set => WriteUInt32LittleEndian(Data.AsSpan(0xD4), value); }
|
|
|
|
|
|
|
|
public int RelearnMove1 { get => ReadUInt16LittleEndian(Data.AsSpan(0xD8)); set => WriteUInt16LittleEndian(Data.AsSpan(0xD8), (ushort)value); }
|
|
|
|
public int RelearnMove2 { get => ReadUInt16LittleEndian(Data.AsSpan(0xDA)); set => WriteUInt16LittleEndian(Data.AsSpan(0xDA), (ushort)value); }
|
|
|
|
public int RelearnMove3 { get => ReadUInt16LittleEndian(Data.AsSpan(0xDC)); set => WriteUInt16LittleEndian(Data.AsSpan(0xDC), (ushort)value); }
|
|
|
|
public int RelearnMove4 { get => ReadUInt16LittleEndian(Data.AsSpan(0xDE)); set => WriteUInt16LittleEndian(Data.AsSpan(0xDE), (ushort)value); }
|
|
|
|
|
|
|
|
public byte OT_Intensity { get => Data[0xE0]; set => Data[0xE0] = value; }
|
|
|
|
public byte OT_Memory { get => Data[0xE1]; set => Data[0xE1] = value; }
|
|
|
|
public ushort OT_TextVar { get => ReadUInt16LittleEndian(Data.AsSpan(0xE2)); set => WriteUInt16LittleEndian(Data.AsSpan(0xE2), value); }
|
|
|
|
public byte OT_Feeling { get => Data[0xE4]; set => Data[0xE4] = value; }
|
|
|
|
|
|
|
|
public int EV_HP { get => Data[0xE5]; set => Data[0xE5] = (byte)value; }
|
|
|
|
public int EV_ATK { get => Data[0xE6]; set => Data[0xE6] = (byte)value; }
|
|
|
|
public int EV_DEF { get => Data[0xE7]; set => Data[0xE7] = (byte)value; }
|
|
|
|
public int EV_SPE { get => Data[0xE8]; set => Data[0xE8] = (byte)value; }
|
|
|
|
public int EV_SPA { get => Data[0xE9]; set => Data[0xE9] = (byte)value; }
|
|
|
|
public int EV_SPD { get => Data[0xEA]; set => Data[0xEA] = (byte)value; }
|
|
|
|
|
|
|
|
private byte RIB0 { get => Data[0x74]; set => Data[0x74] = value; }
|
|
|
|
private byte RIB1 { get => Data[0x75]; set => Data[0x75] = value; }
|
|
|
|
public bool RibbonChampionBattle { get => (RIB0 & (1 << 0)) == 1 << 0; set => RIB0 = (byte)((RIB0 & ~(1 << 0)) | (value ? 1 << 0 : 0)); }
|
|
|
|
public bool RibbonChampionRegional { get => (RIB0 & (1 << 1)) == 1 << 1; set => RIB0 = (byte)((RIB0 & ~(1 << 1)) | (value ? 1 << 1 : 0)); }
|
|
|
|
public bool RibbonChampionNational { get => (RIB0 & (1 << 2)) == 1 << 2; set => RIB0 = (byte)((RIB0 & ~(1 << 2)) | (value ? 1 << 2 : 0)); }
|
|
|
|
public bool RibbonCountry { get => (RIB0 & (1 << 3)) == 1 << 3; set => RIB0 = (byte)((RIB0 & ~(1 << 3)) | (value ? 1 << 3 : 0)); }
|
|
|
|
public bool RibbonNational { get => (RIB0 & (1 << 4)) == 1 << 4; set => RIB0 = (byte)((RIB0 & ~(1 << 4)) | (value ? 1 << 4 : 0)); }
|
|
|
|
public bool RibbonEarth { get => (RIB0 & (1 << 5)) == 1 << 5; set => RIB0 = (byte)((RIB0 & ~(1 << 5)) | (value ? 1 << 5 : 0)); }
|
|
|
|
public bool RibbonWorld { get => (RIB0 & (1 << 6)) == 1 << 6; set => RIB0 = (byte)((RIB0 & ~(1 << 6)) | (value ? 1 << 6 : 0)); }
|
|
|
|
public bool RibbonEvent { get => (RIB0 & (1 << 7)) == 1 << 7; set => RIB0 = (byte)((RIB0 & ~(1 << 7)) | (value ? 1 << 7 : 0)); }
|
|
|
|
public bool RibbonChampionWorld { get => (RIB1 & (1 << 0)) == 1 << 0; set => RIB1 = (byte)((RIB1 & ~(1 << 0)) | (value ? 1 << 0 : 0)); }
|
|
|
|
public bool RibbonBirthday { get => (RIB1 & (1 << 1)) == 1 << 1; set => RIB1 = (byte)((RIB1 & ~(1 << 1)) | (value ? 1 << 1 : 0)); }
|
|
|
|
public bool RibbonSpecial { get => (RIB1 & (1 << 2)) == 1 << 2; set => RIB1 = (byte)((RIB1 & ~(1 << 2)) | (value ? 1 << 2 : 0)); }
|
|
|
|
public bool RibbonSouvenir { get => (RIB1 & (1 << 3)) == 1 << 3; set => RIB1 = (byte)((RIB1 & ~(1 << 3)) | (value ? 1 << 3 : 0)); }
|
|
|
|
public bool RibbonWishing { get => (RIB1 & (1 << 4)) == 1 << 4; set => RIB1 = (byte)((RIB1 & ~(1 << 4)) | (value ? 1 << 4 : 0)); }
|
|
|
|
public bool RibbonClassic { get => (RIB1 & (1 << 5)) == 1 << 5; set => RIB1 = (byte)((RIB1 & ~(1 << 5)) | (value ? 1 << 5 : 0)); }
|
|
|
|
public bool RibbonPremier { get => (RIB1 & (1 << 6)) == 1 << 6; set => RIB1 = (byte)((RIB1 & ~(1 << 6)) | (value ? 1 << 6 : 0)); }
|
|
|
|
public bool RIB1_7 { get => (RIB1 & (1 << 7)) == 1 << 7; set => RIB1 = (byte)((RIB1 & ~(1 << 7)) | (value ? 1 << 7 : 0)); }
|
|
|
|
|
|
|
|
// Meta Accessible Properties
|
|
|
|
public override int[] IVs
|
|
|
|
{
|
|
|
|
get => new[] { IV_HP, IV_ATK, IV_DEF, IV_SPE, IV_SPA, IV_SPD };
|
|
|
|
set
|
2018-08-10 04:53:39 +00:00
|
|
|
{
|
2022-06-18 18:04:24 +00:00
|
|
|
if (value.Length != 6) return;
|
|
|
|
IV_HP = value[0]; IV_ATK = value[1]; IV_DEF = value[2];
|
|
|
|
IV_SPE = value[3]; IV_SPA = value[4]; IV_SPD = value[5];
|
2018-08-10 04:53:39 +00:00
|
|
|
}
|
2022-06-18 18:04:24 +00:00
|
|
|
}
|
2018-08-10 04:53:39 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
public int[] EVs
|
|
|
|
{
|
|
|
|
get => new[] { EV_HP, EV_ATK, EV_DEF, EV_SPE, EV_SPA, EV_SPD };
|
|
|
|
set
|
2018-08-10 04:53:39 +00:00
|
|
|
{
|
2022-06-18 18:04:24 +00:00
|
|
|
if (value.Length != 6) return;
|
|
|
|
EV_HP = value[0]; EV_ATK = value[1]; EV_DEF = value[2];
|
|
|
|
EV_SPE = value[3]; EV_SPA = value[4]; EV_SPD = value[5];
|
2017-05-13 03:32:36 +00:00
|
|
|
}
|
2022-06-18 18:04:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
public bool IsNicknamed => Nickname.Length > 0;
|
|
|
|
public override int Location { get => MetLocation; set => MetLocation = (ushort)value; }
|
2018-08-10 04:53:39 +00:00
|
|
|
|
2022-08-22 00:34:32 +00:00
|
|
|
public override Moveset Moves
|
2022-06-18 18:04:24 +00:00
|
|
|
{
|
2022-08-22 00:34:32 +00:00
|
|
|
get => new((ushort)Move1, (ushort)Move2, (ushort)Move3, (ushort)Move4);
|
2022-06-18 18:04:24 +00:00
|
|
|
set
|
2017-01-06 02:33:11 +00:00
|
|
|
{
|
2022-08-22 00:34:32 +00:00
|
|
|
Move1 = value.Move1;
|
|
|
|
Move2 = value.Move2;
|
|
|
|
Move3 = value.Move3;
|
|
|
|
Move4 = value.Move4;
|
2017-01-06 02:33:11 +00:00
|
|
|
}
|
2022-06-18 18:04:24 +00:00
|
|
|
}
|
2018-08-10 04:53:39 +00:00
|
|
|
|
2022-08-22 00:34:32 +00:00
|
|
|
public override Moveset Relearn
|
2022-06-18 18:04:24 +00:00
|
|
|
{
|
2022-08-22 00:34:32 +00:00
|
|
|
get => new((ushort)RelearnMove1, (ushort)RelearnMove2, (ushort)RelearnMove3, (ushort)RelearnMove4);
|
2022-06-18 18:04:24 +00:00
|
|
|
set
|
2017-01-06 02:33:11 +00:00
|
|
|
{
|
2022-08-22 00:34:32 +00:00
|
|
|
RelearnMove1 = value.Move1;
|
|
|
|
RelearnMove2 = value.Move2;
|
|
|
|
RelearnMove3 = value.Move3;
|
|
|
|
RelearnMove4 = value.Move4;
|
2017-01-06 02:33:11 +00:00
|
|
|
}
|
2022-06-18 18:04:24 +00:00
|
|
|
}
|
2018-08-10 04:53:39 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
public bool IsLinkGift => MetLocation == Locations.LinkGift6;
|
2016-01-17 21:27:24 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
public override PKM ConvertToPKM(ITrainerInfo tr, EncounterCriteria criteria)
|
|
|
|
{
|
|
|
|
if (!IsEntity)
|
|
|
|
throw new ArgumentException(nameof(IsEntity));
|
|
|
|
|
|
|
|
var rnd = Util.Rand;
|
|
|
|
|
|
|
|
int currentLevel = Level > 0 ? Level : rnd.Next(1, 101);
|
|
|
|
var pi = PersonalTable.AO.GetFormEntry(Species, Form);
|
|
|
|
PK6 pk = new()
|
2015-11-22 21:38:16 +00:00
|
|
|
{
|
2022-06-18 18:04:24 +00:00
|
|
|
Species = Species,
|
|
|
|
HeldItem = HeldItem,
|
|
|
|
TID = TID,
|
|
|
|
SID = SID,
|
|
|
|
Met_Level = currentLevel,
|
|
|
|
Form = Form,
|
|
|
|
EncryptionConstant = EncryptionConstant != 0 ? EncryptionConstant : Util.Rand32(),
|
|
|
|
Version = OriginGame != 0 ? OriginGame : tr.Game,
|
|
|
|
Language = Language != 0 ? Language : tr.Language,
|
|
|
|
Ball = Ball,
|
|
|
|
Move1 = Move1, Move2 = Move2, Move3 = Move3, Move4 = Move4,
|
|
|
|
RelearnMove1 = RelearnMove1, RelearnMove2 = RelearnMove2,
|
|
|
|
RelearnMove3 = RelearnMove3, RelearnMove4 = RelearnMove4,
|
|
|
|
Met_Location = MetLocation,
|
|
|
|
Egg_Location = EggLocation,
|
|
|
|
CNT_Cool = CNT_Cool,
|
|
|
|
CNT_Beauty = CNT_Beauty,
|
|
|
|
CNT_Cute = CNT_Cute,
|
|
|
|
CNT_Smart = CNT_Smart,
|
|
|
|
CNT_Tough = CNT_Tough,
|
|
|
|
CNT_Sheen = CNT_Sheen,
|
|
|
|
|
|
|
|
OT_Name = OT_Name.Length > 0 ? OT_Name : tr.OT,
|
|
|
|
OT_Gender = OTGender != 3 ? OTGender % 2 : tr.Gender,
|
|
|
|
HT_Name = OT_Name.Length > 0 ? tr.OT : string.Empty,
|
|
|
|
HT_Gender = OT_Name.Length > 0 ? tr.Gender : 0,
|
|
|
|
CurrentHandler = OT_Name.Length > 0 ? 1 : 0,
|
|
|
|
|
|
|
|
EXP = Experience.GetEXP(Level, pi.EXPGrowth),
|
|
|
|
|
|
|
|
// Ribbons
|
|
|
|
RibbonCountry = RibbonCountry,
|
|
|
|
RibbonNational = RibbonNational,
|
|
|
|
|
|
|
|
RibbonEarth = RibbonEarth,
|
|
|
|
RibbonWorld = RibbonWorld,
|
|
|
|
RibbonClassic = RibbonClassic,
|
|
|
|
RibbonPremier = RibbonPremier,
|
|
|
|
RibbonEvent = RibbonEvent,
|
|
|
|
RibbonBirthday = RibbonBirthday,
|
|
|
|
RibbonSpecial = RibbonSpecial,
|
|
|
|
RibbonSouvenir = RibbonSouvenir,
|
|
|
|
|
|
|
|
RibbonWishing = RibbonWishing,
|
|
|
|
RibbonChampionBattle = RibbonChampionBattle,
|
|
|
|
RibbonChampionRegional = RibbonChampionRegional,
|
|
|
|
RibbonChampionNational = RibbonChampionNational,
|
|
|
|
RibbonChampionWorld = RibbonChampionWorld,
|
|
|
|
|
|
|
|
OT_Friendship = pi.BaseFriendship,
|
|
|
|
OT_Intensity = OT_Intensity,
|
|
|
|
OT_Memory = OT_Memory,
|
|
|
|
OT_TextVar = OT_TextVar,
|
|
|
|
OT_Feeling = OT_Feeling,
|
|
|
|
FatefulEncounter = !IsLinkGift, // Link gifts do not set fateful encounter
|
|
|
|
|
|
|
|
EV_HP = EV_HP,
|
|
|
|
EV_ATK = EV_ATK,
|
|
|
|
EV_DEF = EV_DEF,
|
|
|
|
EV_SPE = EV_SPE,
|
|
|
|
EV_SPA = EV_SPA,
|
|
|
|
EV_SPD = EV_SPD,
|
|
|
|
};
|
2018-08-10 04:53:39 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
if (tr is IRegionOrigin o)
|
2015-11-22 21:38:16 +00:00
|
|
|
{
|
2022-06-18 18:04:24 +00:00
|
|
|
pk.Country = o.Country;
|
|
|
|
pk.Region = o.Region;
|
|
|
|
pk.ConsoleRegion = o.ConsoleRegion;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
pk.SetDefaultRegionOrigins();
|
2015-11-22 21:38:16 +00:00
|
|
|
}
|
2015-11-26 15:49:44 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
pk.SetMaximumPPCurrent();
|
Track a PKM's Box,Slot,StorageFlags,Identifier metadata separately (#3222)
* Track a PKM's Box,Slot,StorageFlags,Identifier metadata separately
Don't store within the object, track the slot origin data separately.
Batch editing now pre-filters if using Box/Slot/Identifier logic; split up mods/filters as they're starting to get pretty hefty.
- Requesting a Box Data report now shows all slots in the save file (party, misc)
- Can now exclude backup saves from database search via toggle (separate from settings preventing load entirely)
- Replace some linq usages with direct code
* Remove WasLink virtual in PKM
Inline any logic, since we now have encounter objects to indicate matching, rather than the proto-legality logic checking properties of a PKM.
* Use Fateful to directly check gen5 mysterygift origins
No other encounter types in gen5 apply Fateful
* Simplify double ball comparison
Used to be separate for deferral cases, now no longer needed to be separate.
* Grab move/relearn reference and update locally
Fix relearn move identifier
* Inline defog HM transfer preference check
HasMove is faster than getting moves & checking contains. Skips allocation by setting values directly.
* Extract more met location metadata checks: WasBredEgg
* Replace Console.Write* with Debug.Write*
There's no console output UI, so don't include them in release builds.
* Inline WasGiftEgg, WasEvent, and WasEventEgg logic
Adios legality tags that aren't entirely correct for the specific format. Just put the computations in EncounterFinder.
2021-06-23 03:23:48 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
pk.MetDate = Date ?? DateTime.Now;
|
2015-11-26 15:49:44 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
if ((tr.Generation > Generation && OriginGame == 0) || !CanBeReceivedByVersion(pk.Version))
|
|
|
|
{
|
|
|
|
// give random valid game
|
|
|
|
do { pk.Version = (int)GameVersion.X + rnd.Next(4); }
|
|
|
|
while (!CanBeReceivedByVersion(pk.Version));
|
|
|
|
}
|
2020-01-26 05:49:52 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
if (!IsEgg)
|
|
|
|
{
|
|
|
|
if (pk.CurrentHandler == 0) // OT
|
2020-07-31 20:53:42 +00:00
|
|
|
{
|
2022-06-18 18:04:24 +00:00
|
|
|
pk.OT_Memory = 3;
|
|
|
|
pk.OT_TextVar = 9;
|
|
|
|
pk.OT_Intensity = 1;
|
|
|
|
pk.OT_Feeling = MemoryContext6.GetRandomFeeling6(pk.OT_Memory, 10); // 0-9
|
2020-07-31 20:53:42 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2022-06-18 18:04:24 +00:00
|
|
|
pk.HT_Memory = 3;
|
|
|
|
pk.HT_TextVar = 9;
|
|
|
|
pk.HT_Intensity = 1;
|
|
|
|
pk.HT_Feeling = MemoryContext6.GetRandomFeeling6(pk.HT_Memory, 10); // 0-9
|
|
|
|
pk.HT_Friendship = pk.OT_Friendship;
|
2020-07-31 20:53:42 +00:00
|
|
|
}
|
2022-06-18 18:04:24 +00:00
|
|
|
}
|
2020-07-31 20:53:42 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
pk.IsNicknamed = IsNicknamed;
|
|
|
|
pk.Nickname = IsNicknamed ? Nickname : SpeciesName.GetSpeciesNameGeneration(Species, pk.Language, Generation);
|
2016-04-17 20:52:37 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
SetPINGA(pk, criteria);
|
2018-08-10 04:53:39 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
if (IsEgg)
|
|
|
|
SetEggMetData(pk);
|
|
|
|
pk.CurrentFriendship = pk.IsEgg ? pi.HatchCycles : pi.BaseFriendship;
|
2015-11-26 15:49:44 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
pk.RefreshChecksum();
|
|
|
|
return pk;
|
|
|
|
}
|
2019-02-09 19:37:20 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
private void SetEggMetData(PKM pk)
|
|
|
|
{
|
|
|
|
pk.IsEgg = true;
|
|
|
|
pk.EggMetDate = Date;
|
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
|
|
|
pk.Nickname = SpeciesName.GetEggName(pk.Language, Generation);
|
2022-06-18 18:04:24 +00:00
|
|
|
pk.IsNicknamed = true;
|
|
|
|
}
|
2019-02-09 19:37:20 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
private void SetPINGA(PKM pk, EncounterCriteria criteria)
|
|
|
|
{
|
|
|
|
var pi = PersonalTable.AO.GetFormEntry(Species, Form);
|
|
|
|
pk.Nature = (int)criteria.GetNature((Nature)Nature);
|
|
|
|
pk.Gender = criteria.GetGender(Gender, pi);
|
|
|
|
var av = GetAbilityIndex(criteria);
|
|
|
|
pk.RefreshAbility(av);
|
|
|
|
SetPID(pk);
|
|
|
|
SetIVs(pk);
|
|
|
|
}
|
2019-02-09 19:37:20 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
private int GetAbilityIndex(EncounterCriteria criteria) => AbilityType switch
|
|
|
|
{
|
|
|
|
00 or 01 or 02 => AbilityType, // Fixed 0/1/2
|
|
|
|
03 or 04 => criteria.GetAbilityFromNumber(Ability), // 0/1 or 0/1/H
|
|
|
|
_ => throw new ArgumentOutOfRangeException(nameof(AbilityType)),
|
|
|
|
};
|
2019-02-09 19:37:20 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
public override AbilityPermission Ability => AbilityType switch
|
|
|
|
{
|
|
|
|
0 => AbilityPermission.OnlyFirst,
|
|
|
|
1 => AbilityPermission.OnlySecond,
|
|
|
|
2 => AbilityPermission.OnlyHidden,
|
|
|
|
3 => AbilityPermission.Any12,
|
|
|
|
_ => AbilityPermission.Any12H,
|
|
|
|
};
|
|
|
|
|
|
|
|
private void SetPID(PKM pk)
|
|
|
|
{
|
|
|
|
switch (PIDType)
|
2019-02-09 19:37:20 +00:00
|
|
|
{
|
2022-06-18 18:04:24 +00:00
|
|
|
case ShinyType6.FixedValue: // Specified
|
|
|
|
pk.PID = PID;
|
|
|
|
break;
|
|
|
|
case ShinyType6.Random: // Random
|
|
|
|
pk.PID = Util.Rand32();
|
|
|
|
break;
|
|
|
|
case ShinyType6.Always: // Random Shiny
|
|
|
|
pk.PID = Util.Rand32();
|
|
|
|
pk.PID = (uint)(((pk.TID ^ pk.SID ^ (pk.PID & 0xFFFF)) << 16) | (pk.PID & 0xFFFF));
|
|
|
|
break;
|
|
|
|
case ShinyType6.Never: // Random Nonshiny
|
|
|
|
pk.PID = Util.Rand32();
|
|
|
|
if (pk.IsShiny) pk.PID ^= 0x10000000;
|
|
|
|
break;
|
2019-02-09 19:37:20 +00:00
|
|
|
}
|
2022-06-18 18:04:24 +00:00
|
|
|
}
|
2015-11-26 15:49:44 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
public override void GetIVs(Span<int> value)
|
|
|
|
{
|
|
|
|
if (value.Length != 6)
|
|
|
|
return;
|
|
|
|
value[0] = IV_HP;
|
|
|
|
value[1] = IV_ATK;
|
|
|
|
value[2] = IV_DEF;
|
|
|
|
value[3] = IV_SPE;
|
|
|
|
value[4] = IV_SPA;
|
|
|
|
value[5] = IV_SPD;
|
|
|
|
}
|
2021-12-09 08:46:59 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
private void SetIVs(PKM pk)
|
|
|
|
{
|
|
|
|
Span<int> finalIVs = stackalloc int[6];
|
|
|
|
GetIVs(finalIVs);
|
|
|
|
var ivflag = finalIVs.Find(iv => (byte)(iv - 0xFC) < 3);
|
|
|
|
var rng = Util.Rand;
|
|
|
|
if (ivflag == 0) // Random IVs
|
2019-02-09 19:37:20 +00:00
|
|
|
{
|
2022-06-18 18:04:24 +00:00
|
|
|
for (int i = 0; i < finalIVs.Length; i++)
|
2015-11-26 15:49:44 +00:00
|
|
|
{
|
2022-06-18 18:04:24 +00:00
|
|
|
if (finalIVs[i] > 31)
|
|
|
|
finalIVs[i] = rng.Next(32);
|
2015-11-26 15:49:44 +00:00
|
|
|
}
|
2019-02-09 19:37:20 +00:00
|
|
|
}
|
2022-06-18 18:04:24 +00:00
|
|
|
else // 1/2/3 perfect IVs
|
2022-03-14 02:24:08 +00:00
|
|
|
{
|
2022-06-18 18:04:24 +00:00
|
|
|
int IVCount = ivflag - 0xFB;
|
|
|
|
do { finalIVs[rng.Next(6)] = 31; }
|
|
|
|
while (finalIVs.Count(31) < IVCount);
|
|
|
|
for (int i = 0; i < finalIVs.Length; i++)
|
2019-02-09 19:37:20 +00:00
|
|
|
{
|
2022-06-18 18:04:24 +00:00
|
|
|
if (finalIVs[i] != 31)
|
|
|
|
finalIVs[i] = rng.Next(32);
|
2019-02-09 19:37:20 +00:00
|
|
|
}
|
2015-11-26 15:49:44 +00:00
|
|
|
}
|
2022-06-18 18:04:24 +00:00
|
|
|
pk.SetIVs(finalIVs);
|
|
|
|
}
|
2018-12-27 09:00:08 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
public override bool IsMatchExact(PKM pk, EvoCriteria evo)
|
|
|
|
{
|
|
|
|
if (!IsEgg)
|
2018-12-27 09:00:08 +00:00
|
|
|
{
|
2022-06-18 18:04:24 +00:00
|
|
|
if (OTGender != 3)
|
2018-12-27 09:00:08 +00:00
|
|
|
{
|
2022-06-18 18:04:24 +00:00
|
|
|
// Skip ID check if ORASDEMO Simulated wc6
|
|
|
|
if (CardID != 0)
|
2019-01-13 07:50:31 +00:00
|
|
|
{
|
2022-06-18 18:04:24 +00:00
|
|
|
if (SID != pk.SID) return false;
|
|
|
|
if (TID != pk.TID) return false;
|
2019-01-13 07:50:31 +00:00
|
|
|
}
|
2022-06-18 18:04:24 +00:00
|
|
|
if (OTGender != pk.OT_Gender) return false;
|
2018-12-27 09:00:08 +00:00
|
|
|
}
|
2022-06-18 18:04:24 +00:00
|
|
|
if (!string.IsNullOrEmpty(OT_Name) && OT_Name != pk.OT_Name) return false;
|
|
|
|
if (PIDType == ShinyType6.FixedValue && pk.PID != PID) return false;
|
|
|
|
if (!Shiny.IsValid(pk)) return false;
|
|
|
|
if (OriginGame != 0 && OriginGame != pk.Version) return false;
|
|
|
|
if (EncryptionConstant != 0 && EncryptionConstant != pk.EncryptionConstant) return false;
|
|
|
|
if (Language != 0 && Language != pk.Language) return false;
|
|
|
|
}
|
|
|
|
if (Form != evo.Form && !FormInfo.IsFormChangeable(Species, Form, pk.Form, pk.Format))
|
|
|
|
return false;
|
2018-12-27 09:00:08 +00:00
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
if (IsEgg)
|
|
|
|
{
|
|
|
|
if (EggLocation != pk.Egg_Location) // traded
|
2018-12-27 09:00:08 +00:00
|
|
|
{
|
2022-06-18 18:04:24 +00:00
|
|
|
if (pk.Egg_Location != Locations.LinkTrade6)
|
2018-12-27 09:00:08 +00:00
|
|
|
return false;
|
|
|
|
}
|
2022-06-18 18:04:24 +00:00
|
|
|
else if (PIDType == 0 && pk.IsShiny)
|
2018-12-27 09:00:08 +00:00
|
|
|
{
|
2022-06-18 18:04:24 +00:00
|
|
|
return false; // can't be traded away for unshiny
|
2018-12-27 09:00:08 +00:00
|
|
|
}
|
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
if (pk.IsEgg && !pk.IsNative)
|
2018-12-27 09:00:08 +00:00
|
|
|
return false;
|
|
|
|
}
|
2022-06-18 18:04:24 +00:00
|
|
|
else
|
2018-12-27 09:00:08 +00:00
|
|
|
{
|
2022-06-18 18:04:24 +00:00
|
|
|
if (!IsMatchEggLocation(pk)) return false;
|
|
|
|
if (MetLocation != pk.Met_Location) return false;
|
Fracture the encounter matching checks to allow progressive validation (#3137)
## Issue
We want to discard-but-remember any slots that aren't a perfect fit, on the off chance that a better one exists later in the search space. If there's no better match, then we gotta go with what we got.
## Example:
Wurmple exists in area `X`, and also has a more rare slot for Silcoon, with the same level for both slots.
* We have a Silcoon that we've leveled up a few times.
Was our Silcoon originally a Wurmple, or was it caught as a Silcoon?
* To be sure, we have to check the EC/PID if the Wurmple wouldn't evolve into Cascoon instead.
* We don't want to wholly reject that Wurmple slot, as maybe the Met Level isn't within Silcoon's slot range.
---
Existing implementation would store "deferred" matches in a list; we only need to keep 1 of these matches around (less allocation!). We also want to differentiate between a "good" deferral and a "bad" deferral; I don't think this is necessary but it's currently used by Mystery Gift matching (implemented for the Eeveelution mystery gifts which matter for evolution moves).
The existing logic didn't use inheritance, and instead had static methods being reused across generations. Quite kludgy. Also, the existing logic was a pain to modify the master encounter yield methods, as one generation's quirks had to not impact all other generations that used the method.
---
The new implementation splits out the encounter yielding methods to be separate for each generation / subset. Now, things don't have to check `WasLink` for Gen7 origin, because Pokémon Link wasn't a thing in Gen7.
---
## Future
Maybe refactoring yielders into "GameCores" that expose yielding behaviors / properties, rather than the static logic. As more generations and side-gamegroups get added (thanks LGPE/GO/GameCube), all this switch stuff gets annoying to maintain instead of just overriding/inheritance.
## Conclusion
This shouldn't impact any legality results negatively; if you notice any regressions, report them! This should reduce false flags where we didn't defer-discard an encounter when we should have (wild area mons being confused with raids).
2021-01-30 01:55:27 +00:00
|
|
|
}
|
|
|
|
|
2022-06-18 18:04:24 +00:00
|
|
|
if (Level != pk.Met_Level) return false;
|
|
|
|
if (Ball != pk.Ball) return false;
|
|
|
|
if (OTGender < 3 && OTGender != pk.OT_Gender) return false;
|
|
|
|
if (Nature != -1 && pk.Nature != Nature) return false;
|
|
|
|
if (Gender != 3 && Gender != pk.Gender) return false;
|
|
|
|
|
|
|
|
if (pk is IContestStats s && s.IsContestBelow(this))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
protected override bool IsMatchDeferred(PKM pk)
|
|
|
|
{
|
|
|
|
switch (CardID)
|
Fracture the encounter matching checks to allow progressive validation (#3137)
## Issue
We want to discard-but-remember any slots that aren't a perfect fit, on the off chance that a better one exists later in the search space. If there's no better match, then we gotta go with what we got.
## Example:
Wurmple exists in area `X`, and also has a more rare slot for Silcoon, with the same level for both slots.
* We have a Silcoon that we've leveled up a few times.
Was our Silcoon originally a Wurmple, or was it caught as a Silcoon?
* To be sure, we have to check the EC/PID if the Wurmple wouldn't evolve into Cascoon instead.
* We don't want to wholly reject that Wurmple slot, as maybe the Met Level isn't within Silcoon's slot range.
---
Existing implementation would store "deferred" matches in a list; we only need to keep 1 of these matches around (less allocation!). We also want to differentiate between a "good" deferral and a "bad" deferral; I don't think this is necessary but it's currently used by Mystery Gift matching (implemented for the Eeveelution mystery gifts which matter for evolution moves).
The existing logic didn't use inheritance, and instead had static methods being reused across generations. Quite kludgy. Also, the existing logic was a pain to modify the master encounter yield methods, as one generation's quirks had to not impact all other generations that used the method.
---
The new implementation splits out the encounter yielding methods to be separate for each generation / subset. Now, things don't have to check `WasLink` for Gen7 origin, because Pokémon Link wasn't a thing in Gen7.
---
## Future
Maybe refactoring yielders into "GameCores" that expose yielding behaviors / properties, rather than the static logic. As more generations and side-gamegroups get added (thanks LGPE/GO/GameCube), all this switch stuff gets annoying to maintain instead of just overriding/inheritance.
## Conclusion
This shouldn't impact any legality results negatively; if you notice any regressions, report them! This should reduce false flags where we didn't defer-discard an encounter when we should have (wild area mons being confused with raids).
2021-01-30 01:55:27 +00:00
|
|
|
{
|
2022-06-18 18:04:24 +00:00
|
|
|
case 0525 when IV_HP == 0xFE: // Diancie was distributed with no IV enforcement & 3IVs
|
|
|
|
case 0504 when RibbonClassic != ((IRibbonSetEvent4)pk).RibbonClassic: // Magmar with/without classic
|
2018-12-27 09:00:08 +00:00
|
|
|
return true;
|
|
|
|
}
|
2022-06-18 18:04:24 +00:00
|
|
|
return Species != pk.Species;
|
|
|
|
}
|
|
|
|
|
|
|
|
protected override bool IsMatchPartial(PKM pk)
|
|
|
|
{
|
|
|
|
if (RestrictLanguage != 0 && RestrictLanguage != pk.Language)
|
|
|
|
return true;
|
|
|
|
if (!CanBeReceivedByVersion(pk.Version))
|
|
|
|
return true;
|
|
|
|
return false;
|
2015-11-22 21:38:16 +00:00
|
|
|
}
|
|
|
|
}
|