ai.libs.jaicore.search.algorithms.standard.uncertainty.paretosearch

Class ParetoSelection<T,V extends java.lang.Comparable<V>>

java.lang.Object

ai.libs.jaicore.search.algorithms.standard.uncertainty.paretosearch.ParetoSelection<T,V>

Type Parameters:

T - internal label of node

V - external label of node

All Implemented Interfaces:

java.lang.Iterable<Node<T,V>>, java.util.Collection<Node<T,V>>, java.util.Queue<Node<T,V>>

public class ParetoSelection<T,V extends java.lang.Comparable<V>>
extends java.lang.Object
implements java.util.Queue<Node<T,V>>

Open collection pareto front implementation.

Constructor Summary

Constructors

Constructor and Description
ParetoSelection(java.util.Queue<Node<T,V>> pareto) Constructor.

Method Summary

Modifier and Type	Method and Description
boolean	add(Node<T,V> n) Adds a node to the open list and, if its not dominated by any other point also to the pareto front.
boolean	addAll(java.util.Collection<? extends Node<T,V>> c)
void	clear()
boolean	contains(java.lang.Object o)
boolean	containsAll(java.util.Collection<?> c)
Node<T,V>	element()
boolean	isEmpty()
java.util.Iterator<Node<T,V>>	iterator()
boolean	offer(Node<T,V> arg0)
Node<T,V>	peek() Return a node from pareto front.
Node<T,V>	poll()
Node<T,V>	remove()
boolean	remove(java.lang.Object o) Removes an Node from
boolean	removeAll(java.util.Collection<?> c)
boolean	retainAll(java.util.Collection<?> c)
int	size()
java.lang.Object[]	toArray()
<X> X[]	toArray(X[] a)
java.lang.String	toString()

Methods inherited from class java.lang.Object

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

Methods inherited from interface java.util.Collection

equals, hashCode, parallelStream, removeIf, spliterator, stream

Methods inherited from interface java.lang.Iterable

forEach

Constructor Detail

ParetoSelection

public ParetoSelection(java.util.Queue<Node<T,V>> pareto)

Constructor.

Parameters:

pareto - Pareto set implementation.

Method Detail

add

public boolean add(Node<T,V> n)

Adds a node to the open list and, if its not dominated by any other point also to the pareto front.

Specified by:

add in interface java.util.Collection<Node<T,V extends java.lang.Comparable<V>>>

Specified by:

add in interface java.util.Queue<Node<T,V extends java.lang.Comparable<V>>>

Parameters:

n -

Returns:

addAll

public boolean addAll(java.util.Collection<? extends Node<T,V>> c)

Specified by:

addAll in interface java.util.Collection<Node<T,V extends java.lang.Comparable<V>>>

clear

public void clear()

Specified by:

clear in interface java.util.Collection<Node<T,V extends java.lang.Comparable<V>>>

contains

public boolean contains(java.lang.Object o)

Specified by:

contains in interface java.util.Collection<Node<T,V extends java.lang.Comparable<V>>>

containsAll

public boolean containsAll(java.util.Collection<?> c)

Specified by:

containsAll in interface java.util.Collection<Node<T,V extends java.lang.Comparable<V>>>

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface java.util.Collection<Node<T,V extends java.lang.Comparable<V>>>

iterator

public java.util.Iterator<Node<T,V>> iterator()

Specified by:

iterator in interface java.lang.Iterable<Node<T,V extends java.lang.Comparable<V>>>

Specified by:

iterator in interface java.util.Collection<Node<T,V extends java.lang.Comparable<V>>>

removeAll

public boolean removeAll(java.util.Collection<?> c)

Specified by:

removeAll in interface java.util.Collection<Node<T,V extends java.lang.Comparable<V>>>

retainAll

public boolean retainAll(java.util.Collection<?> c)

Specified by:

retainAll in interface java.util.Collection<Node<T,V extends java.lang.Comparable<V>>>

size

public int size()

Specified by:

size in interface java.util.Collection<Node<T,V extends java.lang.Comparable<V>>>

toArray

public java.lang.Object[] toArray()

Specified by:

toArray in interface java.util.Collection<Node<T,V extends java.lang.Comparable<V>>>

toArray

public <X> X[] toArray(X[] a)

Specified by:

toArray in interface java.util.Collection<Node<T,V extends java.lang.Comparable<V>>>

peek

public Node<T,V> peek()

Return a node from pareto front.

Specified by:

peek in interface java.util.Queue<Node<T,V extends java.lang.Comparable<V>>>

remove

public boolean remove(java.lang.Object o)

Removes an Node from

Specified by:

remove in interface java.util.Collection<Node<T,V extends java.lang.Comparable<V>>>

Parameters:

o -

Returns:

toString

public java.lang.String toString()

Overrides:

toString in class java.lang.Object

element

public Node<T,V> element()

Specified by:

element in interface java.util.Queue<Node<T,V extends java.lang.Comparable<V>>>

offer

public boolean offer(Node<T,V> arg0)

Specified by:

offer in interface java.util.Queue<Node<T,V extends java.lang.Comparable<V>>>

poll

public Node<T,V> poll()

Specified by:

poll in interface java.util.Queue<Node<T,V extends java.lang.Comparable<V>>>

remove

public Node<T,V> remove()

Specified by:

remove in interface java.util.Queue<Node<T,V extends java.lang.Comparable<V>>>