protected Partitions loadPartitions() {

        Iterable<RedisURI> topologyRefreshSource = getTopologyRefreshSource();

        try {
            return doLoadPartitions(topologyRefreshSource);
        } catch (RedisException e) {

            // Attempt recovery using initial seed nodes
            if (useDynamicRefreshSources() && topologyRefreshSource != initialUris) {

                try {
                    return doLoadPartitions(initialUris);
                } catch (RedisConnectionException e2) {

                    RedisException exception = new RedisException(getTopologyRefreshErrorMessage(initialUris), e2);
                    exception.addSuppressed(e);

                    throw exception;
                }
            }

            if (e.getClass().equals(RedisException.class)) {
                throw e;
            }

            throw new RedisException(getTopologyRefreshErrorMessage(topologyRefreshSource), e);
        }
    }
protected Partitions loadPartitions ( ) { Iterable < RedisURI > topologyRefreshSource = getTopologyRefreshSource ( ) ; try { return doLoadPartitions ( topologyRefreshSource ) ; } catch ( RedisException e ) { if ( useDynamicRefreshSources ( ) && topologyRefreshSource != initialUris ) { try { return doLoadPartitions ( initialUris ) ; } catch ( RedisConnectionException e2 ) { RedisException exception = new RedisException ( getTopologyRefreshErrorMessage ( initialUris ) , e2 ) ; exception . addSuppressed ( e ) ; throw exception ; } } if ( e . getClass ( ) . equals ( RedisException . class ) ) { throw e ; } throw new RedisException ( getTopologyRefreshErrorMessage ( topologyRefreshSource ) , e ) ; } }
Retrieve partitions. Nodes within {@link Partitions} are ordered by latency. Lower latency nodes come first.

@return Partitions