/*
* $Id$
* This file is a part of the Arakhne Foundation Classes, http://www.arakhne.org/afc
*
* Copyright (c) 2000-2012 Stephane GALLAND.
* Copyright (c) 2005-10, Multiagent Team, Laboratoire Systemes et Transports,
* Universite de Technologie de Belfort-Montbeliard.
* Copyright (c) 2013-2016 The original authors, and other authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.arakhne.afc.math.graph;
import java.util.Collection;
import java.util.Iterator;
import java.util.LinkedList;
import org.eclipse.xtext.xbase.lib.Pure;
/**
* This class permits to implement a shortest path
* algorithm to make a course inside a graph.
*
* @param <PT> is the type of node in the graph
* @param <ST> is the type of edge in the graph
* @author $Author: sgalland$
* @version $FullVersion$
* @mavengroupid $GroupId$
* @mavenartifactid $ArtifactId$
* @since 13.0
*/
public class ShortestSegmentFirstGraphCourseModel<ST extends GraphSegment<ST, PT>, PT extends GraphPoint<PT, ST>>
implements GraphCourseModel<ST, PT> {
private final LinkedList<GraphIterationElement<ST, PT>> list = new LinkedList<>();
/** Replies if this model restitutes the elements in a reverse order.
*
* <p>If <code>true</code> this model is assumed to replies the <code>GraphIterationElement</code>
* in the reverse order than the sequence of calls to <code>addIterationElement()</code>.
* If <code>false</code> this model is assumed to replies the <code>GraphIterationElement</code>
* in the same order as the sequence of calls to <code>addIterationElement()</code>.
*
* @return <code>true</code> if reversed, otherwise <code>false</code>
*/
@Override
@Pure
public final boolean isReversedRestitution() {
return false;
}
@Override
public void addIterationElement(GraphIterationElement<ST, PT> element) {
// Search for the insertion index
final Iterator<GraphIterationElement<ST, PT>> iterator = this.list.iterator();
final double d1 = element.getDistanceToReachSegment() + element.getSegment().getLength();
int index = 0;
while (iterator.hasNext()) {
final GraphIterationElement<ST, PT> e = iterator.next();
if (e != null) {
final double d2 = e.getDistanceToReachSegment() + e.getSegment().getLength();
if (d1 <= d2) {
// Stop looping
break;
}
}
++index;
}
// Bounds the index
if (index < 0) {
index = 0;
}
if (index > this.list.size()) {
index = this.list.size();
}
// Insert the element at the computed index
this.list.add(index, element);
}
@Pure
@Override
public boolean isEmpty() {
return this.list.isEmpty();
}
@Override
public GraphIterationElement<ST, PT> getNextIterationElement() {
if (this.list.isEmpty()) {
return null;
}
return this.list.getFirst();
}
@Override
public GraphIterationElement<ST, PT> removeNextIterationElement() {
if (this.list.isEmpty()) {
return null;
}
return this.list.removeFirst();
}
@Override
public void removeIterationElements(Collection<GraphIterationElement<ST, PT>> elements) {
this.list.removeAll(elements);
}
}