Index

A B C D E F G H I L M O P R S T U
All Classes and Interfaces|All Packages|Constant Field Values

A

add(double) - Method in class org.cicirello.util.DoubleArray

Adds a new element, provided size() is less than length(); and otherwise throws an exception.

add(double) - Method in class org.cicirello.util.DoubleList

Adds a new element to the end of the list, growing the internal array if necessary.

add(int) - Method in class org.cicirello.util.IntegerArray

Adds a new element, provided size() is less than length(); and otherwise throws an exception.

add(int) - Method in class org.cicirello.util.IntegerList

Adds a new element to the end of the list, growing the internal array if necessary.

add(int, double) - Method in class org.cicirello.util.DoubleArray

Inserts a new element at a specified index, provided size() is less than length(); and otherwise throws an exception.

add(int, double) - Method in class org.cicirello.util.DoubleList

Inserts a new element into the list, growing the internal array if necessary.

add(int, int) - Method in class org.cicirello.util.IntegerArray

Inserts a new element at a specified index, provided size() is less than length(); and otherwise throws an exception.

add(int, int) - Method in class org.cicirello.util.IntegerList

Inserts a new element into the list, growing the internal array if necessary.

add(E, double) - Method in interface org.cicirello.ds.PriorityQueueDouble

Adds an (element, priority) pair to the priority queue with a specified priority.

add(E, double) - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

add(E, int) - Method in interface org.cicirello.ds.PriorityQueue

Adds an (element, priority) pair to the priority queue with a specified priority.

add(E, int) - Method in class org.cicirello.ds.SimpleBinaryHeap

add(PriorityQueueNode.Double<E>) - Method in interface org.cicirello.ds.PriorityQueueDouble

Adds an (element, priority) pair to the priority queue.

add(PriorityQueueNode.Double<E>) - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

add(PriorityQueueNode.Integer<E>) - Method in interface org.cicirello.ds.PriorityQueue

Adds an (element, priority) pair to the priority queue.

add(PriorityQueueNode.Integer<E>) - Method in class org.cicirello.ds.SimpleBinaryHeap

addAll(Collection<? extends PriorityQueueNode.Double<E>>) - Method in class org.cicirello.ds.BinaryHeapDouble

Adds all (element, priority) pairs from a Collection to the priority queue.

addAll(Collection<? extends PriorityQueueNode.Double<E>>) - Method in interface org.cicirello.ds.PriorityQueueDouble

Adds all (element, priority) pairs from a Collection to the priority queue.

addAll(Collection<? extends PriorityQueueNode.Double<E>>) - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

Adds all (element, priority) pairs from a Collection to the priority queue.

addAll(Collection<? extends PriorityQueueNode.Integer<E>>) - Method in class org.cicirello.ds.BinaryHeap

Adds all (element, priority) pairs from a Collection to the priority queue.

addAll(Collection<? extends PriorityQueueNode.Integer<E>>) - Method in interface org.cicirello.ds.PriorityQueue

Adds all (element, priority) pairs from a Collection to the priority queue.

addAll(Collection<? extends PriorityQueueNode.Integer<E>>) - Method in class org.cicirello.ds.SimpleBinaryHeap

Adds all (element, priority) pairs from a Collection to the priority queue.

array() - Method in class org.cicirello.util.DoubleArray

Exposes a reference to the wrapped array.

array() - Method in class org.cicirello.util.IntegerArray

Exposes a reference to the wrapped array.

ArrayFiller - Class in org.cicirello.util

Utility class for filling integer arrays with consecutive integers.

ArrayLengthEnforcer - Class in org.cicirello.util

Utility class for checking and enforcing that an array has a length equal to a target length.

ArrayMinimumLengthEnforcer - Class in org.cicirello.util

Utility class for checking and enforcing that the length of an array is at least some target minimum length.

B

BinaryHeap<E> - Class in org.cicirello.ds

An implementation of a Binary Heap.

BinaryHeapDouble<E> - Class in org.cicirello.ds

An implementation of a Binary Heap.

C

change(int, double) - Method in class org.cicirello.ds.IntBinaryHeapDouble

Changes the priority of an element if the element is present in the IntPriorityQueueDouble, and otherwise adds the (element, priority) pair to the IntPriorityQueueDouble.

change(int, double) - Method in class org.cicirello.ds.IntFibonacciHeapDouble

Changes the priority of an element if the element is present in the IntPriorityQueueDouble, and otherwise adds the (element, priority) pair to the IntPriorityQueueDouble.

change(int, double) - Method in interface org.cicirello.ds.IntPriorityQueueDouble

Changes the priority of an element if the element is present in the IntPriorityQueueDouble, and otherwise adds the (element, priority) pair to the IntPriorityQueueDouble.

change(int, int) - Method in class org.cicirello.ds.IntBinaryHeap

Changes the priority of an element if the element is present in the IntPriorityQueue, and otherwise adds the (element, priority) pair to the IntPriorityQueue.

change(int, int) - Method in class org.cicirello.ds.IntFibonacciHeap

Changes the priority of an element if the element is present in the IntPriorityQueue, and otherwise adds the (element, priority) pair to the IntPriorityQueue.

change(int, int) - Method in interface org.cicirello.ds.IntPriorityQueue

Changes the priority of an element if the element is present in the IntPriorityQueue, and otherwise adds the (element, priority) pair to the IntPriorityQueue.

change(E, double) - Method in class org.cicirello.ds.BinaryHeapDouble

change(E, double) - Method in class org.cicirello.ds.FibonacciHeapDouble

change(E, double) - Method in interface org.cicirello.ds.PriorityQueueDouble

Changes the priority of an element if the element is present in the priority queue, and otherwise adds the (element, priority) pair to the priority queue.

change(E, double) - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

change(E, double) - Method in class org.cicirello.ds.SimpleFibonacciHeapDouble

change(E, int) - Method in class org.cicirello.ds.BinaryHeap

change(E, int) - Method in class org.cicirello.ds.FibonacciHeap

change(E, int) - Method in interface org.cicirello.ds.PriorityQueue

Changes the priority of an element if the element is present in the priority queue, and otherwise adds the (element, priority) pair to the priority queue.

change(E, int) - Method in class org.cicirello.ds.SimpleBinaryHeap

change(E, int) - Method in class org.cicirello.ds.SimpleFibonacciHeap

clear() - Method in class org.cicirello.ds.BinaryHeap

clear() - Method in class org.cicirello.ds.BinaryHeapDouble

clear() - Method in class org.cicirello.ds.FibonacciHeap

clear() - Method in class org.cicirello.ds.FibonacciHeapDouble

clear() - Method in class org.cicirello.ds.IntBinaryHeap

clear() - Method in class org.cicirello.ds.IntBinaryHeapDouble

clear() - Method in class org.cicirello.ds.IntFibonacciHeap

clear() - Method in class org.cicirello.ds.IntFibonacciHeapDouble

clear() - Method in interface org.cicirello.ds.IntPriorityQueue

Clears the IntPriorityQueue, removing all elements.

clear() - Method in interface org.cicirello.ds.IntPriorityQueueDouble

Clears the IntPriorityQueueDouble, removing all elements.

clear() - Method in interface org.cicirello.ds.PriorityQueue

Clears the priority queue, removing all elements.

clear() - Method in interface org.cicirello.ds.PriorityQueueDouble

Clears the priority queue, removing all elements.

clear() - Method in class org.cicirello.ds.SimpleBinaryHeap

clear() - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

clear() - Method in class org.cicirello.ds.SimpleFibonacciHeap

clear() - Method in class org.cicirello.ds.SimpleFibonacciHeapDouble

clear() - Method in class org.cicirello.util.DoubleArray

Logically clears the array.

clear() - Method in class org.cicirello.util.DoubleList

Logically clears the list.

clear() - Method in class org.cicirello.util.IntegerArray

Logically clears the array.

clear() - Method in class org.cicirello.util.IntegerList

Logically clears the list.

compareExchange(double[], int, int) - Static method in class org.cicirello.util.SortingNetwork

The compare-exchange operation of sorting networks.

compareExchange(int[], int, int) - Static method in class org.cicirello.util.SortingNetwork

The compare-exchange operation of sorting networks.

contains(double) - Method in class org.cicirello.util.DoubleArray

Checks if the array contains a value within the first size() elements.

contains(double) - Method in class org.cicirello.util.DoubleList

Checks if the list contains a value.

contains(int) - Method in class org.cicirello.ds.IntBinaryHeap

Checks if an element is in the IntPriorityQueue.

contains(int) - Method in class org.cicirello.ds.IntBinaryHeapDouble

Checks if an element is in the IntPriorityQueueDouble.

contains(int) - Method in class org.cicirello.ds.IntFibonacciHeap

Checks if an element is in the IntPriorityQueue.

contains(int) - Method in class org.cicirello.ds.IntFibonacciHeapDouble

Checks if an element is in the IntPriorityQueueDouble.

contains(int) - Method in interface org.cicirello.ds.IntPriorityQueue

Checks if an element is in the IntPriorityQueue.

contains(int) - Method in interface org.cicirello.ds.IntPriorityQueueDouble

Checks if an element is in the IntPriorityQueueDouble.

contains(int) - Method in class org.cicirello.util.IntegerArray

Checks if the array contains a value within the first size() elements.

contains(int) - Method in class org.cicirello.util.IntegerList

Checks if the list contains a value.

contains(Object) - Method in class org.cicirello.ds.BinaryHeap

contains(Object) - Method in class org.cicirello.ds.BinaryHeapDouble

contains(Object) - Method in class org.cicirello.ds.FibonacciHeap

contains(Object) - Method in class org.cicirello.ds.FibonacciHeapDouble

contains(Object) - Method in interface org.cicirello.ds.PriorityQueue

Checks if this priority queue contains a given element or an (element, priority) pair with a given element.

contains(Object) - Method in interface org.cicirello.ds.PriorityQueueDouble

Checks if this priority queue contains a given element or an (element, priority) pair with a given element.

