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 | 1× 1× 1× 1× 1× 1× 1× 1× 1× 1× 96× 96× 96× 1× 95× 95× 96× 1× 1× 13× 13× 13× 1× 12× 1× 1× 1× 48× 48× 48× 48× 1× 47× 1× 46× 1× 45× 45× 1× 44× 1× 43× 1× 42× 42× 1× 41× 41× 41× 9× 41× 150× 41× 1× 1× 49× 49× 49× 41× 40× 1× 8× 1× 8× 1× 1× 48× 48× 1× 1× 5× 2× 3× 1× 2× 1× 2× 2× 9× 3× 3× 3× 1× 2× 1× 1× 46× 46× 1× 45× 45× 14× 45× 45× 1× 44× 75× 1× 1× 43× 43× 1× 1× 3× 3× 1× 2× 2× 2× 1× 2× 1× 1× 5× 1× 4× 1× 3× 3× 2× 10× 1× 1× 2× 1× 1× 1× 1× 2× 1× 2× 1× 1× 1× 2× 1× 3× 1× 1× 4× 1× 3× 3× 1× 2× 2× 1× 2× 1× 1× 42× 42× 2× 40× 1× 39× 39× 37× 161× 41× 41× 2× 2× 18× 3× 3× 3× 1× 2× 3× 39× 1× 1× 8× 8× 1× 7× 7× 18× 7× 1× 1× 7× 7× 2× 5× 2× 3× 1× 2× 2× 1003× 1003× 2× 1× 1× 6× 6× 1× 5× 1× 1× 1× 1× 6× 6× 6× 27× 27× 6× 4× 6× 44× 21× 6× 1× | /*! * @author electricessence / https://github.com/electricessence/ * Licensing: MIT https://github.com/electricessence/TypeScript.NET/blob/master/LICENSE.md */ (function (factory) { Eif (typeof module === 'object' && typeof module.exports === 'object') { var v = factory(require, exports); Iif (v !== undefined) module.exports = v; } else if (typeof define === 'function' && define.amd) { define(["require", "exports", "../../Types", "../../Integer", "../../Compare", "../../Exceptions/ArgumentException", "../../Exceptions/ArgumentNullException", "../../Exceptions/ArgumentOutOfRangeException"], factory); } })(function (require, exports) { "use strict"; var Types_1 = require("../../Types"); var Integer_1 = require("../../Integer"); var Compare_1 = require("../../Compare"); var ArgumentException_1 = require("../../Exceptions/ArgumentException"); var ArgumentNullException_1 = require("../../Exceptions/ArgumentNullException"); var ArgumentOutOfRangeException_1 = require("../../Exceptions/ArgumentOutOfRangeException"); function initialize(length) { Integer_1.Integer.assert(length, 'length'); var array; if (length > 65536) array = new Array(length); else { array = []; array.length = length; } return array; } exports.initialize = initialize; function copy(source, sourceIndex, length) { if (sourceIndex === void 0) { sourceIndex = 0; } if (length === void 0) { length = Infinity; } if (!source) return source; return copyTo(source, initialize(Math.min(length, Math.max(source.length - sourceIndex, 0))), sourceIndex, 0, length); } exports.copy = copy; var CBN = 'Cannot be null.', CB0 = 'Cannot be zero.', CBL0 = 'Cannot be less than zero.', VFN = 'Must be a valid finite number'; function copyTo(source, destination, sourceIndex, destinationIndex, length) { if (sourceIndex === void 0) { sourceIndex = 0; } if (destinationIndex === void 0) { destinationIndex = 0; } if (length === void 0) { length = Infinity; } if (!source) throw new ArgumentNullException_1.ArgumentNullException('source', CBN); if (!destination) throw new ArgumentNullException_1.ArgumentNullException('destination', CBN); if (sourceIndex < 0) throw new ArgumentOutOfRangeException_1.ArgumentOutOfRangeException('sourceIndex', sourceIndex, CBL0); var sourceLength = source.length; if (!sourceLength) return destination; if (sourceIndex >= sourceLength) throw new ArgumentOutOfRangeException_1.ArgumentOutOfRangeException('sourceIndex', sourceIndex, 'Must be less than the length of the source array.'); if (destination.length < 0) throw new ArgumentOutOfRangeException_1.ArgumentOutOfRangeException('destinationIndex', destinationIndex, CBL0); var maxLength = source.length - sourceIndex; if (isFinite(length) && length > maxLength) throw new ArgumentOutOfRangeException_1.ArgumentOutOfRangeException('sourceIndex', sourceIndex, 'Source index + length cannot exceed the length of the source array.'); length = Math.min(length, maxLength); var newLength = destinationIndex + length; if (newLength > destination.length) destination.length = newLength; for (var i = 0; i < length; i++) { destination[destinationIndex + i] = source[sourceIndex + i]; } return destination; } exports.copyTo = copyTo; function indexOf(array, item, equalityComparer) { if (equalityComparer === void 0) { equalityComparer = Compare_1.areEqual; } var len = array && array.length; if (len) { if (Array.isArray(array) && !Types_1.Type.isTrueNaN(item)) return array.indexOf(item); for (var i = 0; i < len; i++) { if (equalityComparer(array[i], item)) return i; } } return -1; } exports.indexOf = indexOf; function contains(array, item, equalityComparer) { if (equalityComparer === void 0) { equalityComparer = Compare_1.areEqual; } return indexOf(array, item, equalityComparer) != -1; } exports.contains = contains; function replace(array, old, newValue, max) { if (!array || !array.length || max === 0) return 0; if (max < 0) throw new ArgumentOutOfRangeException_1.ArgumentOutOfRangeException('max', max, CBL0); if (!max) max = Infinity; var count = 0; for (var i = 0, len = array.length; i < len; i++) { if (array[i] === old) { array[i] = newValue; ++count; if (count == max) break; } } return count; } exports.replace = replace; function updateRange(array, value, start, stop) { if (start === void 0) { start = 0; } if (!array) return; Integer_1.Integer.assertZeroOrGreater(start, 'start'); if (!stop && stop !== 0) stop = array.length; Integer_1.Integer.assert(stop, 'stop'); if (stop < start) throw new ArgumentOutOfRangeException_1.ArgumentOutOfRangeException("stop", stop, "is less than start"); for (var i = start; i < stop; i++) { array[i] = value; } } exports.updateRange = updateRange; function clear(array, start, stop) { if (start === void 0) { start = 0; } updateRange(array, null, start, stop); } exports.clear = clear; function register(array, item, equalityComparer) { if (equalityComparer === void 0) { equalityComparer = Compare_1.areEqual; } if (!array) throw new ArgumentNullException_1.ArgumentNullException('array', CBN); var len = array.length; var ok = !len || !contains(array, item, equalityComparer); if (ok) array[len] = item; return ok; } exports.register = register; function findIndex(array, predicate) { if (!array) throw new ArgumentNullException_1.ArgumentNullException('array', CBN); if (!Types_1.Type.isFunction(predicate)) throw new ArgumentException_1.ArgumentException('predicate', 'Must be a function.'); var len = array.length; if (Array.isArray(array)) { for (var i = 0; i < len; i++) { if (predicate(array[i])) return i; } } else { for (var i = 0; i < len; i++) { if ((i) in (array) && predicate(array[i])) return i; } } return -1; } exports.findIndex = findIndex; function forEach(source, action) { if (source && action) { for (var i = 0; i < source.length; i++) { if (action(source[i], i) === false) break; } } } exports.forEach = forEach; function applyTo(target, fn) { if (target && fn) { for (var i = 0; i < target.length; i++) { target[i] = fn(target[i]); } } } exports.applyTo = applyTo; function removeIndex(array, index) { if (!array) throw new ArgumentNullException_1.ArgumentNullException('array', CBN); Integer_1.Integer.assert(index, 'index'); if (index < 0) throw new ArgumentOutOfRangeException_1.ArgumentOutOfRangeException('index', index, CBL0); var exists = index < array.length; if (exists) array.splice(index, 1); return exists; } exports.removeIndex = removeIndex; function remove(array, value, max, equalityComparer) { if (equalityComparer === void 0) { equalityComparer = Compare_1.areEqual; } if (!array || !array.length || max === 0) return 0; if (max < 0) throw new ArgumentOutOfRangeException_1.ArgumentOutOfRangeException('max', max, CBL0); var count = 0; if (!max || !isFinite(max)) { for (var i = (array.length - 1); i >= 0; i--) { if (equalityComparer(array[i], value)) { array.splice(i, 1); ++count; } } } else { var found = []; for (var i = 0, len = array.length; i < len; i++) { if (equalityComparer(array[i], value)) { found.push(i); ++count; if (count == max) break; } } for (var i = found.length - 1; i >= 0; i--) { array.splice(found[i], 1); } } return count; } exports.remove = remove; function repeat(element, count) { Integer_1.Integer.assert(count, 'count'); if (count < 0) throw new ArgumentOutOfRangeException_1.ArgumentOutOfRangeException('count', count, CBL0); var result = initialize(count); for (var i = 0; i < count; i++) { result[i] = element; } return result; } exports.repeat = repeat; function range(first, count, step) { if (step === void 0) { step = 1; } if (isNaN(first) || !isFinite(first)) throw new ArgumentOutOfRangeException_1.ArgumentOutOfRangeException('first', first, VFN); if (isNaN(count) || !isFinite(count)) throw new ArgumentOutOfRangeException_1.ArgumentOutOfRangeException('count', count, VFN); if (count < 0) throw new ArgumentOutOfRangeException_1.ArgumentOutOfRangeException('count', count, CBL0); var result = initialize(count); for (var i = 0; i < count; i++) { result[i] = first; first += step; } return result; } exports.range = range; function rangeUntil(first, until, step) { if (step === void 0) { step = 1; } if (step == 0) throw new ArgumentOutOfRangeException_1.ArgumentOutOfRangeException('step', step, CB0); return range(first, (until - first) / step, step); } exports.rangeUntil = rangeUntil; function distinct(source) { var seen = {}; return source.filter(function (e) { return !(e in seen) && (seen[e] = true); }); } exports.distinct = distinct; function flatten(a, recurseDepth) { if (recurseDepth === void 0) { recurseDepth = 0; } var result = []; for (var i = 0; i < a.length; i++) { var x = a[i]; if (Array.isArray(x)) { if (recurseDepth > 0) x = flatten(x, recurseDepth - 1); for (var n = 0; n < x.length; n++) result.push(x[n]); } else result.push(x); } return result; } exports.flatten = flatten; }); //# sourceMappingURL=Utility.js.map |