Serialized Form (JHeaps)

Package org.jheaps.array
- Class org.jheaps.array.AbstractArrayAddressableHeap.ArrayHandle extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - key
```
Object key
```
    - value
```
Object value
```
    - index
```
int index
```
- Class org.jheaps.array.BinaryArrayAddressableHeap extends org.jheaps.array.AbstractArrayAddressableHeap<K,V> implements Serializable
  
  serialVersionUID:
  
  1L
- Class org.jheaps.array.BinaryArrayBulkInsertWeakHeap extends BinaryArrayWeakHeap<K> implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - insertionBuffer
```
Object[] insertionBuffer
```
      The insertion buffer
    - insertionBufferSize
```
int insertionBufferSize
```
      Number of elements in the insertion buffer
    - insertionBufferMinPos
```
int insertionBufferMinPos
```
      Position of minimum in the insertion buffer
- Class org.jheaps.array.BinaryArrayHeap extends org.jheaps.array.AbstractArrayHeap<K> implements Serializable
  
  serialVersionUID:
  
  1L
- Class org.jheaps.array.BinaryArrayIntegerValueHeap extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - array
```
org.jheaps.array.BinaryArrayIntegerValueHeap.Elem<V>[] array
```
      The array used for representing the heap.
    - size
```
int size
```
      Number of elements in the heap.
    - minCapacity
```
int minCapacity
```
      Minimum capacity due to initially requested capacity.
- Class org.jheaps.array.BinaryArrayWeakHeap extends org.jheaps.array.AbstractArrayWeakHeap<K> implements Serializable
  
  serialVersionUID:
  
  7721391024028836146L
  - Serialized Fields
    - reverse
```
BitSet reverse
```
      Reverse bits
- Class org.jheaps.array.DaryArrayAddressableHeap extends org.jheaps.array.AbstractArrayAddressableHeap<K,V> implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - d
```
int d
```
      Degree
- Class org.jheaps.array.DaryArrayHeap extends org.jheaps.array.AbstractArrayHeap<K> implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - d
```
int d
```
      Degree
- Class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap extends org.jheaps.array.AbstractArrayHeap<K> implements Serializable
  
  serialVersionUID:
  
  -8985374211686556917L
Package org.jheaps.monotone
- Class org.jheaps.monotone.AbstractRadixAddressableHeap.Node extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - key
```
Object key
```
    - value
```
Object value
```
    - next
```
org.jheaps.monotone.AbstractRadixAddressableHeap.Node next
```
    - prev
```
org.jheaps.monotone.AbstractRadixAddressableHeap.Node prev
```
    - bucket
```
int bucket
```
- Class org.jheaps.monotone.BigIntegerRadixAddressableHeap extends org.jheaps.monotone.AbstractRadixAddressableHeap<BigInteger,V> implements Serializable
  
  serialVersionUID:
  
  1L
- Class org.jheaps.monotone.BigIntegerRadixHeap extends org.jheaps.monotone.AbstractRadixHeap<BigInteger> implements Serializable
  
  serialVersionUID:
  
  1L
- Class org.jheaps.monotone.DoubleRadixAddressableHeap extends org.jheaps.monotone.AbstractRadixAddressableHeap<Double,V> implements Serializable
  
  serialVersionUID:
  
  1L
- Class org.jheaps.monotone.DoubleRadixHeap extends org.jheaps.monotone.AbstractRadixHeap<Double> implements Serializable
  
  serialVersionUID:
  
  1L
- Class org.jheaps.monotone.IntegerRadixAddressableHeap extends org.jheaps.monotone.AbstractRadixAddressableHeap<Integer,V> implements Serializable
  
  serialVersionUID:
  
  1L
- Class org.jheaps.monotone.IntegerRadixHeap extends org.jheaps.monotone.AbstractRadixHeap<Integer> implements Serializable
  
  serialVersionUID:
  
  1L
- Class org.jheaps.monotone.LongRadixAddressableHeap extends org.jheaps.monotone.AbstractRadixAddressableHeap<Long,V> implements Serializable
  
  serialVersionUID:
  
  1L
- Class org.jheaps.monotone.LongRadixHeap extends org.jheaps.monotone.AbstractRadixHeap<Long> implements Serializable
  
  serialVersionUID:
  
  1L
Package org.jheaps.tree
- Class org.jheaps.tree.BinaryTreeAddressableHeap extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - comparator
```
Comparator<T> comparator
```
      The comparator used to maintain order in this heap, or null if it uses the natural ordering of its keys.
    - size
```
long size
```
      Size of the heap
    - root
```
org.jheaps.tree.BinaryTreeAddressableHeap.Node root
```
      Root node of the heap
