Uses of Interface
choco.cp.solver.constraints.global.geost.dataStructures.Heapable

Packages that use Heapable
choco.cp.solver.constraints.global.geost.dataStructures   
 

Uses of Heapable in choco.cp.solver.constraints.global.geost.dataStructures
 

Classes in choco.cp.solver.constraints.global.geost.dataStructures that implement Heapable
 class HeapKey
           
 

Methods in choco.cp.solver.constraints.global.geost.dataStructures that return Heapable
 Heapable HeapDescending.extractMax()
          Removes the maximum (top) element from the Heap, decreases the size of the heap by one, and returns the maximum element.
 Heapable HeapAscending.extractMin()
          Removes the minimum (top) element from the Heap, decreases the size of the heap by one, and returns the minimum element.
 Heapable HeapDescending.getMax()
          Returns the maximum (top) element from the Heap
 Heapable HeapAscending.getMin()
          Returns the minimum (top) element from the Heap.
 Heapable HeapImpl.remove()
           
 Heapable HeapDescending.remove()
          Removes an element from the heap.
 Heapable HeapAscending.remove()
          Removes an element from the heap.
 Heapable Heap.remove()
          Removes the top key from the heap.
 

Methods in choco.cp.solver.constraints.global.geost.dataStructures with parameters of type Heapable
 void HeapImpl.insert(Heapable key)
           
 void HeapDescending.insert(Heapable key)
          Inserts key into the heap, and then upheaps that key to a position where the heap property is satisfied.
 void HeapAscending.insert(Heapable key)
          Inserts key into the heap, and then upheaps that key to a position where the heap property is satisfied.
 void Heap.insert(Heapable key)
          Inserts a key into the heap.
 

Constructors in choco.cp.solver.constraints.global.geost.dataStructures with parameters of type Heapable
Heap(Heapable[] anArray)
          Constructs the heap by copying an unordered array.
Heap(Heapable[] anArray, boolean descending)
          Constructs the heap by copying an unordered array.
HeapAscending(Heapable[] anArray)
          Constructs the heap in O(N) time, using a technique similar to bottom-up construction.
HeapDescending(Heapable[] anArray)
          Constructs the heap in O(N) time, using a technique similar to bottom-up construction.
 



Copyright © 2012. All Rights Reserved.