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

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.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.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.DoubleList: Inserts a new element into the list, growing the internal array if necessary.
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 PriorityQueueDouble with a specified priority, provided the element is not already in the PriorityQueueDouble.
add(E, int) - Method in interface org.cicirello.ds.PriorityQueue: Adds an (element, priority) pair to the PriorityQueue with a specified priority, provided the element is not already in the PriorityQueue.
add(PriorityQueueNode.Double<E>) - Method in interface org.cicirello.ds.PriorityQueueDouble: Adds an (element, priority) pair to the PriorityQueueDouble, provided the element is not already in the PriorityQueueDouble.
add(PriorityQueueNode.Integer<E>) - Method in interface org.cicirello.ds.PriorityQueue: Adds an (element, priority) pair to the PriorityQueue, provided the element is not already in the PriorityQueue.
addAll(Collection<? extends PriorityQueueNode.Double<E>>) - Method in interface org.cicirello.ds.PriorityQueueDouble: Adds all (element, priority) pairs from a Collection to the PriorityQueueDouble, provided the elements are not already in the PriorityQueueDouble.
addAll(Collection<? extends PriorityQueueNode.Integer<E>>) - Method in interface org.cicirello.ds.PriorityQueue: Adds all (element, priority) pairs from a Collection to the PriorityQueue, provided the elements are not already in the PriorityQueue.

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 PriorityQueueDouble, and otherwise adds the (element, priority) pair to the PriorityQueueDouble.
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 PriorityQueue, and otherwise adds the (element, priority) pair to the PriorityQueue.
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 PriorityQueue, removing all elements.
clear() - Method in interface org.cicirello.ds.PriorityQueueDouble: Clears the PriorityQueueDouble, removing all elements.
clear() - Method in class org.cicirello.util.DoubleList: Logically clears the list.
clear() - Method in class org.cicirello.util.IntegerList: Logically clears the list.
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.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 PriorityQueue 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 PriorityQueueDouble contains a given element or an (element, priority) pair with a given element.
contains(T) - Method in class org.cicirello.ds.DisjointSetForest: Checks if an element is in the disjoint set forest.
containsAll(Collection<?>) - Method in interface org.cicirello.ds.PriorityQueue: Checks if this PriorityQueue contains all elements or (element, priority) pairs from a given Collection.
containsAll(Collection<?>) - Method in interface org.cicirello.ds.PriorityQueueDouble: Checks if this PriorityQueueDouble 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 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.
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(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(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.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.
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(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(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.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.

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.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 PriorityQueueDouble.
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 PriorityQueue.
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.
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 PriorityQueue, without removing it.
element() - Method in interface org.cicirello.ds.PriorityQueueDouble: Gets the next (element, priority) pair in priority order from this PriorityQueueDouble, without removing it.
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.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 FibonacciHeap contains the same (element, priority) pairs as another FibonacciHeap, including the specific structure the FibonacciHeap, as well as that the priority order is the same.
equals(Object) - Method in class org.cicirello.ds.FibonacciHeapDouble: Checks if this FibonacciHeapDouble contains the same (element, priority) pairs as another FibonacciHeapDouble, including the specific structure the FibonacciHeapDouble, 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.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.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.
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.DoubleList: 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 for the BinaryHeapInteger.
hashCode() - Method in class org.cicirello.ds.FibonacciHeapDouble: Computes a hashCode for the BinaryHeapDouble.
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.util.DoubleList: Computes a hashCode for the list.
hashCode() - Method in class org.cicirello.util.IntegerList: Computes a hashCode for the list.

I

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.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.
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 PriorityQueue is empty.
isEmpty() - Method in interface org.cicirello.ds.PriorityQueueDouble: Checks if the PriorityQueueDouble is empty.
isEmpty() - Method in class org.cicirello.util.DoubleList: Checks if the list is 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).

L

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.IntegerList: Gets the index of the last occurrence of an element.

M

makeSet(T) - Method in class org.cicirello.ds.DisjointSetForest: Adds a new set to the disjoint set forest containing only the new element.

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 PriorityQueueDouble with a specified priority, provided the element is not already in the PriorityQueueDouble.
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 PriorityQueue with a specified priority, provided the element is not already in the PriorityQueue.
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 PriorityQueueDouble, provided the element is not already in the PriorityQueueDouble.
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 PriorityQueue, provided the element is not already in the PriorityQueue.
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 PriorityQueue, without removing it.
peek() - Method in interface org.cicirello.ds.PriorityQueueDouble: Gets the next (element, priority) pair in priority order from this PriorityQueueDouble, without removing it.
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 PriorityQueue, without removing it.
peekElement() - Method in interface org.cicirello.ds.PriorityQueueDouble: Gets the next element in priority order from this PriorityQueueDouble, without removing it.
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 PriorityQueue.
peekPriority() - Method in interface org.cicirello.ds.PriorityQueueDouble: Gets the priority of the next element in priority order in the PriorityQueueDouble.
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 PriorityQueue.
peekPriority(E) - Method in interface org.cicirello.ds.PriorityQueueDouble: Gets the priority of a specified element if it is present in the PriorityQueueDouble.
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 PriorityQueue.
poll() - Method in interface org.cicirello.ds.PriorityQueueDouble: Removes and returns the next (element, priority) pair in priority order from this PriorityQueueDouble.
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 PriorityQueue.
pollElement() - Method in interface org.cicirello.ds.PriorityQueueDouble: Removes and returns the next element in priority order from this PriorityQueueDouble.
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 PriorityQueueDouble.
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 PriorityQueue.

R

remove() - Method in interface org.cicirello.ds.PriorityQueue: Removes and returns the next (element, priority) pair in priority order from this PriorityQueue.
remove() - Method in interface org.cicirello.ds.PriorityQueueDouble: Removes and returns the next (element, priority) pair in priority order from this PriorityQueueDouble.
remove(int) - Method in class org.cicirello.util.DoubleList: 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 PriorityQueue 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 PriorityQueueDouble the (element, priority) pair, if present, for a specified element or element from a specified (element, priority) pair.
removeAll(Collection<?>) - Method in interface org.cicirello.ds.PriorityQueue: Removes from this PriorityQueue 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 PriorityQueueDouble 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 PriorityQueue.
removeElement() - Method in interface org.cicirello.ds.PriorityQueueDouble: Removes and returns the next element in priority order from this PriorityQueueDouble.
retainAll(Collection<?>) - Method in class org.cicirello.ds.BinaryHeap
retainAll(Collection<?>) - Method in class org.cicirello.ds.BinaryHeapDouble
retainAll(Collection<?>) - Method in class org.cicirello.ds.FibonacciHeap
retainAll(Collection<?>) - Method in class org.cicirello.ds.FibonacciHeapDouble
retainAll(Collection<?>) - Method in interface org.cicirello.ds.PriorityQueue: Removes from this PriorityQueue 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 PriorityQueueDouble all (element, priority) pairs except for the elements or (element, priority) pairs contained in a given Collection c.

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.DoubleList: 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.
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 PriorityQueue, 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 PriorityQueueDouble, which is the number of (element, value) pairs that it contains.
size() - Method in class org.cicirello.util.DoubleList: Gets the size of the list.
size() - Method in class org.cicirello.util.IntegerList: Gets the size of the list.

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 PriorityQueue.
toArray() - Method in interface org.cicirello.ds.PriorityQueueDouble: Returns an array containing all of the (element, priority) pairs contained in the PriorityQueueDouble.
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
toArray(T[]) - Method in class org.cicirello.ds.BinaryHeapDouble
toArray(T[]) - Method in class org.cicirello.ds.FibonacciHeap
toArray(T[]) - Method in class org.cicirello.ds.FibonacciHeapDouble
toArray(T[]) - Method in interface org.cicirello.ds.PriorityQueue: Returns an array containing all of the (element, priority) pairs contained in the PriorityQueue.
toArray(T[]) - Method in interface org.cicirello.ds.PriorityQueueDouble: Returns an array containing all of the (element, priority) pairs contained in the PriorityQueueDouble.
toString() - Method in class org.cicirello.util.DoubleList: Generate a String representation of the list.
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.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