- Class org.jheaps.tree.BinaryTreeSoftAddressableHeap extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - comparator
```
Comparator<T> comparator
```
      The comparator used to maintain order in this heap, or null if it uses the natural ordering of its keys.
    - rankLimit
```
int rankLimit
```
      Tree nodes with less or equal than this rank will have no corrupted keys.
    - rootList
```
org.jheaps.tree.BinaryTreeSoftAddressableHeap.RootList<K,V> rootList
```
      The root list, in non-decreasing rank order.
    - size
```
long size
```
      Size of the heap.
    - other
```
BinaryTreeSoftAddressableHeap<K,V> other
```
      Used to reference the current heap or some other 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.
- Class org.jheaps.tree.BinaryTreeSoftHeap extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - comparator
```
Comparator<T> comparator
```
      The comparator used to maintain order in this heap, or null if it uses the natural ordering of its keys.
    - rankLimit
```
int rankLimit
```
      Tree nodes with less or equal than this rank will have no corrupted keys.
    - rootList
```
org.jheaps.tree.BinaryTreeSoftHeap.RootList<K> rootList
```
      The root list, in non-decreasing rank order.
    - size
```
long size
```
      Size of the heap.
- Class org.jheaps.tree.CostlessMeldPairingHeap extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - comparator
```
Comparator<T> comparator
```
      The comparator used to maintain order in this heap, or null if it uses the natural ordering of its keys.
    - root
```
org.jheaps.tree.CostlessMeldPairingHeap.Node<K,V> root
```
      The root of the pairing heap
    - size
```
long size
```
      Size of the pairing heap
    - decreasePool
```
org.jheaps.tree.CostlessMeldPairingHeap.Node<K,V>[] decreasePool
```
      The decrease pool
    - decreasePoolSize
```
byte decreasePoolSize
```
      How many elements are valid in the decrease pool
    - decreasePoolMinPos
```
byte decreasePoolMinPos
```
      Index of node with minimum key in the decrease pool. Not existent if decreasePoolMin >= decreasePoolSize.
    - other
```
CostlessMeldPairingHeap<K,V> 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.
- Class org.jheaps.tree.FibonacciHeap extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - comparator
```
Comparator<T> comparator
```
      The comparator used to maintain order in this heap, or null if it uses the natural ordering of its keys.
    - minRoot
```
org.jheaps.tree.FibonacciHeap.Node<K,V> minRoot
```
      The root with the minimum key
    - roots
```
int roots
```
      Number of roots in the root list
    - size
```
long size
```
      Size of the heap
    - aux
```
org.jheaps.tree.FibonacciHeap.Node<K,V>[] aux
```
      Auxiliary array for consolidation
    - other
```
FibonacciHeap<K,V> other
```
      Used to reference the current heap or some other 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.
- Class org.jheaps.tree.LeftistHeap extends SkewHeap<K,V> implements Serializable
  
  serialVersionUID:
  
  -5948402731186806608L
- Class org.jheaps.tree.PairingHeap extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - comparator
```
Comparator<T> comparator
```
      The comparator used to maintain order in this heap, or null if it uses the natural ordering of its keys.
    - root
```
org.jheaps.tree.PairingHeap.Node<K,V> root
```
      The root of the pairing heap
    - size
```
long size
```
      Size of the pairing heap
    - other
```
PairingHeap<K,V> 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.
- Class org.jheaps.tree.ReflectedFibonacciHeap extends ReflectedHeap<K,V> implements Serializable
  
  serialVersionUID:
  
  651281438828109106L
- Class org.jheaps.tree.ReflectedHeap extends Object implements Serializable
  
  serialVersionUID:
  
  -5428954082047233961L
  - Serialized Fields
    - comparator
```
Comparator<T> comparator
```
      The comparator used to maintain order in this heap, or null if it uses the natural ordering of its keys.
    - minHeap
```
AddressableHeap<K,V> minHeap
```
      A minimum heap
    - maxHeap
```
AddressableHeap<K,V> maxHeap
```
      A maximum heap
    - free
```
org.jheaps.tree.ReflectedHeap.ReflectedHandle<K,V> free
```
      A free element in case the size is odd
    - size
```
long size
```
      Size of the heap
    - other
```
ReflectedHeap<K,V> other
```
      Used to reference the current heap or some other 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.
- Class org.jheaps.tree.ReflectedPairingHeap extends ReflectedHeap<K,V> implements Serializable
  
  serialVersionUID:
  
  651281438828109106L
- Class org.jheaps.tree.SimpleFibonacciHeap extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - comparator
```
Comparator<T> comparator
```
      The comparator used to maintain order in this heap, or null if it uses the natural ordering of its keys.
    - root
