架构训练营第五周 - 作业

public class HashCircleFactory {

    public static Map<Integer, String> build(List<String> nodes, int virtual) {
        final Map<Integer, String> circleHashMap = new TreeMap<>();

        Random random = new Random(Integer.MAX_VALUE);

        Map<String, Map<Object, Object>> nodeMap = new TreeMap<>();

        nodes.forEach(key -> {
            nodeMap.put(key, new TreeMap<>());
            //随机数字，尽可能均匀分布
            int rd = Math.abs(random.nextInt());
            int hashCode = Math.abs(key.hashCode());

            int init = Math.abs(hashCode * rd % Integer.MAX_VALUE % virtual);

            for (int i = 0; i < virtual; i++) {
                circleHashMap.put(init + i, key);
            }
        });

        System.out.println(circleHashMap);
        return circleHashMap;
    }
}

public class Test {
    private static final List<String> list = new ArrayList<>();

    public static void main(String[] args) {
        List<String> ipAddressList = List.of("10.22.34.91", "10.22.34.92", "10.22.34.93", "10.22.34.94", "10.22.34.95",
                "10.22.34.96", "10.22.34.97", "10.22.34.98", "10.22.34.99", "10.22.34.10");
        Map<Integer, String> circle = HashCircleFactory.build(ipAddressList, 32);

        list.stream().forEach(str -> {
            int hashCode = Math.abs(str.hashCode());
            // System.out.println("str hashCode:" + hashCode);
            int mo=hashCode%ipAddressList.size();
            // System.out.println("str hashCode mo:" + mo);
            Integer rightKey = circle.keySet().stream().filter(key -> mo <= key).findFirst().get();

            String rightValue = circle.get(rightKey);
            System.out.println("str hashCode mo:" + mo+"  rightKey:" + rightKey+" rightValue:" + rightValue);
            // System.out.println("rightValue:" + rightValue);
        });



    }

    static {
        for (int i = 0; i < 1000; i++) {
            String str = RandomUtils.generateString(10);
            list.add(str);
        }
    }


}