net.sourceforge.cilib.moo.archive.unconstrained
Class QuadTree

java.lang.Object
  net.sourceforge.cilib.moo.archive.Archive
      net.sourceforge.cilib.moo.archive.unconstrained.QuadTree

All Implemented Interfaces:

Iterable<OptimisationSolution>, Collection<OptimisationSolution>, List<OptimisationSolution>

public class QuadTree
extends Archive

Placeholder class for anybody interrested in implementing this datastructure. The reference where the implementation details can be found is:

References:

• S. Mostaghim, J. Teich and A. Tyagi, "Comparison of Data Structures for Storing Pareto-sets in MOEA's", in Proceedings of the IEEE World Congress on Computational Intelligence, vol 1, pp. 843-849, May 2002.

Constructor Summary

QuadTree()

Method Summary

void	add(int index, OptimisationSolution element)
boolean	add(OptimisationSolution e)
boolean	addAll(Collection<? extends OptimisationSolution> c)
boolean	addAll(int index, Collection<? extends OptimisationSolution> c)
void	clear()
boolean	contains(Object o)
boolean	containsAll(Collection<?> c)
Collection<OptimisationSolution>	dominates(OptimisationSolution candidateSolution) Checks the entire archive and accumulates the solutions that dominates candidateSolution.
OptimisationSolution	get(int index)
int	indexOf(Object o)
Collection<OptimisationSolution>	isDominatedBy(OptimisationSolution candidateSolution) Checks the archive and accumulates all solutions that is dominated by candidateSolution.
boolean	isEmpty()
Iterator<OptimisationSolution>	iterator()
int	lastIndexOf(Object o)
ListIterator<OptimisationSolution>	listIterator()
ListIterator<OptimisationSolution>	listIterator(int index)
OptimisationSolution	remove(int index)
boolean	remove(Object o)
boolean	removeAll(Collection<?> c)
boolean	retainAll(Collection<?> c)
OptimisationSolution	set(int index, OptimisationSolution element)
int	size()
List<OptimisationSolution>	subList(int fromIndex, int toIndex)
Object[]	toArray()
<T> T[]	toArray(T[] a)

Methods inherited from class net.sourceforge.cilib.moo.archive.Archive

get, set

Methods inherited from class java.lang.Object

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

Methods inherited from interface java.util.List

equals, hashCode

Constructor Detail

QuadTree

public QuadTree()

Method Detail

dominates

public Collection<OptimisationSolution> dominates(OptimisationSolution candidateSolution)

Description copied from class: Archive

Checks the entire archive and accumulates the solutions that dominates candidateSolution.

Specified by:

dominates in class Archive

Parameters:

candidateSolution - The solution to compare against all of the solutions in the archive.

Returns:

The collection of solutions that dominates candidateSolution.

isDominatedBy

public Collection<OptimisationSolution> isDominatedBy(OptimisationSolution candidateSolution)

Description copied from class: Archive

Checks the archive and accumulates all solutions that is dominated by candidateSolution.

Specified by:

isDominatedBy in class Archive

Parameters:

candidateSolution - The solution to compare against all of the solutions in the archive.

Returns:

The collection of solutions dominated by the candidateSolution.

add

public boolean add(OptimisationSolution e)

addAll

public boolean addAll(Collection<? extends OptimisationSolution> c)

clear

public void clear()

contains

public boolean contains(Object o)

containsAll

public boolean containsAll(Collection<?> c)

isEmpty

public boolean isEmpty()

iterator

public Iterator<OptimisationSolution> iterator()

remove

public boolean remove(Object o)

removeAll

public boolean removeAll(Collection<?> c)

retainAll

public boolean retainAll(Collection<?> c)

size

public int size()

toArray

public Object[] toArray()

toArray

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

addAll

public boolean addAll(int index,
                      Collection<? extends OptimisationSolution> c)

get

public OptimisationSolution get(int index)

set

public OptimisationSolution set(int index,
                                OptimisationSolution element)

add

public void add(int index,
                OptimisationSolution element)

remove

public OptimisationSolution remove(int index)

indexOf

public int indexOf(Object o)

lastIndexOf

public int lastIndexOf(Object o)

listIterator

public ListIterator<OptimisationSolution> listIterator()

listIterator

public ListIterator<OptimisationSolution> listIterator(int index)

subList

public List<OptimisationSolution> subList(int fromIndex,
                                          int toIndex)