|
| 1 | +package peschke.collections.range |
| 2 | + |
| 3 | +import scala.collection.immutable.NumericRange |
| 4 | + |
| 5 | +object RangeUtils { |
| 6 | + |
| 7 | + private def copy |
| 8 | + (range: Range) |
| 9 | + (start: Int = range.start, end: Int = range.end, step: Int = range.step) // scalafix:ok DisableSyntax.defaultArgs |
| 10 | + : Range = |
| 11 | + if (range.isInclusive) Range.inclusive(start, end, step) |
| 12 | + else Range(start, end, step) |
| 13 | + |
| 14 | + private def copyNumeric[N] |
| 15 | + (range: NumericRange[N]) |
| 16 | + (start: N = range.start, end: N = range.end, step: N = range.step) // scalafix:ok DisableSyntax.defaultArgs |
| 17 | + (implicit I: Integral[N]) |
| 18 | + : NumericRange[N] = |
| 19 | + if (range.isInclusive) NumericRange.inclusive(start, end, step) |
| 20 | + else NumericRange(start, end, step) |
| 21 | + |
| 22 | + /** The inverse of [[Range.drop]] |
| 23 | + * |
| 24 | + * Extends the range start such that `range.grow(n).drop(n) == range` |
| 25 | + */ |
| 26 | + def grow(range: Range, steps: Int): Range = |
| 27 | + if (steps <= 0) range |
| 28 | + else copy(range)(start = range.start - (range.step * steps)) |
| 29 | + |
| 30 | + /** The inverse of [[Range.dropRight]] |
| 31 | + * |
| 32 | + * Extends the range end such that `range.growRight(n).dropRight(n) == range` |
| 33 | + */ |
| 34 | + def growRight(range: Range, steps: Int): Range = |
| 35 | + if (steps <= 0) range |
| 36 | + else copy(range)(end = range.end + (range.step * steps)) |
| 37 | + |
| 38 | + /** Shift the entire range by a number of steps |
| 39 | + * |
| 40 | + * Equivalent to `range.growRight(n).drop(n)` |
| 41 | + * |
| 42 | + * Note: with the exception of situations where intermediate values would |
| 43 | + * overflow or underflow, [[shift]] and [[unshift]] are inverse operations |
| 44 | + */ |
| 45 | + def shift(range: Range, steps: Int): Range = |
| 46 | + if (steps <= 0) range |
| 47 | + else { |
| 48 | + val offset = range.step * steps |
| 49 | + copy(range)( |
| 50 | + start = range.start + offset, |
| 51 | + end = range.end + offset |
| 52 | + ) |
| 53 | + } |
| 54 | + |
| 55 | + /** Shift the entire range by a number of steps |
| 56 | + * |
| 57 | + * Equivalent to `range.grow(n).dropRight(n)`, and the inverse of [[shift]] |
| 58 | + */ |
| 59 | + def unshift(range: Range, steps: Int): Range = |
| 60 | + if (steps <= 0) range |
| 61 | + else { |
| 62 | + val offset = range.step * steps |
| 63 | + copy(range)( |
| 64 | + start = range.start - offset, |
| 65 | + end = range.end - offset |
| 66 | + ) |
| 67 | + } |
| 68 | + |
| 69 | + /** Specialization of [[NumericRange.slice]], returning a [[NumericRange]] |
| 70 | + * instead of an [[IndexedSeq]] |
| 71 | + * |
| 72 | + * Equivalent to `r.drop(from).take(until - from)` |
| 73 | + */ |
| 74 | + def sliceNumeric[N](range: NumericRange[N], from: Int, until: Int) |
| 75 | + (implicit I: Integral[N]) |
| 76 | + : NumericRange[N] = |
| 77 | + if (from <= 0) range.take(until) |
| 78 | + else if (until >= range.length) range.drop(from) |
| 79 | + else { |
| 80 | + val fromValue = I.plus(range.start, I.times(range.step, I.fromInt(from))) |
| 81 | + |
| 82 | + def untilValue = |
| 83 | + I.plus(range.start, I.times(range.step, I.fromInt(until - 1))) |
| 84 | + |
| 85 | + if (from >= until) NumericRange(fromValue, fromValue, range.step) |
| 86 | + else NumericRange.inclusive(fromValue, untilValue, range.step) |
| 87 | + } |
| 88 | + |
| 89 | + /** The inverse of [[NumericRange.drop]] |
| 90 | + * |
| 91 | + * Extends the range start such that `range.grow(n).drop(n) == range` |
| 92 | + */ |
| 93 | + def growNumeric[N](range: NumericRange[N], steps: Int) |
| 94 | + (implicit I: Integral[N]) |
| 95 | + : NumericRange[N] = |
| 96 | + if (steps <= 0) range |
| 97 | + else |
| 98 | + copyNumeric(range)(start = |
| 99 | + I.minus(range.start, I.times(range.step, I.fromInt(steps))) |
| 100 | + ) |
| 101 | + |
| 102 | + /** The inverse of [[NumericRange.dropRight]] |
| 103 | + * |
| 104 | + * Extends the range end such that `range.growRight(n).dropRight(n) == range` |
| 105 | + */ |
| 106 | + def growNumericRight[N](range: NumericRange[N], steps: Int) |
| 107 | + (implicit I: Integral[N]) |
| 108 | + : NumericRange[N] = |
| 109 | + if (steps <= 0) range |
| 110 | + else |
| 111 | + copyNumeric(range)(end = |
| 112 | + I.plus(range.end, I.times(range.step, I.fromInt(steps))) |
| 113 | + ) |
| 114 | + |
| 115 | + /** Shift the entire range by a number of steps |
| 116 | + * |
| 117 | + * Equivalent to `range.drop(n).growRight(n)` |
| 118 | + * |
| 119 | + * Note: with the exception of situations where intermediate values would |
| 120 | + * overflow or underflow, [[shiftNumeric]] and [[unshiftNumeric]] are inverse |
| 121 | + * operations |
| 122 | + */ |
| 123 | + def shiftNumeric[N](range: NumericRange[N], steps: Int) |
| 124 | + (implicit I: Integral[N]) |
| 125 | + : NumericRange[N] = |
| 126 | + if (steps <= 0) range |
| 127 | + else { |
| 128 | + val offset = I.times(range.step, I.fromInt(steps)) |
| 129 | + copyNumeric(range)( |
| 130 | + start = I.plus(range.start, offset), |
| 131 | + end = I.plus(range.end, offset) |
| 132 | + ) |
| 133 | + } |
| 134 | + |
| 135 | + /** Shift the entire range by a number of steps |
| 136 | + * |
| 137 | + * Equivalent to `range.dropRight(n).grow(n)`, and the inverse of |
| 138 | + * [[shiftNumeric]] |
| 139 | + */ |
| 140 | + def unshiftNumeric[N](range: NumericRange[N], steps: Int) |
| 141 | + (implicit I: Integral[N]) |
| 142 | + : NumericRange[N] = |
| 143 | + if (steps <= 0) range |
| 144 | + else { |
| 145 | + val offset = I.times(range.step, I.fromInt(steps)) |
| 146 | + copyNumeric(range)( |
| 147 | + start = I.minus(range.start, offset), |
| 148 | + end = I.minus(range.end, offset) |
| 149 | + ) |
| 150 | + } |
| 151 | +} |
0 commit comments