contains(Object) - Method in class org.cicirello.ds.SimpleBinaryHeap

contains(Object) - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

contains(Object) - Method in class org.cicirello.ds.SimpleFibonacciHeap

contains(Object) - Method in class org.cicirello.ds.SimpleFibonacciHeapDouble

contains(T) - Method in class org.cicirello.ds.DisjointSetForest

Checks if an element is in the disjoint set forest.

containsAll(Collection<?>) - Method in class org.cicirello.ds.FibonacciHeap

Checks if this PriorityQueue contains all elements or (element, priority) pairs from a given Collection.

containsAll(Collection<?>) - Method in class org.cicirello.ds.FibonacciHeapDouble

Checks if this PriorityQueueDouble contains all elements or (element, priority) pairs from a given Collection.

containsAll(Collection<?>) - Method in interface org.cicirello.ds.PriorityQueue

Checks if this priority queue contains all elements or (element, priority) pairs from a given Collection.

containsAll(Collection<?>) - Method in interface org.cicirello.ds.PriorityQueueDouble

Checks if this priority queue contains all elements or (element, priority) pairs from a given Collection.

containsAll(Collection<?>) - Method in class org.cicirello.ds.SimpleBinaryHeap

Checks if this priority queue contains all elements or (element, priority) pairs from a given Collection.

containsAll(Collection<?>) - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

Checks if this priority queue contains all elements or (element, priority) pairs from a given Collection.

containsAll(Collection<?>) - Method in class org.cicirello.ds.SimpleFibonacciHeap

Checks if this priority queue contains all elements or (element, priority) pairs from a given Collection.

containsAll(Collection<?>) - Method in class org.cicirello.ds.SimpleFibonacciHeapDouble

Checks if this priority queue contains all elements or (element, priority) pairs from a given Collection.

copy() - Method in class org.cicirello.ds.BinaryHeap

copy() - Method in class org.cicirello.ds.BinaryHeapDouble

copy() - Method in class org.cicirello.ds.DisjointIntegerSetForest

copy() - Method in class org.cicirello.ds.FibonacciHeap

copy() - Method in class org.cicirello.ds.FibonacciHeapDouble

copy() - Method in class org.cicirello.ds.IntBinaryHeap

copy() - Method in class org.cicirello.ds.IntBinaryHeapDouble

copy() - Method in class org.cicirello.ds.IntFibonacciHeap

copy() - Method in class org.cicirello.ds.IntFibonacciHeapDouble

copy() - Method in class org.cicirello.ds.PriorityQueueNode.Double

Creates an identical copy of this object.

copy() - Method in class org.cicirello.ds.PriorityQueueNode.Integer

Creates an identical copy of this object.

copy() - Method in class org.cicirello.ds.SimpleBinaryHeap

copy() - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

copy() - Method in class org.cicirello.ds.SimpleFibonacciHeap

copy() - Method in class org.cicirello.ds.SimpleFibonacciHeapDouble

copy() - Method in interface org.cicirello.util.Copyable

Creates an identical copy of this object.

copy() - Method in class org.cicirello.util.DoubleList

copy() - Method in class org.cicirello.util.IntegerList

Copyable<T extends Copyable<T>> - Interface in org.cicirello.util

A simple interface for objects that can be copied.

create(int) - Static method in class org.cicirello.util.ArrayFiller

Creates an array and fills it with the integers: 0, 1, ....

create(int, int) - Static method in class org.cicirello.util.ArrayFiller

Creates an array and fills it with the integers: x+0, x+1, ....

createMaxHeap() - Static method in class org.cicirello.ds.BinaryHeap

Creates an empty BinaryHeap with the BinaryHeap.DEFAULT_INITIAL_CAPACITY as the initial capacity, and a maximum-priority-first-out priority order.

createMaxHeap() - Static method in class org.cicirello.ds.BinaryHeapDouble

Creates an empty BinaryHeapDouble with the BinaryHeapDouble.DEFAULT_INITIAL_CAPACITY as the initial capacity, and a maximum-priority-first-out priority order.

createMaxHeap() - Static method in class org.cicirello.ds.FibonacciHeap

Creates an empty FibonacciHeap with maximum-priority-first-out priority order.

createMaxHeap() - Static method in class org.cicirello.ds.FibonacciHeapDouble

Creates an empty FibonacciHeapDouble with maximum-priority-first-out priority order.

createMaxHeap() - Static method in class org.cicirello.ds.SimpleBinaryHeap

Creates an empty SimpleBinaryHeap with the SimpleBinaryHeap.DEFAULT_INITIAL_CAPACITY as the initial capacity, and a maximum-priority-first-out priority order.

createMaxHeap() - Static method in class org.cicirello.ds.SimpleBinaryHeapDouble

Creates an empty SimpleBinaryHeapDouble with the SimpleBinaryHeapDouble.DEFAULT_INITIAL_CAPACITY as the initial capacity, and a maximum-priority-first-out priority order.

createMaxHeap() - Static method in class org.cicirello.ds.SimpleFibonacciHeap

Creates an empty SimpleFibonacciHeap with maximum-priority-first-out priority order.

createMaxHeap() - Static method in class org.cicirello.ds.SimpleFibonacciHeapDouble

Creates an empty SimpleFibonacciHeapDouble with maximum-priority-first-out priority order.

createMaxHeap(int) - Static method in class org.cicirello.ds.BinaryHeap

Creates an empty BinaryHeap with a specified initial capacity, and a maximum-priority-first-out priority order.

createMaxHeap(int) - Static method in class org.cicirello.ds.BinaryHeapDouble

Creates an empty BinaryHeapDouble with a specified initial capacity, and a maximum-priority-first-out priority order.

createMaxHeap(int) - Static method in class org.cicirello.ds.IntBinaryHeap

Initializes an empty max-heap of (int, priority) pairs, such that the domain of the elements are the integers in [0, n).

createMaxHeap(int) - Static method in class org.cicirello.ds.IntBinaryHeapDouble

Initializes an empty max-heap of (int, priority) pairs, such that the domain of the elements are the integers in [0, n).

createMaxHeap(int) - Static method in class org.cicirello.ds.IntFibonacciHeap

Initializes an empty max-heap of (int, priority) pairs, such that the domain of the elements are the integers in [0, n).

createMaxHeap(int) - Static method in class org.cicirello.ds.IntFibonacciHeapDouble

Initializes an empty max-heap of (int, priority) pairs, such that the domain of the elements are the integers in [0, n).

createMaxHeap(int) - Static method in class org.cicirello.ds.SimpleBinaryHeap

Creates an empty SimpleBinaryHeap with a specified initial capacity, and a maximum-priority-first-out priority order.

createMaxHeap(int) - Static method in class org.cicirello.ds.SimpleBinaryHeapDouble

Creates an empty SimpleBinaryHeapDouble with a specified initial capacity, and a maximum-priority-first-out priority order.

createMaxHeap(Collection<PriorityQueueNode.Double<E>>) - Static method in class org.cicirello.ds.BinaryHeapDouble

Creates a BinaryHeapDouble from a collection of (element, priority) pairs, with a maximum-priority-first-out priority order.

createMaxHeap(Collection<PriorityQueueNode.Double<E>>) - Static method in class org.cicirello.ds.FibonacciHeapDouble

Creates a FibonacciHeapDouble from a collection of (element, priority) pairs, with a maximum-priority-first-out priority order.

createMaxHeap(Collection<PriorityQueueNode.Double<E>>) - Static method in class org.cicirello.ds.SimpleBinaryHeapDouble

Creates a SimpleBinaryHeapDouble from a collection of (element, priority) pairs, with a maximum-priority-first-out priority order.

createMaxHeap(Collection<PriorityQueueNode.Double<E>>) - Static method in class org.cicirello.ds.SimpleFibonacciHeapDouble

Creates a SimpleFibonacciHeapDouble from a collection of (element, priority) pairs, with a maximum-priority-first-out priority order.

createMaxHeap(Collection<PriorityQueueNode.Integer<E>>) - Static method in class org.cicirello.ds.BinaryHeap

Creates a BinaryHeap from a collection of (element, priority) pairs, with a maximum-priority-first-out priority order.

createMaxHeap(Collection<PriorityQueueNode.Integer<E>>) - Static method in class org.cicirello.ds.FibonacciHeap

Creates a FibonacciHeap from a collection of (element, priority) pairs, with a maximum-priority-first-out priority order.

createMaxHeap(Collection<PriorityQueueNode.Integer<E>>) - Static method in class org.cicirello.ds.SimpleBinaryHeap

Creates a SimpleBinaryHeap from a collection of (element, priority) pairs, with a maximum-priority-first-out priority order.

createMaxHeap(Collection<PriorityQueueNode.Integer<E>>) - Static method in class org.cicirello.ds.SimpleFibonacciHeap

Creates a SimpleFibonacciHeap from a collection of (element, priority) pairs, with a maximum-priority-first-out priority order.

createMinHeap() - Static method in class org.cicirello.ds.BinaryHeap

Creates an empty BinaryHeap with the BinaryHeap.DEFAULT_INITIAL_CAPACITY as the initial capacity, and a minimum-priority-first-out priority order.

createMinHeap() - Static method in class org.cicirello.ds.BinaryHeapDouble

Creates an empty BinaryHeapDouble with the BinaryHeapDouble.DEFAULT_INITIAL_CAPACITY as the initial capacity, and a minimum-priority-first-out priority order.

createMinHeap() - Static method in class org.cicirello.ds.FibonacciHeap

Creates an empty FibonacciHeap with minimum-priority-first-out priority order.

createMinHeap() - Static method in class org.cicirello.ds.FibonacciHeapDouble

Creates an empty FibonacciHeapDouble with minimum-priority-first-out priority order.

createMinHeap() - Static method in class org.cicirello.ds.SimpleBinaryHeap

Creates an empty SimpleBinaryHeap with the SimpleBinaryHeap.DEFAULT_INITIAL_CAPACITY as the initial capacity, and a minimum-priority-first-out priority order.

