Class HollowHeap<K,V>
- Type Parameters:
K
- the type of keys maintained by this heapV
- the type of values maintained by this heap
- All Implemented Interfaces:
Serializable
,AddressableHeap<K,
,V> MergeableAddressableHeap<K,
V>
Comparator
provided at heap
creation time, depending on which constructor is used.
This is the hollow heap described in detail in the following paper:
- TD Hansen, H Kaplan, RE Tarjan and U Zwick. Hollow heaps. ACM Transactions on Algorithms (TALG), 13(3), 42, 2017.
This implementation provides amortized O(1) time for operations that do not
involve deleting an element such as insert
, and decreaseKey
.
Operations deleteMin
and delete
are amortized O(log(n)). The
operation meld
is also amortized O(1).
All the above bounds, however, assume that the user does not perform cascading melds on heaps such as:
d.meld(e); c.meld(d); b.meld(c); a.meld(b);The above scenario, although efficiently supported by using union-find with path compression, invalidates the claimed bounds.
Note that the ordering maintained by this 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
AddressableHeap
interface. (See Comparable
or
Comparator
for a precise definition of consistent with
equals.) This is so because the AddressableHeap
interface is
defined in terms of the equals
operation, but this 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
this 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 AddressableHeap
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.
- See Also:
-
Nested Class Summary
Nested ClassesModifier and TypeClassDescription(package private) static class
(package private) static class
Nested classes/interfaces inherited from interface org.jheaps.AddressableHeap
AddressableHeap.Handle<K,
V> -
Field Summary
FieldsModifier and TypeFieldDescriptionprivate HollowHeap.HollowNode<K,
V>[] Auxiliary array for performing links.private static final int
Size of bucket array.private final Comparator<? super K>
The comparator used to maintain order in this heap, or null if it uses the natural ordering of its keys.private long
Number of nodes (hollow or not).private HollowHeap<K,
V> Used to reference the current heap or some other pairing heap in case of melding, so that handles remain valid even after a meld, without having to iterate over them.private HollowHeap.HollowNode<K,
V> The last node in the root listprivate static final long
private long
Size of the heap -
Constructor Summary
ConstructorsConstructorDescriptionConstructs a new, empty heap, using the natural ordering of its keys.HollowHeap
(Comparator<? super K> comparator) Constructs a new, empty heap, ordered according to the given comparator. -
Method Summary
Modifier and TypeMethodDescriptionvoid
clear()
Clear all the elements of the heap.Comparator<? super K>
Returns the comparator used to order the keys in this AddressableHeap, ornull
if this heap uses the natural ordering of its keys.private void
decreaseKey
(HollowHeap.Item<K, V> e, K newKey) Decrease the key of an item.private void
delete
(HollowHeap.Item<K, V> e) Delete an itemDelete and return an element with the minimum key.private int
private void
doUnrankedLinks
(int maxRank) findMin()
Find an element with the minimum key.Insert a new element into the heap with a null value.Insert a new element into the heap.boolean
isEmpty()
Returnstrue
if this heap is empty.private HollowHeap.HollowNode<K,
V> link
(HollowHeap.HollowNode<K, V> v, HollowHeap.HollowNode<K, V> w) void
meld
(MergeableAddressableHeap<K, V> other) Meld a heap into the current heap.long
size()
Returns the number of elements in the heap.
-
Field Details
-
serialVersionUID
private static final long serialVersionUID- See Also:
-
AUX_BUCKET_ARRAY_SIZE
private static final int AUX_BUCKET_ARRAY_SIZESize of bucket array. Based on maximum rank.- See Also:
-
comparator
The comparator used to maintain order in this heap, or null if it uses the natural ordering of its keys. -
root
The last node in the root list -
size
private long sizeSize of the heap -
nodes
private long nodesNumber of nodes (hollow or not). Useful for rebuilding. -
aux
Auxiliary array for performing links. -
other
Used to reference the current heap or some other pairing heap in case of melding, so that handles remain valid even after a meld, without having to iterate over them. In order to avoid maintaining a full-fledged union-find data structure, we disallow a heap to be used in melding more than once. We use however, path-compression in case of cascading melds, that it, a handle moves from one heap to another and then another.
-
-
Constructor Details
-
HollowHeap
public HollowHeap()Constructs a new, empty heap, using the natural ordering of its keys. All keys inserted into the heap must implement theComparable
interface. Furthermore, all such keys must be mutually comparable:k1.compareTo(k2)
must not throw aClassCastException
for any keysk1
andk2
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), theinsert(Object key)
call will throw aClassCastException
. -
HollowHeap
Constructs a new, empty heap, ordered according to the given comparator. All keys inserted into the heap must be mutually comparable by the given comparator:comparator.compare(k1, k2)
must not throw aClassCastException
for any keysk1
andk2
in the heap. If the user attempts to put a key into the heap that violates this constraint, theinsert(Object key)
call will throw aClassCastException
.- Parameters:
comparator
- the comparator that will be used to order this heap. Ifnull
, the natural ordering of the keys will be used.
-
-
Method Details
-
insert
Insert a new element into the heap.- Specified by:
insert
in interfaceAddressableHeap<K,
V> - Parameters:
key
- the element's keyvalue
- the element's value- Returns:
- a handle for the newly added element
- Throws:
IllegalStateException
- if the heap has already been used in the right hand side of a meld
-
insert
Insert a new element into the heap with a null value.- Specified by:
insert
in interfaceAddressableHeap<K,
V> - Parameters:
key
- the element's key- Returns:
- a handle for the newly added element
- Throws:
IllegalStateException
- if the heap has already been used in the right hand side of a meld
-
findMin
Find an element with the minimum key.- Specified by:
findMin
in interfaceAddressableHeap<K,
V> - Returns:
- a handle to an element with minimum key
-
deleteMin
Delete and return an element with the minimum key. If multiple such elements exists, only one of them will be deleted. After the element is deleted the handle is invalidated and only methodAddressableHeap.Handle.getKey()
andAddressableHeap.Handle.getValue()
can be used.- Specified by:
deleteMin
in interfaceAddressableHeap<K,
V> - Returns:
- a handle to the deleted element with minimum key
-
isEmpty
public boolean isEmpty()Returnstrue
if this heap is empty.- Specified by:
isEmpty
in interfaceAddressableHeap<K,
V> - Returns:
true
if this heap is empty,false
otherwise
-
size
public long size()Returns the number of elements in the heap.- Specified by:
size
in interfaceAddressableHeap<K,
V> - Returns:
- the number of elements in the heap
-
comparator
Returns the comparator used to order the keys in this AddressableHeap, ornull
if this heap uses the natural ordering of its keys.- Specified by:
comparator
in interfaceAddressableHeap<K,
V> - Returns:
- the comparator used to order the keys in this heap, or
null
if this addressable heap uses the natural ordering of its keys
-
clear
public void clear()Clear all the elements of the heap. After calling this method all handles should be considered invalidated and the behavior of methodsAddressableHeap.Handle.decreaseKey(Object)
andAddressableHeap.Handle.delete()
is undefined.- Specified by:
clear
in interfaceAddressableHeap<K,
V>
-
meld
Meld a heap into the current heap. After the operation theother
heap will be empty and will not permit further insertions.- Specified by:
meld
in interfaceMergeableAddressableHeap<K,
V> - Parameters:
other
- a merge-able heap
-
decreaseKey
Decrease the key of an item.- Parameters:
n
- the itemnewKey
- the new key
-
delete
Delete an item- Parameters:
e
- the item
-
doRankedLinks
-
doUnrankedLinks
private void doUnrankedLinks(int maxRank) -
link
-