private Orderable parseMove(ParseContext pc, OrderPrefix op, final String[] tokens)
throws OrderException {
/*
3-StP: Army St Petersburg -> Moscow. (*bounce*)
1-Smy: Army Constantinople -> Aegean Sea -> Greece.
keep parsing Locations until END or a -> is reached.
so we keep looking for a -> until no more are found.
if we have more than one, we'll add them to a list
and then add that to the order Move order.
*/
LinkedList pathList = new LinkedList();
int idx = op.tokenIndex;
int movTokIdx = findNextMoveToken(idx, tokens);
while (movTokIdx != -1) {
Location loc = parseLocation(pc, idx, movTokIdx, tokens);
pathList.addLast(loc.getProvince());
idx = movTokIdx + 1;
movTokIdx = findNextMoveToken(idx, tokens);
}
// add last location
final Location loc = parseLocation(pc, idx, tokens.length, tokens);
pathList.addLast(loc.getProvince());
// create Move order
if (pathList.size() == 1) {
if (pc.isRetreatPhase()) {
return pc.orderFactory.createRetreat(op.power, op.location, op.unit, loc);
} else {
return pc.orderFactory.createMove(op.power, op.location, op.unit, loc);
}
} else if (pathList.size() > 1) {
if (pc.isRetreatPhase()) {
throw new OrderException("Convoyed Retreat orders are not allowed. Order: " + pc.orderText);
}
// add source location at beginning of move list
pathList.addFirst(op.location.getProvince());
final Province[] route = (Province[]) pathList.toArray(new Province[pathList.size()]);
return pc.orderFactory.createMove(op.power, op.location, op.unit, loc, route);
} else {
// this probably will not occur....
throw new OrderException("Invalid movement path in Move order: " + pc.orderText);
}
} // parseMove()
