return false; case NTH_CHILD: return positionMatches(countSiblingsBefore(e, false) + 1, elementIndex); case NTH_LAST_CHILD: return positionMatches(countSiblingsAfter(e, false) + 1, elementIndex); case NTH_OF_TYPE: return positionMatches(countSiblingsBefore(e, true) + 1, elementIndex); case NTH_LAST_OF_TYPE: return positionMatches(countSiblingsAfter(e, true) + 1, elementIndex); case ROOT: return e.getParentNode().getNodeType() == Node.DOCUMENT_NODE;
return false; case NTH_CHILD: return positionMatches(countSiblingsBefore(e, false) + 1, elementIndex); case NTH_LAST_CHILD: return positionMatches(countSiblingsAfter(e, false) + 1, elementIndex); case NTH_OF_TYPE: return positionMatches(countSiblingsBefore(e, true) + 1, elementIndex); case NTH_LAST_OF_TYPE: return positionMatches(countSiblingsAfter(e, true) + 1, elementIndex); case ROOT: return e.getParentNode().getNodeType() == Node.DOCUMENT_NODE;