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

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

  • Type Parameters:
    T - internal label of node
    V - external label of node
    All Implemented Interfaces:
    java.lang.Iterable<BackPointerPath<T,​A,​V>>, java.util.Collection<BackPointerPath<T,​A,​V>>, java.util.Queue<BackPointerPath<T,​A,​V>>
    public class ParetoSelection<T,​A,​V extends java.lang.Comparable<V>>
extends java.lang.Object
implements java.util.Queue<BackPointerPath<T,​A,​V>>
    Open collection pareto front implementation.

    • Constructor Detail

      • ParetoSelection

        public ParetoSelection​(java.util.Queue<BackPointerPath<T,​A,​V>> pareto)
        Constructor.
        Parameters:
        pareto - Pareto set implementation.

    • Method Detail

      • add

        public boolean add​(BackPointerPath<T,​A,​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<T>
        Specified by:
        add in interface java.util.Queue<T>
        Parameters:
        n -
        Returns:

      • addAll

        public boolean addAll​(java.util.Collection<? extends BackPointerPath<T,​A,​V>> c)
        Specified by:
        addAll in interface java.util.Collection<T>

      • clear

        public void clear()
        Specified by:
        clear in interface java.util.Collection<T>

      • contains

        public boolean contains​(java.lang.Object o)
        Specified by:
        contains in interface java.util.Collection<T>

      • containsAll

        public boolean containsAll​(java.util.Collection<?> c)
        Specified by:
        containsAll in interface java.util.Collection<T>

      • isEmpty

        public boolean isEmpty()
        Specified by:
        isEmpty in interface java.util.Collection<T>

      • iterator

        public java.util.Iterator<BackPointerPath<T,​A,​V>> iterator()
        Specified by:
        iterator in interface java.util.Collection<T>
        Specified by:
        iterator in interface java.lang.Iterable<T>

      • removeAll

        public boolean removeAll​(java.util.Collection<?> c)
        Specified by:
        removeAll in interface java.util.Collection<T>

      • retainAll

        public boolean retainAll​(java.util.Collection<?> c)
        Specified by:
        retainAll in interface java.util.Collection<T>

      • size

        public int size()
        Specified by:
        size in interface java.util.Collection<T>

      • toArray

        public java.lang.Object[] toArray()
        Specified by:
        toArray in interface java.util.Collection<T>

      • toArray

        public <X> X[] toArray​(X[] a)
        Specified by:
        toArray in interface java.util.Collection<T>

      • peek

        public BackPointerPath<T,​A,​V> peek()
        Return a node from pareto front.
        Specified by:
        peek in interface java.util.Queue<T>

      • remove

        public boolean remove​(java.lang.Object o)
        Removes an Node from
        Specified by:
        remove in interface java.util.Collection<T>
        Parameters:
        o -
        Returns:

      • toString

        public java.lang.String toString()
        Overrides:
        toString in class java.lang.Object

      • element

        public BackPointerPath<T,​A,​V> element()
        Specified by:
        element in interface java.util.Queue<T>

      • offer

        public boolean offer​(BackPointerPath<T,​A,​V> arg0)
        Specified by:
        offer in interface java.util.Queue<T>

      • poll

        public BackPointerPath<T,​A,​V> poll()
        Specified by:
        poll in interface java.util.Queue<T>

      • remove

        public BackPointerPath<T,​A,​V> remove()
        Specified by:
        remove in interface java.util.Queue<T>