public int getNextNode(int elementHandle) {
		int element = m_lists.getElement(elementHandle);
		int ptr = m_lists.getNext(elementHandle);
		while (ptr != -1) {
			int e = m_lists.getElement(ptr);
			if (m_hash.equal(e, element)) {
				return ptr;
			}
			ptr = m_lists.getNext(ptr);
		}

		return -1;

	}
public int getNextNode ( int elementHandle ) { int element = m_lists . getElement ( elementHandle ) ; int ptr = m_lists . getNext ( elementHandle ) ; while ( ptr != - 1 ) { int e = m_lists . getElement ( ptr ) ; if ( m_hash . equal ( e , element ) ) { return ptr ; } ptr = m_lists . getNext ( ptr ) ; } return - 1 ; }
Gets next equal node.