PKHeX/PKHeX.Core/Saves/Substructures/Gen6/Puff6.cs
Kurt 47071b41f3
Refactoring: Span-based value writes and method signatures (#3361)
Existing `get`/`set` logic is flawed in that it doesn't work on Big Endian operating systems, and it allocates heap objects when it doesn't need to.

`System.Buffers.Binary.BinaryPrimitives` in the `System.Memory` NuGet package provides both Little Endian and Big Endian methods to read and write data; all the `get`/`set` operations have been reworked to use this new API. This removes the need for PKHeX's manual `BigEndian` class, as all functions are already covered by the BinaryPrimitives API.

The `StringConverter` has now been rewritten to accept a Span to read from & write to, no longer requiring a temporary StringBuilder.

Other Fixes included:
- The Super Training UI for Gen6 has been reworked according to the latest block structure additions.
- Cloning a Stadium2 Save File now works correctly (opening from the Folder browser list).
- Checksum & Sanity properties removed from parent PKM class, and is now implemented via interface.
2022-01-02 21:35:59 -08:00

58 lines
1.8 KiB
C#

using System;
using static System.Buffers.Binary.BinaryPrimitives;
namespace PKHeX.Core
{
public sealed class Puff6 : SaveBlock
{
private const int MaxPuffID = 26; // Supreme Winter Poké Puff
private const int PuffSlots = 100;
public Puff6(SaveFile SAV, int offset) : base(SAV) => Offset = offset;
public byte[] GetPuffs() => SAV.GetData(Offset, PuffSlots);
public void SetPuffs(byte[] value) => SAV.SetData(value, Offset);
public int PuffCount
{
get => ReadInt32LittleEndian(Data.AsSpan(Offset + PuffSlots));
set => WriteInt32LittleEndian(Data.AsSpan(Offset + PuffSlots), value);
}
public void Reset()
{
Array.Clear(Data, Offset, PuffSlots);
// Set the first few default Puffs
Data[Offset + 0] = 1;
Data[Offset + 1] = 2;
Data[Offset + 2] = 3;
Data[Offset + 3] = 4;
Data[Offset + 4] = 5;
PuffCount = 5;
}
public void MaxCheat(bool special = false)
{
var rnd = Util.Rand;
if (special)
{
for (int i = 0; i < PuffSlots; i++)
Data[Offset + i] = (byte)(21 + rnd.Next(2)); // Supreme Wish or Honor
}
else
{
for (int i = 0; i < PuffSlots; i++)
Data[Offset + i] = (byte)((i % MaxPuffID) + 1);
Util.Shuffle(Data.AsSpan(), Offset, Offset + PuffSlots, rnd);
}
PuffCount = PuffSlots;
}
public void Sort(bool reverse = false)
{
Array.Sort(Data, Offset, PuffCount);
if (reverse)
Array.Reverse(Data, Offset, PuffCount);
}
}
}