for (int i = 0; i < jumps.Count - 1; i++)
            {
                lastIndex = jumps[i + 1];
                diff = (lastIndex - jumps[i]);
                size = diff;
                while (size < MINIMAL_STEP)
                {
                    // use next step
                    i++;
                    diff = (jumps[i + 1] - jumps[i]);
                    size += diff;
                    lastIndex = jumps[i + 1];
                    // check if we are not on the end
                    if (lastItem - lastIndex < MINIMAL_STEP)
                    {
                        mergedJumps.Add(lastItem);
                        return mergedJumps;
                    }
                }
                mergedJumps.Add(lastIndex);
            }