createMinHeap() - Static method in class org.cicirello.ds.SimpleBinaryHeapDouble

Creates an empty SimpleBinaryHeapDouble with the SimpleBinaryHeapDouble.DEFAULT_INITIAL_CAPACITY as the initial capacity, and a minimum-priority-first-out priority order.

createMinHeap() - Static method in class org.cicirello.ds.SimpleFibonacciHeap

Creates an empty SimpleFibonacciHeap with minimum-priority-first-out priority order.

createMinHeap() - Static method in class org.cicirello.ds.SimpleFibonacciHeapDouble

Creates an empty SimpleFibonacciHeapDouble with minimum-priority-first-out priority order.

createMinHeap(int) - Static method in class org.cicirello.ds.BinaryHeap

Creates an empty BinaryHeap with a specified initial capacity, and a minimum-priority-first-out priority order.

createMinHeap(int) - Static method in class org.cicirello.ds.BinaryHeapDouble

Creates an empty BinaryHeapDouble with a specified initial capacity, and a minimum-priority-first-out priority order.

createMinHeap(int) - Static method in class org.cicirello.ds.IntBinaryHeap

Initializes an empty min-heap of (int, priority) pairs, such that the domain of the elements are the integers in [0, n).

createMinHeap(int) - Static method in class org.cicirello.ds.IntBinaryHeapDouble

Initializes an empty min-heap of (int, priority) pairs, such that the domain of the elements are the integers in [0, n).

createMinHeap(int) - Static method in class org.cicirello.ds.IntFibonacciHeap

Initializes an empty min-heap of (int, priority) pairs, such that the domain of the elements are the integers in [0, n).

createMinHeap(int) - Static method in class org.cicirello.ds.IntFibonacciHeapDouble

Initializes an empty min-heap of (int, priority) pairs, such that the domain of the elements are the integers in [0, n).

createMinHeap(int) - Static method in class org.cicirello.ds.SimpleBinaryHeap

Creates an empty SimpleBinaryHeap with a specified initial capacity, and a minimum-priority-first-out priority order.

createMinHeap(int) - Static method in class org.cicirello.ds.SimpleBinaryHeapDouble

Creates an empty SimpleBinaryHeapDouble with a specified initial capacity, and a minimum-priority-first-out priority order.

createMinHeap(Collection<PriorityQueueNode.Double<E>>) - Static method in class org.cicirello.ds.BinaryHeapDouble

Creates a BinaryHeapDouble from a collection of (element, priority) pairs, with a minimum-priority-first-out priority order.

createMinHeap(Collection<PriorityQueueNode.Double<E>>) - Static method in class org.cicirello.ds.FibonacciHeapDouble

Creates a FibonacciHeapDouble from a collection of (element, priority) pairs, with a minimum-priority-first-out priority order.

createMinHeap(Collection<PriorityQueueNode.Double<E>>) - Static method in class org.cicirello.ds.SimpleBinaryHeapDouble

Creates a SimpleBinaryHeapDouble from a collection of (element, priority) pairs, with a minimum-priority-first-out priority order.

createMinHeap(Collection<PriorityQueueNode.Double<E>>) - Static method in class org.cicirello.ds.SimpleFibonacciHeapDouble

Creates a SimpleFibonacciHeapDouble from a collection of (element, priority) pairs, with a minimum-priority-first-out priority order.

createMinHeap(Collection<PriorityQueueNode.Integer<E>>) - Static method in class org.cicirello.ds.BinaryHeap

Creates a BinaryHeap from a collection of (element, priority) pairs, with a minimum-priority-first-out priority order.

createMinHeap(Collection<PriorityQueueNode.Integer<E>>) - Static method in class org.cicirello.ds.FibonacciHeap

Creates a FibonacciHeap from a collection of (element, priority) pairs, with a minimum-priority-first-out priority order.

createMinHeap(Collection<PriorityQueueNode.Integer<E>>) - Static method in class org.cicirello.ds.SimpleBinaryHeap

Creates a SimpleBinaryHeap from a collection of (element, priority) pairs, with a minimum-priority-first-out priority order.

createMinHeap(Collection<PriorityQueueNode.Integer<E>>) - Static method in class org.cicirello.ds.SimpleFibonacciHeap

Creates a SimpleFibonacciHeap from a collection of (element, priority) pairs, with a minimum-priority-first-out priority order.

createReverse(int) - Static method in class org.cicirello.util.ArrayFiller

Creates an array and fills it with the integers: n-1, n-1, ..., 1, 0, where n is the length of the array.

createReverse(int, int) - Static method in class org.cicirello.util.ArrayFiller

Creates an array and fills it with the integers: x+n-1, x+n-1, ..., x+1, x, where n is the length of the array.

D

DEFAULT_INITIAL_CAPACITY - Static variable in class org.cicirello.ds.BinaryHeap

The default initial capacity.

DEFAULT_INITIAL_CAPACITY - Static variable in class org.cicirello.ds.BinaryHeapDouble

The default initial capacity.

DEFAULT_INITIAL_CAPACITY - Static variable in class org.cicirello.ds.SimpleBinaryHeap

The default initial capacity.

DEFAULT_INITIAL_CAPACITY - Static variable in class org.cicirello.ds.SimpleBinaryHeapDouble

The default initial capacity.

DEFAULT_INITIAL_CAPACITY - Static variable in class org.cicirello.util.DoubleList

The default initial capacity of the list.

DEFAULT_INITIAL_CAPACITY - Static variable in class org.cicirello.util.IntegerList

The default initial capacity of the list.

demote(int, double) - Method in class org.cicirello.ds.IntBinaryHeapDouble

Demotes an element relative to priority order if the element is present in the IntPriorityQueueDouble.

demote(int, double) - Method in class org.cicirello.ds.IntFibonacciHeapDouble

Demotes an element relative to priority order if the element is present in the IntPriorityQueueDouble.

demote(int, double) - Method in interface org.cicirello.ds.IntPriorityQueueDouble

Demotes an element relative to priority order if the element is present in the IntPriorityQueueDouble.

demote(int, int) - Method in class org.cicirello.ds.IntBinaryHeap

Demotes an element relative to priority order if the element is present in the IntPriorityQueue.

demote(int, int) - Method in class org.cicirello.ds.IntFibonacciHeap

Demotes an element relative to priority order if the element is present in the IntPriorityQueue.

demote(int, int) - Method in interface org.cicirello.ds.IntPriorityQueue

Demotes an element relative to priority order if the element is present in the IntPriorityQueue.

demote(E, double) - Method in class org.cicirello.ds.BinaryHeapDouble

demote(E, double) - Method in class org.cicirello.ds.FibonacciHeapDouble

demote(E, double) - Method in interface org.cicirello.ds.PriorityQueueDouble

Demotes an element relative to priority order if the element is present in the priority queue.

demote(E, double) - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

demote(E, double) - Method in class org.cicirello.ds.SimpleFibonacciHeapDouble

demote(E, int) - Method in class org.cicirello.ds.BinaryHeap

demote(E, int) - Method in class org.cicirello.ds.FibonacciHeap

demote(E, int) - Method in interface org.cicirello.ds.PriorityQueue

Demotes an element relative to priority order if the element is present in the priority queue.

demote(E, int) - Method in class org.cicirello.ds.SimpleBinaryHeap

demote(E, int) - Method in class org.cicirello.ds.SimpleFibonacciHeap

DisjointIntegerSetForest - Class in org.cicirello.ds

Disjoint sets of integers from [0, n) implemented with a disjoint set forest.

DisjointIntegerSetForest(int) - Constructor for class org.cicirello.ds.DisjointIntegerSetForest

Initializes a disjoint set forest containing the integers from 0 through n-1, each initially in a set by itself.

DisjointSetForest<T> - Class in org.cicirello.ds

Represents disjoint sets of objects with a disjoint set forest.

DisjointSetForest() - Constructor for class org.cicirello.ds.DisjointSetForest

Initializes an empty DisjointSetForest.

domain() - Method in class org.cicirello.ds.IntBinaryHeap

domain() - Method in class org.cicirello.ds.IntBinaryHeapDouble

domain() - Method in class org.cicirello.ds.IntFibonacciHeap

domain() - Method in class org.cicirello.ds.IntFibonacciHeapDouble

domain() - Method in interface org.cicirello.ds.IntPriorityQueue

Returns the domain of this IntPriorityQueue.

domain() - Method in interface org.cicirello.ds.IntPriorityQueueDouble

Returns the domain of this IntPriorityQueueDouble.

Double(E, double) - Constructor for class org.cicirello.ds.PriorityQueueNode.Double

Initializes the PriorityQueueNode.Double.

DoubleArray - Class in org.cicirello.util

An object of this class wraps an array of primitive doubles in such a way as to provide some ArrayList-like operations for a primitive array (e.g., using it as a partially-filled array).

DoubleArray(double[]) - Constructor for class org.cicirello.util.DoubleArray

Initializes an DoubleArray so as to wrap an existing array.

DoubleArray(int) - Constructor for class org.cicirello.util.DoubleArray

Initializes an empty DoubleArray, with a specified length for the internal array.

DoubleList - Class in org.cicirello.util

This class is an implementation of a partially-filled array of primitive double values.

DoubleList() - Constructor for class org.cicirello.util.DoubleList

Initializes an empty DoubleList.

DoubleList(double[]) - Constructor for class org.cicirello.util.DoubleList

Initializes an DoubleList from an array,

DoubleList(int) - Constructor for class org.cicirello.util.DoubleList

Initializes an empty DoubleList, with a specified initial capacity.

E

element() - Method in interface org.cicirello.ds.PriorityQueue

Gets the next (element, priority) pair in priority order from this priority queue, without removing it.

element() - Method in interface org.cicirello.ds.PriorityQueueDouble

Gets the next (element, priority) pair in priority order from this priority queue, without removing it.

enforce(boolean[], int) - Static method in class org.cicirello.util.ArrayLengthEnforcer

