K - the type of keys maintained by this heappublic class BinaryArrayBulkInsertWeakHeap<K> extends BinaryArrayWeakHeap<K> implements Serializable
Comparator provided at heap creation time, depending on which
constructor is used.
The implementation uses an array in order to store the elements and
automatically maintains the size of the array much like a
Vector does, providing amortized O(1) time cost for the
insert and amortized O(log(n)) for the deleteMin operation.
Operation findMin, is a worst-case O(1) operation.
Constructing such a heap from an array of elements can be performed using the
method heapify(Object[]) or heapify(Object[], Comparator)
in linear time.
Note that the ordering maintained by a binary heap, like any heap, and
whether or not an explicit comparator is provided, must be consistent
with equals if this heap is to correctly implement the
Heap interface. (See Comparable or Comparator for a
precise definition of consistent with equals.) This is so because
the Heap interface is defined in terms of the equals
operation, but a binary heap performs all key comparisons using its
compareTo (or compare) method, so two keys that are deemed
equal by this method are, from the standpoint of the binary heap, equal. The
behavior of a heap is well-defined even if its ordering is
inconsistent with equals; it just fails to obey the general contract
of the Heap interface.
Note that this implementation is not synchronized. If multiple threads access a heap concurrently, and at least one of the threads modifies the heap structurally, it must be synchronized externally. (A structural modification is any operation that adds or deletes one or more elements or changing the key of some element.) This is typically accomplished by synchronizing on some object that naturally encapsulates the heap.
DEFAULT_HEAP_CAPACITY| Constructor and Description |
|---|
BinaryArrayBulkInsertWeakHeap()
Constructs a new, empty heap, using the natural ordering of its keys.
|
BinaryArrayBulkInsertWeakHeap(Comparator<? super K> comparator)
Constructs a new, empty heap, ordered according to the given comparator.
|
BinaryArrayBulkInsertWeakHeap(Comparator<? super K> comparator,
int capacity)
Constructs a new, empty heap, with a provided initial capacity ordered
according to the given comparator.
|
BinaryArrayBulkInsertWeakHeap(int capacity)
Constructs a new, empty heap, with a provided initial capacity using the
natural ordering of its keys.
|
| Modifier and Type | Method and Description |
|---|---|
void |
clear()
Clear all the elements of this heap.
|
Comparator<? super K> |
comparator()
Returns the comparator used to order the keys in this heap, or
null if this heap uses the natural
ordering of its keys. |
K |
deleteMin()
Delete and return an element with the minimum key.
|
K |
findMin()
Find an element with the minimum key.
|
static <K> BinaryArrayBulkInsertWeakHeap<K> |
heapify(K[] array)
Create a heap from an array of elements.
|
static <K> BinaryArrayBulkInsertWeakHeap<K> |
heapify(K[] array,
Comparator<? super K> comparator)
Create a heap from an array of elements.
|
void |
insert(K key)
Insert a key into the heap.
|
boolean |
isEmpty()
Returns
true if this heap is empty. |
long |
size()
Returns the number of elements in this heap.
|
public BinaryArrayBulkInsertWeakHeap()
All keys inserted into the heap must implement the Comparable
interface. Furthermore, all such keys must be mutually
comparable: k1.compareTo(k2) must not throw a
ClassCastException for any keys k1 and k2 in the
heap. If the user attempts to put a key into the heap that violates this
constraint (for example, the user attempts to put a string key into a
heap whose keys are integers), the insert(Object key) call will
throw a ClassCastException.
The initial capacity of the heap is
BinaryArrayWeakHeap.DEFAULT_HEAP_CAPACITY and adjusts
automatically based on the sequence of insertions and deletions.
public BinaryArrayBulkInsertWeakHeap(int capacity)
All keys inserted into the heap must implement the Comparable
interface. Furthermore, all such keys must be mutually
comparable: k1.compareTo(k2) must not throw a
ClassCastException for any keys k1 and k2 in the
heap. If the user attempts to put a key into the heap that violates this
constraint (for example, the user attempts to put a string key into a
heap whose keys are integers), the insert(Object key) call will
throw a ClassCastException.
The initial capacity of the heap is provided by the user and is adjusted automatically based on the sequence of insertions and deletions.
capacity - the initial heap capacitypublic BinaryArrayBulkInsertWeakHeap(Comparator<? super K> comparator)
All keys inserted into the heap must be mutually comparable by
the given comparator: comparator.compare(k1,
k2) must not throw a ClassCastException for any keys k1
and k2 in the heap. If the user attempts to put a key into the
heap that violates this constraint, the insert(Object key) call
will throw a ClassCastException.
The initial capacity of the heap is
BinaryArrayWeakHeap.DEFAULT_HEAP_CAPACITY and adjusts
automatically based on the sequence of insertions and deletions.
comparator - the comparator that will be used to order this heap. If
null, the natural ordering of
the keys will be used.public BinaryArrayBulkInsertWeakHeap(Comparator<? super K> comparator, int capacity)
All keys inserted into the heap must be mutually comparable by
the given comparator: comparator.compare(k1,
k2) must not throw a ClassCastException for any keys k1
and k2 in the heap. If the user attempts to put a key into the
heap that violates this constraint, the insert(Object key) call
will throw a ClassCastException.
The initial capacity of the heap is provided by the user and is adjusted automatically based on the sequence of insertions and deletions.
comparator - the comparator that will be used to order this heap. If
null, the natural ordering of
the keys will be used.capacity - the initial heap capacitypublic boolean isEmpty()
true if this heap is empty.public long size()
public void clear()
public K findMin()
public void insert(K key)
public K deleteMin()
public static <K> BinaryArrayBulkInsertWeakHeap<K> heapify(K[] array)
K - the type of keys maintained by the heaparray - an array of elementsIllegalArgumentException - in case the array is nullpublic static <K> BinaryArrayBulkInsertWeakHeap<K> heapify(K[] array, Comparator<? super K> comparator)
K - the type of keys maintained by the heaparray - an array of elementscomparator - the comparator to useIllegalArgumentException - in case the array is nullpublic Comparator<? super K> comparator()
null if this heap uses the natural
ordering of its keys.comparator in interface Heap<K>null if this heap uses the natural ordering of its keysCopyright © 2018. All rights reserved.