N - First node parameterV - Second node parameterpublic abstract class ADyadRankedNodeQueue<N,V extends java.lang.Comparable<V>>
extends java.lang.Object
implements java.util.Queue<ai.libs.jaicore.search.model.travesaltree.Node<N,V>>
| Modifier and Type | Field and Description |
|---|---|
protected AbstractDyadScaler |
scaler
for scaling the dyads
|
| Constructor and Description |
|---|
ADyadRankedNodeQueue(ai.libs.jaicore.math.linearalgebra.Vector contextCharacterization)
Constructs a new DyadRankedNodeQueue that ranks the nodes in the queue
according to the given context characterization.
|
ADyadRankedNodeQueue(ai.libs.jaicore.math.linearalgebra.Vector contextCharacterization,
IDyadRanker dyadRanker,
AbstractDyadScaler scaler)
Constructs a new DyadRankedNodeQueue that ranks the nodes in the queue
according to the given context characterization and given dyad ranker.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(ai.libs.jaicore.search.model.travesaltree.Node<N,V> e) |
boolean |
addAll(java.util.Collection<? extends ai.libs.jaicore.search.model.travesaltree.Node<N,V>> c) |
protected abstract ai.libs.jaicore.math.linearalgebra.Vector |
characterize(ai.libs.jaicore.search.model.travesaltree.Node<N,V> node)
Provide a characterization of the given node to be used by the dyad ranker.
|
void |
clear() |
boolean |
contains(java.lang.Object o) |
boolean |
containsAll(java.util.Collection<?> c) |
ai.libs.jaicore.search.model.travesaltree.Node<N,V> |
element() |
IDyadRanker |
getDyadRanker()
Get the dyad ranker used to rank the nodes.
|
AbstractDyadScaler |
getScaler() |
boolean |
isEmpty() |
java.util.Iterator<ai.libs.jaicore.search.model.travesaltree.Node<N,V>> |
iterator() |
boolean |
offer(ai.libs.jaicore.search.model.travesaltree.Node<N,V> e) |
ai.libs.jaicore.search.model.travesaltree.Node<N,V> |
peek() |
ai.libs.jaicore.search.model.travesaltree.Node<N,V> |
poll() |
ai.libs.jaicore.search.model.travesaltree.Node<N,V> |
remove() |
boolean |
remove(java.lang.Object o) |
boolean |
removeAll(java.util.Collection<?> c) |
ai.libs.jaicore.search.model.travesaltree.Node<N,V> |
removeNodeAtPosition(int i) |
boolean |
retainAll(java.util.Collection<?> c) |
void |
setDyadRanker(IDyadRanker dyadRanker)
Set which dyad ranker shall be used to rank the nodes.
|
void |
setScaler(AbstractDyadScaler scaler) |
int |
size() |
java.lang.Object[] |
toArray() |
<T> T[] |
toArray(T[] a) |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitprotected AbstractDyadScaler scaler
public ADyadRankedNodeQueue(ai.libs.jaicore.math.linearalgebra.Vector contextCharacterization)
contextCharacterization - the characterization of the context the nodes are ranked inpublic ADyadRankedNodeQueue(ai.libs.jaicore.math.linearalgebra.Vector contextCharacterization,
IDyadRanker dyadRanker,
AbstractDyadScaler scaler)
contextCharacterization - the characterization of the context the nodes are ranked indyadRanker - the dyad ranker to be used for the ranking of the nodesprotected abstract ai.libs.jaicore.math.linearalgebra.Vector characterize(ai.libs.jaicore.search.model.travesaltree.Node<N,V> node)
node - the node to be characterizedpublic int size()
public boolean isEmpty()
public boolean contains(java.lang.Object o)
public java.lang.Object[] toArray()
public <T> T[] toArray(T[] a)
public boolean remove(java.lang.Object o)
public boolean containsAll(java.util.Collection<?> c)
public boolean addAll(java.util.Collection<? extends ai.libs.jaicore.search.model.travesaltree.Node<N,V>> c)
public boolean removeAll(java.util.Collection<?> c)
public boolean retainAll(java.util.Collection<?> c)
public void clear()
public ai.libs.jaicore.search.model.travesaltree.Node<N,V> removeNodeAtPosition(int i)
public IDyadRanker getDyadRanker()
public void setDyadRanker(IDyadRanker dyadRanker)
dyadRanker - the dyad rankerpublic AbstractDyadScaler getScaler()
public void setScaler(AbstractDyadScaler scaler)