public int compareNodePositions() {
		if(beginPath.length == 0 && endPath.length == 0)
			return 0;
		if(beginPath.length == 0) 
			return -1;
		if(endPath.length == 0) 
			return 1;
		return Integer.compare(beginPath[0], endPath[0]);
	}
@Test
	public void compareSameNode(){
		final NodeModel parent = root();
		final int compared = new NodeRelativePath(parent, parent).compareNodePositions();
		assertEquals(0, compared);
	}