ideal • runtime • elements • base

public overload base list()

pass

public overload base list(element type n1)

this()

append(n1)

public overload base list(element type n1, element type n2)

this()

append(n1)

append(n2)

public overload base list(element type n1, element type n2, element type n3)

this()

append(n1)

append(n2)

append(n3)

public overload base list(element type n1, element type n2, element type n3, element type n4)

this()

append(n1)

append(n2)

append(n3)

append(n4)

public overload base list(element type n1, element type n2, element type n3, element type n4, element type n5)

this()

append(n1)

append(n2)

append(n3)

append(n4)

append(n5)

public overload base list(element type n1, element type n2, element type n3, element type n4, element type n5, element type n6)

this()

append(n1)

append(n2)

append(n3)

append(n4)

append(n5)

append(n6)

public overload base list(element type n1, element type n2, element type n3, element type n4, element type n5, element type n6, element type n7)

this()

append(n1)

append(n2)

append(n3)

append(n4)

append(n5)

append(n6)

append(n7)

public overload base list(readonly list[element type] the list)

this()

append all(the list)

implement void clear()

if is not empty

state = list state[element type] • new()

private list state[element type] writable state()

if !state • writable

state = state • copy()

assert state • writable

return state

implement void append(element type element)

writable state() • insert(size, element)

implement void append all(readonly list[element type] new elements)

writable state() • insert all(size, new elements)

implement void prepend(element type element)

writable state() • insert(0, element)

implement implicit mutable reference[element type] at(nonnegative index) mutable pure

assert index < state • size

return writable state() • the elements[index]

implement element type remove last()

assert is not empty

last index : size - 1

assert last index is nonnegative

result : state • the elements[last index]

writable state() • clear(last index, 1)

return result

implement element type remove at(nonnegative index)

assert is not empty

assert index < size

the elements : writable state() • the elements

result : the elements[index]

if index != size - 1

rest length : size - index - 1

assert rest length is nonnegative

the elements • move(index + 1, index, rest length)

last index : size - 1

assert last index is nonnegative

state • clear(last index, 1)

return result

Sort the list in place using the given sort order.

implement void sort(order[element type] the order)

new state : writable state()

new state • the elements • sort(the order, 0, new state • size)