|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.bytes.ByteIndirectHeaps
public class ByteIndirectHeaps
A class providing static methods and objects that do useful things with indirect heaps.
An indirect heap is an extension of a semi-indirect heap using also an
inversion array of the same length as the reference array,
satisfying the relation heap[inv[i]]==i
when
inv[i]>=0
, and inv[heap[i]]==i
for all elements in the heap.
Method Summary | |
---|---|
static int |
downHeap(byte[] refArray,
int[] heap,
int[] inv,
int size,
int i,
ByteComparator c)
Moves the given element down into the indirect heap until it reaches the lowest possible position. |
static void |
makeHeap(byte[] refArray,
int[] heap,
int[] inv,
int size,
ByteComparator c)
Creates an indirect heap from a given index array. |
static void |
makeHeap(byte[] refArray,
int offset,
int length,
int[] heap,
int[] inv,
ByteComparator c)
Creates an indirect heap in the given array. |
static int |
upHeap(byte[] refArray,
int[] heap,
int[] inv,
int size,
int i,
ByteComparator c)
Moves the given element up in the 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(byte[] refArray, int[] heap, int[] inv, int size, int i, ByteComparator c)
refArray
- the reference array.heap
- the indirect heap (starting at 0).inv
- the inversion array.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(byte[] refArray, int[] heap, int[] inv, int size, int i, ByteComparator c)
refArray
- the reference array.heap
- the indirect heap (starting at 0).inv
- the inversion array.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(byte[] refArray, int offset, int length, int[] heap, int[] inv, ByteComparator 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.inv
- the inversion array.c
- a type-specific comparator, or null
for the natural order.public static void makeHeap(byte[] refArray, int[] heap, int[] inv, int size, ByteComparator c)
refArray
- the reference array.heap
- an array containing indices into refArray
.inv
- the inversion array.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 |