if (begin == null || end == null || begin >= end || divideNum == null || divideNum <= 0) { return null; Integer[][] ranges = new Integer[divideNum][2]; int spread = end - begin; for (int i = 1; i < divideNum; i++) { ranges[i - 1][0] = spread / divideNum * (i - 1) + begin; ranges[i - 1][1] = spread / divideNum * i + begin; ...
assert a.length - aStart > length && b.length - bStart > length; for (int i = aStart, j = bStart, k = 0; k < length; k++) { if (a[i] != b[j]) return false; return true;
if (num == null) { return num; if (num < min) { num = min; if (num > max) { num = max; ...
if (receiver < minBound) return minBound; else if (receiver > maxBound) return maxBound; else return receiver;
byte[] buffer = new byte[length]; for (int a = 0; a < length; a++, offset++) { buffer[a] = data[offset]; return buffer;
final double multiplier = (scaleMax - scaleMin) / (rangeMax - rangeMin); final double devValue = multiplier * (rawValue - rangeMin) + scaleMin; return fitInRange(devValue, scaleMin, scaleMax);