mirror of
https://github.com/kwsch/PKHeX
synced 2024-11-30 15:59:13 +00:00
96115916b2
Setting too many invalid entries will bloat above 500, so clamp the max. Preallocate entries size rather than 4 always
137 lines
4.4 KiB
C#
137 lines
4.4 KiB
C#
using System;
|
|
using System.Collections.Generic;
|
|
|
|
namespace PKHeX.Core
|
|
{
|
|
public sealed class StrategyMemo
|
|
{
|
|
private readonly bool XD;
|
|
public const int SIZE_ENTRY = 12;
|
|
private readonly List<StrategyMemoEntry> Entries;
|
|
public const int MAX_COUNT = 500;
|
|
private StrategyMemoEntry? this[int Species] => Entries.Find(e => e.Species == Species);
|
|
private readonly ushort _unk;
|
|
|
|
public StrategyMemo(bool xd = true) : this(new byte[4], 0, xd) { }
|
|
|
|
public StrategyMemo(byte[] input, int offset, bool xd)
|
|
{
|
|
XD = xd;
|
|
int count = BigEndian.ToInt16(input, offset);
|
|
if (count > MAX_COUNT)
|
|
count = MAX_COUNT;
|
|
_unk = BigEndian.ToUInt16(input, offset + 2);
|
|
|
|
Entries = new List<StrategyMemoEntry>(count);
|
|
for (int i = 0; i < count; i++)
|
|
{
|
|
var entry = Read(input, offset, i);
|
|
Entries.Add(entry);
|
|
}
|
|
}
|
|
|
|
private StrategyMemoEntry Read(byte[] input, int offset, int index)
|
|
{
|
|
byte[] data = new byte[SIZE_ENTRY];
|
|
var ofs = 4 + offset + (SIZE_ENTRY * index);
|
|
Array.Copy(input, ofs, data, 0, SIZE_ENTRY);
|
|
return new StrategyMemoEntry(XD, data);
|
|
}
|
|
|
|
public byte[] Write()
|
|
{
|
|
var result = new byte[4 + (Entries.Count * SIZE_ENTRY)];
|
|
BigEndian.GetBytes((short)Entries.Count).CopyTo(result, 0);
|
|
BigEndian.GetBytes((short)_unk).CopyTo(result, 2);
|
|
|
|
var count = Math.Min(MAX_COUNT, Entries.Count);
|
|
for (int i = 0; i < count; i++)
|
|
Entries[i].Data.CopyTo(result, 4 + (i * SIZE_ENTRY));
|
|
return result;
|
|
}
|
|
|
|
public StrategyMemoEntry GetEntry(int Species)
|
|
{
|
|
return this[Species] ?? new StrategyMemoEntry(XD);
|
|
}
|
|
|
|
public void SetEntry(StrategyMemoEntry entry)
|
|
{
|
|
int index = Entries.FindIndex(ent => ent.Species == entry.Species);
|
|
if (index >= 0)
|
|
Entries[index] = entry;
|
|
else
|
|
Entries.Add(entry);
|
|
}
|
|
}
|
|
|
|
public sealed class StrategyMemoEntry
|
|
{
|
|
public readonly byte[] Data;
|
|
private readonly bool XD;
|
|
|
|
public StrategyMemoEntry(bool xd) : this(xd, new byte[StrategyMemo.SIZE_ENTRY]) { }
|
|
|
|
public StrategyMemoEntry(bool xd, byte[] data)
|
|
{
|
|
Data = data;
|
|
XD = xd;
|
|
}
|
|
|
|
public int Species
|
|
{
|
|
get
|
|
{
|
|
int val = BigEndian.ToUInt16(Data, 0) & 0x1FF;
|
|
return SpeciesConverter.GetG4Species(val);
|
|
}
|
|
set
|
|
{
|
|
value = SpeciesConverter.GetG3Species(value);
|
|
int cval = BigEndian.ToUInt16(Data, 0);
|
|
cval &= 0xE00; value &= 0x1FF; cval |= value;
|
|
BigEndian.GetBytes((ushort)cval).CopyTo(Data, 0);
|
|
}
|
|
}
|
|
|
|
private bool Flag0 { get => Data[0] >> 6 == 1; set { Data[0] &= 0xBF; if (value) Data[0] |= 0x40; } } // Unused
|
|
private bool Flag1 { get => Data[0] >> 7 == 1; set { Data[0] &= 0x7F; if (value) Data[0] |= 0x80; } } // Complete Entry
|
|
public int SID { get => BigEndian.ToUInt16(Data, 4); set => BigEndian.GetBytes((ushort)value).CopyTo(Data, 4); }
|
|
public int TID { get => BigEndian.ToUInt16(Data, 6); set => BigEndian.GetBytes((ushort)value).CopyTo(Data, 6); }
|
|
public uint PID { get => BigEndian.ToUInt32(Data, 8); set => BigEndian.GetBytes(value).CopyTo(Data, 8); }
|
|
|
|
public bool Seen
|
|
{
|
|
get
|
|
{
|
|
if (XD) return !Flag1;
|
|
return Species != 0;
|
|
}
|
|
set
|
|
{
|
|
if (XD)
|
|
Flag1 = !value;
|
|
else if (!value)
|
|
new byte[StrategyMemo.SIZE_ENTRY].CopyTo(Data, 0);
|
|
}
|
|
}
|
|
|
|
public bool Owned
|
|
{
|
|
get
|
|
{
|
|
if (XD) return false;
|
|
return Flag0 || !Flag1;
|
|
}
|
|
set
|
|
{
|
|
if (XD) return;
|
|
if (!value)
|
|
Flag1 = true;
|
|
}
|
|
}
|
|
|
|
public bool IsEmpty => Species == 0;
|
|
public bool Matches(int species, uint pid, int tid, int sid) => Species == species && PID == pid && TID == tid && SID == sid;
|
|
}
|
|
}
|