License:
see license.txt

  • interface List (V): Collection!(V), Addable!(V), Multi!(V);
    • A List is a collection whose elements are in the order added. These are useful when you need something that keeps track of not only values, but the order added.

  • List!(V) opCat (List!(V) rhs);
    • Concatenate two lists together. The resulting list type is of the type of the left hand side.

  • List!(V) opCat (V[] array);
    • Concatenate this list and an array together.

    The resulting list is the same type as this list.

  • List!(V) opCat_r (V[] array);
    • Concatenate an array and this list together.

    The resulting list is the same type as this list.

  • List!(V) opCatAssign (List!(V) rhs);
    • append the given list to this list. Returns 'this'.

  • List!(V) opCatAssign (V[] array);
    • append the given array to this list. Returns 'this'.

  • List!(V) clear ();
    • covariant clear (from Collection)

  • List!(V) dup ();
    • covariant dup (from Collection)

  • List!(V) remove (V v);
    • Covariant remove (from Collection)

  • List!(V) remove (V v, ref bool wasRemoved);
    • Covariant remove (from Collection)

  • List!(V) add (V v);
    • Covariant add (from Addable)

  • List!(V) add (V v, ref bool wasAdded);
    • Covariant add (from Addable)

  • List!(V) add (Iterator!(V) it);
    • Covariant add (from Addable)

  • List!(V) add (Iterator!(V) it, ref uint numAdded);
    • Covariant add (from Addable)

  • List!(V) add (V[] array);
    • Covariant add (from Addable)

  • List!(V) add (V[] array, ref uint numAdded);
    • Covariant add (from Addable)

  • List!(V) removeAll (V v);
    • covariant removeAll (from Multi)

  • List!(V) removeAll (V v, ref uint numRemoved);
    • covariant removeAll (from Multi)

  • List!(V) sort ();
    • sort this list according to the default compare routine for V. Returns a reference to the list after it is sorted.

  • List!(V) sort (int delegate(ref V v1, ref V v2) comp);
    • sort this list according to the comparison routine given. Returns a reference to the list after it is sorted.

  • List!(V) sort (int(* comp)(ref V v1, ref V v2));
    • sort this list according to the comparison routine given. Returns a reference to the list after it is sorted.

  • int opEquals (Object o);
    • compare this list to another list. Returns true if they have the same number of elements and all the elements are equal.

    If o is not a list, then 0 is returned.

  • V front ();
    • Returns the element at the front of the list, or the oldest element added. If the list is empty, calling front is undefined.

  • V back ();
    • Returns the element at the end of the list, or the most recent element added. If the list is empty, calling back is undefined.

  • V takeFront ();
    • Takes the element at the front of the list, and return its value. This operation can be as high as O(n).

  • V takeBack ();
    • Takes the element at the end of the list, and return its value. This operation can be as high as O(n).

    (C) 2008 by Steven Schveighoffer. All rights reserved :: page rendered by CandyDoc