org.mindswap.pellet.tableau.completion.queue

Class OptimizedBasicCompletionQueue

java.lang.Object

org.mindswap.pellet.IndividualIterator

org.mindswap.pellet.tableau.completion.queue.CompletionQueue

org.mindswap.pellet.tableau.completion.queue.OptimizedBasicCompletionQueue

All Implemented Interfaces:

Iterator<Individual>

public class OptimizedBasicCompletionQueue
extends CompletionQueue

An optimized basic queue for individuals that need to have completion rules applied

Field Summary

Fields

Modifier and Type	Field and Description
protected boolean	backtracked Flag set for when the kb is restored - in this case we do not want to flush the queue immediatly
protected int[]	current List of current index pointer for each queue
protected int[]	cutOff List of current index pointer for the stopping point at each queue
protected int[]	end List of current index pointer for each queue
protected Set<aterm.ATermAppl>[]	newQueue Set to track duplicates for new elements list for queue
protected List<aterm.ATermAppl>[]	newQueueList List to hold new elements for the queue
protected List<aterm.ATermAppl>[]	queue The queue - array - each entry is an arraylist for a particular rule type

Fields inherited from class org.mindswap.pellet.tableau.completion.queue.CompletionQueue

closed, currentType, log

Fields inherited from class org.mindswap.pellet.IndividualIterator

abox, index, nodeList, stop

Constructor Summary

Constructors

Constructor and Description
OptimizedBasicCompletionQueue(ABox abox) Constructor - create queue

Method Summary

Methods

Modifier and Type	Method and Description
void	add(QueueElement x) Add an element to all queues
void	add(QueueElement x, NodeSelector s) Add an element to the queue
void	clearQueue(NodeSelector s) Clear the queue
OptimizedBasicCompletionQueue	copy() Copy the queue
protected void	findNext(int type) Find the next individual in a given queue
void	flushQueue() Flush the queue
protected void	flushQueue(NodeSelector s) Flush the queue
boolean	hasNext() Test if there is another element on the queue to process
void	incrementBranch(int branch) Set branch pointers to current pointer.
Individual	next() Get the next element of a queue of a given type
Node	nextLiteral() Get the next element of a queue of a given type
void	print() Print method for entire queue
void	print(int type) Print method for a given queue type
void	remove() Remove method for abstract class
void	reset(NodeSelector s) Reset the cutoff for a given type index
void	restore(int branch) Reset the queue to be the current nodes in the abox; Also reset the type index to 0
void	setABox(ABox ab) Set the abox for the queue

Methods inherited from class org.mindswap.pellet.tableau.completion.queue.CompletionQueue

allowLiterals, getNextLabel, printBranchInfo, setAllowLiterals, setClosed

Methods inherited from class org.mindswap.pellet.IndividualIterator

findNext

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

queue

protected List<aterm.ATermAppl>[] queue

The queue - array - each entry is an arraylist for a particular rule type

newQueue

protected Set<aterm.ATermAppl>[] newQueue

Set to track duplicates for new elements list for queue

newQueueList

protected List<aterm.ATermAppl>[] newQueueList

List to hold new elements for the queue

current

protected int[] current

List of current index pointer for each queue

end

protected int[] end

List of current index pointer for each queue

cutOff

protected int[] cutOff

List of current index pointer for the stopping point at each queue

backtracked

protected boolean backtracked

Flag set for when the kb is restored - in this case we do not want to flush the queue immediatly

Constructor Detail

OptimizedBasicCompletionQueue

public OptimizedBasicCompletionQueue(ABox abox)

Constructor - create queue

Parameters:

abox -

Method Detail

findNext

protected void findNext(int type)

Find the next individual in a given queue

Specified by:

findNext in class CompletionQueue

Parameters:

type -

hasNext

public boolean hasNext()

Test if there is another element on the queue to process

Specified by:

hasNext in interface Iterator<Individual>

Overrides:

hasNext in class IndividualIterator

Parameters:

type -

Returns:

restore

public void restore(int branch)

Reset the queue to be the current nodes in the abox; Also reset the type index to 0

Specified by:

restore in class CompletionQueue

Parameters:

branch -

next

public Individual next()

Get the next element of a queue of a given type

Specified by:

next in interface Iterator<Individual>

Overrides:

next in class IndividualIterator

Parameters:

type -

Returns:

nextLiteral

public Node nextLiteral()

Get the next element of a queue of a given type

Specified by:

nextLiteral in class CompletionQueue

Parameters:

type -

Returns:

add

public void add(QueueElement x,
       NodeSelector s)

Description copied from class: CompletionQueue

Add an element to the queue

Specified by:

add in class CompletionQueue

add

public void add(QueueElement x)

Description copied from class: CompletionQueue

Add an element to all queues

Specified by:

add in class CompletionQueue

reset

public void reset(NodeSelector s)

Reset the cutoff for a given type index

Specified by:

reset in class CompletionQueue

Parameters:

type -

incrementBranch

public void incrementBranch(int branch)

Set branch pointers to current pointer. This is done whenever abox.incrementBranch is called

Specified by:

incrementBranch in class CompletionQueue

Parameters:

branch -

copy

public OptimizedBasicCompletionQueue copy()

Copy the queue

Specified by:

copy in class CompletionQueue

Returns:

setABox

public void setABox(ABox ab)

Set the abox for the queue

Overrides:

setABox in class CompletionQueue

Parameters:

ab -

print

public void print(int type)

Print method for a given queue type

Specified by:

print in class CompletionQueue

Parameters:

type -

print

public void print()

Print method for entire queue

Specified by:

print in class CompletionQueue

remove

public void remove()

Remove method for abstract class

Specified by:

remove in interface Iterator<Individual>

Overrides:

remove in class IndividualIterator

flushQueue

public void flushQueue()

Description copied from class: CompletionQueue

Flush the queue

Specified by:

flushQueue in class CompletionQueue

flushQueue

protected void flushQueue(NodeSelector s)

Description copied from class: CompletionQueue

Flush the queue

Specified by:

flushQueue in class CompletionQueue

clearQueue

public void clearQueue(NodeSelector s)

Description copied from class: CompletionQueue

Clear the queue

Specified by:

clearQueue in class CompletionQueue