public T select(int code, int trynum) {
            if (totalLoadFactor <= 0) return null;

            // Multiply by a prime number much bigger than the likely number of hosts
            int hashValue=(Math.abs(code*76103)) % totalLoadFactor;
            int sumLoad=0;
            int targetNode;
            for (targetNode=0; targetNode<nodes.length; targetNode++) {
                sumLoad +=nodes[targetNode].getLoad();
                if (sumLoad > hashValue)
                    break;
            }
            
            // Skip the ones we have tried before.
            targetNode += trynum;
            targetNode %= nodes.length;
            return nodes[targetNode].getNode();
        }
The relative weight of the different nodes.
Hashing are based on the proportions of the weights.
container-search/src/main/java/com/yahoo/search/cluster/Hasher.java