Validates the length of an array and that it is non-null, checking that it is equal to a specified target length.

enforce(boolean[], int) - Static method in class org.cicirello.util.ArrayMinimumLengthEnforcer

Validates that an array is non-null and has a length at least that of a target minimum.

enforce(byte[], int) - Static method in class org.cicirello.util.ArrayLengthEnforcer

Validates the length of an array and that it is non-null, checking that it is equal to a specified target length.

enforce(byte[], int) - Static method in class org.cicirello.util.ArrayMinimumLengthEnforcer

Validates that an array is non-null and has a length at least that of a target minimum.

enforce(char[], int) - Static method in class org.cicirello.util.ArrayLengthEnforcer

Validates the length of an array and that it is non-null, checking that it is equal to a specified target length.

enforce(char[], int) - Static method in class org.cicirello.util.ArrayMinimumLengthEnforcer

Validates that an array is non-null and has a length at least that of a target minimum.

enforce(double[], int) - Static method in class org.cicirello.util.ArrayLengthEnforcer

Validates the length of an array and that it is non-null, checking that it is equal to a specified target length.

enforce(double[], int) - Static method in class org.cicirello.util.ArrayMinimumLengthEnforcer

Validates that an array is non-null and has a length at least that of a target minimum.

enforce(float[], int) - Static method in class org.cicirello.util.ArrayLengthEnforcer

Validates the length of an array and that it is non-null, checking that it is equal to a specified target length.

enforce(float[], int) - Static method in class org.cicirello.util.ArrayMinimumLengthEnforcer

Validates that an array is non-null and has a length at least that of a target minimum.

enforce(int[], int) - Static method in class org.cicirello.util.ArrayLengthEnforcer

Validates the length of an array and that it is non-null, checking that it is equal to a specified target length.

enforce(int[], int) - Static method in class org.cicirello.util.ArrayMinimumLengthEnforcer

Validates that an array is non-null and has a length at least that of a target minimum.

enforce(long[], int) - Static method in class org.cicirello.util.ArrayLengthEnforcer

Validates the length of an array and that it is non-null, checking that it is equal to a specified target length.

enforce(long[], int) - Static method in class org.cicirello.util.ArrayMinimumLengthEnforcer

Validates that an array is non-null and has a length at least that of a target minimum.

enforce(short[], int) - Static method in class org.cicirello.util.ArrayLengthEnforcer

Validates the length of an array and that it is non-null, checking that it is equal to a specified target length.

enforce(short[], int) - Static method in class org.cicirello.util.ArrayMinimumLengthEnforcer

Validates that an array is non-null and has a length at least that of a target minimum.

ensureCapacity(int) - Method in class org.cicirello.ds.BinaryHeap

Increases the capacity if the capacity is not already at least the specified minimum.

ensureCapacity(int) - Method in class org.cicirello.ds.BinaryHeapDouble

Increases the capacity if the capacity is not already at least the specified minimum.

ensureCapacity(int) - Method in class org.cicirello.ds.SimpleBinaryHeap

Increases the capacity if the capacity is not already at least the specified minimum.

ensureCapacity(int) - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

Increases the capacity if the capacity is not already at least the specified minimum.

ensureCapacity(int) - Method in class org.cicirello.util.DoubleList

Increases capacity if necessary to achieve a specified minimum capacity.

ensureCapacity(int) - Method in class org.cicirello.util.IntegerList

Increases capacity if necessary to achieve a specified minimum capacity.

equals(Object) - Method in class org.cicirello.ds.BinaryHeap

Checks if this BinaryHeap contains the same (element, priority) pairs as another BinaryHeap, including the specific order within the BinaryHeap, as well as that the priority order is the same.

equals(Object) - Method in class org.cicirello.ds.BinaryHeapDouble

Checks if this BinaryHeapDouble contains the same (element, priority) pairs as another BinaryHeapDouble, including the specific order within the BinaryHeapDouble, as well as that the priority order is the same.

equals(Object) - Method in class org.cicirello.ds.DisjointIntegerSetForest

Checks if this DisjointIntegerSetForest is equal to another.

equals(Object) - Method in class org.cicirello.ds.FibonacciHeap

Checks if this heap is the same as another, including that they contain the same (element, priority) pairs as another, including the specific structure the heap, as well as that the priority order is the same.

equals(Object) - Method in class org.cicirello.ds.FibonacciHeapDouble

Checks if this heap is the same as another, including that they contain the same (element, priority) pairs as another, including the specific structure the heap, as well as that the priority order is the same.

equals(Object) - Method in class org.cicirello.ds.PriorityQueueNode.Double

Checks if another PriorityQueueNode.Double is equal to this one.

equals(Object) - Method in class org.cicirello.ds.PriorityQueueNode

Checks if another PriorityQueueNode is equal to this one.

equals(Object) - Method in class org.cicirello.ds.PriorityQueueNode.Integer

Checks if another PriorityQueueNode.Integer is equal to this one.

equals(Object) - Method in class org.cicirello.ds.SimpleBinaryHeap

Checks if this SimpleBinaryHeap contains the same (element, priority) pairs as another SimpleBinaryHeap, including the specific order within the SimpleBinaryHeap, as well as that the priority order is the same.

equals(Object) - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

Checks if this SimpleBinaryHeapDouble contains the same (element, priority) pairs as another SimpleBinaryHeapDouble, including the specific order within the SimpleBinaryHeapDouble, as well as that the priority order is the same.

equals(Object) - Method in class org.cicirello.ds.SimpleFibonacciHeap

Checks if this heap is the same as another, including that they contain the same (element, priority) pairs as another, including the specific structure the heap, as well as that the priority order is the same.

equals(Object) - Method in class org.cicirello.ds.SimpleFibonacciHeapDouble

Checks if this heap is the same as another, including that they contain the same (element, priority) pairs as another, including the specific structure the heap, as well as that the priority order is the same.

equals(Object) - Method in class org.cicirello.util.DoubleArray

Checks if this DoubleArray is equal to another DoubleArray, such that they wrap the same array instance and are of the same size().

equals(Object) - Method in class org.cicirello.util.DoubleList

Checks if this list is equal to another list, such that they are the same size, and contain all of the same elements in the same order.

equals(Object) - Method in class org.cicirello.util.IntegerArray

Checks if this IntegerArray is equal to another IntegerArray, such that they wrap the same array instance and are of the same size().

equals(Object) - Method in class org.cicirello.util.IntegerList

Checks if this list is equal to another list, such that they are the same size, and contain all of the same elements in the same order.

F

FibonacciHeap<E> - Class in org.cicirello.ds

An implementation of a Fibonacci Heap.

FibonacciHeapDouble<E> - Class in org.cicirello.ds

An implementation of a Fibonacci Heap.

fill(int[]) - Static method in class org.cicirello.util.ArrayFiller

Fills an existing array with integers: 0, 1, ....

fill(int[], int) - Static method in class org.cicirello.util.ArrayFiller

Fills an existing array with integers: x+0, x+1, ....

fillPartial(int[], int) - Static method in class org.cicirello.util.ArrayFiller

Fills part of an existing array with integers: 0, 1, ..., (k-1).

fillPartial(int[], int, int) - Static method in class org.cicirello.util.ArrayFiller

Fills part of an existing array with integers: x+0, x+1, ....

findSet(int) - Method in class org.cicirello.ds.DisjointIntegerSetForest

Finds the id of the set currently containing the element.

findSet(T) - Method in class org.cicirello.ds.DisjointSetForest

Finds the id of the set currently containing the element.

G

get(int) - Method in class org.cicirello.util.DoubleArray

Gets the element at a specified index.

get(int) - Method in class org.cicirello.util.DoubleList

Gets the element at a specified index.

get(int) - Method in class org.cicirello.util.IntegerArray

Gets the element at a specified index.

get(int) - Method in class org.cicirello.util.IntegerList

Gets the element at a specified index.

getElement() - Method in class org.cicirello.ds.PriorityQueueNode

Gets the encapsulated object.

getPriority() - Method in class org.cicirello.ds.PriorityQueueNode.Double

Gets the priority value.

getPriority() - Method in class org.cicirello.ds.PriorityQueueNode.Integer

Gets the priority value.

H

hashCode() - Method in class org.cicirello.ds.BinaryHeap

Computes a hashCode for the BinaryHeap.

hashCode() - Method in class org.cicirello.ds.BinaryHeapDouble

Computes a hashCode for the BinaryHeapDouble.

hashCode() - Method in class org.cicirello.ds.DisjointIntegerSetForest

Computes a hashCode for the DisjointIntegerSetForest.

hashCode() - Method in class org.cicirello.ds.FibonacciHeap

Computes a hashCode.

hashCode() - Method in class org.cicirello.ds.FibonacciHeapDouble

Computes a hashCode.

hashCode() - Method in class org.cicirello.ds.PriorityQueueNode.Double

Computes the hashCode of the PriorityQueueNode.Double.

hashCode() - Method in class org.cicirello.ds.PriorityQueueNode

Computes the hashCode of the PriorityQueueNode.

hashCode() - Method in class org.cicirello.ds.PriorityQueueNode.Integer

Computes the hashCode of the PriorityQueueNode.Integer.

hashCode() - Method in class org.cicirello.ds.SimpleBinaryHeap

Computes a hashCode for the SimpleBinaryHeap.

hashCode() - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

Computes a hashCode for the SimpleBinaryHeapDouble.

hashCode() - Method in class org.cicirello.ds.SimpleFibonacciHeap

Computes a hashCode.

hashCode() - Method in class org.cicirello.ds.SimpleFibonacciHeapDouble

Computes a hashCode.

hashCode() - Method in class org.cicirello.util.DoubleArray

Computes a hashCode for the DoubleArray.

hashCode() - Method in class org.cicirello.util.DoubleList

Computes a hashCode for the list.

hashCode() - Method in class org.cicirello.util.IntegerArray

Computes a hashCode for the IntegerArray.

