/Dlls/Delta.Utilities.Collections.xml

Large files files are truncated, but you can click here to view the full file

<?xml version="1.0"?>

<doc>

    <assembly>

        <name>Delta.Utilities.Collections</name>

    </assembly>

    <members>

        <member name="T:Delta.Utilities.Collections.Hash`1">

            <summary>

            The base implementation for various collections classes that use hash

            tables as part of their implementation. This class should not (and can

            not) be used directly by end users; it's only for internal use by the

            collections package. The Hash does not handle duplicate values.

            </summary>

            <remarks>

            The Hash manages items of type T, and uses a IComparer&lt;ItemTYpe&gt;

            that hashes compares items to hash items into the table.  

            </remarks>

            <typeparam name="T">Data type</typeparam>

        </member>

        <member name="F:Delta.Utilities.Collections.Hash`1.equalityComparer">

            <summary>

            Interface for comparing elements

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="F:Delta.Utilities.Collections.Hash`1.count">

            <summary>

            Count

            </summary>

            <typeparam name="T">T</typeparam>

            <summary>

            The count of elements in the table.

            </summary>

        </member>

        <member name="F:Delta.Utilities.Collections.Hash`1.usedSlots">

            <summary>

            Includes real elements and deleted elements with the collision bit on.

            Used to determine when we need to resize.

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="F:Delta.Utilities.Collections.Hash`1.totalSlots">

            <summary>

            Size of the table. Always a power of two.

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="F:Delta.Utilities.Collections.Hash`1.loadFactor">

            <summary>

            maximal load factor for the table.

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="F:Delta.Utilities.Collections.Hash`1.thresholdGrow">

            <summary>

            floor(totalSlots * loadFactor);

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="F:Delta.Utilities.Collections.Hash`1.thresholdShrink">

            <summary>

            thresholdGrow / 3.

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="F:Delta.Utilities.Collections.Hash`1.hashMask">

            <summary>

            Table

            </summary>

            <typeparam name="T">T</typeparam>

            <summary>

            Mask to convert hash values to the size of the table.

            </summary>

        </member>

        <member name="F:Delta.Utilities.Collections.Hash`1.secondaryShift">

            <summary>

            Shift to get the secondary skip value.

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="F:Delta.Utilities.Collections.Hash`1.table">

            <summary>

            The hash table.

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="F:Delta.Utilities.Collections.Hash`1.changeStamp">

            <summary>

            An integer that is changed every time the table structurally changes.

            Used so that enumerations throw an exception if the tree is changed

            during enumeration.

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="F:Delta.Utilities.Collections.Hash`1.serializationInfo">

            <summary>

            Info used during deserialization.

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="M:Delta.Utilities.Collections.Hash`1.#ctor(System.Collections.Generic.IEqualityComparer{`0})">

            <summary>

            Constructor. Create a new hash table.

            </summary>

            <param name="equalityComparer">The comparer to use to compare items.

            </param>

        </member>

        <member name="M:Delta.Utilities.Collections.Hash`1.GetEnumerationStamp">

            <summary>

            Gets the current enumeration stamp. Call CheckEnumerationStamp later

            with this value to throw an exception if the hash table is changed.

            </summary>

            <returns>The current enumeration stamp.</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.Hash`1.StopEnumerations">

            <summary>

            Must be called whenever there is a structural change in the tree.

            Causes changeStamp to be changed, which causes any in-progress

            enumerations to throw exceptions.

            </summary>

        </member>

        <member name="M:Delta.Utilities.Collections.Hash`1.CheckEnumerationStamp(System.Int32)">

            <summary>

            Checks the given stamp against the current change stamp. If different,

            the collection has changed during enumeration and an

            InvalidOperationException must be thrown

            </summary>

            <param name="startStamp">changeStamp at the start of the enumeration.

            </param>

        </member>

        <member name="M:Delta.Utilities.Collections.Hash`1.GetEnumerator">

            <summary>

            Enumerate all of the items in the hash table. The items

            are enumerated in a haphazard, unpredictable order.

            </summary>

            <returns>An IEnumerator&lt;T&gt; that enumerates the items

            in the hash table.</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.Hash`1.System#Collections#IEnumerable#GetEnumerator">

            <summary>

            Enumerate all of the items in the hash table. The items

            are enumerated in a haphazard, unpredictable order.

            </summary>

            <returns>An IEnumerator that enumerates the items

            in the hash table.</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.Hash`1.GetFullHash(`0)">

            <summary>

            Gets the full hash code for an item.

            </summary>

            <param name="item">Item to get hash code for.</param>

            <returns>The full hash code. It is never zero.</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.Hash`1.GetHashValuesFromFullHash(System.Int32,System.Int32@,System.Int32@)">

            <summary>

            Get the initial bucket number and skip amount from the full hash value.

            </summary>

            <param name="hash">The full hash value.</param>

            <param name="initialBucket">Returns the initial bucket. Always in the

            range 0..(totalSlots - 1).</param>

            <param name="skip">Returns the skip values. Always odd in the range

            0..(totalSlots - 1).</param>

        </member>

        <member name="M:Delta.Utilities.Collections.Hash`1.GetHashValues(`0,System.Int32@,System.Int32@)">

            <summary>

            Gets the full hash value, initial bucket number, and skip amount for an

            item.

            </summary>

            <param name="item">Item to get hash value of.</param>

            <param name="initialBucket">Returns the initial bucket. Always in the

            range 0..(totalSlots - 1).</param>

            <param name="skip">Returns the skip values. Always odd in the range

            0..(totalSlots - 1).</param>

            <returns>The full hash value. This is never zero.</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.Hash`1.EnsureEnoughSlots(System.Int32)">

            <summary>

            Make sure there are enough slots in the hash table that

            <paramref name="additionalItems"/> items can be inserted into the

            table.

            </summary>

            <param name="additionalItems">Number of additional items we are

            inserting.</param>

        </member>

        <member name="M:Delta.Utilities.Collections.Hash`1.ShrinkIfNeeded">

            <summary>

            Check if the number of items in the table is small enough that

            we should shrink the table again.

            </summary>

        </member>

        <member name="M:Delta.Utilities.Collections.Hash`1.GetSecondaryShift(System.Int32)">

            <summary>

            Given the size of a hash table, compute the "secondary shift" value.

            The shift that is used to determine the skip amount for collision

            resolution.

            </summary>

            <param name="newSize">The new size of the table.</param>

            <returns>The secondary skip amount.</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.Hash`1.ResizeTable(System.Int32)">

            <summary>

            Resize the hash table to the given new size, moving all items into the

            new hash table.

            </summary>

            <param name="newSize">The new size of the hash table. Must be a power

            of two.</param>

        </member>

        <member name="M:Delta.Utilities.Collections.Hash`1.Insert(`0,System.Boolean,`0@)">

            <summary>

            Insert a new item into the hash table. If a duplicate item exists,

            can replace or do nothing.

            </summary>

            <param name="item">The item to insert.</param>

            <param name="replaceOnDuplicate">If true, duplicate items are replaced.

            If false, nothing is done if a duplicate already exists.</param>

            <param name="previous">If a duplicate was found, returns it (whether

            replaced or not).</param>

            <returns>True if no duplicate existed, false if a duplicate was found.

            </returns>

        </member>

        <member name="M:Delta.Utilities.Collections.Hash`1.Delete(`0,`0@)">

            <summary>

            Deletes an item from the hash table. 

            </summary>

            <param name="item">Item to search for and delete.</param>

            <param name="itemDeleted">If true returned, the actual item stored in

            the hash table (must be equal to <paramref name="item"/>, but may not

            be identical.</param>

            <returns>True if item was found and deleted, false if item wasn't

            found.</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.Hash`1.Find(`0,System.Boolean,`0@)">

            <summary>

            Find an item in the hash table. If found, optionally replace it with

            the finding item.

            </summary>

            <param name="find">Item to find.</param>

            <param name="replace">If true, replaces the equal item in the hash

            table with <paramref name="item"/>.</param>

            <param name="item">Returns the equal item found in the table, if true

            was returned.</param>

            <returns>True if the item was found, false otherwise.</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.Hash`1.Clone(System.Converter{`0,`0})">

            <summary>

            Creates a clone of this hash table.

            </summary>

            <param name="cloneItem">If non-null, this function is applied to each

            item when cloning. It must be the case that this function does not

            modify the hash code or equality function.</param>

            <returns>A shallow clone that contains the same items.</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.Hash`1.System#Runtime#Serialization#ISerializable#GetObjectData(System.Runtime.Serialization.SerializationInfo,System.Runtime.Serialization.StreamingContext)">

            <summary>

            Serialize the hash table. Called from the serialization infrastructure.

            </summary>

            <param name="context">Context</param>

            <param name="info">Info</param>

        </member>

        <member name="M:Delta.Utilities.Collections.Hash`1.#ctor(System.Runtime.Serialization.SerializationInfo,System.Runtime.Serialization.StreamingContext)">

            <summary>

            Called on deserialization. We cannot deserialize now, because hash

            codes might not be correct now. We do real deserialization in the

            OnDeserialization call.

            </summary>

            <param name="context">Context</param>

            <param name="serInfo">serInfo</param>

        </member>

        <member name="M:Delta.Utilities.Collections.Hash`1.System#Runtime#Serialization#IDeserializationCallback#OnDeserialization(System.Object)">

            <summary>

            Deserialize the hash table. Called from the serialization

            infrastructure when the object graph has finished deserializing.

            </summary>

            <param name="sender">sender</param>

        </member>

        <member name="M:Delta.Utilities.Collections.Hash`1.ToString">

            <summary>

            To string

            </summary>

            <returns>String</returns>

        </member>

        <member name="P:Delta.Utilities.Collections.Hash`1.ElementCount">

            <summary>

            Get the number of items in the hash table.

            </summary>

            <typeparam name="T">T</typeparam>

            <value>The number of items stored in the hash table.</value>

        </member>

        <member name="P:Delta.Utilities.Collections.Hash`1.SlotCount">

            <summary>

            Get the number of slots in the hash table. Exposed internally

            for testing purposes.

            </summary>

            <typeparam name="T">T</typeparam>

            <value>The number of slots in the hash table.</value>

        </member>

        <member name="P:Delta.Utilities.Collections.Hash`1.LoadFactor">

            <summary>

            Get or change the load factor. Changing the load factor may cause

            the size of the table to grow or shrink accordingly.

            </summary>

            <typeparam name="T">T</typeparam>

            <value></value>

        </member>

        <member name="T:Delta.Utilities.Collections.Hash`1.Slot">

            <summary>

            The structure that has each slot in the hash table. Each slot has three

            parts:

            1. The collision bit. Indicates whether some item visited this slot but

            had to keep looking because the slot was full. 

            2. 31-bit full hash value of the item. If zero, the slot is empty.

            3. The item itself.

            </summary>

        </member>

        <member name="F:Delta.Utilities.Collections.Hash`1.Slot.item">

            <summary>

            

            </summary>

            <summary>

            The item.

            </summary>

        </member>

        <member name="F:Delta.Utilities.Collections.Hash`1.Slot.hash_collision">

            <summary>

            Lower 31 bits: the hash value. Top bit: the collision bit.

            </summary>

        </member>

        <member name="M:Delta.Utilities.Collections.Hash`1.Slot.Clear">

            <summary>

            Clear this slot, leaving the collision bit alone.

            </summary>

        </member>

        <member name="M:Delta.Utilities.Collections.Hash`1.Slot.ToString">

            <summary>

            To string

            </summary>

            <returns>String</returns>

        </member>

        <member name="P:Delta.Utilities.Collections.Hash`1.Slot.HashValue">

            <summary>

            The full hash value associated with the value in this slot, or zero

            if the slot is empty.

            </summary>

        </member>

        <member name="P:Delta.Utilities.Collections.Hash`1.Slot.Empty">

            <summary>

            Is this slot empty?

            </summary>

        </member>

        <member name="P:Delta.Utilities.Collections.Hash`1.Slot.Collision">

            <summary>

            The "Collision" bit indicates that some value hit this slot and

            collided, so had to try another slot.

            </summary>

        </member>

        <member name="T:Delta.Utilities.Collections.HashTests">

            <summary>

            Hash tests, needs to be an extra class because Hash is generic.

            </summary>

        </member>

        <member name="M:Delta.Utilities.Collections.HashTests.TestHash">

            <summary>

            Test hash. Note: Too slow for a dynamic unit test.

            </summary>

        </member>

        <member name="T:Delta.Utilities.Collections.PriorityQueue`1">

            <summary>

            Priority queue with generics.

            INFO: This is up to 3 times faster than the non generic version

            Delta.Utilities.Collections.PriorityQueue.cs, Benchmark results:

            1000 times adding 500 elements and popping them:

            BinaryPriorityQueue: 403,76ms (32,6%)

            PriorityQueue: 429,24ms (34,6%)

            PriorityQueuePoint: 197,88ms (16%)

            PriorityQueue with generics (this class): 208,5ms (16,8%)

            <para />

            This class is way more flexible than fixed class for just one type like

            the PriorityQueuePoint class, optimized for a Point structure. Generics

            are good enough to avoid these special case classes.

            </summary>

        </member>

        <member name="T:Delta.Utilities.Collections.ICloneable`1">

            <summary>

            Generic interface for cloning objects. We put this in the System

            namespace to make sure it is always loaded.

            </summary>

            <typeparam name="T">Data type</typeparam>

        </member>

        <member name="M:Delta.Utilities.Collections.ICloneable`1.Clone">

            <summary>

            Clones the object.

            </summary>

        </member>

        <member name="F:Delta.Utilities.Collections.PriorityQueue`1.numOfElements">

            <summary>

            Number of elements

            </summary>

        </member>

        <member name="F:Delta.Utilities.Collections.PriorityQueue`1.data">

            <summary>

            Data

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="M:Delta.Utilities.Collections.PriorityQueue`1.#ctor(`0[])">

            <summary>

            Create priority queue

            </summary>

        </member>

        <member name="M:Delta.Utilities.Collections.PriorityQueue`1.#ctor">

            <summary>

            Priority queue

            </summary>

        </member>

        <member name="M:Delta.Utilities.Collections.PriorityQueue`1.Clone">

            <summary>

            Clone

            </summary>

            <returns>Clone</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.PriorityQueue`1.System#Collections#IEnumerable#GetEnumerator">

            <summary>

            System. collections. i enumerable. get enumerator

            </summary>

            <returns>System. collections. i enumerator</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.PriorityQueue`1.GetEnumerator">

            <summary>

            IEnumerator

            </summary>

            <returns>IEnumerator</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.PriorityQueue`1.Push(`0)">

            <summary>

            Push a new item to the priority queue.

            Could realloc memory if bigger size is required.

            </summary>

            <param name="newData">New Data</param>

        </member>

        <member name="M:Delta.Utilities.Collections.PriorityQueue`1.Pop">

            <summary>

            Remove top entry (returns nothing, if you want to use top entry,

            just use pq.data[1])

            </summary>

        </member>

        <member name="M:Delta.Utilities.Collections.PriorityQueue`1.Peek">

            <summary>

            Get the smallest object without removing it.

            </summary>

            <returns>The smalles object without removing it</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.PriorityQueue`1.CopyTo(System.Array,System.Int32)">

            <summary>

            Copy to

            </summary>

            <param name="array">Array</param>

            <param name="index">Index</param>

        </member>

        <member name="P:Delta.Utilities.Collections.PriorityQueue`1.Count">

            <summary>

            Count, will NOT return numOfElements, because its 1-based.

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="P:Delta.Utilities.Collections.PriorityQueue`1.IsSynchronized">

            <summary>

            Is synchronized

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="P:Delta.Utilities.Collections.PriorityQueue`1.SyncRoot">

            <summary>

            Sync root

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="T:Delta.Utilities.Collections.PriorityQueueTests">

            <summary>

            PriorityQueue tests, must be decleared outside of a generic class.

            </summary>

        </member>

        <member name="M:Delta.Utilities.Collections.PriorityQueueTests.TestPriorityQueueGenericPerformance">

            <summary>

            Test priority queue generic performance

            </summary>

        </member>

        <member name="M:Delta.Utilities.Collections.PriorityQueueTests.TestPriorityQueue">

            <summary>

            Test PriorityQueue

            </summary>

        </member>

        <member name="T:Delta.Utilities.Collections.PriorityQueueTests.TestPriorityQueuePointData">

            <summary>

            Test PriorityQueue helper class for Points

            </summary>

        </member>

        <member name="T:Delta.Utilities.Collections.IPriorityQueueData">

            <summary>

            Interface for priority queue data, used in PriorityQueue class!

            </summary>

        </member>

        <member name="P:Delta.Utilities.Collections.IPriorityQueueData.Priority">

            <summary>

            Get priority of item, everything will be sorted by this priority.

            </summary>

        </member>

        <member name="F:Delta.Utilities.Collections.PriorityQueueTests.TestPriorityQueuePointData.pos">

            <summary>

            Position

            </summary>

        </member>

        <member name="F:Delta.Utilities.Collections.PriorityQueueTests.TestPriorityQueuePointData.priority">

            <summary>

            Priority

            </summary>

        </member>

        <member name="M:Delta.Utilities.Collections.PriorityQueueTests.TestPriorityQueuePointData.#ctor(Delta.Utilities.Datatypes.Point,System.Single)">

            <summary>

            Priority queue point data

            </summary>

        </member>

        <member name="P:Delta.Utilities.Collections.PriorityQueueTests.TestPriorityQueuePointData.Priority">

            <summary>

            Priority

            </summary>

        </member>

        <member name="T:Delta.Utilities.Collections.Dequeue`1">

            <summary>

            System.Collections conform class for a ring-queue.

            </summary>

            <remarks>

            The collection support adding and removing at both ends and automatic

            expansion. The left end of the ring is referred to as head, the right

            end as tail. Add / Remove needs always the same time, expansion takes

            more time, depending on the size. Indexed access and enumeration is fast.

            </remarks>

        </member>

        <member name="F:Delta.Utilities.Collections.Dequeue`1.innerList">

            <summary>

            Inner list for this dequeue

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="F:Delta.Utilities.Collections.Dequeue`1.growthFactor">

            <summary>

            Grow factor

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="F:Delta.Utilities.Collections.Dequeue`1.head">

            <summary>

            Head, tail and count of elements

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="F:Delta.Utilities.Collections.Dequeue`1.tail">

            <summary>

            Head, tail and count of elements

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="F:Delta.Utilities.Collections.Dequeue`1.count">

            <summary>

            Head, tail and count of elements

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="F:Delta.Utilities.Collections.Dequeue`1.version">

            <summary>

            Version, who needs that?

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.#ctor">

            <summary>

            Create an empty Dequeue with capacity 32 and growth 2

            </summary>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.#ctor(System.Int32)">

            <summary>

            Create an empty Dequeue with given capacity and growth 2

            </summary>

            <param name="capacity">the initial capacity of the collection</param>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.#ctor(System.Int32,System.Double)">

            <summary>

            Create an empty Dequeue with given capacity and given growth

            </summary>

            <param name="capacity">The initial capacity of the collection</param>

            <param name="setGrowthFactor">The factor by which to grow the

            collection when the capacity is reached</param>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.#ctor(System.Collections.Generic.ICollection{`0})">

            <summary>

            Create a new Dequeue as a copy of the given collection

            </summary>

            <param name="collection">The source collection</param>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.#ctor(System.Collections.Generic.ICollection{`0},System.Int32)">

            <summary>

            Create a new Dequeue as a copy of the given collection and the

            given capacity.

            </summary>

            <param name="collection">The source collection</param>

            <param name="capacity">The capacity of the new Dequeue

            (must be bigger or equal as C.Count)</param>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.Clone">

            <summary>

            Standard implementation.

            </summary>

            <returns>A Dequeue with a shallow copy of this one.</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.Add(`0)">

            <summary>

            Add. Not supported, do not call!

            </summary>

            <param name="item">Item to add</param>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.Clear">

            <summary>

            Deletes all entries from the collection

            </summary>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.Contains(`0)">

            <summary>

            Contains

            </summary>

            <param name="item">Item</param>

            <returns>True if the item was found, false otherwise.</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.CopyTo(`0[],System.Int32)">

            <summary>

            Implementation of the ICollection.CopyTo function.

            </summary>

            <param name="array">Target array</param>

            <param name="arrayIndex">Start-Index in target array</param>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.Remove(`0)">

            <summary>

            Remove. Do not call, this is not implemented!

            </summary>

            <param name="item">Item</param>

            <returns>

            True if removing the item succeeded, false otherwise.

            </returns>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.System#Collections#IEnumerable#GetEnumerator">

            <summary>

            System. collections. i enumerable. get enumerator

            </summary>

            <returns>System. collections. i enumerator</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.GetEnumerator">

            <summary>

            Standard implementation.

            </summary>

            <returns>A DequeueEnumerator on the current dequeue</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.Equals(System.Collections.Generic.ICollection{`0})">

            <summary>

            Equals

            </summary>

            <param name="that">That</param>

            <returns>True if the other collection (that) is the same.</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.ContainsCount(`0)">

            <summary>

            Contains count

            </summary>

            <param name="item">Item</param>

            <returns>Int</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.ContainsAll(System.Collections.Generic.IEnumerable{`0})">

            <summary>

            Contains all

            </summary>

            <param name="items">Items to check</param>

            <returns>Returns true if all items are in this dequeue.</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.Find(`0@)">

            <summary>

            Find. Do not call, this method is not implemented!

            </summary>

            <param name="item">Item</param>

            <returns>True if the item was found</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.FindOrAdd(`0@)">

            <summary>

            Find or add. Do not call, this method is not implemented!

            </summary>

            <param name="item">Item</param>

            <returns>True if the item was found or could be added.</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.Update(`0)">

            <summary>

            Update. Do not call, this method is not implemented!

            </summary>

            <param name="item">Item</param>

            <returns>True if the item was updated.</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.UpdateOrAdd(`0)">

            <summary>

            Update or add. Do not call, this method is not implemented!

            </summary>

            <param name="item">Item</param>

            <returns>True if the item was updated or added.</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.RemoveWithReturn(`0@)">

            <summary>

            Remove with return. Do not call, this method is not implemented!

            </summary>

            <param name="item">Item</param>

            <returns>True if the item was removed</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.RemoveAllCopies(`0)">

            <summary>

            Remove all copies

            </summary>

            <param name="item">Item</param>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.RemoveAll(System.Collections.Generic.IEnumerable{`0})">

            <summary>

            Remove all

            </summary>

            <param name="items">Items</param>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.RetainAll(System.Collections.Generic.IEnumerable{`0})">

            <summary>

            Retain all

            </summary>

            <param name="items">Items</param>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.AddAll(System.Collections.Generic.IEnumerable{`0})">

            <summary>

            Add all

            </summary>

            <param name="items">Items</param>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.AddAll``1(System.Collections.Generic.IEnumerable{``0})">

            <summary>

            Add all

            </summary>

            <param name="items">Items</param>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.Check">

            <summary>

            Check the queue. Do not call, this method is not implemented!

            </summary>

            <returns>True if the check succeeded, false otherwise.</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.ToArray">

            <summary>

            To array

            </summary>

            <returns>Filled array with the same data as this dequeue</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.EnqueueHead(`0)">

            <summary>

            Add the given object to the collections head

            </summary>

            <param name="value">The object to enqueue</param>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.EnqueueTail(`0)">

            <summary>

            Add the given object to the collections tail

            </summary>

            <param name="value">The object to enqueue</param>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.DequeueHead">

            <summary>

            Retrieve and remove the current head

            </summary>

            <returns>The removed object</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.DequeueTail">

            <summary>

            Retrieve and remove the current tail

            </summary>

            <returns>The removed object</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.EnqueueTailRange(System.Collections.Generic.ICollection{`0})">

            <summary>

            Add the given collection to the dequeues tail

            </summary>

            <param name="collection">The source collection</param>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.EnqueueHeadRange(System.Collections.Generic.ICollection{`0})">

            <summary>

            Add the given collection to the dequeues head.

            To preserve the order in the collection, the entries are

            added in revers order.

            </summary>

            <param name="collection">The source collection</param>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.TrimToSize">

            <summary>

            Sets the capacity to Count.

            </summary>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.CopyTo(System.Array,System.Int32)">

            <summary>

            Implementation of the ICollection.CopyTo function.

            </summary>

            <param name="array">Target array</param>

            <param name="index">Start-Index in target array</param>

        </member>

        <member name="M:Delta.Utilities.Collections.Dequeue`1.SetSize(System.Int32)">

            <summary>

            Sets the collections capacity to newSize

            </summary>

            <param name="newSize">the new collection size

            (must be &gt;= Count)</param>

        </member>

        <member name="P:Delta.Utilities.Collections.Dequeue`1.IsReadOnly">

            <summary>

            Is read only? Will always return false.

            </summary>

        </member>

        <member name="P:Delta.Utilities.Collections.Dequeue`1.AllowsDuplicates">

            <summary>

            Allows duplicates? Will always return false.

            </summary>

        </member>

        <member name="P:Delta.Utilities.Collections.Dequeue`1.IsEmpty">

            <summary>

            Is empty? Will return true if we have at least one item.

            </summary>

        </member>

        <member name="P:Delta.Utilities.Collections.Dequeue`1.Item(System.Int32)">

            <summary>

            Indexed access to all elements currently in the collection.

            Indexing starts at 0 (head) and ends at Count-1 (tail).

            </summary>

            <returns>Item at this index</returns>

        </member>

        <member name="P:Delta.Utilities.Collections.Dequeue`1.GrowthFactor">

            <summary>

            The current factor by which to grow the collection in case of expansion

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="P:Delta.Utilities.Collections.Dequeue`1.Capacity">

            <summary>

            The current amount of cells available to the dequeue

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="P:Delta.Utilities.Collections.Dequeue`1.Version">

            <summary>

            The current version of the dequeue. The version is increased with every

            changing operation. The main use is to invalidate all IEnumerators.

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="P:Delta.Utilities.Collections.Dequeue`1.IsSynchronized">

            <summary>

            Returns true.

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="P:Delta.Utilities.Collections.Dequeue`1.Count">

            <summary>

            The current number of elements in the queue

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="P:Delta.Utilities.Collections.Dequeue`1.SyncRoot">

            <summary>

            Returns sync root for this dequeue, which is always this object.

            </summary>

        </member>

        <member name="T:Delta.Utilities.Collections.DequeueTests">

            <summary>

            Dequeue tests, needs to be an extra class because Dequeue is generic.

            </summary>

        </member>

        <member name="M:Delta.Utilities.Collections.DequeueTests.TestDequeueGenericPerformance">

            <summary>

            Test dequeue generic performance

            </summary>

        </member>

        <member name="M:Delta.Utilities.Collections.DequeueTests.TestEnqueueHead">

            <summary>

            Test enqueue head

            </summary>

        </member>

        <member name="M:Delta.Utilities.Collections.DequeueTests.TestEnqueueTail">

            <summary>

            Test enqueue tail

            </summary>

        </member>

        <member name="T:Delta.Utilities.Collections.TreeNodeCollection`1">

            <summary>

            Tree node collection

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="F:Delta.Utilities.Collections.TreeNodeCollection`1.mList">

            <summary>

            mList List

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="F:Delta.Utilities.Collections.TreeNodeCollection`1.mOwner">

            <summary>

            mOwner Node

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="M:Delta.Utilities.Collections.TreeNodeCollection`1.#ctor(Delta.Utilities.Collections.TreeNode{`0})">

            <summary>

            Create tree node collection

            </summary>

            <param name="owner">owner</param>

        </member>

        <member name="M:Delta.Utilities.Collections.TreeNodeCollection`1.System#Collections#IEnumerable#GetEnumerator">

            <summary>

            Standard implementation.

            </summary>

            <returns>A IEnumerator on the current tree node collection</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.TreeNodeCollection`1.GetEnumerator">

            <summary>

            Get enumerator

            </summary>

            <returns>IEnumerator</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.TreeNodeCollection`1.Add(Delta.Utilities.Collections.TreeNode{`0})">

            <summary>

            Add

            </summary>

            <param name="rhs">rhs</param>

        </member>

        <member name="M:Delta.Utilities.Collections.TreeNodeCollection`1.Remove(Delta.Utilities.Collections.TreeNode{`0})">

            <summary>

            Remove

            </summary>

            <param name="rhs">rhs</param>

        </member>

        <member name="M:Delta.Utilities.Collections.TreeNodeCollection`1.Contains(Delta.Utilities.Collections.TreeNode{`0})">

            <summary>

            Does this node contains the given node directly?

            </summary>

            <param name="rhs">rhs</param>

            <returns>True if the list contains the given node</returns>

        </member>

        <member name="M:Delta.Utilities.Collections.TreeNodeCollection`1.Clear">

            <summary>

            Clear

            </summary>

        </member>

        <member name="P:Delta.Utilities.Collections.TreeNodeCollection`1.Count">

            <summary>

            Count

            </summary>

            <returns>Int</returns>

        </member>

        <member name="P:Delta.Utilities.Collections.TreeNodeCollection`1.Owner">

            <summary>

            Owner

            </summary>

            <returns>Node</returns>

        </member>

        <member name="P:Delta.Utilities.Collections.TreeNodeCollection`1.Item(System.Int32)">

            <summary>

            Indexer

            </summary>

            <returns>Node</returns>

        </member>

        <member name="T:Delta.Utilities.Collections.TreeNodeCollectionTests">

            <summary>

            TreeNodeCollection tests

            </summary>

        </member>

        <member name="M:Delta.Utilities.Collections.TreeNodeCollectionTests.TestTreeNode">

            <summary>

            Test tree node

            </summary>

        </member>

        <member name="M:Delta.Utilities.Collections.TreeNodeCollectionTests.TestTreeNodeCollection">

            <summary>

            Test tree node collection

            </summary>

        </member>

        <member name="T:Delta.Utilities.Collections.CircularBuffer`1">

            <summary>

            CircularShortBuffer, used for recording/playback of sound samples.

            We can simply add new sample data and read existing sample data

            at the same time! The size of the circular buffer should fit

            the requirements (data should have been read when cycling around).

            There will be no warning if we overwrite data without reading.

            </summary>

            <typeparam name="T">Data type</typeparam>

        </member>

        <member name="F:Delta.Utilities.Collections.CircularBuffer`1.buffer">

            <summary>

            Buffer

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="F:Delta.Utilities.Collections.CircularBuffer`1.writePos">

            <summary>

            We only increase writePos and readPos, they will

            obviously go way out of range of the buffer size,

            we need ALWAYS to modulate it by the size of the buffer to access data!

            We do this because only this way we can see how much data

            was written and how much was read!

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="F:Delta.Utilities.Collections.CircularBuffer`1.readPos">

            <summary>

            Read pos

            </summary>

            <returns>0</returns>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="M:Delta.Utilities.Collections.CircularBuffer`1.#ctor(System.Int32)">

            <summary>

            Circular short buffer

            </summary>

            <param name="bufferSize">Buffer size</param>

        </member>

        <member name="M:Delta.Utilities.Collections.CircularBuffer`1.Flush">

            <summary>

            Flush is very simply, we just reset both writePos and readPos to 0.

            </summary>

        </member>

        <member name="M:Delta.Utilities.Collections.CircularBuffer`1.Write(`0[])">

            <summary>

            Write array of new data to write into the circular buffer.

            </summary>

            <param name="newData">New data to write into the buffer</param>

        </member>

        <member name="M:Delta.Utilities.Collections.CircularBuffer`1.Read(`0[])">

            <summary>

            Read data into an array of the same type.

            </summary>

            <param name="readData">Data to read into</param>

        </member>

        <member name="P:Delta.Utilities.Collections.CircularBuffer`1.Length">

            <summary>

            Get how much bytes can be read, can even be more than buffer.Length

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="T:Delta.Utilities.Collections.CircularBufferTests">

            <summary>

            CircularBuffer tests helper, must be decleared outside of generic class.

            </summary>

        </member>

        <member name="M:Delta.Utilities.Collections.CircularBufferTests.TestAddAndReadData">

            <summary>

            Test add and read data

            </summary>

        </member>

        <member name="T:Delta.Utilities.Collections.UniqueChangeableList`1">

            <summary>

            Same as ChangeableList, which allows to add and remove elements

            while enumerating, but this also checks if elements do already

            exists. It will not add duplicates, duplicates are ignored!

            </summary>

        </member>

        <member name="T:Delta.Utilities.Collections.ChangeableList`1">

            <summary>

            Changeable list is basically just a List, which allows

            you to add and remove elements while enumerating.

            When ALL enumerations are complete, all the remembered removed

            and added elements will be applied (we can't do that while enumerating).

            </summary>	

            <remarks>

            You can use this list like a normal List and will never notice

            any difference except when adding or removing entries while enumerating,

            which will thrown an exception for normal Lists.

            When the enumeration is complete and there are no other pending

            enumerations, the ApplyAddedAndRemovedElements() function is called

            and all added and removed elements are added and removed.

            Another way would be to copy the whole list for the enumeration,

            but this is much slower and usually we don't change the list that

            often when enumerating (see slower approach here:)

            http://msdn.microsoft.com/library/default.asp?url=/library/en-us/dncscol/html/csharp01212002.asp

            </remarks>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="F:Delta.Utilities.Collections.ChangeableList`1.remElementsToBeAdded">

            <summary>

            Remembered elements to be added and removed when finished

            enumerating. If we are not enumerating, adding and removing it

            done directly (this lists are empty then).

            Usually all these lists are empty, it will not happen very

            often that we want to add or remove elements while enumerating.

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="F:Delta.Utilities.Collections.ChangeableList`1.remElementsToBeRemoved">

            <summary>

            Remembered elements to be added and removed when finished

            enumerating. If we are not enumerating, adding and removing it

            done directly (this lists are empty then).

            Usually all these lists are empty, it will not happen very

            often that we want to add or remove elements while enumerating.

            </summary>

            <typeparam name="T">T</typeparam>

        </member>

        <member name="F:Delta.Utilities.Collections.ChangeableLis…