/**
* @param dbfFile A DBF file
* @return A list of attribute names in the DBF file
*/
public static List<String> getAttributeNames(File dbfFile) throws IOException {
FileInputStream fis = new FileInputStream(dbfFile);
DbaseFileReader dbfReader =
new DbaseFileReader(fis.getChannel(), false, Charset.forName("ISO-8859-1"));
// contains the header columns
DbaseFileHeader dbfHeader = dbfReader.getHeader();
// get the names from the header
List<String> names = new Vector<String>();
int n = dbfHeader.getNumFields();
for (int i = 0; i < n; i++) names.add(dbfHeader.getFieldName(i));
return names;
}
/**
* @param dbfFile A DBF file
* @return A list of attribute names in the DBF file
*/
public static Object[][] getDBFData(File dbfFile) throws IOException {
FileInputStream fis = new FileInputStream(dbfFile);
DbaseFileReader dbfReader =
new DbaseFileReader(fis.getChannel(), false, Charset.forName("ISO-8859-1"));
// contains the header columns
DbaseFileHeader dbfHeader = dbfReader.getHeader();
List<Object[]> rowsList = new Vector<Object[]>();
while (dbfReader.hasNext()) {
rowsList.add(dbfReader.readEntry());
}
int numOfCol = dbfHeader.getNumFields();
Object[][] dataRows = new Object[rowsList.size()][numOfCol];
for (int i = 0; i < rowsList.size(); i++) {
dataRows[i] = rowsList.get(i);
}
return dataRows;
}
private void run2(final Network network) throws Exception {
log.info("running " + this.getClass().getName() + " module...");
NetworkExpandNode neModule =
new NetworkExpandNode(network, expansionRadius, this.linkSeparation);
TreeMap<String, TreeMap<Integer, Id<Link>>> mSequences = new TreeMap<>();
try (FileInputStream fis = new FileInputStream(this.mpDbfFileName)) {
DbaseFileReader r =
new DbaseFileReader(fis.getChannel(), true, IOUtils.CHARSET_WINDOWS_ISO88591);
// get header indices
int mpIdNameIndex = -1;
int mpSeqNrNameIndex = -1;
int mpTrpelIDNameIndex = -1;
for (int i = 0; i < r.getHeader().getNumFields(); i++) {
if (r.getHeader().getFieldName(i).equals(MP_ID_NAME)) {
mpIdNameIndex = i;
}
if (r.getHeader().getFieldName(i).equals(MP_SEQNR_NAME)) {
mpSeqNrNameIndex = i;
}
if (r.getHeader().getFieldName(i).equals(MP_TRPELID_NAME)) {
mpTrpelIDNameIndex = i;
}
}
if (mpIdNameIndex < 0) {
throw new NoSuchFieldException("Field name '" + MP_ID_NAME + "' not found.");
}
if (mpSeqNrNameIndex < 0) {
throw new NoSuchFieldException("Field name '" + MP_SEQNR_NAME + "' not found.");
}
if (mpTrpelIDNameIndex < 0) {
throw new NoSuchFieldException("Field name '" + MP_TRPELID_NAME + "' not found.");
}
log.trace(" FieldName-->Index:");
log.trace(" " + MP_ID_NAME + "-->" + mpIdNameIndex);
log.trace(" " + MP_SEQNR_NAME + "-->" + mpSeqNrNameIndex);
log.trace(" " + MP_TRPELID_NAME + "-->" + mpTrpelIDNameIndex);
// create mp data structure
// TreeMap<mpId,TreeMap<mpSeqNr,linkId>>
log.info(" parsing meneuver paths dbf file...");
while (r.hasNext()) {
Object[] entries = r.readEntry();
String mpId = entries[mpIdNameIndex].toString();
int mpSeqNr = Integer.parseInt(entries[mpSeqNrNameIndex].toString());
Id<Link> linkId = Id.create(entries[mpTrpelIDNameIndex].toString(), Link.class);
TreeMap<Integer, Id<Link>> mSequence = mSequences.get(mpId);
if (mSequence == null) {
mSequence = new TreeMap<>();
mSequences.put(mpId, mSequence);
}
if (mSequence.put(mpSeqNr, linkId) != null) {
fis.close();
throw new IllegalArgumentException(
MP_ID_NAME + "=" + mpId + ": " + MP_SEQNR_NAME + " " + mpSeqNr + " already exists.");
}
}
log.info(" " + mSequences.size() + " maneuvers sequences stored.");
log.info(" done.");
r.close();
}
// store the maneuver list of the nodes
// TreeMap<NodeId,ArrayList<Tuple<MnId,MnFeatType>>>
log.info(" parsing meneuver shape file...");
TreeMap<Id<Node>, ArrayList<Tuple<String, Integer>>> maneuvers = new TreeMap<>();
SimpleFeatureSource fs = ShapeFileReader.readDataFile(this.mnShpFileName);
SimpleFeatureIterator fIt = fs.getFeatures().features();
while (fIt.hasNext()) {
SimpleFeature f = fIt.next();
int featType = Integer.parseInt(f.getAttribute(MN_FEATTYP_NAME).toString());
if ((featType == 2103) || (featType == 2102) || (featType == 2101)) {
// keep 'Prohibited Maneuver' (2103), 'Restricted Maneuver' (2102) and 'Calculated/Derived
// Prohibited Maneuver' (2101)
Id<Node> nodeId = Id.create(f.getAttribute(MN_JNCTID_NAME).toString(), Node.class);
ArrayList<Tuple<String, Integer>> ms = maneuvers.get(nodeId);
if (ms == null) {
ms = new ArrayList<>();
}
Tuple<String, Integer> m = new Tuple<>(f.getAttribute(MN_ID_NAME).toString(), featType);
ms.add(m);
maneuvers.put(nodeId, ms);
} else if ((featType == 9401) || (featType == 2104)) {
// ignore 'Bifurcation' (9401) and 'Priority Maneuver' (2104)
} else {
throw new IllegalArgumentException(
"mnId="
+ f.getAttribute(MN_ID_NAME)
+ ": "
+ MN_FEATTYP_NAME
+ "="
+ featType
+ " not known.");
}
}
fIt.close();
log.info(" " + maneuvers.size() + " nodes with maneuvers stored.");
log.info(" done.");
// create a maneuver matrix for each given node and
// expand those nodes
log.info(" expand nodes according to the given manveuvers...");
int nodesIgnoredCnt = 0;
int nodesAssignedCnt = 0;
int maneuverIgnoredCnt = 0;
int maneuverAssignedCnt = 0;
int virtualNodesCnt = 0;
int virtualLinksCnt = 0;
for (Map.Entry<Id<Node>, ArrayList<Tuple<String, Integer>>> entry : maneuvers.entrySet()) {
Id<Node> nodeId = entry.getKey();
if (network.getNodes().get(nodeId) == null) {
log.trace(
" nodeid="
+ nodeId
+ ": maneuvers exist for that node but node is missing. Ignoring and proceeding anyway...");
nodesIgnoredCnt++;
} else {
// node found
Node n = network.getNodes().get(nodeId);
// init maneuver matrix
// TreeMap<fromLinkId,TreeMap<toLinkId,turnAllowed>>
TreeMap<Id<Link>, TreeMap<Id<Link>, Boolean>> mmatrix = new TreeMap<>();
// assign maneuvers for given node to the matrix
ArrayList<Tuple<String, Integer>> ms = entry.getValue();
for (Tuple<String, Integer> m : ms) {
// get maneuver path sequence for given maneuver
TreeMap<Integer, Id<Link>> mSequence = mSequences.get(m.getFirst());
if (mSequence == null) {
throw new Exception(
"nodeid=" + nodeId + "; mnId=" + m.getFirst() + ": no maneuver sequence given.");
}
if (mSequence.size() < 2) {
throw new Exception(
"nodeid="
+ nodeId
+ "; mnId="
+ m.getFirst()
+ ": mSequenceSize="
+ mSequence.size()
+ " not alowed!");
}
// get the first element of the sequence, defining the start link for the maneuver
Id<Link> firstLinkid = mSequence.values().iterator().next();
// go through each other element (target link of the maneuver) of the sequence by sequence
// number
for (Id<Link> otherLinkId : mSequence.values()) {
// get the start link and the target link of the maneuver
Link inLink = n.getInLinks().get(Id.create(firstLinkid + "FT", Link.class));
if (inLink == null) {
inLink = n.getInLinks().get(Id.create(firstLinkid + "TF", Link.class));
}
Link outLink = n.getOutLinks().get(Id.create(otherLinkId + "FT", Link.class));
if (outLink == null) {
outLink = n.getOutLinks().get(Id.create(otherLinkId + "TF", Link.class));
}
if ((inLink != null) && (outLink != null)) {
// start and target link found and they are incident to the given node
if (m.getSecond() == 2102) {
// restricted maneuver: given start and target link path is allowed to drive
// store it to the matrix
TreeMap<Id<Link>, Boolean> outLinkMap = mmatrix.get(inLink.getId());
if (outLinkMap == null) {
outLinkMap = new TreeMap<>();
}
outLinkMap.put(outLink.getId(), Boolean.TRUE);
mmatrix.put(inLink.getId(), outLinkMap);
} else {
// prohibited maneuver: given start and target link path is not allowed to drive
// store it to the matrix
TreeMap<Id<Link>, Boolean> outLinkMap = mmatrix.get(inLink.getId());
if (outLinkMap == null) {
outLinkMap = new TreeMap<>();
}
outLinkMap.put(outLink.getId(), Boolean.FALSE);
mmatrix.put(inLink.getId(), outLinkMap);
}
maneuverAssignedCnt++;
} else {
maneuverIgnoredCnt++;
}
}
}
// complete the matrix
for (TreeMap<Id<Link>, Boolean> fromLinkEntry : mmatrix.values()) {
// detect inlinks with restricted maneuvers
boolean hasRestrictedManeuver = false;
for (Boolean b : fromLinkEntry.values()) {
if (b) {
hasRestrictedManeuver = true;
}
}
// add missing toLink maneuvers
for (Id<Link> toLinkId : n.getOutLinks().keySet()) {
if (!fromLinkEntry.containsKey(toLinkId)) {
fromLinkEntry.put(toLinkId, !hasRestrictedManeuver);
}
}
}
// add allowed maneuvers for fromLinks which were not assigned yet.
for (Id<Link> fromLinkId : n.getInLinks().keySet()) {
if (!mmatrix.containsKey(fromLinkId)) {
mmatrix.put(fromLinkId, new TreeMap<Id<Link>, Boolean>());
for (Id<Link> toLinkId : n.getOutLinks().keySet()) {
mmatrix.get(fromLinkId).put(toLinkId, Boolean.TRUE);
}
}
}
// remove all U-turns from the matrix
if (this.removeUTurns) {
for (Id<Link> fromLinkId : n.getInLinks().keySet()) {
String str1 = fromLinkId.toString().substring(0, fromLinkId.toString().length() - 2);
for (Id<Link> toLinkId : n.getOutLinks().keySet()) {
String str2 = toLinkId.toString().substring(0, toLinkId.toString().length() - 2);
if (str1.equals(str2)) {
mmatrix.get(fromLinkId).put(toLinkId, Boolean.FALSE);
}
}
}
}
// create arraylist with turn tuples
ArrayList<TurnInfo> turns = new ArrayList<>();
for (Map.Entry<Id<Link>, TreeMap<Id<Link>, Boolean>> fromLinkEntry : mmatrix.entrySet()) {
Id<Link> fromLinkId = fromLinkEntry.getKey();
for (Map.Entry<Id<Link>, Boolean> toLinkEntry : fromLinkEntry.getValue().entrySet()) {
if (toLinkEntry.getValue()) {
turns.add(new TurnInfo(fromLinkId, toLinkEntry.getKey()));
}
}
}
// expand the node
Tuple<List<Node>, List<Link>> t = neModule.expandNode(nodeId, turns);
virtualNodesCnt += t.getFirst().size();
virtualLinksCnt += t.getSecond().size();
nodesAssignedCnt++;
}
}
log.info(" " + nodesAssignedCnt + " nodes expanded.");
log.info(" " + maneuverAssignedCnt + " maneuvers assigned.");
log.info(" " + virtualNodesCnt + " new nodes created.");
log.info(" " + virtualLinksCnt + " new links created.");
log.info(
" " + nodesIgnoredCnt + " nodes with given maneuvers (2103, 2102 or 2101) ignored.");
log.info(" " + maneuverIgnoredCnt + " maneuvers ignored (while node was found).");
log.info(" done.");
log.info("done.");
}
