public struct CUtlMap<TKey, TValue, TIndex> : IDisposable where TIndex : unmanaged, IBinaryInteger<TIndex>, IMinMaxValue<TIndex>

public CUtlMap(TIndex growSize, TIndex initSize, CUtlRBTree<CUtlMapTreeNode<TKey, TValue>, TIndex>.LessFunc func)

public CUtlMap(CUtlRBTree<CUtlMapTreeNode<TKey, TValue>, TIndex>.LessFunc func)

public CUtlRBTree<CUtlMapTreeNode<TKey, TValue>, TIndex> Tree

public int Count { get; }

public TIndex MaxElement { get; }

public ref TValue this[TIndex idx] { get; }

public void Dispose()

public void EnsureCapacity(TIndex num)

public TIndex Find(TKey key)

public TIndex FirstInOrdered()

public TIndex Insert(TKey key, TValue element)

public TIndex Insert(TKey key)

public TIndex InsertOrReplace(TKey key, TValue element)

public TIndex InvalidIndex()

public bool IsValid()

public bool IsValidIndex(TIndex idx)

public ref TKey Key(TIndex idx)

public TIndex LastInOrdered()

public TIndex NextInOrdered(TIndex idx)

public TIndex PrevInOrdered(TIndex idx)

public void Purge()

public void Reinsert(TKey key, TIndex idx)

public bool Remove(TKey key)

public void RemoveAll()

public void RemoveAt(TIndex idx)

public void SetLessFunc(CUtlRBTree<CUtlMapTreeNode<TKey, TValue>, TIndex>.LessFunc func)