if(index == -1) return null;
		public TreePath getPathToBug(BugInstance b)		{			//ArrayList<Sortables> order=MainFrame.getInstance().getSorter().getOrder();			List<Sortables> order=st.getOrderBeforeDivider();			//Create an array of BugAspects of lengths from one to the full BugAspect list of the bugInstance				BugAspects[] toBug=new BugAspects[order.size()];			for (int i=0; i < order.size(); i++)				toBug[i]=new BugAspects();							for (int x=0; x< order.size();x++)			{				for (int y=0; y<=x;y++)				{					Sortables s = order.get(y);					toBug[x].add(new StringPair(s,s.getFrom(b)));				}			}			//Add this array as elements of the path			TreePath pathToBug=new TreePath(root);			for (int x=0;x<order.size();x++)			{				int index=getIndexOfChild(pathToBug.getLastPathComponent(),toBug[x]);				if (index==-1)				{					if (MainFrame.DEBUG) System.err.println("Node does not exist in the tree");//For example, not a bug bugs are filtered, they set a bug to be not a bug it filters out					return null;				}								pathToBug=pathToBug.pathByAddingChild(getChild(pathToBug.getLastPathComponent(),index));			}			//Using a hashlist to store bugs in BugSet will make getIndexOfChild Waaaaaay faster, thus making this O(1) (best case)			int index=getIndexOfChild(pathToBug.getLastPathComponent(),new BugLeafNode(b));			pathToBug=pathToBug.pathByAddingChild(getChild(pathToBug.getLastPathComponent(),index));			return pathToBug;		}