Class/Object

TaskManager

Related Docs: object TaskManager | package goal

Permalink

class TaskManager extends AnyRef

An immutable class (priority queue) for handling a set of tasks in a proof goal. Currently, this is implemented using a sorted set, but it would be better to use a real immutable queue (leftist heap?).

TODO: So far, no real subsumption checks are performed

Linear Supertypes

AnyRef, Any

Ordering

Alphabetic
By Inheritance

Inherited

TaskManager
AnyRef
Any

Hide All
Show All

Visibility

Public
All

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
def +(t: PrioritisedTask): TaskManager
def ++(elems: Iterator[PrioritisedTask]): TaskManager
def ++(elems: Iterable[PrioritisedTask]): TaskManager
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
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

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def filter(p: (PrioritisedTask) ⇒ Boolean): TaskManager

Eliminate all prioritised tasks for which the given predicate is false.
def finalEagerTask: Boolean
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
def isEmpty: Boolean
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
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.
Returns the element with the smallest priority value in the queue, or throws an error if there is no element contained in the queue.
returns
the element with the smallest priority.
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def prioritisedTasks: Iterable[PrioritisedTask]
def removeFirst: TaskManager

Remove the first task from the queue.
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def taskInfos: TaskInfoCollector

Compute information about the prioritised tasks (eager tasks are not considered at this point)
def toString(): String

Definition Classes
TaskManager → AnyRef → Any
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.
Update all PrioritisedTask stored by this managed, making use of possibly new facts and information from the goal. The argument stopUpdating can be used to tell at which point the updating of tasks can be stopped, because some task or fact has been discovered that can be used right away.
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped