LinkedList

Object Hierarchy:

public class LinkedList<G> : AbstractBidirList<G>, Queue<G>, Deque<G>

Doubly-linked list implementation of the List interface.

This implementation is pretty well designed for highly mutable data. When indexed access is privileged prefer using ArrayList.

public EqualDataFunc<G> equal_func { get; }
The elements' equality testing function.
public override bool read_only { get; }
Specifies whether this collection can change - i.e. whether add, remove etc. are legal operations.
public override int size { get; }
The number of items in this collection.

public LinkedList (owned EqualDataFunc<G>? equal_func = null)
Constructs a new, empty linked list.

public override bool @foreach (ForallFunc<G> f)
public override G @get (int index)
public override void @set (int index, G item)
public override bool add (G item)
Adds an item to this collection. Must not be called on read-only collections.
public override BidirListIterator<G> bidir_list_iterator ()
Returns a BidirListIterator that can be used for iteration over this list.
public override void clear ()
Removes all items from this collection. Must not be called on read-only collections.
public override bool contains (G item)
Determines whether this collection contains the specified item.
public G first ()
public override int index_of (G item)
public override void insert (int index, G item)
public override Iterator<G> iterator ()
Returns a Iterator that can be used for simple iteration over a collection.
public G last ()
public override ListIterator<G> list_iterator ()
public override bool remove (G item)
Removes the first occurrence of an item from this collection. Must not be called on read-only collections.
public override G remove_at (int index)
public override List<G>? slice (int start, int stop)