tango.util.container.CircularList

License:

BSD style: see license.txt

Version:

Apr 2008: Initial release

Authors:

Kris

Since:

0.99.7

Based upon Doug Lea's Java collection package

class CircularList(V, alias Reap = Container.reap, alias Heap = Container.DefaultCollect) : IContainer!(V) #
Circular linked list
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39

Iterator iterator ()
uint opApply (int delegate(ref V value) dg)

CircularList add (V element)
CircularList addAt (uint index, V element)
CircularList append (V element)
CircularList prepend (V element)
uint addAt (uint index, IContainer!(V) e)
uint append (IContainer!(V) e)
uint prepend (IContainer!(V) e)

bool take (ref V v)
bool contains (V element)
V get (uint index)
uint first (V element, uint startingIndex = 0)
uint last (V element, uint startingIndex = 0)

V head ()
V tail ()
V head (V element)
V tail (V element)
V removeHead ()
V removeTail ()

bool removeAt (uint index)
uint remove (V element, bool all)
uint removeRange (uint fromIndex, uint toIndex)

uint replace (V oldElement, V newElement, bool all)
bool replaceAt (uint index, V element)

uint size ()
bool isEmpty ()
V[] toArray (V[] dst)
CircularList dup ()
CircularList subset (uint from, uint length)
CircularList clear ()
CircularList reset ()
CircularList check ()
this() #
Make an empty list
this(Ref h, uint c) [protected] #
Make an configured list
~this() #
Clean up when deleted
Alloc allocator() [final] #
Return the configured allocator
Iterator iterator() [final] #
Return a generic iterator for contained elements
int opApply(int delegate(ref V value) dg) [final] #
uint size() [final] #
Return the number of elements contained
CircularList dup() [final] #
Make an independent copy of the list. Elements themselves are not cloned
bool contains(V element) [final] #
Time complexity: O(n)
V head() [final] #
Time complexity: O(1)
V tail() [final] #
Time complexity: O(1)
V get(uint index) [final] #
Time complexity: O(n)
uint first(V element, uint startingIndex = 0) [final] #
Time complexity: O(n)
uint last(V element, uint startingIndex = 0) [final] #
Time complexity: O(n)
CircularList subset(uint from, uint length) [final] #
Time complexity: O(length)
CircularList clear() [final] #
Time complexity: O(1)
CircularList reset() [final] #
Reset the HashMap contents and optionally configure a new heap manager. This releases more memory than clear() does
Time complexity: O(n)
bool take(ref V v) [final] #
Time complexity: O(n)
Takes the last element on the list
CircularList prepend(V element) [final] #
Time complexity: O(1)
V head(V element) [final] #
Time complexity: O(1)
V removeHead() [final] #
Time complexity: O(1)
CircularList add(V element) [final] #
Time complexity: O(1)
CircularList append(V element) [final] #
Time complexity: O(1)
V tail(V element) [final] #
Time complexity: O(1)
V removeTail() [final] #
Time complexity: O(1)
CircularList addAt(uint index, V element) [final] #
Time complexity: O(n)
CircularList replaceAt(uint index, V element) [final] #
Time complexity: O(n)
CircularList removeAt(uint index) [final] #
Time complexity: O(n)
uint remove(V element, bool all) [final] #
Time complexity: O(n)
uint replace(V oldElement, V newElement, bool all) [final] #
Time complexity: O(n)
uint prepend(IContainer!(V) e) [final] #
Time complexity: O(number of elements in e)
uint append(IContainer!(V) e) [final] #
Time complexity: O(number of elements in e)
uint addAt(uint index, IContainer!(V) e) [final] #
Time complexity: O(size() + number of elements in e)
uint removeRange(uint fromIndex, uint toIndex) [final] #
Time complexity: O(n)
V[] toArray(V[] dst = null) [final] #
Copy and return the contained set of values in an array, using the optional dst as a recipient (which is resized as necessary).
Returns a slice of dst representing the container values. Time complexity: O(n)
bool isEmpty() [final] #
Is this container empty? Time complexity: O(1)
CircularList check() [final] #
uint instances(V element) [private] #
Time complexity: O(n)
void checkIndex(uint i) [private] #
Ref firstCell() [private] #
return the first cell, or throw exception if empty
Ref lastCell() [private] #
return the last cell, or throw exception if empty
Ref cellAt(uint index) [private] #
return the index'th cell, or throw exception if bad index
CircularList clear(bool all) [private] #
Time complexity: O(1)
void increment() [private] #
new element was added
void decrement(Ref p) [private] #
element was removed
void mutate() [private] #
set was changed
struct Iterator [private] #
Iterator with no filtering
bool valid() #
Did the container change underneath us?
bool next(ref V v) #
Accesses the next value, and returns false when there are no further values to traverse
V* next() #
Return a pointer to the next value, or null when there are no further values to traverse
int opApply(int delegate(ref V value) dg) #
Foreach support
bool remove() #
Remove value that was just iterated.
Iterator insert(V value) #
Insert a new value before the node about to be iterated (or after the node that was just iterated).

Returns:

a copy of this iterator for chaining.
Iterator reverse() #
Ref fore(Ref p) [private, static] #
Ref back(Ref p) [private, static] #