ldrupture.java

基于Java的地图数据管理软件。使用MySQL数据库管理系统。

package net.aetherial.gis.jiaotongbu.outputJTB.txtOutput.module.colligate;

import org.w3c.dom.Node;
import org.w3c.dom.NodeList;
import net.aetherial.gis.surface.ItemValue;
import java.util.Vector;
import net.aetherial.gis.publicuse.track.TrackDecussate;

/**
 * <p>Title: </p>
 *
 * <p>Description:断头路段的操作 </p>
 *
 * <p>Copyright: Copyright (c) 2004</p>
 *
 * <p>Company: </p>
 *
 * @author not attributable
 * @version 1.0
 */
public class LDRupture {
  public LDRupture() {
  }

  /**
   * 判断指定编码的路线是否是多条航迹
   */
  public boolean isMultiTrack(String trackNumber, Node[] allTrks) {
    int flag = 0;
    for (int i = 0; allTrks != null && i < allTrks.length; i++) {
      if (ItemValue.getTracksNumber(allTrks[i]).trim().equals(trackNumber)) {
        flag++;
      }
    }
    if (flag >= 2) {
      return true;
    }
    else {
      return false;
    }
  }

  /**
   * 判断指定编码的路线是否是多条航迹
   */
  public boolean isMultiTrack(Node trk, Node[] allTrks) {
    String trackNumber = ItemValue.getTracksNumber(trk).trim();
    return this.isMultiTrack(trackNumber,allTrks);
  }


  /**
   * 得到同编码的航迹
   */
  private Vector getSameNumberTrk(String trackNumber, Node[] allTrks) {
    Vector ve = new Vector();
    for (int i = 0; allTrks != null && i < allTrks.length; i++) {
      if (ItemValue.getTracksNumber(allTrks[i]).trim().equals(trackNumber)) {
        ve.add(allTrks[i]);
      }
    }
    return ve;
  }

  /**
   * 判断两条航迹是否相近？
   */
  private boolean isTwoTrkLink(Node trk1, Node trk2) {
    TrackDecussate td = new TrackDecussate();
    td.setTracks(trk1, trk2);
    if (td.isTLink()) {
      return true;
    }
    else if (td.isKLink()) {
      return true;
    }
    else if (td.isDecussate()) {
      return true;
    }

    else {
      return false;
    }
  }

  /**
   * 判断该路线包含多条路段的情况下
   * 指定的航迹是否独立，即该路线的所有路段均不和该航迹相连
   */
  public boolean isTrkIndependency(Node trk,Node[] allTrk){
    Vector sameNumberTrk = this.getSameNumberTrk(ItemValue.getTracksNumber(trk).trim(),allTrk);
    for (int i = 0; i < sameNumberTrk.size(); i++) {
      if (this.isTwoTrkLink(trk,(Node)sameNumberTrk.get(i))) {
        return true;
      }
    }
    return false;
  }

  public static void main(String[] args) {
    LDRupture ldrupture = new LDRupture();
  }
}