Class ArrayList<T>

Type parameters

T

Hierarchy

ArrayList

Implements

List<T>
Queue<T>
Deque<T>

Index

Constructors

constructor

Methods

Constructors

constructor

new ArrayList(iEquals?: Collectable<T>, initialElements: ImmutableCollection<T>): ArrayList

- Defined in ArrayList.ts:36
Parameters
- Default value iEquals: Collectable<T> = AllFieldCollectable.instance
- Optional initialElements: ImmutableCollection<T>
Returns ArrayList

Methods

__@iterator

__@iterator(): Iterator<T>

Implementation of Deque.__@iterator
- Defined in ArrayList.ts:496
Returns Iterator<T>

the TypeScript style iterator

add

add(t: T): boolean

Implementation of Deque.add
- Defined in ArrayList.ts:61
Parameters
- t: T
Returns boolean

true if this collection changed as a result of the call

addAll

addAll(c: ImmutableCollection<T>, index: number): boolean

Implementation of List.addAll
- Defined in ArrayList.ts:136
Parameters
- c: ImmutableCollection<T>
- Optional index: number
Returns boolean

true if this collection changed as a result of the call

addFirst

addFirst(t: T): boolean

Implementation of Deque.addFirst
- Defined in ArrayList.ts:98
Parameters
- t: T
Returns boolean

true if this collection changed as a result of the call

addIndex

addIndex(index: number, t: T): void

Implementation of List.addIndex
- Defined in ArrayList.ts:85
Parameters
- index: number
- t: T
Returns void

addLast

addLast(t: T): boolean

Implementation of Deque.addLast
- Defined in ArrayList.ts:117
Parameters
- t: T
Returns boolean

true if this collection changed as a result of the call

clear

clear(): void

Implementation of Deque.clear
- Defined in ArrayList.ts:191
Returns void

contains

contains(t: T): boolean

Implementation of Deque.contains
- Defined in ArrayList.ts:252
Parameters
- t: T
Returns boolean

true if this list contains the specified element

element

element(): T

Implementation of Deque.element
- Defined in ArrayList.ts:480
Returns T

the element at the head of the queue or undefined if empty

forEach

forEach(consumer: Consumer<T>): void

Implementation of Deque.forEach
- Defined in ArrayList.ts:351
Parameters
- consumer: Consumer<T>
Returns void

get

get(index: number): T

Implementation of List.get
- Defined in ArrayList.ts:201
Parameters
- index: number
Returns T

the element at the specified position in this list

getCollectable

getCollectable(): Collectable<T>

- Defined in ArrayList.ts:52
Returns Collectable<T>

getFirst

getFirst(): T

Implementation of Deque.getFirst
- Defined in ArrayList.ts:446
Returns T

the element at the head of the queue or undefined if empty

getLast

getLast(): T

Implementation of Deque.getLast
- Defined in ArrayList.ts:462
Returns T

the element at the end of the queue or undefined if empty

immutableCollection

immutableCollection(): ImmutableCollection<T>

Implementation of Deque.immutableCollection
- Defined in ArrayList.ts:510
Returns ImmutableCollection<T>

immutableList

immutableList(): ImmutableList<T>

Implementation of List.immutableList
- Defined in ArrayList.ts:503
Returns ImmutableList<T>

indexOf

indexOf(t: T): number

Implementation of List.indexOf
- Defined in ArrayList.ts:210
Parameters
- t: T
Returns number

the index of the first occurrence of the specified element in this list, or -1 if this list does not contain the element

isEmpty

isEmpty(): boolean

Implementation of Deque.isEmpty
- Defined in ArrayList.ts:302
Returns boolean

true if this list contains no elements

iterator

iterator(): JIterator<T>

Implementation of Deque.iterator
- Defined in ArrayList.ts:488
Returns JIterator<T>

the Java style iterator

lastIndexOf

lastIndexOf(t: T): number

Implementation of List.lastIndexOf
- Defined in ArrayList.ts:231
Parameters
- t: T
Returns number

the index of the last occurrence of the specified element in this list, or -1 if this list does not contain the element

offer

offer(t: T): boolean

Implementation of Deque.offer
- Defined in ArrayList.ts:76
Parameters
- t: T
Returns boolean

true if this collection changed as a result of the call

offerFirst

offerFirst(t: T): boolean

Implementation of Deque.offerFirst
- Defined in ArrayList.ts:108
Parameters
- t: T
Returns boolean

true if this collection changed as a result of the call

offerLast

offerLast(t: T): boolean

Implementation of Deque.offerLast
- Defined in ArrayList.ts:126
Parameters
- t: T
Returns boolean

true if this collection changed as a result of the call

peek

peek(): T

Implementation of Deque.peek
- Defined in ArrayList.ts:406
Returns T

the element at the head of the queue or null if empty

peekFirst

peekFirst(): T

Implementation of Deque.peekFirst
- Defined in ArrayList.ts:422
Returns T

the element at the head of the queue or null if empty

peekLast

peekLast(): T

Implementation of Deque.peekLast
- Defined in ArrayList.ts:430
Returns T

the element at the head of the queue or null if empty

poll

poll(): T

Implementation of Deque.poll
- Defined in ArrayList.ts:334
Returns T

the element at the head of the queue or null if empty

pollFirst

pollFirst(): T

Implementation of Deque.pollFirst
- Defined in ArrayList.ts:362
Returns T

the element at the head of the queue or null if empty

pollLast

pollLast(): T

Implementation of Deque.pollLast
- Defined in ArrayList.ts:370
Returns T

the element at the head of the queue or null if empty

remove

remove(t: T): boolean

Implementation of Deque.remove
- Defined in ArrayList.ts:263
Parameters
- t: T
Returns boolean

true if this list contained the specified element

removeAll

removeAll(c: ImmutableCollection<T>): boolean

Implementation of List.removeAll
- Defined in ArrayList.ts:282
Parameters
- c: ImmutableCollection<T>
Returns boolean

true if this list changed as a result of the call

removeFirst

removeFirst(): T

Implementation of Deque.removeFirst
- Defined in ArrayList.ts:173
Returns T

the element at the head of the queue or undefined if empty

removeIndex

removeIndex(index: number): T

Implementation of List.removeIndex
- Defined in ArrayList.ts:156
Parameters
- index: number
Returns T

the element that was removed from the list, undefined if the element does not exist

removeLast

removeLast(): T

Implementation of Deque.removeLast
- Defined in ArrayList.ts:181
Returns T

the element at the end of the queue or undefined if empty

removeQueue

removeQueue(): T

Implementation of Deque.removeQueue
- Defined in ArrayList.ts:388
Returns T

the element at the head of the queue or undefined if empty

set

set(index: number, element: T): T

Implementation of List.set
- Defined in ArrayList.ts:315
Parameters
- index: number
- element: T
Returns T

the element previously at the specified position

size

size(): number

Implementation of Deque.size
- Defined in ArrayList.ts:325
Returns number

the number of elements in this list

toJSON

toJSON(tmp: any): Array<T>

- Defined in ArrayList.ts:517
Parameters
- tmp: any
Returns Array<T>

Generated using TypeDoc