public void outTextSearch(Point aPoint)
	{
		int pointX = (int)aPoint.getX();
		int pointY = (int)aPoint.getY();
		for(Map.Entry<Integer,TreeNode> e : this.nodes.entrySet())
		{
			TreeNode node = e.getValue();
			
			int nodeX = (int)node.getTarget().getX();
			int nodeY = (int)(node.getTarget().getY());
			
			if((nodeX-1 < pointX) && (pointX < (nodeX + node.getWidth()+2)) &&
			   ((nodeY - node.getHeight()) < pointY) && (pointY < nodeY+node.getDescent()))
				//各定数は誤差修正用
			{
				int number = e.getKey();
				System.out.println("ID:"+number+" word:"+node.getDate());
				break;
			}
		}
		return;
	}