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 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 | 1 1 1 1 1 1 1 1 1 4202554 1 1 23 1 7 7 7 58 7 1 4157 4157 4157 8913248 1 46 46 4144 4104 1 4198410 4194306 4104 1 10 2 8 8 1 1 8270 8270 1 8270 1 1 4194312 1 4194312 1 1 8296 8296 26 8270 20 8250 8296 1 66 66 66 66 5 5 61 1 4130 4130 4130 4130 4130 4130 4130 4456606 4456576 4456576 4456576 30 12 12 18 18 30 30 30 4130 12 12 4118 2 2 4116 4116 4130 2 4128 1 27 27 27 27 4456642 4106 4452536 258220 4194316 4194312 4 23 23 4098 4098 23 23 20 23 6 23 6 23 1 14 1 13 1 12 67575952 12 1 6 1 9 1 8 1 7 7 101 7 1 4 1 1 1 1 1 | /*! http://mths.be/regenerate v0.1.0 by @mathias */ ;(function(root) { // Detect free variables `exports` var freeExports = typeof exports == 'object' && exports; // Detect free variable `module` var freeModule = typeof module == 'object' && module && module.exports == freeExports && module; // Detect free variable `global`, from Node.js or Browserified code, // and use it as `root` var freeGlobal = typeof global == 'object' && global; Eif (freeGlobal.global === freeGlobal || freeGlobal.window === freeGlobal) { root = freeGlobal; } /*--------------------------------------------------------------------------*/ var object = {}; var hasOwnProperty = object.hasOwnProperty; var hasKey = function(object, key) { return hasOwnProperty.call(object, key); }; var toString = object.toString; var isArray = function(object) { return toString.call(object) == '[object Array]'; }; var map = function(array, callback) { var index = -1; var length = array.length; while (++index < length) { array[index] = callback(array[index]); } return array; }; var forEach = function(array, callback) { var index = -1; var length = array.length; while (++index < length) { callback(array[index]); } }; var forOwn = function(object, callback) { var key; for (key in object) { if (hasKey(object, key)) { callback(key, object[key]); } } }; var append = function(object, key, value) { if (hasKey(object, key)) { object[key].push(value); } else { object[key] = [value]; } }; var range = function(start, stop) { // inclusive, e.g. `range(1, 3)` → `[1, 2, 3]` if (stop < start) { throw Error('A range\u2019s `stop` value must be greater than or equal ' + 'to the `start` value.'); } for (var result = []; start <= stop; result.push(start++)); return result; }; // This assumes that `number` is a positive integer that `toString()`s nicely // (which is the case for all code point values). var zeroes = '0000'; var pad = function(number, totalCharacters) { var string = String(number); return string.length < totalCharacters ? (zeroes + string).slice(-totalCharacters) : string; }; var hex = function(number) { return Number(number).toString(16).toUpperCase(); }; /*--------------------------------------------------------------------------*/ // http://mathiasbynens.be/notes/javascript-encoding#surrogate-formulae var floor = Math.floor; var highSurrogate = function(codePoint) { return parseInt(floor((codePoint - 0x10000) / 0x400) + 0xD800, 10); }; var lowSurrogate = function(codePoint) { return parseInt((codePoint - 0x10000) % 0x400 + 0xDC00, 10); }; var stringFromCharCode = String.fromCharCode; var codePointToString = function(codePoint) { var string; if ( (codePoint >= 0x41 && codePoint <= 0x5A) || (codePoint >= 0x61 && codePoint <= 0x7A) || (codePoint >= 0x30 && codePoint <= 0x39) ) { // [a-zA-Z0-9] string = stringFromCharCode(codePoint); } else if (codePoint <= 0xFF) { // http://mathiasbynens.be/notes/javascript-escapes#hexadecimal string = '\\x' + pad(hex(codePoint), 2); } else { // if (codePoint <= 0xFFFF) // http://mathiasbynens.be/notes/javascript-escapes#unicode string = '\\u' + pad(hex(codePoint), 4); } // There’s no need to account for astral symbols / surrogate pairs here, // since `codePointToString` is private and only used for BMP code points. // But if that’s what you need, just add an `else` block with this code: // // string = '\\u' + pad(hex(highSurrogate(codePoint)), 4) // + '\\u' + pad(hex(lowSurrogate(codePoint)), 4); return string; }; // Based on `punycode.ucs2.decode`: http://mths.be/punycode function symbolToCodePoint(symbol) { var length = symbol.length; var value = symbol.charCodeAt(0); var extra; if ((value & 0xF800) == 0xD800 && length > 1) { // `value` is a high surrogate, and there is a next character — assume // it’s a low surrogate (else it’s invalid use of Regenerate anyway). extra = symbol.charCodeAt(1); return ((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000; } else { return value; } } var createBMPCharacterClasses = function(codePoints) { var tmp = []; var start = codePoints[0]; var end = codePoints[0]; var predict = start + 1; codePoints = codePoints.slice(1); var counter = 0; forEach(codePoints, function(code) { if (predict == code) { end = code; predict = code + 1; return; } if (start == end) { tmp.push(codePointToString(start)); counter += 1; } else { tmp.push(codePointToString(start) + '-' + codePointToString(end)); counter += 2; } start = code; end = code; predict = code + 1; }); if (start == end) { tmp.push(codePointToString(start)); counter += 1; } else if (end == start + 1) { tmp.push(codePointToString(start) + codePointToString(end)); counter += 2; } else { tmp.push(codePointToString(start) + '-' + codePointToString(end)); counter += 2; } if (counter == 1) { return tmp.join(''); } else { return '[' + tmp.join('') + ']'; } }; var createCharacterClasses = function(codePoints) { // At this point, it’s safe to assume `codePoints` is a sorted array of // numeric code point values. var bmp = []; var astralMap = {}; var surrogates = []; forEach(codePoints, function(codePoint) { if (codePoint >= 0xD800 && codePoint <= 0xDBFF) { // If a high surrogate is followed by a low surrogate, the two code // units should be matched together, so that the regex always matches a // full code point. For this reason, separate code points that are // (unmatched) high surrogates go at the end. surrogates.push(codePoint); } else if (codePoint >= 0x0000 && codePoint <= 0xFFFF) { // non-surrogate BMP code point bmp.push(codePoint); } else if (codePoint >= 0x010000 && codePoint <= 0x10FFFF) { // astral code point append( astralMap, highSurrogate(codePoint), lowSurrogate(codePoint) ); } else { throw RangeError('Invalid code point value. Code points range from ' + 'U+000000 to U+10FFFF.'); } }); var astralMapByLowRanges = {}; forOwn(astralMap, function(highSurrogate, lowSurrogate) { var bmpRange = createBMPCharacterClasses(lowSurrogate); append(astralMapByLowRanges, bmpRange, +highSurrogate); }); var tmp = []; if (bmp.length) { tmp.push(createBMPCharacterClasses(bmp)); } forOwn(astralMapByLowRanges, function(lowSurrogate, highSurrogate) { tmp.push(createBMPCharacterClasses(highSurrogate) + lowSurrogate); }); // individual code points that are high surrogates must go at the end if (surrogates.length) { tmp.push(createBMPCharacterClasses(surrogates)); } return tmp .join('|') // use `\0` instead of `\x00` where possible .replace(/\\x00([^01234567]|$)/g, '\\0$1'); }; var fromCodePoints = function(codePoints) { if (!isArray(codePoints)) { throw TypeError('The argument to `fromCodePoints` must be an array.'); } if (!codePoints.length) { return ''; } // Sort code points numerically codePoints = codePoints.sort(function(a, b) { return a - b; }); return createCharacterClasses(codePoints); }; var fromCodePointRange = function(start, end) { return createCharacterClasses(range(start, end)); }; var fromSymbols = function(symbols) { if (!isArray(symbols)) { throw TypeError('The argument to `fromSymbols` must be an array.'); } if (!symbols.length) { return ''; } var codePoints = map(symbols, symbolToCodePoint); // Sort code points numerically codePoints = codePoints.sort(function(a, b) { return a - b; }); return createCharacterClasses(codePoints); }; var fromSymbolRange = function(start, end) { return createCharacterClasses( range(symbolToCodePoint(start), symbolToCodePoint(end)) ); }; /*--------------------------------------------------------------------------*/ var regenerate = { 'version': '0.1.0', 'fromCodePoints': fromCodePoints, 'fromCodePointRange': fromCodePointRange, 'fromSymbols': fromSymbols, 'fromSymbolRange': fromSymbolRange, 'range': range }; // Some AMD build optimizers, like r.js, check for specific condition patterns // like the following: Iif ( typeof define == 'function' && typeof define.amd == 'object' && define.amd ) { define(function() { return regenerate; }); } else Eif (freeExports && !freeExports.nodeType) { Eif (freeModule) { // in Node.js or RingoJS v0.8.0+ freeModule.exports = regenerate; } else { // in Narwhal or RingoJS v0.7.0- forOwn(regenerate, function(key, value) { freeExports[key] = value; }); } } else { // in Rhino or a web browser root.regenerate = regenerate; } }(this)); |