hashCode() - Method in class org.cicirello.util.IntegerList

Computes a hashCode for the list.

I

indexOf(double) - Method in class org.cicirello.util.DoubleArray

Gets the index of the first occurrence of an element from the left, provided it appears within the first size() elements.

indexOf(double) - Method in class org.cicirello.util.DoubleList

Gets the index of the first occurrence of an element from the left.

indexOf(int) - Method in class org.cicirello.util.IntegerArray

Gets the index of the first occurrence of an element from the left, provided it appears within the first size() elements.

indexOf(int) - Method in class org.cicirello.util.IntegerList

Gets the index of the first occurrence of an element from the left.

IntBinaryHeap - Class in org.cicirello.ds

An implementation of a Binary Heap of (element, priority) pairs, such that the elements are distinct integers in the interval [0, n), and with priority values also of type int.

IntBinaryHeapDouble - Class in org.cicirello.ds

An implementation of a Binary Heap of (element, priority) pairs, such that the elements are distinct integers in the interval [0, n), and with priority values of type double.

Integer(E, int) - Constructor for class org.cicirello.ds.PriorityQueueNode.Integer

Initializes the PriorityQueueNode.Integer.

IntegerArray - Class in org.cicirello.util

An object of this class wraps an array of primitive ints in such a way as to provide some ArrayList-like operations for a primitive array (e.g., using it as a partially-filled array).

IntegerArray(int) - Constructor for class org.cicirello.util.IntegerArray

Initializes an empty IntegerArray, with a specified length for the internal array.

IntegerArray(int[]) - Constructor for class org.cicirello.util.IntegerArray

Initializes an IntegerArray so as to wrap an existing array.

IntegerList - Class in org.cicirello.util

This class is an implementation of a partially-filled array of primitive int values.

IntegerList() - Constructor for class org.cicirello.util.IntegerList

Initializes an empty IntegerList.

IntegerList(int) - Constructor for class org.cicirello.util.IntegerList

Initializes an empty IntegerList, with a specified initial capacity.

IntegerList(int[]) - Constructor for class org.cicirello.util.IntegerList

Initializes an IntegerList from an array,

IntFibonacciHeap - Class in org.cicirello.ds

An implementation of a Fibonacci Heap of (element, priority) pairs, such that the elements are distinct integers in the interval [0, n), and with priority values of type int.

IntFibonacciHeapDouble - Class in org.cicirello.ds

An implementation of a Fibonacci Heap of (element, priority) pairs, such that the elements are distinct integers in the interval [0, n), and with priority values of type double.

IntPriorityQueue - Interface in org.cicirello.ds

Interface common to the classes that provide implementations of a priority queue of (element, priority) pairs, such that the elements are int values in the interval [0, n), and priorities are also ints.

IntPriorityQueueDouble - Interface in org.cicirello.ds

Interface common to the classes that provide implementations of a priority queue of (element, priority) pairs, such that the elements are int values in the interval [0, n), and priorities are doubles.

isEmpty() - Method in class org.cicirello.ds.BinaryHeap

isEmpty() - Method in class org.cicirello.ds.BinaryHeapDouble

isEmpty() - Method in class org.cicirello.ds.FibonacciHeap

isEmpty() - Method in class org.cicirello.ds.FibonacciHeapDouble

isEmpty() - Method in class org.cicirello.ds.IntBinaryHeap

isEmpty() - Method in class org.cicirello.ds.IntBinaryHeapDouble

isEmpty() - Method in class org.cicirello.ds.IntFibonacciHeap

isEmpty() - Method in class org.cicirello.ds.IntFibonacciHeapDouble

isEmpty() - Method in interface org.cicirello.ds.IntPriorityQueue

Checks if the IntPriorityQueue is empty.

isEmpty() - Method in interface org.cicirello.ds.IntPriorityQueueDouble

Checks if the IntPriorityQueueDouble is empty.

isEmpty() - Method in interface org.cicirello.ds.PriorityQueue

Checks if the priority queue is empty.

isEmpty() - Method in interface org.cicirello.ds.PriorityQueueDouble

Checks if the priority queue is empty.

isEmpty() - Method in class org.cicirello.ds.SimpleBinaryHeap

isEmpty() - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

isEmpty() - Method in class org.cicirello.ds.SimpleFibonacciHeap

isEmpty() - Method in class org.cicirello.ds.SimpleFibonacciHeapDouble

isEmpty() - Method in class org.cicirello.util.DoubleArray

Checks if the array is logically empty.

isEmpty() - Method in class org.cicirello.util.DoubleList

Checks if the list is empty.

isEmpty() - Method in class org.cicirello.util.IntegerArray

Checks if the array is logically empty.

isEmpty() - Method in class org.cicirello.util.IntegerList

Checks if the list is empty.

iterator() - Method in class org.cicirello.ds.BinaryHeap

iterator() - Method in class org.cicirello.ds.BinaryHeapDouble

iterator() - Method in class org.cicirello.ds.FibonacciHeap

iterator() - Method in class org.cicirello.ds.FibonacciHeapDouble

iterator() - Method in interface org.cicirello.ds.PriorityQueue

Returns an iterator over the (element, priority) pairs in a mostly arbitrary order (i.e., you must not assume any particular order).

iterator() - Method in interface org.cicirello.ds.PriorityQueueDouble

Returns an iterator over the (element, priority) pairs in a mostly arbitrary order (i.e., you must not assume any particular order).

iterator() - Method in class org.cicirello.ds.SimpleBinaryHeap

iterator() - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

iterator() - Method in class org.cicirello.ds.SimpleFibonacciHeap

iterator() - Method in class org.cicirello.ds.SimpleFibonacciHeapDouble

L

lastIndexOf(double) - Method in class org.cicirello.util.DoubleArray

Gets the index of the last occurrence of an element, provided it appears within the first size() elements.

lastIndexOf(double) - Method in class org.cicirello.util.DoubleList

Gets the index of the last occurrence of an element.

lastIndexOf(int) - Method in class org.cicirello.util.IntegerArray

Gets the index of the last occurrence of an element, provided it appears within the first size() elements.

lastIndexOf(int) - Method in class org.cicirello.util.IntegerList

Gets the index of the last occurrence of an element.

length() - Method in class org.cicirello.util.DoubleArray

Gets the length of the wrapped array.

length() - Method in class org.cicirello.util.IntegerArray

Gets the length of the wrapped array.

M

makeSet(T) - Method in class org.cicirello.ds.DisjointSetForest

Adds a new set to the disjoint set forest containing only the new element.

merge(BinaryHeap<E>) - Method in class org.cicirello.ds.BinaryHeap

Merges another priority queue into this one, adding all of its (element, priority) pairs.

merge(BinaryHeapDouble<E>) - Method in class org.cicirello.ds.BinaryHeapDouble

Merges another priority queue into this one, adding all of its (element, priority) pairs.

merge(FibonacciHeap<E>) - Method in class org.cicirello.ds.FibonacciHeap

Merges another priority queue into this one, adding all of its (element, priority) pairs.

merge(FibonacciHeapDouble<E>) - Method in class org.cicirello.ds.FibonacciHeapDouble

Merges another priority queue into this one, adding all of its (element, priority) pairs.

merge(SimpleBinaryHeap<E>) - Method in class org.cicirello.ds.SimpleBinaryHeap

Merges another priority queue into this one, adding all of its (element, priority) pairs.

merge(SimpleBinaryHeapDouble<E>) - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

Merges another priority queue into this one, adding all of its (element, priority) pairs.

merge(SimpleFibonacciHeap<E>) - Method in class org.cicirello.ds.SimpleFibonacciHeap

Merges another priority queue into this one, adding all of its (element, priority) pairs.

merge(SimpleFibonacciHeapDouble<E>) - Method in class org.cicirello.ds.SimpleFibonacciHeapDouble

Merges another priority queue into this one, adding all of its (element, priority) pairs.

merge(T) - Method in interface org.cicirello.ds.MergeablePriorityQueue

Merges another priority queue into this one, adding all of its (element, priority) pairs.

merge(T) - Method in interface org.cicirello.ds.MergeablePriorityQueueDouble

Merges another priority queue into this one, adding all of its (element, priority) pairs.

MergeablePriorityQueue<E,T extends MergeablePriorityQueue<E,T>> - Interface in org.cicirello.ds

A MergeablePriorityQueue is a PriorityQueue that includes a merge method.

MergeablePriorityQueueDouble<E,T extends MergeablePriorityQueueDouble<E,T>> - Interface in org.cicirello.ds

A MergeablePriorityQueueDouble is a PriorityQueueDouble that includes a merge method.

O

offer(int, double) - Method in class org.cicirello.ds.IntBinaryHeapDouble

Adds an (element, priority) pair to the IntPriorityQueueDouble with a specified priority, provided the element is not already in the IntPriorityQueueDouble.

offer(int, double) - Method in class org.cicirello.ds.IntFibonacciHeapDouble

Adds an (element, priority) pair to the IntPriorityQueueDouble with a specified priority, provided the element is not already in the IntPriorityQueueDouble.

offer(int, double) - Method in interface org.cicirello.ds.IntPriorityQueueDouble

Adds an (element, priority) pair to the IntPriorityQueueDouble with a specified priority, provided the element is not already in the IntPriorityQueueDouble.

offer(int, int) - Method in class org.cicirello.ds.IntBinaryHeap

Adds an (element, priority) pair to the IntPriorityQueue with a specified priority, provided the element is not already in the IntPriorityQueue.

offer(int, int) - Method in class org.cicirello.ds.IntFibonacciHeap

Adds an (element, priority) pair to the IntPriorityQueue with a specified priority, provided the element is not already in the IntPriorityQueue.

offer(int, int) - Method in interface org.cicirello.ds.IntPriorityQueue

Adds an (element, priority) pair to the IntPriorityQueue with a specified priority, provided the element is not already in the IntPriorityQueue.

offer(E, double) - Method in class org.cicirello.ds.BinaryHeapDouble

