package network;
import java.awt.Color;
import java.awt.Graphics2D;
import java.awt.geom.Point2D;
import java.awt.geom.Rectangle2D;
import java.util.ArrayList;
import java.util.Vector;

/**
 * 
 */

/**
 * 這個類用于存儲結點的信息
 *
 */
public class Node {
	/**
	 * 
	 *
	 */
	private Rectangle2D bounds;
	private String name;
	private ArrayList rTable;
	private static int i=0;
	private ArrayList links;
	private final double width=30,height=30;
	private double locX,locY;
	private static Color p=Color.cyan;
	public Node(){
		
	}
	/**
	 * @param p 這個結點的初始位置 
	 * 
	 * */
	public Node(Point2D p){
		name="R"+i;
		i++;
		links=new ArrayList();
		rTable=new ArrayList();
		locX=p.getX();
		locY=p.getY();
		bounds=new Rectangle2D.Double(p.getX(),p.getY(),width,height);
	}
	
	public void addPacket(Packet p){
		rTable.add(p);
	}
	
	public ArrayList getTable(){
		return this.rTable;
	}
	
	public void addLink(Link l){
		links.add(l);
		NetNode net=l.getNetNode();
		Packet p=new Packet(net.getNetName(),1,"-");
		rTable.add(p);
		
	}
	
	public ArrayList getLinks(){
		return this.links;
	}
	
	/**
	 *判斷p是否在這個結點的范圍之內(nèi).
	 *@param p 是一個Point2D實例,存儲者一個點的坐標
	 *@return 如果這個結點包含這個坐標返回真
	 * */
	public boolean contains(Point2D p){
		return bounds.contains(p);
	}
	public String getName() {
		return name;
	}
	public void setName(String name) {
		this.name = name;
	}
	public Rectangle2D getBounds(){
		return this.bounds;
	}
	/**
	 * 把結點移到一個給定的地方
	 * @param x 結點在X軸方向移動的距離
	 * @param y 結點在Y軸方向移動的距離
	 * */
	public void translate(double x,double y){
		locX+=x;
		locY+=y;
		bounds=new Rectangle2D.Double(locX,locY,width,height);
	}
	
	public void draw(Graphics2D g2d){
		Color oldColor=g2d.getColor();
		g2d.setColor(p);
		g2d.fill(bounds);
		g2d.setColor(oldColor);
		g2d.drawString(name, (float)locX, (float)locY);
	}
	public String toString(){
		String s="網(wǎng)絡名\t跳數(shù)\t下一跳路由\n";
		for(int i=0;i<rTable.size();i++){
			Packet p=(Packet)rTable.get(i);
			s+=p.toString()+"\n";
		}
		return s;
	}
	public boolean equals(Object o){
		if(o==null){
			return false;
		}
		if(o instanceof Node ){
			Node n=(Node)o;
			if(n.getName().equals(name)){
				return true;
			}
		}
		return false;
	}
	public void destroy(String net){
		for(int i=0;i<rTable.size();i++){
			Packet p=(Packet)rTable.get(i);
			if(p.getNetName().equals(net)){
				p.setStep(16);
			}
		}
	}
}