1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 |
/** * class RangeList * * This is collection class, List with range of integer. * like this: [ [ 5, 7 ], [ 9, 13 ], [ 17, 21 ] ] as is 5 to 7, 9 to 13 and 17 to 21. * * Version: 1.0.0 * Date: 2018-12-27 */ /* Usage: import RangeList from "./RangeList"; const r = new RangeList(); r.add([5, 7]); r.add([9, 13]); r.add([17, 21]); console.log("ranges: ", r.get()); r.remove([22, 23]); console.log("ranges: ", r.get()); */ // Type alias type n2 = [number, number]; // Interface, extends and generics declaration interface Data extends Array<n2> { [index: number]: n2; } export default class RangeList { private data: Data = []; /** * Return as array list what is not covered range in the list. * * @param r range array [a, b] * @returns range items array list [ [a, b], [c, d], ... ], or false */ public notCoveredRanges(r: n2): Data | false { // invalid arguments if (r[0] > r[1]) { return false; } const len = this.data.length; // this.data is empty if (!len) { return [r]; } // target range is not covered any range items in the array. target is less than. let d = this.data[0]; if (r[1] < d[0]) { return [r]; } // target range is not covered any range items in the array. target is greater than. d = this.data[len - 1]; if (r[0] > d[1]) { return [r]; } // find the uncovered range in the array at the target range. const result: Data = []; let a = r[0], b = r[1]; // [a, b] for (let i = 0; i < len; i++) { let d = this.data[i]; if (a < d[0]) { if (b < d[0]) { result.push([a, b]); break; } else if (b <= d[1]) { result.push([a, d[0] - 1]); break; } else { result.push([a, d[0] - 1]); a = d[1] + 1; continue; } } else if (a >= d[0] && a <= d[1]) { if (b <= d[1]) { return []; } else { a = d[1] + 1; continue; } } else { continue; } } if (b > d[1]) { result.push([d[1] + 1, b]); } return result; } /** * Add range * * @param r range array [a, b] * @returns range items array list [ [a, b], [c, d], ... ], or false */ public add(r: n2): Data | false { // invalid arguments if (r[0] > r[1]) { return false; } const len = this.data.length; // this.data is empty if (!len) { this.data.push(r); return this.data; } // additional item is less than any in array let d = this.data[0]; if (r[1] < d[0] - 1) { this.data.unshift(r); return this.data; } // additional item is greater than any in array d = this.data[len - 1]; if (r[0] > d[1] + 1) { this.data.push(r); return this.data; } // find the items from the array what is covered all and part of range array by additional range // and result is the found first and end item index number: firstIndex, endIndex let firstIndex = -1, endIndex = -1; for (let i = 0; i < len; i++) { let d = this.data[i]; if (firstIndex < 0 && r[0] >= d[0] - 1 && r[0] <= d[1] + 1) { firstIndex = i; } if (r[1] >= d[0] - 1 && r[1] <= d[1] + 1) { endIndex = i; } if (r[1] < d[0] - 1) { break; } } if (firstIndex < 0) { firstIndex = 0; } if (endIndex < 0) { endIndex = len - 1; } // make the new range: [a, b] let a = this.data[firstIndex][0]; if (a > r[0]) { a = r[0]; } let b = this.data[endIndex][1]; if (b < r[1]) { b = r[1]; } // remove and add range items this.data.splice(firstIndex, endIndex - firstIndex + 1, [a, b]); return this.data; } /** * Remove range * * @param r range array [a, b] * @returns range items array list [ [a, b], [c, d], ... ], or false */ public remove(r: n2): Data | false { // invalid arguments if (r[0] > r[1]) { return false; } const len = this.data.length; // this.data is empty if (!len) { return this.data; } // remove range is less than any in array let d = this.data[0]; if (r[1] < d[0]) { return this.data; } // remove range is greater than any in array d = this.data[len - 1]; if (r[0] > d[1]) { return this.data; } // find the items from the array what is covered all and part of range array by remove range // and result is the found first and end item index number: firstIndex, endIndex let firstIndex = -1, endIndex = -1; for (let i = 0; i < len; i++) { let d = this.data[i]; if (firstIndex < 0 && r[0] >= d[0] && r[0] <= d[1]) { firstIndex = i; } if (r[1] >= d[0]) { endIndex = i; } if (r[1] < d[0]) { break; } } if (firstIndex < 0) { firstIndex = 0; } if (endIndex < 0) { endIndex = len - 1; } // d = this.data[firstIndex]; if (r[0] == d[0] && r[1] >= d[1]) { // remove firstIndex range } else if (r[0] < d[0]) { if (r[1] < d[1]) { this.data[firstIndex] = [r[1] + 1, d[1]]; firstIndex += 1; } else { // r[1] >= d[1] // remove firstIndex range } } else { // d[0] <= r[0] <= d[1] if (r[1] < d[1]) { this.data[firstIndex] = [d[0], r[0] - 1]; firstIndex += 1; this.data.splice(firstIndex, 0, [r[1] + 1, d[1]]); firstIndex += 1; } else { // r[1] >= d[1] this.data[firstIndex] = [d[0], r[0] - 1]; firstIndex += 1; } } // d = this.data[endIndex]; if (r[0] > d[0]) { endIndex -= 1; } if (r[1] < d[1]) { this.data[endIndex] = [r[1] + 1, d[1]]; endIndex -= 1; } else { // nothing } // remove items this.data.splice(firstIndex, endIndex - firstIndex + 1); return this.data; } /** * @returns range array, like this: [ [a, b], [c, d], ... ] */ public get(): Data { return this.data; } public clear() { this.data = []; } /** * @returns count of ranges in array */ public length(): number { return this.data.length; } } |
整数の範囲を扱うコレクションクラス?が欲しかったのですが、
ありそうで見つからず。もっとスマートな方法がないだろうか。
It seems to exist such this code, but I could not find it. Is there a smarter way?