A C D E G H I K L M O P Q R S T

A

add(T) - Method in class pt.ua.base.ArrayedSet

add(T) - Method in class pt.ua.base.LinkedSet

add(T) - Method in class pt.ua.base.Set

Adds an element to the set.

Array<T> - Class in pt.ua.base

Generic array module.

Array(int) - Constructor for class pt.ua.base.Array

Creates an array with size elements.

ArrayedQueue<T> - Class in pt.ua.base

Queue module implemented with an array.

ArrayedQueue() - Constructor for class pt.ua.base.ArrayedQueue

Creates an unbounded queue.

ArrayedQueue(int) - Constructor for class pt.ua.base.ArrayedQueue

Creates an bounded queue limited to maxSize elements.

ArrayedSet<T> - Class in pt.ua.base

Set module implemented with an array.

ArrayedSet() - Constructor for class pt.ua.base.ArrayedSet

Creates an unbounded set.

ArrayedSet(int) - Constructor for class pt.ua.base.ArrayedSet

Creates an bounded set limited to maxSize elements.

ArrayedStack<T> - Class in pt.ua.base

Stack module implemented with an array.

ArrayedStack() - Constructor for class pt.ua.base.ArrayedStack

Creates an unbounded stack.

ArrayedStack(int) - Constructor for class pt.ua.base.ArrayedStack

Creates an bounded stack limited to maxSize elements.

AssociativeArray<K,E> - Class in pt.ua.base

Generic associative array module.

AssociativeArray() - Constructor for class pt.ua.base.AssociativeArray

C

clear() - Method in class pt.ua.base.ArrayedQueue

clear() - Method in class pt.ua.base.ArrayedSet

clear() - Method in class pt.ua.base.ArrayedStack

clear() - Method in class pt.ua.base.AssociativeArray

Empties the associative array.

clear() - Method in class pt.ua.base.HashTableChainingAssociativeArray

clear() - Method in class pt.ua.base.LinkedQueue

clear() - Method in class pt.ua.base.LinkedSet

clear() - Method in class pt.ua.base.LinkedStack

clear() - Method in class pt.ua.base.Queue

Empties the queue.

clear() - Method in class pt.ua.base.Set

Empties the set.

clear() - Method in class pt.ua.base.Stack

Empties the stack.

copy(AssociativeArray<K, E>) - Method in class pt.ua.base.AssociativeArray

Copies an associative array to this associative array (deep copy).

copy(Queue<T>) - Method in class pt.ua.base.Queue

Copies a queue to this queue (deep copy).

copy(Set<T>) - Method in class pt.ua.base.Set

Copies a set to this set (deep copy).

copy(Stack<T>) - Method in class pt.ua.base.Stack

Copies a stack to this stack (deep copy).

D

deepClone() - Method in class pt.ua.base.ArrayedQueue

deepClone() - Method in class pt.ua.base.ArrayedSet

deepClone() - Method in class pt.ua.base.ArrayedStack

deepClone() - Method in class pt.ua.base.AssociativeArray

deepClone() - Method in class pt.ua.base.HashTableChainingAssociativeArray

deepClone() - Method in class pt.ua.base.Indexable

deepClone() - Method in class pt.ua.base.LinkedQueue

deepClone() - Method in class pt.ua.base.LinkedSet

deepClone() - Method in class pt.ua.base.LinkedStack

deepClone() - Method in class pt.ua.base.Listable

Clones current list.

deepClone() - Method in class pt.ua.base.Queue

deepClone() - Method in class pt.ua.base.Set

deepClone() - Method in class pt.ua.base.Stack

E

equals(Array<T>) - Method in class pt.ua.base.Array

Queries equality with other array.

equals(ImmutableList<T>) - Method in class pt.ua.base.ImmutableList

Queries equality with other list.

exists(K) - Method in class pt.ua.base.AssociativeArray

Checks if key exists in the associative array.

exists(K) - Method in class pt.ua.base.HashTableChainingAssociativeArray

exists(T) - Method in class pt.ua.base.Set

Queries element e existence.

G

get(int) - Method in class pt.ua.base.Array

Gets array's element at idx position.

get(K) - Method in class pt.ua.base.AssociativeArray

Gets the element value associated with value key.

get(K) - Method in class pt.ua.base.HashTableChainingAssociativeArray

H

HashTableChainingAssociativeArray<K,E> - Class in pt.ua.base

Associative array module implemented with a closed address (chaining) hash table.

