theory/it.unibo.tuprolog.collections/ClauseQueue

ClauseQueue

interface ClauseQueue : ClauseCollection

A ClauseCollection that preserves insertion order and exposes it through addFirst/addLast and FIFO/LIFO-ordered retrieval (getFifoOrdered/getLifoOrdered). This is the shape Theory uses to store its clauses, since Prolog's SLD resolution requires clauses to be tried in the order they were asserted; the ordering is what the isOrdered flag of the underlying it.unibo.tuprolog.collections.rete.custom.ReteTree controls.

Inheritors

MutableClauseQueue

Types

Companion

object Companion

Properties

directives

abstract val directives: Iterable<Directive>

Only the clauses in this collection that are Directives.

rules

abstract val rules: Iterable<Rule>

Only the clauses in this collection that are Rules.

size

abstract val size: Int

Computes the size of the ClauseCollection

unificator

abstract val unificator: Unificator

The Unificator used to match clauses against each other in this collection.

Functions

add

open override fun add(clause: Clause): ClauseQueue

Gives a freshly produced ClauseQueue including the given Clause and the content of this one. Analogous to addFirst

addAll

abstract override fun addAll(clauses: Iterable<Clause>): ClauseQueue

Gives a freshly produced ClauseQueue including all the given Clause and the content of this one

addFirst

abstract fun addFirst(clause: Clause): ClauseQueue

Gives a freshly produced ClauseQueue including the given Clause in the first position and the content of this one

addLast

abstract fun addLast(clause: Clause): ClauseQueue

Gives a freshly produced ClauseQueue including the given Clause in the last position and the content of this one

contains

abstract operator fun contains(element: Clause): Boolean

Tells if the ClauseCollection contains a clause unifying against the given element

containsAll

abstract fun containsAll(elements: Iterable<Clause>): Boolean

Tells if, for each of the given elements, the ClauseCollection contains a unifying clause

get

open operator fun get(clause: Clause): Sequence<Clause>

Produces a Sequence of the clauses that would unify over the given Clause. Analogous to getFifoOrdered

getFifoOrdered

abstract fun getFifoOrdered(clause: Clause): Sequence<Clause>

Produces a Sequence of the clauses that would unify over the given Clause, scanning from data structure from the first position to the last one

getLifoOrdered

abstract fun getLifoOrdered(clause: Clause): Sequence<Clause>

Produces a Sequence of the clauses that would unify over the given Clause, scanning from data structure from the last position to the first

isEmpty

abstract fun isEmpty(): Boolean

Tells if the ClauseCollection contains any Clause

isNonEmpty

abstract fun isNonEmpty(): Boolean

Tells if the ClauseCollection contains at least one Clause; the negation of isEmpty.

iterator

abstract operator override fun iterator(): Iterator<Clause>

Iterates over all the clauses in this collection, in an order that depends on the concrete implementation (e.g. insertion order for a ClauseQueue, unspecified for a ClauseMultiSet).

retrieve

open override fun retrieve(clause: Clause): RetrieveResult<out ClauseQueue>

Retrieve the first Clause unifying the given one. Analogous to retrieveFirst

retrieveAll

abstract override fun retrieveAll(clause: Clause): RetrieveResult<out ClauseQueue>

Retrieve all the Clause unifying the given one

retrieveFirst

abstract fun retrieveFirst(clause: Clause): RetrieveResult<out ClauseQueue>

Retrieve the first Clause unifying the given one, searching from the first position

ClauseQueue

See also

Inheritors

Types

Properties

Functions