src/main/java/com/workplacesystems/utilsj/collections/TransactionalBidiTreeMap.java
private Node<K,V> mostValidNode(final Node<K,V> node, final int index, final String thread_id) {
        Node<K,V> rval = node;

        while (rval != null && !validNode(rval, thread_id)) {
            rval = nextGreater(rval, index);
        }
        return rval;
    }
private Node<K,V> mostValidNode(final Node<K,V> node, final int index, final String thread_id) {
        Node<K,V> rval = node;

        while (rval != null && !validNode(rval, thread_id)) {
            rval = nextGreater(rval, index);
        }
        return rval;
    }
private Node < K , V > mostValidNode ( final Node < K , V > node , final int index , final String thread_id ) { Node < K , V > rval = node ; while ( rval != null && ! validNode ( rval , thread_id ) ) { rval = nextGreater ( rval , index ) ; } return rval ; }
get the most valid node from the specified node

@param node the node to be searched from
@param index KEY or VALUE

@return the specified node
get the most valid node from the specified node