offer(E, double) - Method in class org.cicirello.ds.FibonacciHeapDouble

offer(E, double) - Method in interface org.cicirello.ds.PriorityQueueDouble

Adds an (element, priority) pair to the priority queue with a specified priority.

offer(E, double) - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

offer(E, double) - Method in class org.cicirello.ds.SimpleFibonacciHeapDouble

offer(E, int) - Method in class org.cicirello.ds.BinaryHeap

offer(E, int) - Method in class org.cicirello.ds.FibonacciHeap

offer(E, int) - Method in interface org.cicirello.ds.PriorityQueue

Adds an (element, priority) pair to the priority queue with a specified priority.

offer(E, int) - Method in class org.cicirello.ds.SimpleBinaryHeap

offer(E, int) - Method in class org.cicirello.ds.SimpleFibonacciHeap

offer(PriorityQueueNode.Double<E>) - Method in class org.cicirello.ds.BinaryHeapDouble

offer(PriorityQueueNode.Double<E>) - Method in class org.cicirello.ds.FibonacciHeapDouble

offer(PriorityQueueNode.Double<E>) - Method in interface org.cicirello.ds.PriorityQueueDouble

Adds an (element, priority) pair to the priority queue.

offer(PriorityQueueNode.Double<E>) - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

offer(PriorityQueueNode.Double<E>) - Method in class org.cicirello.ds.SimpleFibonacciHeapDouble

offer(PriorityQueueNode.Integer<E>) - Method in class org.cicirello.ds.BinaryHeap

offer(PriorityQueueNode.Integer<E>) - Method in class org.cicirello.ds.FibonacciHeap

offer(PriorityQueueNode.Integer<E>) - Method in interface org.cicirello.ds.PriorityQueue

Adds an (element, priority) pair to the priority queue.

offer(PriorityQueueNode.Integer<E>) - Method in class org.cicirello.ds.SimpleBinaryHeap

offer(PriorityQueueNode.Integer<E>) - Method in class org.cicirello.ds.SimpleFibonacciHeap

org.cicirello.core - module org.cicirello.core

org.cicirello.core - A Java library of utilities and data structures

org.cicirello.ds - package org.cicirello.ds

This package includes core data structures used by other of our libraries and projects.

org.cicirello.util - package org.cicirello.util

This package includes classes and interfaces that serve some useful utility purpose.

P

peek() - Method in class org.cicirello.ds.BinaryHeap

peek() - Method in class org.cicirello.ds.BinaryHeapDouble

peek() - Method in class org.cicirello.ds.FibonacciHeap

peek() - Method in class org.cicirello.ds.FibonacciHeapDouble

peek() - Method in class org.cicirello.ds.IntBinaryHeap

peek() - Method in class org.cicirello.ds.IntBinaryHeapDouble

peek() - Method in class org.cicirello.ds.IntFibonacciHeap

Gets the next element in priority order from this IntPriorityQueue, without removing it.

peek() - Method in class org.cicirello.ds.IntFibonacciHeapDouble

Gets the next element in priority order from this IntPriorityQueueDouble, without removing it.

peek() - Method in interface org.cicirello.ds.IntPriorityQueue

Gets the next element in priority order from this IntPriorityQueue, without removing it.

peek() - Method in interface org.cicirello.ds.IntPriorityQueueDouble

Gets the next element in priority order from this IntPriorityQueueDouble, without removing it.

peek() - Method in interface org.cicirello.ds.PriorityQueue

Gets the next (element, priority) pair in priority order from this priority queue, without removing it.

peek() - Method in interface org.cicirello.ds.PriorityQueueDouble

Gets the next (element, priority) pair in priority order from this priority queue, without removing it.

peek() - Method in class org.cicirello.ds.SimpleBinaryHeap

peek() - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

peek() - Method in class org.cicirello.ds.SimpleFibonacciHeap

peek() - Method in class org.cicirello.ds.SimpleFibonacciHeapDouble

peekElement() - Method in class org.cicirello.ds.BinaryHeap

peekElement() - Method in class org.cicirello.ds.BinaryHeapDouble

peekElement() - Method in class org.cicirello.ds.FibonacciHeap

peekElement() - Method in class org.cicirello.ds.FibonacciHeapDouble

peekElement() - Method in interface org.cicirello.ds.PriorityQueue

Gets the next element in priority order from this priority queue, without removing it.

peekElement() - Method in interface org.cicirello.ds.PriorityQueueDouble

Gets the next element in priority order from this priority queue, without removing it.

peekElement() - Method in class org.cicirello.ds.SimpleBinaryHeap

peekElement() - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

peekElement() - Method in class org.cicirello.ds.SimpleFibonacciHeap

peekElement() - Method in class org.cicirello.ds.SimpleFibonacciHeapDouble

peekPriority() - Method in class org.cicirello.ds.BinaryHeap

peekPriority() - Method in class org.cicirello.ds.BinaryHeapDouble

peekPriority() - Method in class org.cicirello.ds.FibonacciHeap

peekPriority() - Method in class org.cicirello.ds.FibonacciHeapDouble

peekPriority() - Method in class org.cicirello.ds.IntBinaryHeap

peekPriority() - Method in class org.cicirello.ds.IntBinaryHeapDouble

peekPriority() - Method in class org.cicirello.ds.IntFibonacciHeap

Gets the priority of the next element in priority order in the IntPriorityQueue.

peekPriority() - Method in class org.cicirello.ds.IntFibonacciHeapDouble

Gets the priority of the next element in priority order in the IntPriorityQueueDouble.

peekPriority() - Method in interface org.cicirello.ds.IntPriorityQueue

Gets the priority of the next element in priority order in the IntPriorityQueue.

peekPriority() - Method in interface org.cicirello.ds.IntPriorityQueueDouble

Gets the priority of the next element in priority order in the IntPriorityQueueDouble.

peekPriority() - Method in interface org.cicirello.ds.PriorityQueue

Gets the priority of the next element in priority order in the priority queue.

peekPriority() - Method in interface org.cicirello.ds.PriorityQueueDouble

Gets the priority of the next element in priority order in the priority queue.

peekPriority() - Method in class org.cicirello.ds.SimpleBinaryHeap

peekPriority() - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

peekPriority() - Method in class org.cicirello.ds.SimpleFibonacciHeap

peekPriority() - Method in class org.cicirello.ds.SimpleFibonacciHeapDouble

peekPriority(int) - Method in class org.cicirello.ds.IntBinaryHeap

Gets the current priority of a specified element in the IntPriorityQueue.

peekPriority(int) - Method in class org.cicirello.ds.IntBinaryHeapDouble

Gets the current priority of a specified element in the IntPriorityQueueDouble.

peekPriority(int) - Method in class org.cicirello.ds.IntFibonacciHeap

Gets the current priority of a specified element in the IntPriorityQueue.

peekPriority(int) - Method in class org.cicirello.ds.IntFibonacciHeapDouble

Gets the current priority of a specified element in the IntPriorityQueueDouble.

peekPriority(int) - Method in interface org.cicirello.ds.IntPriorityQueue

Gets the current priority of a specified element in the IntPriorityQueue.

peekPriority(int) - Method in interface org.cicirello.ds.IntPriorityQueueDouble

Gets the current priority of a specified element in the IntPriorityQueueDouble.

peekPriority(E) - Method in class org.cicirello.ds.BinaryHeap

peekPriority(E) - Method in class org.cicirello.ds.BinaryHeapDouble

peekPriority(E) - Method in class org.cicirello.ds.FibonacciHeap

peekPriority(E) - Method in class org.cicirello.ds.FibonacciHeapDouble

peekPriority(E) - Method in interface org.cicirello.ds.PriorityQueue

Gets the priority of a specified element if it is present in the priority queue.

peekPriority(E) - Method in interface org.cicirello.ds.PriorityQueueDouble

Gets the priority of a specified element if it is present in the priority queue.

peekPriority(E) - Method in class org.cicirello.ds.SimpleBinaryHeap

peekPriority(E) - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

peekPriority(E) - Method in class org.cicirello.ds.SimpleFibonacciHeap

peekPriority(E) - Method in class org.cicirello.ds.SimpleFibonacciHeapDouble

poll() - Method in class org.cicirello.ds.BinaryHeap

poll() - Method in class org.cicirello.ds.BinaryHeapDouble

poll() - Method in class org.cicirello.ds.FibonacciHeap

poll() - Method in class org.cicirello.ds.FibonacciHeapDouble

poll() - Method in class org.cicirello.ds.IntBinaryHeap

poll() - Method in class org.cicirello.ds.IntBinaryHeapDouble

poll() - Method in class org.cicirello.ds.IntFibonacciHeap

poll() - Method in class org.cicirello.ds.IntFibonacciHeapDouble

poll() - Method in interface org.cicirello.ds.IntPriorityQueue

Gets and removes the next element in priority order from this IntPriorityQueue.

poll() - Method in interface org.cicirello.ds.IntPriorityQueueDouble

Gets and removes the next element in priority order from this IntPriorityQueueDouble.

poll() - Method in interface org.cicirello.ds.PriorityQueue

Removes and returns the next (element, priority) pair in priority order from this priority queue.

poll() - Method in interface org.cicirello.ds.PriorityQueueDouble

Removes and returns the next (element, priority) pair in priority order from this priority queue.

poll() - Method in class org.cicirello.ds.SimpleBinaryHeap

poll() - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

poll() - Method in class org.cicirello.ds.SimpleFibonacciHeap

poll() - Method in class org.cicirello.ds.SimpleFibonacciHeapDouble

pollElement() - Method in class org.cicirello.ds.BinaryHeap

pollElement() - Method in class org.cicirello.ds.BinaryHeapDouble

pollElement() - Method in class org.cicirello.ds.FibonacciHeap

pollElement() - Method in class org.cicirello.ds.FibonacciHeapDouble

pollElement() - Method in interface org.cicirello.ds.PriorityQueue

