public class ListHeap<E extends java.lang.Comparable<E>> extends java.lang.Object implements Heap<E>
List
as the underlying
data structure. This heap allows values which are equals to be inserted. The heap will
return the top K values which have been added where K is specified by the size passed to
the constructor. K+1 values are not gaurenteed to be kept in the heap or returned in a
particular order.Constructor and Description |
---|
ListHeap(int sz)
Creates a new heap of the specified size.
|
ListHeap(int sz,
java.util.Comparator<E> c)
Creates a new heap with the specified size using the sorted based on the
specified comparator.
|
Modifier and Type | Method and Description |
---|---|
void |
add(E o)
Adds the specified object to the heap.
|
void |
clear()
Clears the contents of the heap.
|
E |
extract()
Removes the smallest element from the heap and returns it.
|
E |
first()
Returns the smallest element of the heap.
|
boolean |
isEmpty()
Returns whether the heap is empty.
|
java.util.Iterator<E> |
iterator()
Returns an iterator over the elements of the heap.
|
E |
last()
Returns the largest element of the heap.
|
static void |
main(java.lang.String[] args)
Deprecated.
|
int |
size()
Returns the size of the heap.
|
public ListHeap(int sz, java.util.Comparator<E> c)
sz
- The size of the heap.c
- The comparator to be used to sort heap elements.public ListHeap(int sz)
sz
- The size of the new heap.public int size()
Heap
public E extract()
Heap
public E first()
Heap
public E last()
Heap
public void add(E o)
Heap
public void clear()
Heap
public java.util.Iterator<E> iterator()
Heap
public boolean isEmpty()
Heap
@Deprecated public static void main(java.lang.String[] args)
Copyright © 2010 - 2020 Adobe. All Rights Reserved