HashTableChainingAssociativeArray() - Constructor for class pt.ua.base.HashTableChainingAssociativeArray

Creates an empty associative array with an initial capacity of 1024 elements.

HashTableChainingAssociativeArray(int) - Constructor for class pt.ua.base.HashTableChainingAssociativeArray

Creates an empty associative array dimensioned for an expected number of elements.

head - Variable in class pt.ua.base.ImmutableList

The list head element

headList(int) - Method in class pt.ua.base.Indexable

Extracts the elements contained in the interval [0, end[.

I

ImmutableList<T> - Class in pt.ua.base

Generic immutable list module.

ImmutableList() - Constructor for class pt.ua.base.ImmutableList

Creates an empty list.

ImmutableList(T, ImmutableList<T>) - Constructor for class pt.ua.base.ImmutableList

Creates a new list by appending tail list to head element.

in(T) - Method in class pt.ua.base.ArrayedQueue

in(T) - Method in class pt.ua.base.LinkedQueue

in(T) - Method in class pt.ua.base.Queue

Adds an element to the tail of the queue.

Indexable<T> - Class in pt.ua.base

Generic indexable list.

Indexable() - Constructor for class pt.ua.base.Indexable

isEmpty() - Method in class pt.ua.base.Listable

Queries the list emptiness.

isFull() - Method in class pt.ua.base.ArrayedQueue

isFull() - Method in class pt.ua.base.ArrayedSet

isFull() - Method in class pt.ua.base.ArrayedStack

isFull() - Method in class pt.ua.base.AssociativeArray

isFull() - Method in class pt.ua.base.LinkedQueue

isFull() - Method in class pt.ua.base.LinkedSet

isFull() - Method in class pt.ua.base.LinkedStack

isFull() - Method in class pt.ua.base.Listable

Queries the list fullness.

isLimited() - Method in class pt.ua.base.ArrayedQueue

isLimited() - Method in class pt.ua.base.ArrayedSet

isLimited() - Method in class pt.ua.base.ArrayedStack

isLimited() - Method in class pt.ua.base.AssociativeArray

isLimited() - Method in class pt.ua.base.LinkedQueue

isLimited() - Method in class pt.ua.base.LinkedSet

isLimited() - Method in class pt.ua.base.LinkedStack

isLimited() - Method in class pt.ua.base.Listable

Checks if list is unbounded.

itemAt(int) - Method in class pt.ua.base.ArrayedQueue

itemAt(int) - Method in class pt.ua.base.ArrayedSet

itemAt(int) - Method in class pt.ua.base.ArrayedStack

itemAt(int) - Method in class pt.ua.base.ImmutableList

Returns the element of the list at the idx position.

itemAt(int) - Method in class pt.ua.base.Indexable

Returns the element of the list at the idx position.

itemAt(int) - Method in class pt.ua.base.LinkedQueue

itemAt(int) - Method in class pt.ua.base.LinkedSet

itemAt(int) - Method in class pt.ua.base.LinkedStack

K

keysToArray() - Method in class pt.ua.base.AssociativeArray

Extracts all keys to an array.

keysToArray() - Method in class pt.ua.base.HashTableChainingAssociativeArray

keysToList() - Method in class pt.ua.base.AssociativeArray

Extracts all keys to an immutable list.

keysToList() - Method in class pt.ua.base.HashTableChainingAssociativeArray

L

LinkedQueue<T> - Class in pt.ua.base

Queue module implemented with a linked list.

LinkedQueue() - Constructor for class pt.ua.base.LinkedQueue

Creates an unbounded queue.

LinkedQueue(int) - Constructor for class pt.ua.base.LinkedQueue

Creates an bounded queue limited to maxSize elements.

LinkedSet<T> - Class in pt.ua.base

Set module implemented with a linked list.

LinkedSet() - Constructor for class pt.ua.base.LinkedSet

Creates an unbounded set.

LinkedSet(int) - Constructor for class pt.ua.base.LinkedSet

Creates an bounded set limited to maxSize elements.

LinkedStack<T> - Class in pt.ua.base

Stack module implemented with a linked list.

LinkedStack() - Constructor for class pt.ua.base.LinkedStack

Creates an unbounded stack.

LinkedStack(int) - Constructor for class pt.ua.base.LinkedStack

Creates an bounded stack limited to maxSize elements.

Listable<T> - Class in pt.ua.base

Generic listable list.

Listable() - Constructor for class pt.ua.base.Listable

M

maxSize() - Method in class pt.ua.base.ArrayedQueue

maxSize() - Method in class pt.ua.base.ArrayedSet

maxSize() - Method in class pt.ua.base.ArrayedStack

maxSize() - Method in class pt.ua.base.AssociativeArray

maxSize() - Method in class pt.ua.base.LinkedQueue

maxSize() - Method in class pt.ua.base.LinkedSet

maxSize() - Method in class pt.ua.base.LinkedStack

maxSize() - Method in class pt.ua.base.Listable

The list maximum number of elements.

O

out() - Method in class pt.ua.base.ArrayedQueue

out() - Method in class pt.ua.base.LinkedQueue

out() - Method in class pt.ua.base.Queue

Removes the head element from the queue.

P

peek() - Method in class pt.ua.base.Queue

Without changing the queue, returns its head element.

peekIn() - Method in class pt.ua.base.Queue

Without changing the queue, returns its tail element.

pop() - Method in class pt.ua.base.ArrayedStack

pop() - Method in class pt.ua.base.LinkedStack

pop() - Method in class pt.ua.base.Stack

Removes the top element from the stack.

pt.ua.base - package pt.ua.base

This package contains several classes implementing fundamental data structures.

push(T) - Method in class pt.ua.base.ArrayedStack

push(T) - Method in class pt.ua.base.LinkedStack

push(T) - Method in class pt.ua.base.Stack

Adds an element to the top of the stack.

Q

Queue<T> - Class in pt.ua.base

Generic queue module.

Queue() - Constructor for class pt.ua.base.Queue

R

remove(T) - Method in class pt.ua.base.ArrayedSet

remove(K) - Method in class pt.ua.base.AssociativeArray

Removes key and its associated element value from the array.

remove(K) - Method in class pt.ua.base.HashTableChainingAssociativeArray

remove(T) - Method in class pt.ua.base.LinkedSet

remove(T) - Method in class pt.ua.base.Set

Removes element from the set.

S

set(int, T) - Method in class pt.ua.base.Array

Sets array's element at idx position.

set(K, E) - Method in class pt.ua.base.AssociativeArray

Associates value elem with value key.

set(K, E) - Method in class pt.ua.base.HashTableChainingAssociativeArray

Set<T> - Class in pt.ua.base

Generic set module.

Set() - Constructor for class pt.ua.base.Set

size() - Method in class pt.ua.base.Array

The array's immutable size

size() - Method in class pt.ua.base.ArrayedQueue

size() - Method in class pt.ua.base.ArrayedSet

size() - Method in class pt.ua.base.ArrayedStack

size() - Method in class pt.ua.base.HashTableChainingAssociativeArray

size - Variable in class pt.ua.base.ImmutableList

The list total number of elements.

size() - Method in class pt.ua.base.LinkedQueue

size() - Method in class pt.ua.base.LinkedSet

size() - Method in class pt.ua.base.LinkedStack

size() - Method in class pt.ua.base.Listable

The list total number of elements.

sort() - Method in class pt.ua.base.Array

Sort array's elements (using their natural orderig).

sort(int, int) - Method in class pt.ua.base.Array

Sort subarray's [fromIdx ; toIdx[ elements (using their natural orderig).

Stack<T> - Class in pt.ua.base

Generic stack module.

Stack() - Constructor for class pt.ua.base.Stack

subList(int, int) - Method in class pt.ua.base.Indexable

Extracts the elements contained in the interval [start, end[.

T

tail - Variable in class pt.ua.base.ImmutableList

The list tail list

tailList(int) - Method in class pt.ua.base.Indexable

Extracts the elements contained in the interval [start, size()[.

toArray() - Method in class pt.ua.base.AssociativeArray

toArray() - Method in class pt.ua.base.Indexable

toArray() - Method in class pt.ua.base.Listable

Extracts all the elements of the list.

toList() - Method in class pt.ua.base.AssociativeArray

toList() - Method in class pt.ua.base.Indexable

toList() - Method in class pt.ua.base.Listable

Extracts all the elements of the list.

top() - Method in class pt.ua.base.Stack

Without changing the stack, returns its top element.

toString() - Method in class pt.ua.base.Array

Returns a String with all array's elements separated with a space.

toString() - Method in class pt.ua.base.ImmutableList

Returns a String with all list's elements separated with a space.

toString() - Method in class pt.ua.base.Indexable

Returns a String with all the list elements separated with a space.

A C D E G H I K L M O P Q R S T