Search Results for

    Show / Hide Table of Contents

    Namespace Evergine.Common.Collections

    Classes

    CheckDictionary<K, V>

    Dictionary implementation to detect when the collection is modified.

    FastList<T>

    List<T> implementation that let you access to the internal array.

    PriorityQueue<T>

    An implementation of a min-Priority Queue using a heap. Has O(1) .Contains()! See https://bitbucket.org/BlueRaja/high-speed-priority-queue-for-c/wiki/Getting%20Started for more information.

    SimpleCache<TKey, KValue>

    Simple cache implementation.

    Structs

    FastList<T>.Enumerator

    A struct that represents the enumerator of the list.

    In This Article
    Back to top
    Generated by DocFX