TaskManager

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(t: PrioritisedTask): TaskManager

def ++(elems: Iterable[PrioritisedTask]): TaskManager

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def dequeueWhile(pred: (Task) ⇒ Boolean): (TaskManager, Seq[Task])

Dequeue as long as the given predicate is satisfied

def enqueue(elems: PrioritisedTask*): TaskManager

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def filter(p: (PrioritisedTask) ⇒ Boolean): TaskManager

Eliminate all prioritised tasks for which the given predicate is false.

def finalEagerTask: Boolean

final def getClass(): Class[_]

def hashCode(): Int

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

def max: Task

Returns the element with the smallest priority value in the queue, or throws an error if there is no element contained in the queue.

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def prioritisedTasks: Iterable[PrioritisedTask]

def removeFirst: TaskManager

Remove the first task from the queue.

final def synchronized[T0](arg0: ⇒ T0): T0

val taskAggregator: VectorTaskAggregator

def taskConstants: Set[ConstantTerm]

def taskSummary: TaskSummary

Computed information about the prioritised tasks (eager tasks are not considered at this point)

def taskSummaryFor(agg: TaskAggregator): TaskSummary

def toString(): String

def updateTasks(goal: Goal, stopUpdating: (Task) ⇒ Boolean): TaskManager

Update all PrioritisedTask stored by this managed, making use of possibly new facts and information from the goal.

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit