|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.ints.IntSemiIndirectHeaps
A class providing static methods and objects that do useful things with semi-indirect heaps.
A semi-indirect heap is based on a reference array. Elements of a semi-indirect heap are integers that index the reference array (note that in an indirect heap you can also map elements of the reference array to heap positions).
Method Summary | |
static int |
downHeap(int[] refArray,
int[] heap,
int size,
int i,
IntComparator c)
Moves the given element down into the semi-indirect heap until it reaches the lowest possible position. |
static void |
makeHeap(int[] refArray,
int[] heap,
int size,
IntComparator c)
Creates a semi-indirect heap from a given index array. |
static void |
makeHeap(int[] refArray,
int offset,
int length,
int[] heap,
IntComparator c)
Creates a semi-indirect heap in the given array. |
static int[] |
makeHeap(int[] refArray,
int offset,
int length,
IntComparator c)
Creates a semi-indirect heap, allocating its heap array. |
static int |
upHeap(int[] refArray,
int[] heap,
int size,
int i,
IntComparator c)
Moves the given element up in the semi-indirect heap until it reaches the highest possible position. |
Methods inherited from class java.lang.Object |
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Method Detail |
public static int downHeap(int[] refArray, int[] heap, int size, int i, IntComparator c)
refArray
- the reference array.heap
- the semi-indirect heap (starting at 0).size
- the number of elements in the heap.i
- the index in the heap of the element to be moved down.c
- a type-specific comparator, or null
for the natural order.
i
.public static int upHeap(int[] refArray, int[] heap, int size, int i, IntComparator c)
refArray
- the reference array.heap
- the semi-indirect heap (starting at 0).size
- the number of elements in the heap.i
- the index in the heap of the element to be moved up.c
- a type-specific comparator, or null
for the natural order.
i
.public static void makeHeap(int[] refArray, int offset, int length, int[] heap, IntComparator c)
refArray
- the reference array.offset
- the first element of the reference array to be put in the heap.length
- the number of elements to be put in the heap.heap
- the array where the heap is to be created.c
- a type-specific comparator, or null
for the natural order.public static int[] makeHeap(int[] refArray, int offset, int length, IntComparator c)
refArray
- the reference array.offset
- the first element of the reference array to be put in the heap.length
- the number of elements to be put in the heap.c
- a type-specific comparator, or null
for the natural order.
public static void makeHeap(int[] refArray, int[] heap, int size, IntComparator c)
refArray
- the reference array.heap
- an array containing indices into refArray
.size
- the number of elements in the heap.c
- a type-specific comparator, or null
for the natural order.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |