tango.util.collection.CircularSeq

class CircularSeq(T) : SeqCollection!(T) ¶#

Circular linked lists. Publically Implement only those methods defined in interfaces.

Author:

Doug Lea

CLCellT list [package] ¶#

The head of the list. Null if empty

this() [public] ¶#

Make an empty list with no element screener

this(Predicate screener) [public] ¶#

Make an empty list with supplied element screener

this(Predicate s, CLCellT h, int c) [protected] ¶#

Special version of constructor needed by clone()

CircularSeq!(T) duplicate() [public, final] ¶#

Make an independent copy of the list. Elements themselves are not cloned

bool contains(T element) [public, final] ¶#

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) [public, final] ¶#

Implements tango.util.collection.impl.Collection.Collection.instances Time complexity: O(n).

See Also:

tango.util.collection.impl.Collection.Collection.instances

GuardIterator!(T) elements() [public, final] ¶#

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 (inout 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() [public, final] ¶#

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

See Also:

tango.util.collection.model.Seq.Seq.head

T tail() [public, final] ¶#

Implements tango.util.collection.model.Seq.Seq.tail. Time complexity: O(1).

See Also:

tango.util.collection.model.Seq.Seq.tail

T get(int index) [public, final] ¶#

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) [public, final] ¶#

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) [public, final] ¶#

Implements tango.util.collection.model.Seq.Seq.last. Time complexity: O(n).

See Also:

tango.util.collection.model.Seq.Seq.last

CircularSeq subset(int from, int _length) [public, final] ¶#

Implements tango.util.collection.model.Seq.Seq.subseq. Time complexity: O(length).

See Also:

tango.util.collection.model.Seq.Seq.subseq

void clear() [public, final] ¶#

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) [public, final] ¶#

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) [public, final] ¶#

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) [public, final] ¶#

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) [public, final] ¶#

Implements tango.util.collection.impl.Collection.Collection.replaceAllOf. Time complexity: O(n).

See Also:

tango.util.collection.impl.Collection.Collection.replaceAllOf

T take() [public, final] ¶#

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

See Also:

tango.util.collection.impl.Collection.Collection.take

void prepend(T element) [public, final] ¶#

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) [public, final] ¶#

Implements tango.util.collection.impl.SeqCollection.SeqCollection.replaceHead. Time complexity: O(1).

See Also:

tango.util.collection.impl.SeqCollection.SeqCollection.replaceHead

void removeHead() [public, final] ¶#

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) [public, final] ¶#

Implements tango.util.collection.impl.SeqCollection.SeqCollection.append. Time complexity: O(1).

See Also:

tango.util.collection.impl.SeqCollection.SeqCollection.append

void replaceTail(T element) [public, final] ¶#

Implements tango.util.collection.impl.SeqCollection.SeqCollection.replaceTail. Time complexity: O(1).

See Also:

tango.util.collection.impl.SeqCollection.SeqCollection.replaceTail

void removeTail() [public, final] ¶#

Implements tango.util.collection.impl.SeqCollection.SeqCollection.removeTail. Time complexity: O(1).

See Also:

tango.util.collection.impl.SeqCollection.SeqCollection.removeTail

void addAt(int index, T element) [public, final] ¶#

Implements tango.util.collection.impl.SeqCollection.SeqCollection.addAt. Time complexity: O(n).

See Also:

tango.util.collection.impl.SeqCollection.SeqCollection.addAt

void replaceAt(int index, T element) [public, final] ¶#

Implements tango.util.collection.impl.SeqCollection.SeqCollection.replaceAt. Time complexity: O(n).

See Also:

tango.util.collection.impl.SeqCollection.SeqCollection.replaceAt

void removeAt(int index) [public, final] ¶#

Implements tango.util.collection.impl.SeqCollection.SeqCollection.removeAt. Time complexity: O(n).

See Also:

tango.util.collection.impl.SeqCollection.SeqCollection.removeAt

void prepend(Iterator!(T) e) [public, final] ¶#

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) [public, final] ¶#

Implements tango.util.collection.impl.SeqCollection.SeqCollection.append. Time complexity: O(number of elements in e).

See Also:

tango.util.collection.impl.SeqCollection.SeqCollection.append

void addAt(int index, Iterator!(T) e) [public, final] ¶#

Implements tango.util.collection.impl.SeqCollection.SeqCollection.addAt. Time complexity: O(size() + number of elements in e).

See Also:

tango.util.collection.impl.SeqCollection.SeqCollection.addAt

void removeRange(int fromIndex, int toIndex) [public, final] ¶#

Implements tango.util.collection.impl.SeqCollection.SeqCollection.removeFromTo. Time complexity: O(n).

See Also:

tango.util.collection.impl.SeqCollection.SeqCollection.removeFromTo

CLCellT firstCell() [private, final] ¶#

return the first cell, or throw exception if empty

CLCellT lastCell() [private, final] ¶#

return the last cell, or throw exception if empty

CLCellT cellAt(int index) [private, final] ¶#

return the index'th cell, or throw exception if bad index

void remove_(T element, bool allOccurrences) [private, final] ¶#

helper for remove/exclude

void replace_(T oldElement, T newElement, bool allOccurrences) [private, final] ¶#

helper for replace *

void checkImplementation() [public, override] ¶#

Implements tango.util.collection.model.View.View.checkImplementation.

See Also:

tango.util.collection.model.View.View.checkImplementation

class CellIterator(T) : AbstractIterator!(T) ¶#

opApply() has migrated here to mitigate the virtual call on method get()