• class LinkSeq (T): SeqCollection!(T), Sortable!(T);
  • LinkedList implementation. Publically implements only those methods defined in its interfaces.

    author:
    Doug Lea @version 0.93

    For an introduction to this package see Overview .

  • LLCellT list ;
  • The head of the list . Null iff count == 0

  • this();
  • Create a new empty list

  • this(Predicate screener);
  • Create a list with a given element screener

  • this(Predicate s, LLCellT l, int c);
  • Special version of constructor needed by clone()

  • LinkSeq!(T) duplicate ();
  • Build an independent copy of the list. The elements themselves are not cloned

  • bool contains (T element);
  • Implements tango.util.collection.impl.Collection.Collection. contains Time complexity: O(n).

    See Also:
    tango.util.collection.impl.Collection.Collection. contains

  • uint instances (T element);
  • Implements tango.util.collection.impl.Collection.Collection. instances Time complexity: O(n).

    See Also:
    tango.util.collection.impl.Collection.Collection. instances

  • GuardIterator!(T) elements ();
  • Implements tango.util.collection.impl.Collection.Collection. elements Time complexity: O(1).

    See Also:
    tango.util.collection.impl.Collection.Collection. elements

  • int opApply (int delegate(ref T value) dg);
  • Implements tango.util.collection.model.View.View. opApply Time complexity: O(n).

    See Also:
    tango.util.collection.model.View.View. opApply

  • T head ();
  • Implements tango.util.collection.model.Seq.Seq. head . Time complexity: O(1).

    See Also:
    tango.util.collection.model.Seq.Seq. head

  • T tail ();
  • Implements tango.util.collection.model.Seq.Seq. tail . Time complexity: O(n).

    See Also:
    tango.util.collection.model.Seq.Seq. tail

  • T get (int index);
  • Implements tango.util.collection.model.Seq.Seq. get . Time complexity: O(n).

    See Also:
    tango.util.collection.model.Seq.Seq. get

  • int first (T element, int startingIndex = 0);
  • Implements tango.util.collection.model.Seq.Seq. first . Time complexity: O(n).

    See Also:
    tango.util.collection.model.Seq.Seq. first

  • int last (T element, int startingIndex = 0);
  • Implements tango.util.collection.model.Seq.Seq. last . Time complexity: O(n).

    See Also:
    tango.util.collection.model.Seq.Seq. last

  • LinkSeq subset (int from, int _length);
  • Implements tango.util.collection.model.Seq.Seq.subseq. Time complexity: O(length).

    See Also:
    tango.util.collection.model.Seq.Seq.subseq

  • void clear ();
  • Implements tango.util.collection.impl.Collection.Collection. clear . Time complexity: O(1).

    See Also:
    tango.util.collection.impl.Collection.Collection. clear

  • void removeAll (T element);
  • Implements tango.util.collection.impl.Collection.Collection.exclude. Time complexity: O(n).

    See Also:
    tango.util.collection.impl.Collection.Collection.exclude

  • void remove (T element);
  • Implements tango.util.collection.impl.Collection.Collection.removeOneOf. Time complexity: O(n).

    See Also:
    tango.util.collection.impl.Collection.Collection.removeOneOf

  • void replace (T oldElement, T newElement);
  • Implements tango.util.collection.impl.Collection.Collection.replaceOneOf Time complexity: O(n).

    See Also:
    tango.util.collection.impl.Collection.Collection.replaceOneOf

  • void replaceAll (T oldElement, T newElement);
  • Implements tango.util.collection.impl.Collection.Collection.replaceAllOf. Time complexity: O(n).

    See Also:
    tango.util.collection.impl.Collection.Collection.replaceAllOf

  • T take ();
  • Implements tango.util.collection.impl.Collection.Collection. take . Time complexity: O(1). takes the first element on the list

    See Also:
    tango.util.collection.impl.Collection.Collection. take

  • void sort (Comparator!(T) cmp);
  • Implements tango.util.collection.Sortable. sort . Time complexity: O(n log n). Uses a merge- sort -based algorithm.

    See Also:
    tango.util.collection.SortableCollection. sort

  • void prepend (T element);
  • Implements tango.util.collection.impl.SeqCollection.SeqCollection. prepend . Time complexity: O(1).

    See Also:
    tango.util.collection.impl.SeqCollection.SeqCollection. prepend

  • void replaceHead (T element);
  • Implements tango.util.collection.impl.SeqCollection.SeqCollection. replaceHead . Time complexity: O(1).

    See Also:
    tango.util.collection.impl.SeqCollection.SeqCollection. replaceHead

  • void removeHead ();
  • Implements tango.util.collection.impl.SeqCollection.SeqCollection. removeHead . Time complexity: O(1).

    See Also:
    tango.util.collection.impl.SeqCollection.SeqCollection. removeHead

  • void append (T element);
  • Implements tango.util.collection.impl.SeqCollection.SeqCollection. append . Time complexity: O(n).

    See Also:
    tango.util.collection.impl.SeqCollection.SeqCollection. append

  • void replaceTail (T element);
  • Implements tango.util.collection.impl.SeqCollection.SeqCollection. replaceTail . Time complexity: O(n).

    See Also:
    tango.util.collection.impl.SeqCollection.SeqCollection. replaceTail

  • void removeTail ();
  • Implements tango.util.collection.impl.SeqCollection.SeqCollection. removeTail . Time complexity: O(n).

    See Also:
    tango.util.collection.impl.SeqCollection.SeqCollection. removeTail

  • void addAt (int index, T element);
  • Implements tango.util.collection.impl.SeqCollection.SeqCollection. addAt . Time complexity: O(n).

    See Also:
    tango.util.collection.impl.SeqCollection.SeqCollection. addAt

  • void removeAt (int index);
  • Implements tango.util.collection.impl.SeqCollection.SeqCollection. removeAt . Time complexity: O(n).

    See Also:
    tango.util.collection.impl.SeqCollection.SeqCollection. removeAt

  • void replaceAt (int index, T element);
  • Implements tango.util.collection.impl.SeqCollection.SeqCollection. replaceAt . Time complexity: O(n).

    See Also:
    tango.util.collection.impl.SeqCollection.SeqCollection. replaceAt

  • void prepend (Iterator!(T) e);
  • Implements tango.util.collection.impl.SeqCollection.SeqCollection. prepend . Time complexity: O(number of elements in e).

    See Also:
    tango.util.collection.impl.SeqCollection.SeqCollection. prepend

  • void append (Iterator!(T) e);
  • Implements tango.util.collection.impl.SeqCollection.SeqCollection. append . Time complexity: O(n + number of elements in e).

    See Also:
    tango.util.collection.impl.SeqCollection.SeqCollection. append

  • void addAt (int index, Iterator!(T) e);
  • Implements tango.util.collection.impl.SeqCollection.SeqCollection. addAt . Time complexity: O(n + number of elements in e).

    See Also:
    tango.util.collection.impl.SeqCollection.SeqCollection. addAt

  • void removeRange (int fromIndex, int toIndex);
  • Implements tango.util.collection.impl.SeqCollection.SeqCollection.removeFromTo. Time complexity: O(n).

    See Also:
    tango.util.collection.impl.SeqCollection.SeqCollection.removeFromTo

  • void remove_ (T element, bool allOccurrences);
  • Helper method for removeOneOf()

  • void replace_ (T oldElement, T newElement, bool allOccurrences);
  • Helper for replace

  • void splice_ (Iterator!(T) e, LLCellT hd, LLCellT tl);
  • Splice elements of e between hd and tl. if hd is null return new hd

  • void checkImplementation ();
  • Implements tango.util.collection.model.View.View. checkImplementation .

    See Also:
    tango.util.collection.model.View.View. checkImplementation

  • template CellIterator (T)
  • opApply() has migrated here to mitigate the virtual call on method get()

    :: page rendered by CandyDoc