jodd-lagarto/src/main/java/jodd/lagarto/dom/Node.java
public Node getNextSiblingElement() {
		parentNode.initChildElementNodes();
		if (siblingElementIndex == -1) {
			int max = parentNode.getChildNodesCount();
			for (int i = siblingIndex; i < max; i++) {
				Node sibling = parentNode.childNodes.get(i);
				if (sibling.getNodeType() == NodeType.ELEMENT) {
					return sibling;
				}
			}
			return null;
		}
		int index = siblingElementIndex + 1;
		if (index >= parentNode.childElementNodesCount) {
			return null;
		}
		return parentNode.childElementNodes[index];
	}
public Node getNextSiblingElement() {
		parentNode.initChildElementNodes();
		if (siblingElementIndex == -1) {
			int max = parentNode.getChildNodesCount();
			for (int i = siblingIndex; i < max; i++) {
				Node sibling = parentNode.childNodes.get(i);
				if (sibling.getNodeType() == NodeType.ELEMENT) {
					return sibling;
				}
			}
			return null;
		}
		int index = siblingElementIndex + 1;
		if (index >= parentNode.childElementNodesCount) {
			return null;
		}
		return parentNode.childElementNodes[index];
	}
public Node getNextSiblingElement ( ) { parentNode . initChildElementNodes ( ) ; if ( siblingElementIndex == - 1 ) { int max = parentNode . getChildNodesCount ( ) ; for ( int i = siblingIndex ; i < max ; i ++ ) { Node sibling = parentNode . childNodes . get ( i ) ; if ( sibling . getNodeType ( ) == NodeType . ELEMENT ) { return sibling ; } } return null ; } int index = siblingElementIndex + 1 ; if ( index >= parentNode . childElementNodesCount ) { return null ; } return parentNode . childElementNodes [ index ] ; }
Returns this node's next <b>element</b>.
Returns this node s next <b > element< / b > .