gui.entities.sectionEntityList

Class LinkList

java.lang.Object

java.util.AbstractCollection<E>

java.util.AbstractList<E>

java.util.ArrayList<Link>

gui.entities.sectionEntityList.LinkList

All Implemented Interfaces:

java.io.Serializable, java.lang.Cloneable, java.lang.Iterable<Link>, java.util.Collection<Link>, java.util.List<Link>, java.util.RandomAccess

public class LinkList
extends java.util.ArrayList<Link>

LinkList

See Also:

Serialized Form

Constructor Summary

Constructors

Constructor and Description
LinkList()

Method Summary

Methods

Modifier and Type	Method and Description
void	addLinkPriorityWise(Link link) Insert the link into a linkList sorted according to its priority
Block	getNextMainBlock()
Link	getNextMainLink()
LinkList	getSortedLinks(Train train, int nextStnBlock) NextBLockArray: ArrayList getSortedLinks(Train train, Block block, double arrivalTime, double deptTime, double startVelocity) 1) The base cases as in the nextBlockArray has size 0 or 1 it should return the linkArray or add the only nextBlock and return.

Methods inherited from class java.util.ArrayList

add, add, addAll, addAll, clear, clone, contains, ensureCapacity, get, indexOf, isEmpty, iterator, lastIndexOf, listIterator, listIterator, remove, remove, removeAll, retainAll, set, size, subList, toArray, toArray, trimToSize

Methods inherited from class java.util.AbstractList

equals, hashCode

Methods inherited from class java.util.AbstractCollection

containsAll, toString

Methods inherited from class java.lang.Object

getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.util.List

containsAll, equals, hashCode

Constructor Detail

LinkList

public LinkList()

Method Detail

getSortedLinks

public LinkList getSortedLinks(Train train,
                      int nextStnBlock)

NextBLockArray: ArrayList getSortedLinks(Train train, Block block, double arrivalTime, double deptTime, double startVelocity) 1) The base cases as in the nextBlockArray has size 0 or 1 it should return the linkArray or add the only nextBlock and return. 2) It checks if the current block is actually a "block" and if the train is scheduled. Then it checks if the next block should be a loop then finds the station name, refers the referenceTable, finds the preferred loop, adds that first, then adds the rest of the loops which do not conflict with the train's direction. 3) Else if the currentBlock is a "loop" or the train is unscheduled one, it adds those links which has a path till the endLoop for the train. Block: boolean hasPath(Block block, int trainEndLoopNo, int trainDirection) 1) It iterates through the all the links and ignores those which are null, while returns true if one of them is the endLoop 2) OtherWise it takes that link's nextBlock for recursion and finds if there exists a path.

Parameters:

Train -

block -

arrivalTime -

deptTime -

startVelocity -

Returns:

list of links.

addLinkPriorityWise

public void addLinkPriorityWise(Link link)

Insert the link into a linkList sorted according to its priority

Parameters:

linkList -

link -

getNextMainBlock

public Block getNextMainBlock()

Returns:

next main block.

getNextMainLink

public Link getNextMainLink()