We are going to remove `sumburConsistentHash` function due to low demand and limited possible usages.
If you are using this function please describe your scenarios here.

`jumpConsistentHash` and `yandexConsistentHash` will remain available.
{
    unsigned int h = hashed_int;
    unsigned int capa = capacity;
    unsigned int part, n, i, c;
    if (capa == 0)
        throw std::runtime_error("Sumbur is not applicable to empty cluster");
    part = L / capa;
    if (L - h < part) return 0;
    n = 1;
    do {
        if (h >= L / 2) h -= L / 2;
        else {
            n = 2;
            if (L / 2 - h < part) return 1;
        }
        if (capa == 2) return 1;
#define curslice(i) (L / (i * (i - 1)))
#define unroll(i) \
        if (curslice(i) <= h) h -= curslice(i); \
        else {                                  \
            h += curslice(i) * (i - n - 1);     \
            n = i;                              \
            if (L / i - h < part) return n-1;   \
        }                                       \
        if (capa == i) return (n-1)
        unroll(3); unroll(4); unroll(5);
        unroll(6); unroll(7); unroll(8);
        unroll(9); unroll(10); unroll(11);
        unroll(12); unroll(13); unroll(14);