function littleThan(a, b, lg) {
	            return a.interval[lg] < b.interval[lg]
	                || (
	                    a.interval[lg] === b.interval[lg]
	                    && (
	                        (a.close[lg] - b.close[lg] === (!lg ? 1 : -1))
	                        || (!lg && littleThan(a, b, 1))
	                    )
	                );
	        }
Order intervals asc, and split them when overlap.
expect(numberUtil.reformIntervals([
    {interval: [18, 62], close: [1, 1]},
    {interval: [-Infinity, -70], close: [0, 0]},
    {interval: [-70, -26], close: [1, 1]},
    {interval: [-26, 18], close: [1, 1]},
    {interval: [62, 150], close: [1, 1]},
    {interval: [106, 150], close: [1, 1]},
    {interval: [150, Infinity], close: [0, 0]}
])).toEqual([
    {interval: [-Infinity, -70], close: [0, 0]},
    {interval: [-70, -26], close: [1, 1]},
    {interval: [-26, 18], close: [0, 1]},
    {interval: [18, 62], close: [0, 1]},
    {interval: [62, 150], close: [0, 1]},
    {interval: [150, Infinity], close: [0, 0]}
]);
@param {Array.<Object>} list, where `close` mean open or close
       of the interval, and Infinity can be used.
@return {Array.<Object>} The origin list, which has been reformed.