> [!CAUTION] > **BREAKING CHANGE** > Removed `OrderdHashSet` and `PooledOrderedHashSet` due to bugs. > [!NOTE] > **Developer Note** > The OrderedSet is not a full data structure. It is not particularly efficient. Pull Requests are welcome for a better implementation, especially if it ends up supporting `ISet<T>` and `IReadOnlySet<T>` ## Summary The ordered hash set was buggy. It's kind of painful to implement, so for now, I added a simple `OrderedSet` to suffice for gumps. Please reach out if this causes disruption!
27 lines
528 B
C#
27 lines
528 B
C#
using System.Buffers;
|
|
using Server.Collections;
|
|
|
|
namespace Server.Gumps;
|
|
|
|
public abstract class GumpEntry
|
|
{
|
|
private Gump m_Parent;
|
|
|
|
public Gump Parent
|
|
{
|
|
get => m_Parent;
|
|
set
|
|
{
|
|
if (m_Parent != value)
|
|
{
|
|
m_Parent?.Remove(this);
|
|
|
|
m_Parent = value;
|
|
|
|
m_Parent?.Add(this);
|
|
}
|
|
}
|
|
}
|
|
|
|
public abstract void AppendTo(ref SpanWriter writer, OrderedSet<string> strings, ref int entries, ref int switches);
|
|
}
|