Removes and returns the next element in priority order from this priority queue.

pollElement() - Method in interface org.cicirello.ds.PriorityQueueDouble

Removes and returns the next element in priority order from this priority queue.

pollElement() - Method in class org.cicirello.ds.SimpleBinaryHeap

pollElement() - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

pollElement() - Method in class org.cicirello.ds.SimpleFibonacciHeap

pollElement() - Method in class org.cicirello.ds.SimpleFibonacciHeapDouble

pollThenAdd(E, double) - Method in class org.cicirello.ds.BinaryHeapDouble

Removes and returns the next element in priority order from this priority queue, adding a new (element, priority) pair to the priority queue with a specified priority.

pollThenAdd(E, double) - Method in interface org.cicirello.ds.PriorityQueueDouble

Removes and returns the next element in priority order from this priority queue, adding a new (element, priority) pair to the priority queue with a specified priority.

pollThenAdd(E, double) - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

pollThenAdd(E, int) - Method in class org.cicirello.ds.BinaryHeap

Removes and returns the next element in priority order from this priority queue, adding a new (element, priority) pair to the priority queue with a specified priority.

pollThenAdd(E, int) - Method in interface org.cicirello.ds.PriorityQueue

Removes and returns the next element in priority order from this priority queue, adding a new (element, priority) pair to the priority queue with a specified priority.

pollThenAdd(E, int) - Method in class org.cicirello.ds.SimpleBinaryHeap

pollThenAdd(PriorityQueueNode.Double<E>) - Method in class org.cicirello.ds.BinaryHeapDouble

Removes and returns the next (element, priority) pair in priority order from this priority queue, adding a new (element, priority) pair prior to returning.

pollThenAdd(PriorityQueueNode.Double<E>) - Method in interface org.cicirello.ds.PriorityQueueDouble

Removes and returns the next (element, priority) pair in priority order from this priority queue, adding a new (element, priority) pair prior to returning.

pollThenAdd(PriorityQueueNode.Double<E>) - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

pollThenAdd(PriorityQueueNode.Integer<E>) - Method in class org.cicirello.ds.BinaryHeap

Removes and returns the next (element, priority) pair in priority order from this priority queue, adding a new (element, priority) pair prior to returning.

pollThenAdd(PriorityQueueNode.Integer<E>) - Method in interface org.cicirello.ds.PriorityQueue

Removes and returns the next (element, priority) pair in priority order from this priority queue, adding a new (element, priority) pair prior to returning.

pollThenAdd(PriorityQueueNode.Integer<E>) - Method in class org.cicirello.ds.SimpleBinaryHeap

PriorityQueue<E> - Interface in org.cicirello.ds

Interface common to the classes that provide implementations of a priority queue with int valued priorities.

PriorityQueueDouble<E> - Interface in org.cicirello.ds

Interface common to the classes that provide implementations of a priority queue with double valued priorities.

PriorityQueueNode<E> - Class in org.cicirello.ds

An instances of the nested subclasses of this class encapsulate an (element, priority) pair for use by the various priority queue classes of the library.

PriorityQueueNode.Double<E> - Class in org.cicirello.ds

An instance of this class encapsulates an (element, priority) pair for a double valued priority.

PriorityQueueNode.Integer<E> - Class in org.cicirello.ds

An instance of this class encapsulates an (element, priority) pair for an integer valued priority.

promote(int, double) - Method in class org.cicirello.ds.IntBinaryHeapDouble

Promotes an element relative to priority order if the element is present in the IntPriorityQueueDouble.

promote(int, double) - Method in class org.cicirello.ds.IntFibonacciHeapDouble

Promotes an element relative to priority order if the element is present in the IntPriorityQueueDouble.

promote(int, double) - Method in interface org.cicirello.ds.IntPriorityQueueDouble

Promotes an element relative to priority order if the element is present in the IntPriorityQueueDouble.

promote(int, int) - Method in class org.cicirello.ds.IntBinaryHeap

Promotes an element relative to priority order if the element is present in the IntPriorityQueue.

promote(int, int) - Method in class org.cicirello.ds.IntFibonacciHeap

Promotes an element relative to priority order if the element is present in the IntPriorityQueue.

promote(int, int) - Method in interface org.cicirello.ds.IntPriorityQueue

Promotes an element relative to priority order if the element is present in the IntPriorityQueue.

promote(E, double) - Method in class org.cicirello.ds.BinaryHeapDouble

promote(E, double) - Method in class org.cicirello.ds.FibonacciHeapDouble

promote(E, double) - Method in interface org.cicirello.ds.PriorityQueueDouble

Promotes an element relative to priority order if the element is present in the priority queue.

promote(E, double) - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

promote(E, double) - Method in class org.cicirello.ds.SimpleFibonacciHeapDouble

promote(E, int) - Method in class org.cicirello.ds.BinaryHeap

promote(E, int) - Method in class org.cicirello.ds.FibonacciHeap

promote(E, int) - Method in interface org.cicirello.ds.PriorityQueue

Promotes an element relative to priority order if the element is present in the priority queue.

promote(E, int) - Method in class org.cicirello.ds.SimpleBinaryHeap

promote(E, int) - Method in class org.cicirello.ds.SimpleFibonacciHeap

R

remove() - Method in interface org.cicirello.ds.PriorityQueue

Removes and returns the next (element, priority) pair in priority order from this priority queue.

remove() - Method in interface org.cicirello.ds.PriorityQueueDouble

Removes and returns the next (element, priority) pair in priority order from this priority queue.

remove(int) - Method in class org.cicirello.util.DoubleArray

Removes the element at a specified index.

remove(int) - Method in class org.cicirello.util.DoubleList

Removes the element at a specified index.

remove(int) - Method in class org.cicirello.util.IntegerArray

Removes the element at a specified index.

remove(int) - Method in class org.cicirello.util.IntegerList

Removes the element at a specified index.

remove(Object) - Method in class org.cicirello.ds.BinaryHeap

remove(Object) - Method in class org.cicirello.ds.BinaryHeapDouble

remove(Object) - Method in class org.cicirello.ds.FibonacciHeap

remove(Object) - Method in class org.cicirello.ds.FibonacciHeapDouble

remove(Object) - Method in interface org.cicirello.ds.PriorityQueue

Removes from this priority queue the (element, priority) pair, if present, for a specified element or element from a specified (element, priority) pair.

remove(Object) - Method in interface org.cicirello.ds.PriorityQueueDouble

Removes from this priority queue the (element, priority) pair, if present, for a specified element or element from a specified (element, priority) pair.

remove(Object) - Method in class org.cicirello.ds.SimpleBinaryHeap

remove(Object) - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

remove(Object) - Method in class org.cicirello.ds.SimpleFibonacciHeap

remove(Object) - Method in class org.cicirello.ds.SimpleFibonacciHeapDouble

removeAll(Collection<?>) - Method in class org.cicirello.ds.BinaryHeap

Removes from this priority queue all (element, priority) pairs such that a given Collection c either contains the element or contains an (element, priority) pair with the same element.

removeAll(Collection<?>) - Method in class org.cicirello.ds.BinaryHeapDouble

Removes from this priority queue all (element, priority) pairs such that a given Collection c either contains the element or contains an (element, priority) pair with the same element.

removeAll(Collection<?>) - Method in class org.cicirello.ds.FibonacciHeap

Removes from this priority queue all (element, priority) pairs such that a given Collection c either contains the element or contains an (element, priority) pair with the same element.

removeAll(Collection<?>) - Method in class org.cicirello.ds.FibonacciHeapDouble

Removes from this priority queue all (element, priority) pairs such that a given Collection c either contains the element or contains an (element, priority) pair with the same element.

removeAll(Collection<?>) - Method in interface org.cicirello.ds.PriorityQueue

Removes from this priority queue all (element, priority) pairs such that a given Collection c either contains the element or contains an (element, priority) pair with the same element.

removeAll(Collection<?>) - Method in interface org.cicirello.ds.PriorityQueueDouble

Removes from this priority queue all (element, priority) pairs such that a given Collection c either contains the element or contains an (element, priority) pair with the same element.

removeAll(Collection<?>) - Method in class org.cicirello.ds.SimpleBinaryHeap

Removes from this priority queue all (element, priority) pairs such that a given Collection c either contains the element or contains an (element, priority) pair with the same element.

removeAll(Collection<?>) - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

Removes from this priority queue all (element, priority) pairs such that a given Collection c either contains the element or contains an (element, priority) pair with the same element.

removeAll(Collection<?>) - Method in class org.cicirello.ds.SimpleFibonacciHeap

Removes from this priority queue all (element, priority) pairs such that a given Collection c either contains the element or contains an (element, priority) pair with the same element.

removeAll(Collection<?>) - Method in class org.cicirello.ds.SimpleFibonacciHeapDouble

Removes from this priority queue all (element, priority) pairs such that a given Collection c either contains the element or contains an (element, priority) pair with the same element.

removeElement() - Method in interface org.cicirello.ds.PriorityQueue

Removes and returns the next element in priority order from this priority queue.

removeElement() - Method in interface org.cicirello.ds.PriorityQueueDouble

Removes and returns the next element in priority order from this priority queue.

retainAll(Collection<?>) - Method in class org.cicirello.ds.BinaryHeap

Removes from this priority queue all (element, priority) pairs except for the elements or (element, priority) pairs contained in a given Collection c.

retainAll(Collection<?>) - Method in class org.cicirello.ds.BinaryHeapDouble

Removes from this priority queue all (element, priority) pairs except for the elements or (element, priority) pairs contained in a given Collection c.

retainAll(Collection<?>) - Method in class org.cicirello.ds.FibonacciHeap

Removes from this priority queue all (element, priority) pairs except for the elements or (element, priority) pairs contained in a given Collection c.

retainAll(Collection<?>) - Method in class org.cicirello.ds.FibonacciHeapDouble

Removes from this priority queue all (element, priority) pairs except for the elements or (element, priority) pairs contained in a given Collection c.