```
org.jheaps.tree.SimpleFibonacciHeap.Node<K,V> root
```
      The root
    - size
```
long size
```
      Size of the heap
    - aux
```
org.jheaps.tree.SimpleFibonacciHeap.Node<K,V>[] aux
```
      Auxiliary array for consolidation
    - other
```
SimpleFibonacciHeap<K,V> other
```
      Used to reference the current heap or some other 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.
- Class org.jheaps.tree.SkewHeap extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - comparator
```
Comparator<T> comparator
```
      The comparator used to maintain order in this heap, or null if it uses the natural ordering of its keys.
    - size
```
long size
```
      Size of the heap
    - root
```
org.jheaps.tree.SkewHeap.Node<K,V> root
```
      Root node of the heap
    - other
```
SkewHeap<K,V> other
```
      Used to reference the current heap or some other 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.

Serialized Form

Package org.jheaps.array

Class org.jheaps.array.AbstractArrayAddressableHeap.ArrayHandle extends Object implements Serializable

Serialized Fields

key

value

index

Class org.jheaps.array.BinaryArrayAddressableHeap extends org.jheaps.array.AbstractArrayAddressableHeap<K,V> implements Serializable

Class org.jheaps.array.BinaryArrayBulkInsertWeakHeap extends BinaryArrayWeakHeap<K> implements Serializable

Serialized Fields

insertionBuffer

insertionBufferSize

insertionBufferMinPos

Class org.jheaps.array.BinaryArrayHeap extends org.jheaps.array.AbstractArrayHeap<K> implements Serializable

Class org.jheaps.array.BinaryArrayIntegerValueHeap extends Object implements Serializable

Serialized Fields

array

size

minCapacity

Class org.jheaps.array.BinaryArrayWeakHeap extends org.jheaps.array.AbstractArrayWeakHeap<K> implements Serializable

Serialized Fields

reverse

Class org.jheaps.array.DaryArrayAddressableHeap extends org.jheaps.array.AbstractArrayAddressableHeap<K,V> implements Serializable

Serialized Fields

d

Class org.jheaps.array.DaryArrayHeap extends org.jheaps.array.AbstractArrayHeap<K> implements Serializable

Serialized Fields

d

Class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap extends org.jheaps.array.AbstractArrayHeap<K> implements Serializable

Package org.jheaps.monotone

Class org.jheaps.monotone.AbstractRadixAddressableHeap.Node extends Object implements Serializable

Serialized Fields

key

value

next

prev

bucket

Class org.jheaps.monotone.BigIntegerRadixAddressableHeap extends org.jheaps.monotone.AbstractRadixAddressableHeap<BigInteger,V> implements Serializable

Class org.jheaps.monotone.BigIntegerRadixHeap extends org.jheaps.monotone.AbstractRadixHeap<BigInteger> implements Serializable

Class org.jheaps.monotone.DoubleRadixAddressableHeap extends org.jheaps.monotone.AbstractRadixAddressableHeap<Double,V> implements Serializable

Class org.jheaps.monotone.DoubleRadixHeap extends org.jheaps.monotone.AbstractRadixHeap<Double> implements Serializable

Class org.jheaps.monotone.IntegerRadixAddressableHeap extends org.jheaps.monotone.AbstractRadixAddressableHeap<Integer,V> implements Serializable

Class org.jheaps.monotone.IntegerRadixHeap extends org.jheaps.monotone.AbstractRadixHeap<Integer> implements Serializable

Class org.jheaps.monotone.LongRadixAddressableHeap extends org.jheaps.monotone.AbstractRadixAddressableHeap<Long,V> implements Serializable

Class org.jheaps.monotone.LongRadixHeap extends org.jheaps.monotone.AbstractRadixHeap<Long> implements Serializable

Package org.jheaps.tree

Class org.jheaps.tree.BinaryTreeAddressableHeap extends Object implements Serializable

Serialized Fields

comparator

size

root

Class org.jheaps.tree.BinaryTreeSoftAddressableHeap extends Object implements Serializable

Serialized Fields

comparator

rankLimit

rootList

size

other

Class org.jheaps.tree.BinaryTreeSoftHeap extends Object implements Serializable

Serialized Fields

comparator

rankLimit

rootList

size

Class org.jheaps.tree.CostlessMeldPairingHeap extends Object implements Serializable

Serialized Fields

comparator

root

size

decreasePool

decreasePoolSize

decreasePoolMinPos

other

Class org.jheaps.tree.FibonacciHeap extends Object implements Serializable

Serialized Fields

comparator

minRoot

roots

size

aux