package com.mark;

import io.mycat.config.model.rule.RuleAlgorithm;
import io.mycat.route.function.AbstractPartitionAlgorithm;

/**
 * @Description :  java类作用描述
 * @Author :  Markburt
 * @CreateDate :  2020/3/3$ 下午 06:49$
 * @UpdateUser :  Markburt
 * @UpdateDate :  2020/3/3$ 下午 06:49$
 * @UpdateRemark :  Project Build
 * @Version :  1.0
 */
public class HeiMaBurstRuleAlgorithm extends AbstractPartitionAlgorithm implements RuleAlgorithm {

    private Long volume;
    private Integer step;
    private Integer mod;

    public void setVolume(Long volume) {
        this.volume = volume;
    }

    public void setStep(Integer step) {
        this.step = step;
    }

    public void setMod(Integer mod) {
        this.mod = mod;
    }

    /**
     * 计算
     * @param columnValue 3-2  1-2
     * @return 分片ID = （dataId/volume）* step +分表ID/mod
     */
    @Override
    public Integer calculate(String columnValue) {
        if (columnValue != null) {
            String[] temp = columnValue.split("-");
            if (temp.length == 2) {
                try {
                    Long dataId = Long.valueOf(temp[0]);
                    Long burstId = Long.valueOf(temp[1]);
                    int group = (int) (dataId / volume) * step;
                    int pos = group + (int) (burstId / mod);
                    System.out.println("HEIMA RULE INFO [" + columnValue + "]-[{" + pos + "}]");
                    return pos;
                } catch (Exception e) {
                    System.out.println("HEIMA RULE INFO [" + columnValue + "]-[{" + e.getMessage() + "}]");
                }

            }
        }
        return new Integer(0);
    }

    /**
     * 计算范围查询
     * @param beginValue
     * @param endValue
     * @return
     */
    @Override
    public Integer[] calculateRange(String beginValue, String endValue) {
        if (beginValue != null && endValue != null) {
            Integer begin = calculate(beginValue);
            Integer end = calculate(endValue);
            if (begin == null || end == null) {
                return new Integer[0];
            }
            if (end >= begin) {
                int len = end - begin + 1;
                Integer[] request = new Integer[len];
                for (int i = 0; i < len; i++) {
                    request[i] = begin + i;
                }
                return request;
            }
        }
        return new Integer[0];
    }
}