@Override
	public boolean add(final T element) {
		requireNonNull(element);

		boolean updated = false;
		final Iterator<T> iterator = _population.iterator();
		while (iterator.hasNext()) {
			final T existing = iterator.next();

			int cmp = _dominance.compare(element, existing);
			if (cmp > 0) {
				iterator.remove();
				updated = true;
			} else if (cmp < 0 || _equals.test(element, existing)) {
				return updated;
			}
		}

		_population.add(element);
		return true;
	}
Inserts an {@code element} to this pareto front.

@implNote
Inserting a new element has a time complexity of {@code O(this.size())},
where <em>n</em> is the number of elements of {@code this} pareto-front.

@param element the element to add
@return {@code true} if this set did not already contain the specified
        element
jenetics.ext/src/main/java/io/jenetics/ext/moea/ParetoFront.java