- INITIAL_CAPACITY - Static variable in class it.unimi.dsi.fastutil.ints.IntArrayFIFOQueue
-
The standard initial capacity of a queue.
- IntArrayFIFOQueue - Class in it.unimi.dsi.fastutil.ints
-
A type-specific array-based FIFO queue, supporting also deque operations.
- IntArrayFIFOQueue(int) - Constructor for class it.unimi.dsi.fastutil.ints.IntArrayFIFOQueue
-
Creates a new empty queue with given capacity.
- IntArrayFIFOQueue() - Constructor for class it.unimi.dsi.fastutil.ints.IntArrayFIFOQueue
-
- IntArrayIndirectPriorityQueue - Class in it.unimi.dsi.fastutil.ints
-
A type-specific array-based semi-indirect priority queue.
- IntArrayIndirectPriorityQueue(int[], int, IntComparator) - Constructor for class it.unimi.dsi.fastutil.ints.IntArrayIndirectPriorityQueue
-
Creates a new empty queue without elements with a given capacity and comparator.
- IntArrayIndirectPriorityQueue(int[], int) - Constructor for class it.unimi.dsi.fastutil.ints.IntArrayIndirectPriorityQueue
-
Creates a new empty queue with given capacity and using the natural order.
- IntArrayIndirectPriorityQueue(int[], IntComparator) - Constructor for class it.unimi.dsi.fastutil.ints.IntArrayIndirectPriorityQueue
-
Creates a new empty queue with capacity equal to the length of the reference array and a given comparator.
- IntArrayIndirectPriorityQueue(int[]) - Constructor for class it.unimi.dsi.fastutil.ints.IntArrayIndirectPriorityQueue
-
Creates a new empty queue with capacity equal to the length of the reference array and using the natural order.
- IntArrayIndirectPriorityQueue(int[], int[], int, IntComparator) - Constructor for class it.unimi.dsi.fastutil.ints.IntArrayIndirectPriorityQueue
-
Wraps a given array in a queue using a given comparator.
- IntArrayIndirectPriorityQueue(int[], int[], IntComparator) - Constructor for class it.unimi.dsi.fastutil.ints.IntArrayIndirectPriorityQueue
-
Wraps a given array in a queue using a given comparator.
- IntArrayIndirectPriorityQueue(int[], int[], int) - Constructor for class it.unimi.dsi.fastutil.ints.IntArrayIndirectPriorityQueue
-
Wraps a given array in a queue using the natural order.
- IntArrayIndirectPriorityQueue(int[], int[]) - Constructor for class it.unimi.dsi.fastutil.ints.IntArrayIndirectPriorityQueue
-
Wraps a given array in a queue using the natural order.
- IntArrayPriorityQueue - Class in it.unimi.dsi.fastutil.ints
-
A type-specific array-based priority queue.
- IntArrayPriorityQueue(int, IntComparator) - Constructor for class it.unimi.dsi.fastutil.ints.IntArrayPriorityQueue
-
Creates a new empty queue with a given capacity and comparator.
- IntArrayPriorityQueue(int) - Constructor for class it.unimi.dsi.fastutil.ints.IntArrayPriorityQueue
-
Creates a new empty queue with a given capacity and using the natural order.
- IntArrayPriorityQueue(IntComparator) - Constructor for class it.unimi.dsi.fastutil.ints.IntArrayPriorityQueue
-
Creates a new empty queue with a given comparator.
- IntArrayPriorityQueue() - Constructor for class it.unimi.dsi.fastutil.ints.IntArrayPriorityQueue
-
Creates a new empty queue using the natural order.
- IntArrayPriorityQueue(int[], int, IntComparator) - Constructor for class it.unimi.dsi.fastutil.ints.IntArrayPriorityQueue
-
Wraps a given array in a queue using a given comparator.
- IntArrayPriorityQueue(int[], IntComparator) - Constructor for class it.unimi.dsi.fastutil.ints.IntArrayPriorityQueue
-
Wraps a given array in a queue using a given comparator.
- IntArrayPriorityQueue(int[], int) - Constructor for class it.unimi.dsi.fastutil.ints.IntArrayPriorityQueue
-
Wraps a given array in a queue using the natural order.
- IntArrayPriorityQueue(int[]) - Constructor for class it.unimi.dsi.fastutil.ints.IntArrayPriorityQueue
-
Wraps a given array in a queue using the natural order.
- IntHeapIndirectPriorityQueue - Class in it.unimi.dsi.fastutil.ints
-
A type-specific heap-based indirect priority queue.
- IntHeapIndirectPriorityQueue(int[], int, IntComparator) - Constructor for class it.unimi.dsi.fastutil.ints.IntHeapIndirectPriorityQueue
-
Creates a new empty queue with a given capacity and comparator.
- IntHeapIndirectPriorityQueue(int[], int) - Constructor for class it.unimi.dsi.fastutil.ints.IntHeapIndirectPriorityQueue
-
Creates a new empty queue with a given capacity and using the natural order.
- IntHeapIndirectPriorityQueue(int[], IntComparator) - Constructor for class it.unimi.dsi.fastutil.ints.IntHeapIndirectPriorityQueue
-
Creates a new empty queue with capacity equal to the length of the reference array and a given comparator.
- IntHeapIndirectPriorityQueue(int[]) - Constructor for class it.unimi.dsi.fastutil.ints.IntHeapIndirectPriorityQueue
-
Creates a new empty queue with capacity equal to the length of the reference array and using the natural order.
- IntHeapIndirectPriorityQueue(int[], int[], int, IntComparator) - Constructor for class it.unimi.dsi.fastutil.ints.IntHeapIndirectPriorityQueue
-
Wraps a given array in a queue using a given comparator.
- IntHeapIndirectPriorityQueue(int[], int[], IntComparator) - Constructor for class it.unimi.dsi.fastutil.ints.IntHeapIndirectPriorityQueue
-
Wraps a given array in a queue using a given comparator.
- IntHeapIndirectPriorityQueue(int[], int[], int) - Constructor for class it.unimi.dsi.fastutil.ints.IntHeapIndirectPriorityQueue
-
Wraps a given array in a queue using the natural order.
- IntHeapIndirectPriorityQueue(int[], int[]) - Constructor for class it.unimi.dsi.fastutil.ints.IntHeapIndirectPriorityQueue
-
Wraps a given array in a queue using the natural order.
- IntHeapPriorityQueue - Class in it.unimi.dsi.fastutil.ints
-
A type-specific heap-based priority queue.
- IntHeapPriorityQueue(int, IntComparator) - Constructor for class it.unimi.dsi.fastutil.ints.IntHeapPriorityQueue
-
Creates a new empty queue with a given capacity and comparator.
- IntHeapPriorityQueue(int) - Constructor for class it.unimi.dsi.fastutil.ints.IntHeapPriorityQueue
-
Creates a new empty queue with a given capacity and using the natural order.
- IntHeapPriorityQueue(IntComparator) - Constructor for class it.unimi.dsi.fastutil.ints.IntHeapPriorityQueue
-
Creates a new empty queue with a given comparator.
- IntHeapPriorityQueue() - Constructor for class it.unimi.dsi.fastutil.ints.IntHeapPriorityQueue
-
Creates a new empty queue using the natural order.
- IntHeapPriorityQueue(int[], int, IntComparator) - Constructor for class it.unimi.dsi.fastutil.ints.IntHeapPriorityQueue
-
Wraps a given array in a queue using a given comparator.
- IntHeapPriorityQueue(int[], IntComparator) - Constructor for class it.unimi.dsi.fastutil.ints.IntHeapPriorityQueue
-
Wraps a given array in a queue using a given comparator.
- IntHeapPriorityQueue(int[], int) - Constructor for class it.unimi.dsi.fastutil.ints.IntHeapPriorityQueue
-
Wraps a given array in a queue using the natural order.
- IntHeapPriorityQueue(int[]) - Constructor for class it.unimi.dsi.fastutil.ints.IntHeapPriorityQueue
-
Wraps a given array in a queue using the natural order.
- IntHeapPriorityQueue(IntCollection, IntComparator) - Constructor for class it.unimi.dsi.fastutil.ints.IntHeapPriorityQueue
-
Creates a queue using the elements in a type-specific collection using a given comparator.
- IntHeapPriorityQueue(IntCollection) - Constructor for class it.unimi.dsi.fastutil.ints.IntHeapPriorityQueue
-
Creates a queue using the elements in a type-specific collection using the natural order.
- IntHeapPriorityQueue(Collection<? extends Integer>, IntComparator) - Constructor for class it.unimi.dsi.fastutil.ints.IntHeapPriorityQueue
-
Creates a queue using the elements in a collection using a given comparator.
- IntHeapPriorityQueue(Collection<? extends Integer>) - Constructor for class it.unimi.dsi.fastutil.ints.IntHeapPriorityQueue
-
Creates a queue using the elements in a collection using the natural order.
- IntHeaps - Class in it.unimi.dsi.fastutil.ints
-
A class providing static methods and objects that do useful things with heaps.
- IntHeapSemiIndirectPriorityQueue - Class in it.unimi.dsi.fastutil.ints
-
A type-specific heap-based semi-indirect priority queue.
- IntHeapSemiIndirectPriorityQueue(int[], int, IntComparator) - Constructor for class it.unimi.dsi.fastutil.ints.IntHeapSemiIndirectPriorityQueue
-
Creates a new empty queue without elements with a given capacity and comparator.
- IntHeapSemiIndirectPriorityQueue(int[], int) - Constructor for class it.unimi.dsi.fastutil.ints.IntHeapSemiIndirectPriorityQueue
-
Creates a new empty queue with given capacity and using the natural order.
- IntHeapSemiIndirectPriorityQueue(int[], IntComparator) - Constructor for class it.unimi.dsi.fastutil.ints.IntHeapSemiIndirectPriorityQueue
-
Creates a new empty queue with capacity equal to the length of the reference array and a given comparator.
- IntHeapSemiIndirectPriorityQueue(int[]) - Constructor for class it.unimi.dsi.fastutil.ints.IntHeapSemiIndirectPriorityQueue
-
Creates a new empty queue with capacity equal to the length of the reference array and using the natural order.
- IntHeapSemiIndirectPriorityQueue(int[], int[], int, IntComparator) - Constructor for class it.unimi.dsi.fastutil.ints.IntHeapSemiIndirectPriorityQueue
-
Wraps a given array in a queue using a given comparator.
- IntHeapSemiIndirectPriorityQueue(int[], int[], IntComparator) - Constructor for class it.unimi.dsi.fastutil.ints.IntHeapSemiIndirectPriorityQueue
-
Wraps a given array in a queue using a given comparator.
- IntHeapSemiIndirectPriorityQueue(int[], int[], int) - Constructor for class it.unimi.dsi.fastutil.ints.IntHeapSemiIndirectPriorityQueue
-
Wraps a given array in a queue using the natural order.
- IntHeapSemiIndirectPriorityQueue(int[], int[]) - Constructor for class it.unimi.dsi.fastutil.ints.IntHeapSemiIndirectPriorityQueue
-
Wraps a given array in a queue using the natural order.
- IntIndirectHeaps - Class in it.unimi.dsi.fastutil.ints
-
A class providing static methods and objects that do useful things with indirect heaps.
- IntIndirectPriorityQueue - Interface in it.unimi.dsi.fastutil.ints
-
A type-specific IndirectPriorityQueue.
- IntPriorityQueue - Interface in it.unimi.dsi.fastutil.ints
-
A type-specific PriorityQueue; provides some additional methods that use polymorphism to avoid (un)boxing.
- IntPriorityQueues - Class in it.unimi.dsi.fastutil.ints
-
A class providing static methods and objects that do useful things with type-specific priority queues.
- IntPriorityQueues.SynchronizedPriorityQueue - Class in it.unimi.dsi.fastutil.ints
-
A synchronized wrapper class for priority queues.
- IntSemiIndirectHeaps - Class in it.unimi.dsi.fastutil.ints
-
A class providing static methods and objects that do useful things with semi-indirect heaps.
- inv - Variable in class it.unimi.dsi.fastutil.ints.IntHeapIndirectPriorityQueue
-
The inversion array.
- isEmpty() - Method in class it.unimi.dsi.fastutil.ints.IntPriorityQueues.SynchronizedPriorityQueue
-
- it.unimi.dsi.fastutil.ints - package it.unimi.dsi.fastutil.ints
-