License:
see license.txt

  • interface Multiset (V): Collection!(V), Addable!(V), Multi!(V);
    • A Multiset is a container that allows multiple instances of the same value to be added.

    It is similar to a list, except there is no requirement for ordering. That is, elements may not be stored in the order added.

    Since ordering is not important, the collection can reorder elements on removal or addition to optimize the operations.

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

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

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

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

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

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

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

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

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

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

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

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

  • V get ();
    • gets the most convenient element in the multiset. Note that no particular order of elements is assumed, so this might be the last element added, might be the first, might be one in the middle. This element would be the first iterated if the multiset is used as an iterator. Therefore, the removal of this element via remove( get ()) would be less than the normal O(n) runtime.

  • V take ();
    • Remove the most convenient element in the multiset and return its value. This is equivalent to remove(get()), but only does one lookup.

    Undefined if called on an empty multiset.

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