retainAll(Collection<?>) - Method in interface org.cicirello.ds.PriorityQueue

Removes from this priority queue all (element, priority) pairs except for the elements or (element, priority) pairs contained in a given Collection c.

retainAll(Collection<?>) - Method in interface org.cicirello.ds.PriorityQueueDouble

Removes from this priority queue all (element, priority) pairs except for the elements or (element, priority) pairs contained in a given Collection c.

retainAll(Collection<?>) - Method in class org.cicirello.ds.SimpleBinaryHeap

Removes from this priority queue all (element, priority) pairs except for the elements or (element, priority) pairs contained in a given Collection c.

retainAll(Collection<?>) - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

Removes from this priority queue all (element, priority) pairs except for the elements or (element, priority) pairs contained in a given Collection c.

retainAll(Collection<?>) - Method in class org.cicirello.ds.SimpleFibonacciHeap

Removes from this priority queue all (element, priority) pairs except for the elements or (element, priority) pairs contained in a given Collection c.

retainAll(Collection<?>) - Method in class org.cicirello.ds.SimpleFibonacciHeapDouble

Removes from this priority queue all (element, priority) pairs except for the elements or (element, priority) pairs contained in a given Collection c.

reverse(int[]) - Static method in class org.cicirello.util.ArrayFiller

Fills an existing array with integers: n-1, n-2, ..., 1, 0, where n is the length of the array

reverse(int[], int) - Static method in class org.cicirello.util.ArrayFiller

Fills an existing array with integers: x+n-1, x+n-2, ..., x+1, x, where n is the length of the array

S

sameSet(int, int) - Method in class org.cicirello.ds.DisjointIntegerSetForest

Checks whether or not two elements are in the same set.

sameSet(T, T) - Method in class org.cicirello.ds.DisjointSetForest

Checks whether or not two elements are in the same set.

set(int, double) - Method in class org.cicirello.util.DoubleArray

Sets an element at a specified index, replacing any value that is currently there.

set(int, double) - Method in class org.cicirello.util.DoubleList

Sets an element at a specified index, replacing any value that is currently there.

set(int, int) - Method in class org.cicirello.util.IntegerArray

Sets an element at a specified index, replacing any value that is currently there.

set(int, int) - Method in class org.cicirello.util.IntegerList

Sets an element at a specified index, replacing any value that is currently there.

SimpleBinaryHeap<E> - Class in org.cicirello.ds

An implementation of a Binary Heap.

SimpleBinaryHeapDouble<E> - Class in org.cicirello.ds

An implementation of a Binary Heap.

SimpleFibonacciHeap<E> - Class in org.cicirello.ds

An implementation of a Fibonacci Heap.

SimpleFibonacciHeapDouble<E> - Class in org.cicirello.ds

An implementation of a Fibonacci Heap.

size() - Method in class org.cicirello.ds.BinaryHeap

size() - Method in class org.cicirello.ds.BinaryHeapDouble

size() - Method in class org.cicirello.ds.DisjointIntegerSetForest

Gets the size of the DisjointIntegerSetForest in total number of elements.

size() - Method in class org.cicirello.ds.DisjointSetForest

Gets the size of the DisjointSetForest.

size() - Method in class org.cicirello.ds.FibonacciHeap

size() - Method in class org.cicirello.ds.FibonacciHeapDouble

size() - Method in class org.cicirello.ds.IntBinaryHeap

size() - Method in class org.cicirello.ds.IntBinaryHeapDouble

size() - Method in class org.cicirello.ds.IntFibonacciHeap

size() - Method in class org.cicirello.ds.IntFibonacciHeapDouble

size() - Method in interface org.cicirello.ds.IntPriorityQueue

Gets the current size of the IntPriorityQueue, which is the number of (element, priority) pairs that it contains.

size() - Method in interface org.cicirello.ds.IntPriorityQueueDouble

Gets the current size of the IntPriorityQueueDouble, which is the number of (element, priority) pairs that it contains.

size() - Method in interface org.cicirello.ds.PriorityQueue

Gets the current size of the priority queue, which is the number of (element, value) pairs that it contains.

size() - Method in interface org.cicirello.ds.PriorityQueueDouble

Gets the current size of the priority queue, which is the number of (element, value) pairs that it contains.

size() - Method in class org.cicirello.ds.SimpleBinaryHeap

size() - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

size() - Method in class org.cicirello.ds.SimpleFibonacciHeap

size() - Method in class org.cicirello.ds.SimpleFibonacciHeapDouble

size() - Method in class org.cicirello.util.DoubleArray

Gets the size of the array (i.e., the number of elements added via the DoubleArray.add(double) methods).

size() - Method in class org.cicirello.util.DoubleList

Gets the size of the list.

size() - Method in class org.cicirello.util.IntegerArray

Gets the size of the array (i.e., the number of elements added via the IntegerArray.add(int) methods).

size() - Method in class org.cicirello.util.IntegerList

Gets the size of the list.

sort() - Method in class org.cicirello.util.DoubleArray

Sorts the first size() elements of the array into ascending order.

sort() - Method in class org.cicirello.util.DoubleList

Sorts list into ascending order.

sort() - Method in class org.cicirello.util.IntegerArray

Sorts the first size() elements of the array into ascending order.

sort() - Method in class org.cicirello.util.IntegerList

Sorts list into ascending order.

sort(double[], int, int, int) - Static method in class org.cicirello.util.SortingNetwork

3-element sorting network.

sort(int[], int, int, int) - Static method in class org.cicirello.util.SortingNetwork

3-element sorting network.

SortingNetwork - Class in org.cicirello.util

Implements sorting networks for sorting small subsets of array elements.

T

toArray() - Method in class org.cicirello.ds.BinaryHeap

toArray() - Method in class org.cicirello.ds.BinaryHeapDouble

toArray() - Method in class org.cicirello.ds.FibonacciHeap

toArray() - Method in class org.cicirello.ds.FibonacciHeapDouble

toArray() - Method in interface org.cicirello.ds.PriorityQueue

Returns an array containing all of the (element, priority) pairs contained in the priority queue.

toArray() - Method in interface org.cicirello.ds.PriorityQueueDouble

Returns an array containing all of the (element, priority) pairs contained in the priority queue.

toArray() - Method in class org.cicirello.ds.SimpleBinaryHeap

toArray() - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

toArray() - Method in class org.cicirello.ds.SimpleFibonacciHeap

toArray() - Method in class org.cicirello.ds.SimpleFibonacciHeapDouble

toArray() - Method in class org.cicirello.util.DoubleList

Returns an array containing all of the element from the list.

toArray() - Method in class org.cicirello.util.IntegerList

Returns an array containing all of the element from the list.

toArray(T[]) - Method in class org.cicirello.ds.BinaryHeap

Returns an array containing all of the (element, priority) pairs contained in the priority queue.

toArray(T[]) - Method in class org.cicirello.ds.BinaryHeapDouble

Returns an array containing all of the (element, priority) pairs contained in the priority queue.

toArray(T[]) - Method in class org.cicirello.ds.FibonacciHeap

Returns an array containing all of the (element, priority) pairs contained in the priority queue.

toArray(T[]) - Method in class org.cicirello.ds.FibonacciHeapDouble

Returns an array containing all of the (element, priority) pairs contained in the priority queue.

toArray(T[]) - Method in interface org.cicirello.ds.PriorityQueue

Returns an array containing all of the (element, priority) pairs contained in the priority queue.

toArray(T[]) - Method in interface org.cicirello.ds.PriorityQueueDouble

Returns an array containing all of the (element, priority) pairs contained in the priority queue.

toArray(T[]) - Method in class org.cicirello.ds.SimpleBinaryHeap

Returns an array containing all of the (element, priority) pairs contained in the priority queue.

toArray(T[]) - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

Returns an array containing all of the (element, priority) pairs contained in the priority queue.

toArray(T[]) - Method in class org.cicirello.ds.SimpleFibonacciHeap

Returns an array containing all of the (element, priority) pairs contained in the priority queue.

toArray(T[]) - Method in class org.cicirello.ds.SimpleFibonacciHeapDouble

Returns an array containing all of the (element, priority) pairs contained in the priority queue.

toString() - Method in class org.cicirello.util.DoubleArray

Generate a String representation of the DoubleArray.

toString() - Method in class org.cicirello.util.DoubleList

Generate a String representation of the list.

toString() - Method in class org.cicirello.util.IntegerArray

Generate a String representation of the IntegerArray.

toString() - Method in class org.cicirello.util.IntegerList

Generate a String representation of the list.

trimToSize() - Method in class org.cicirello.ds.BinaryHeap

Decreases the capacity to the current size of the BinaryHeap, provided size is at least 1, and otherwise decreases capacity to 1.

trimToSize() - Method in class org.cicirello.ds.BinaryHeapDouble

Decreases the capacity to the current size of the BinaryHeapDouble, provided size is at least 1, and otherwise decreases capacity to 1.

trimToSize() - Method in class org.cicirello.ds.SimpleBinaryHeap

Decreases the capacity to the current size of the SimpleBinaryHeap, provided size is at least 1, and otherwise decreases capacity to 1.

trimToSize() - Method in class org.cicirello.ds.SimpleBinaryHeapDouble

Decreases the capacity to the current size of the SimpleBinaryHeapDouble, provided size is at least 1, and otherwise decreases capacity to 1.

trimToSize() - Method in class org.cicirello.util.DoubleList

Reduces the capacity of the list to the current value of size().

trimToSize() - Method in class org.cicirello.util.IntegerList

Reduces the capacity of the list to the current value of size().

U

union(int, int) - Method in class org.cicirello.ds.DisjointIntegerSetForest

Merges two sets into one, where the sets are chosen by specifying a representative member of each.

union(T, T) - Method in class org.cicirello.ds.DisjointSetForest

Merges two sets into one, where the sets are chosen by specifying a representative member of each.

A B C D E F G H I L M O P R S T U
All Classes and Interfaces|All Packages|Constant Field Values