aboutsummaryrefslogtreecommitdiff
path: root/node_modules/to-regex-range
diff options
context:
space:
mode:
Diffstat (limited to 'node_modules/to-regex-range')
-rw-r--r--node_modules/to-regex-range/LICENSE21
-rw-r--r--node_modules/to-regex-range/README.md281
-rw-r--r--node_modules/to-regex-range/index.js294
-rw-r--r--node_modules/to-regex-range/package.json86
4 files changed, 0 insertions, 682 deletions
diff --git a/node_modules/to-regex-range/LICENSE b/node_modules/to-regex-range/LICENSE
deleted file mode 100644
index 83b56e709..000000000
--- a/node_modules/to-regex-range/LICENSE
+++ /dev/null
@@ -1,21 +0,0 @@
-The MIT License (MIT)
-
-Copyright (c) 2015-2017, Jon Schlinkert
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.
diff --git a/node_modules/to-regex-range/README.md b/node_modules/to-regex-range/README.md
deleted file mode 100644
index 2763c5aef..000000000
--- a/node_modules/to-regex-range/README.md
+++ /dev/null
@@ -1,281 +0,0 @@
-# to-regex-range [![NPM version](https://img.shields.io/npm/v/to-regex-range.svg?style=flat)](https://www.npmjs.com/package/to-regex-range) [![NPM monthly downloads](https://img.shields.io/npm/dm/to-regex-range.svg?style=flat)](https://npmjs.org/package/to-regex-range) [![NPM total downloads](https://img.shields.io/npm/dt/to-regex-range.svg?style=flat)](https://npmjs.org/package/to-regex-range) [![Linux Build Status](https://img.shields.io/travis/micromatch/to-regex-range.svg?style=flat&label=Travis)](https://travis-ci.org/micromatch/to-regex-range)
-
-> Pass two numbers, get a regex-compatible source string for matching ranges. Validated against more than 2.78 million test assertions.
-
-## Install
-
-Install with [npm](https://www.npmjs.com/):
-
-```sh
-$ npm install --save to-regex-range
-```
-
-Install with [yarn](https://yarnpkg.com):
-
-```sh
-$ yarn add to-regex-range
-```
-
-<details>
-<summary><strong>What does this do?</strong></summary>
-
-<br>
-
-This libary generates the `source` string to be passed to `new RegExp()` for matching a range of numbers.
-
-**Example**
-
-```js
-var toRegexRange = require('to-regex-range');
-var regex = new RegExp(toRegexRange('15', '95'));
-```
-
-A string is returned so that you can do whatever you need with it before passing it to `new RegExp()` (like adding `^` or `$` boundaries, defining flags, or combining it another string).
-
-<br>
-
-</details>
-
-<details>
-<summary><strong>Why use this library?</strong></summary>
-
-<br>
-
-### Convenience
-
-Creating regular expressions for matching numbers gets deceptively complicated pretty fast.
-
-For example, let's say you need a validation regex for matching part of a user-id, postal code, social security number, tax id, etc:
-
-* regex for matching `1` => `/1/` (easy enough)
-* regex for matching `1` through `5` => `/[1-5]/` (not bad...)
-* regex for matching `1` or `5` => `/(1|5)/` (still easy...)
-* regex for matching `1` through `50` => `/([1-9]|[1-4][0-9]|50)/` (uh-oh...)
-* regex for matching `1` through `55` => `/([1-9]|[1-4][0-9]|5[0-5])/` (no prob, I can do this...)
-* regex for matching `1` through `555` => `/([1-9]|[1-9][0-9]|[1-4][0-9]{2}|5[0-4][0-9]|55[0-5])/` (maybe not...)
-* regex for matching `0001` through `5555` => `/(0{3}[1-9]|0{2}[1-9][0-9]|0[1-9][0-9]{2}|[1-4][0-9]{3}|5[0-4][0-9]{2}|55[0-4][0-9]|555[0-5])/` (okay, I get the point!)
-
-The numbers are contrived, but they're also really basic. In the real world you might need to generate a regex on-the-fly for validation.
-
-**Learn more**
-
-If you're interested in learning more about [character classes](http://www.regular-expressions.info/charclass.html) and other regex features, I personally have always found [regular-expressions.info](http://www.regular-expressions.info/charclass.html) to be pretty useful.
-
-### Heavily tested
-
-As of April 27, 2017, this library runs [2,783,483 test assertions](./test/test.js) against generated regex-ranges to provide brute-force verification that results are indeed correct.
-
-Tests run in ~870ms on my MacBook Pro, 2.5 GHz Intel Core i7.
-
-### Highly optimized
-
-Generated regular expressions are highly optimized:
-
-* duplicate sequences and character classes are reduced using quantifiers
-* smart enough to use `?` conditionals when number(s) or range(s) can be positive or negative
-* uses fragment caching to avoid processing the same exact string more than once
-
-<br>
-
-</details>
-
-## Usage
-
-Add this library to your javascript application with the following line of code
-
-```js
-var toRegexRange = require('to-regex-range');
-```
-
-The main export is a function that takes two integers: the `min` value and `max` value (formatted as strings or numbers).
-
-```js
-var source = toRegexRange('15', '95');
-//=> 1[5-9]|[2-8][0-9]|9[0-5]
-
-var re = new RegExp('^' + source + '$');
-console.log(re.test('14')); //=> false
-console.log(re.test('50')); //=> true
-console.log(re.test('94')); //=> true
-console.log(re.test('96')); //=> false
-```
-
-## Options
-
-### options.capture
-
-**Type**: `boolean`
-
-**Deafault**: `undefined`
-
-Wrap the returned value in parentheses when there is more than one regex condition. Useful when you're dynamically generating ranges.
-
-```js
-console.log(toRegexRange('-10', '10'));
-//=> -[1-9]|-?10|[0-9]
-
-console.log(toRegexRange('-10', '10', {capture: true}));
-//=> (-[1-9]|-?10|[0-9])
-```
-
-### options.shorthand
-
-**Type**: `boolean`
-
-**Deafault**: `undefined`
-
-Use the regex shorthand for `[0-9]`:
-
-```js
-console.log(toRegexRange('0', '999999'));
-//=> [0-9]|[1-9][0-9]{1,5}
-
-console.log(toRegexRange('0', '999999', {shorthand: true}));
-//=> \d|[1-9]\d{1,5}
-```
-
-### options.relaxZeros
-
-**Type**: `boolean`
-
-**Default**: `true`
-
-This option only applies to **negative zero-padded ranges**. By default, when a negative zero-padded range is defined, the number of leading zeros is relaxed using `-0*`.
-
-```js
-console.log(toRegexRange('-001', '100'));
-//=> -0*1|0{2}[0-9]|0[1-9][0-9]|100
-
-console.log(toRegexRange('-001', '100', {relaxZeros: false}));
-//=> -0{2}1|0{2}[0-9]|0[1-9][0-9]|100
-```
-
-<details>
-<summary><strong>Why are zeros relaxed for negative zero-padded ranges by default?</strong></summary>
-
-Consider the following.
-
-```js
-var regex = toRegexRange('-001', '100');
-```
-
-_Note that `-001` and `100` are both three digits long_.
-
-In most zero-padding implementations, only a single leading zero is enough to indicate that zero-padding should be applied. Thus, the leading zeros would be "corrected" on the negative range in the example to `-01`, instead of `-001`, to make total length of each string no greater than the length of the largest number in the range (in other words, `-001` is 4 digits, but `100` is only three digits).
-
-If zeros were not relaxed by default, you might expect the resulting regex of the above pattern to match `-001` - given that it's defined that way in the arguments - _but it wouldn't_. It would, however, match `-01`. This gets even more ambiguous with large ranges, like `-01` to `1000000`.
-
-Thus, we relax zeros by default to provide a more predictable experience for users.
-
-</details>
-
-## Examples
-
-| **Range** | **Result** | **Compile time** |
-| --- | --- | --- |
-| `toRegexRange('5, 5')` | `5` | _33μs_ |
-| `toRegexRange('5, 6')` | `5\|6` | _53μs_ |
-| `toRegexRange('29, 51')` | `29\|[34][0-9]\|5[01]` | _699μs_ |
-| `toRegexRange('31, 877')` | `3[1-9]\|[4-9][0-9]\|[1-7][0-9]{2}\|8[0-6][0-9]\|87[0-7]` | _711μs_ |
-| `toRegexRange('111, 555')` | `11[1-9]\|1[2-9][0-9]\|[2-4][0-9]{2}\|5[0-4][0-9]\|55[0-5]` | _62μs_ |
-| `toRegexRange('-10, 10')` | `-[1-9]\|-?10\|[0-9]` | _74μs_ |
-| `toRegexRange('-100, -10')` | `-1[0-9]\|-[2-9][0-9]\|-100` | _49μs_ |
-| `toRegexRange('-100, 100')` | `-[1-9]\|-?[1-9][0-9]\|-?100\|[0-9]` | _45μs_ |
-| `toRegexRange('001, 100')` | `0{2}[1-9]\|0[1-9][0-9]\|100` | _158μs_ |
-| `toRegexRange('0010, 1000')` | `0{2}1[0-9]\|0{2}[2-9][0-9]\|0[1-9][0-9]{2}\|1000` | _61μs_ |
-| `toRegexRange('1, 2')` | `1\|2` | _10μs_ |
-| `toRegexRange('1, 5')` | `[1-5]` | _24μs_ |
-| `toRegexRange('1, 10')` | `[1-9]\|10` | _23μs_ |
-| `toRegexRange('1, 100')` | `[1-9]\|[1-9][0-9]\|100` | _30μs_ |
-| `toRegexRange('1, 1000')` | `[1-9]\|[1-9][0-9]{1,2}\|1000` | _52μs_ |
-| `toRegexRange('1, 10000')` | `[1-9]\|[1-9][0-9]{1,3}\|10000` | _47μs_ |
-| `toRegexRange('1, 100000')` | `[1-9]\|[1-9][0-9]{1,4}\|100000` | _44μs_ |
-| `toRegexRange('1, 1000000')` | `[1-9]\|[1-9][0-9]{1,5}\|1000000` | _49μs_ |
-| `toRegexRange('1, 10000000')` | `[1-9]\|[1-9][0-9]{1,6}\|10000000` | _63μs_ |
-
-## Heads up!
-
-**Order of arguments**
-
-When the `min` is larger than the `max`, values will be flipped to create a valid range:
-
-```js
-toRegexRange('51', '29');
-```
-
-Is effectively flipped to:
-
-```js
-toRegexRange('29', '51');
-//=> 29|[3-4][0-9]|5[0-1]
-```
-
-**Steps / increments**
-
-This library does not support steps (increments). A pr to add support would be welcome.
-
-## History
-
-### v2.0.0 - 2017-04-21
-
-**New features**
-
-Adds support for zero-padding!
-
-### v1.0.0
-
-**Optimizations**
-
-Repeating ranges are now grouped using quantifiers. rocessing time is roughly the same, but the generated regex is much smaller, which should result in faster matching.
-
-## Attribution
-
-Inspired by the python library [range-regex](https://github.com/dimka665/range-regex).
-
-## About
-
-### Related projects
-
-* [expand-range](https://www.npmjs.com/package/expand-range): Fast, bash-like range expansion. Expand a range of numbers or letters, uppercase or lowercase. See… [more](https://github.com/jonschlinkert/expand-range) | [homepage](https://github.com/jonschlinkert/expand-range "Fast, bash-like range expansion. Expand a range of numbers or letters, uppercase or lowercase. See the benchmarks. Used by micromatch.")
-* [fill-range](https://www.npmjs.com/package/fill-range): Fill in a range of numbers or letters, optionally passing an increment or `step` to… [more](https://github.com/jonschlinkert/fill-range) | [homepage](https://github.com/jonschlinkert/fill-range "Fill in a range of numbers or letters, optionally passing an increment or `step` to use, or create a regex-compatible range with `options.toRegex`")
-* [micromatch](https://www.npmjs.com/package/micromatch): Glob matching for javascript/node.js. A drop-in replacement and faster alternative to minimatch and multimatch. | [homepage](https://github.com/jonschlinkert/micromatch "Glob matching for javascript/node.js. A drop-in replacement and faster alternative to minimatch and multimatch.")
-* [repeat-element](https://www.npmjs.com/package/repeat-element): Create an array by repeating the given value n times. | [homepage](https://github.com/jonschlinkert/repeat-element "Create an array by repeating the given value n times.")
-* [repeat-string](https://www.npmjs.com/package/repeat-string): Repeat the given string n times. Fastest implementation for repeating a string. | [homepage](https://github.com/jonschlinkert/repeat-string "Repeat the given string n times. Fastest implementation for repeating a string.")
-
-### Contributing
-
-Pull requests and stars are always welcome. For bugs and feature requests, [please create an issue](../../issues/new).
-
-### Building docs
-
-_(This project's readme.md is generated by [verb](https://github.com/verbose/verb-generate-readme), please don't edit the readme directly. Any changes to the readme must be made in the [.verb.md](.verb.md) readme template.)_
-
-To generate the readme, run the following command:
-
-```sh
-$ npm install -g verbose/verb#dev verb-generate-readme && verb
-```
-
-### Running tests
-
-Running and reviewing unit tests is a great way to get familiarized with a library and its API. You can install dependencies and run tests with the following command:
-
-```sh
-$ npm install && npm test
-```
-
-### Author
-
-**Jon Schlinkert**
-
-* [github/jonschlinkert](https://github.com/jonschlinkert)
-* [twitter/jonschlinkert](https://twitter.com/jonschlinkert)
-
-### License
-
-Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
-Released under the [MIT License](LICENSE).
-
-***
-
-_This file was generated by [verb-generate-readme](https://github.com/verbose/verb-generate-readme), v0.6.0, on April 27, 2017._ \ No newline at end of file
diff --git a/node_modules/to-regex-range/index.js b/node_modules/to-regex-range/index.js
deleted file mode 100644
index 7bb5a743e..000000000
--- a/node_modules/to-regex-range/index.js
+++ /dev/null
@@ -1,294 +0,0 @@
-/*!
- * to-regex-range <https://github.com/jonschlinkert/to-regex-range>
- *
- * Copyright (c) 2015, 2017, Jon Schlinkert.
- * Released under the MIT License.
- */
-
-'use strict';
-
-var repeat = require('repeat-string');
-var isNumber = require('is-number');
-var cache = {};
-
-function toRegexRange(min, max, options) {
- if (isNumber(min) === false) {
- throw new RangeError('toRegexRange: first argument is invalid.');
- }
-
- if (typeof max === 'undefined' || min === max) {
- return String(min);
- }
-
- if (isNumber(max) === false) {
- throw new RangeError('toRegexRange: second argument is invalid.');
- }
-
- options = options || {};
- var relax = String(options.relaxZeros);
- var shorthand = String(options.shorthand);
- var capture = String(options.capture);
- var key = min + ':' + max + '=' + relax + shorthand + capture;
- if (cache.hasOwnProperty(key)) {
- return cache[key].result;
- }
-
- var a = Math.min(min, max);
- var b = Math.max(min, max);
-
- if (Math.abs(a - b) === 1) {
- var result = min + '|' + max;
- if (options.capture) {
- return '(' + result + ')';
- }
- return result;
- }
-
- var isPadded = padding(min) || padding(max);
- var positives = [];
- var negatives = [];
-
- var tok = {min: min, max: max, a: a, b: b};
- if (isPadded) {
- tok.isPadded = isPadded;
- tok.maxLen = String(tok.max).length;
- }
-
- if (a < 0) {
- var newMin = b < 0 ? Math.abs(b) : 1;
- var newMax = Math.abs(a);
- negatives = splitToPatterns(newMin, newMax, tok, options);
- a = tok.a = 0;
- }
-
- if (b >= 0) {
- positives = splitToPatterns(a, b, tok, options);
- }
-
- tok.negatives = negatives;
- tok.positives = positives;
- tok.result = siftPatterns(negatives, positives, options);
-
- if (options.capture && (positives.length + negatives.length) > 1) {
- tok.result = '(' + tok.result + ')';
- }
-
- cache[key] = tok;
- return tok.result;
-}
-
-function siftPatterns(neg, pos, options) {
- var onlyNegative = filterPatterns(neg, pos, '-', false, options) || [];
- var onlyPositive = filterPatterns(pos, neg, '', false, options) || [];
- var intersected = filterPatterns(neg, pos, '-?', true, options) || [];
- var subpatterns = onlyNegative.concat(intersected).concat(onlyPositive);
- return subpatterns.join('|');
-}
-
-function splitToRanges(min, max) {
- min = Number(min);
- max = Number(max);
-
- var nines = 1;
- var stops = [max];
- var stop = +countNines(min, nines);
-
- while (min <= stop && stop <= max) {
- stops = push(stops, stop);
- nines += 1;
- stop = +countNines(min, nines);
- }
-
- var zeros = 1;
- stop = countZeros(max + 1, zeros) - 1;
-
- while (min < stop && stop <= max) {
- stops = push(stops, stop);
- zeros += 1;
- stop = countZeros(max + 1, zeros) - 1;
- }
-
- stops.sort(compare);
- return stops;
-}
-
-/**
- * Convert a range to a regex pattern
- * @param {Number} `start`
- * @param {Number} `stop`
- * @return {String}
- */
-
-function rangeToPattern(start, stop, options) {
- if (start === stop) {
- return {pattern: String(start), digits: []};
- }
-
- var zipped = zip(String(start), String(stop));
- var len = zipped.length, i = -1;
-
- var pattern = '';
- var digits = 0;
-
- while (++i < len) {
- var numbers = zipped[i];
- var startDigit = numbers[0];
- var stopDigit = numbers[1];
-
- if (startDigit === stopDigit) {
- pattern += startDigit;
-
- } else if (startDigit !== '0' || stopDigit !== '9') {
- pattern += toCharacterClass(startDigit, stopDigit);
-
- } else {
- digits += 1;
- }
- }
-
- if (digits) {
- pattern += options.shorthand ? '\\d' : '[0-9]';
- }
-
- return { pattern: pattern, digits: [digits] };
-}
-
-function splitToPatterns(min, max, tok, options) {
- var ranges = splitToRanges(min, max);
- var len = ranges.length;
- var idx = -1;
-
- var tokens = [];
- var start = min;
- var prev;
-
- while (++idx < len) {
- var range = ranges[idx];
- var obj = rangeToPattern(start, range, options);
- var zeros = '';
-
- if (!tok.isPadded && prev && prev.pattern === obj.pattern) {
- if (prev.digits.length > 1) {
- prev.digits.pop();
- }
- prev.digits.push(obj.digits[0]);
- prev.string = prev.pattern + toQuantifier(prev.digits);
- start = range + 1;
- continue;
- }
-
- if (tok.isPadded) {
- zeros = padZeros(range, tok);
- }
-
- obj.string = zeros + obj.pattern + toQuantifier(obj.digits);
- tokens.push(obj);
- start = range + 1;
- prev = obj;
- }
-
- return tokens;
-}
-
-function filterPatterns(arr, comparison, prefix, intersection, options) {
- var res = [];
-
- for (var i = 0; i < arr.length; i++) {
- var tok = arr[i];
- var ele = tok.string;
-
- if (options.relaxZeros !== false) {
- if (prefix === '-' && ele.charAt(0) === '0') {
- if (ele.charAt(1) === '{') {
- ele = '0*' + ele.replace(/^0\{\d+\}/, '');
- } else {
- ele = '0*' + ele.slice(1);
- }
- }
- }
-
- if (!intersection && !contains(comparison, 'string', ele)) {
- res.push(prefix + ele);
- }
-
- if (intersection && contains(comparison, 'string', ele)) {
- res.push(prefix + ele);
- }
- }
- return res;
-}
-
-/**
- * Zip strings (`for in` can be used on string characters)
- */
-
-function zip(a, b) {
- var arr = [];
- for (var ch in a) arr.push([a[ch], b[ch]]);
- return arr;
-}
-
-function compare(a, b) {
- return a > b ? 1 : b > a ? -1 : 0;
-}
-
-function push(arr, ele) {
- if (arr.indexOf(ele) === -1) arr.push(ele);
- return arr;
-}
-
-function contains(arr, key, val) {
- for (var i = 0; i < arr.length; i++) {
- if (arr[i][key] === val) {
- return true;
- }
- }
- return false;
-}
-
-function countNines(min, len) {
- return String(min).slice(0, -len) + repeat('9', len);
-}
-
-function countZeros(integer, zeros) {
- return integer - (integer % Math.pow(10, zeros));
-}
-
-function toQuantifier(digits) {
- var start = digits[0];
- var stop = digits[1] ? (',' + digits[1]) : '';
- if (!stop && (!start || start === 1)) {
- return '';
- }
- return '{' + start + stop + '}';
-}
-
-function toCharacterClass(a, b) {
- return '[' + a + ((b - a === 1) ? '' : '-') + b + ']';
-}
-
-function padding(str) {
- return /^-?(0+)\d/.exec(str);
-}
-
-function padZeros(val, tok) {
- if (tok.isPadded) {
- var diff = Math.abs(tok.maxLen - String(val).length);
- switch (diff) {
- case 0:
- return '';
- case 1:
- return '0';
- default: {
- return '0{' + diff + '}';
- }
- }
- }
- return val;
-}
-
-/**
- * Expose `toRegexRange`
- */
-
-module.exports = toRegexRange;
diff --git a/node_modules/to-regex-range/package.json b/node_modules/to-regex-range/package.json
deleted file mode 100644
index 6c8e6b1cc..000000000
--- a/node_modules/to-regex-range/package.json
+++ /dev/null
@@ -1,86 +0,0 @@
-{
- "name": "to-regex-range",
- "description": "Pass two numbers, get a regex-compatible source string for matching ranges. Validated against more than 2.78 million test assertions.",
- "version": "2.1.1",
- "homepage": "https://github.com/micromatch/to-regex-range",
- "author": "Jon Schlinkert (https://github.com/jonschlinkert)",
- "repository": "micromatch/to-regex-range",
- "bugs": {
- "url": "https://github.com/micromatch/to-regex-range/issues"
- },
- "license": "MIT",
- "files": [
- "index.js"
- ],
- "main": "index.js",
- "engines": {
- "node": ">=0.10.0"
- },
- "scripts": {
- "test": "mocha"
- },
- "dependencies": {
- "is-number": "^3.0.0",
- "repeat-string": "^1.6.1"
- },
- "devDependencies": {
- "fill-range": "^3.1.1",
- "gulp-format-md": "^0.1.12",
- "mocha": "^3.2.0",
- "text-table": "^0.2.0",
- "time-diff": "^0.3.1"
- },
- "keywords": [
- "alpha",
- "alphabetical",
- "bash",
- "brace",
- "date",
- "expand",
- "expansion",
- "glob",
- "match",
- "matches",
- "matching",
- "number",
- "numerical",
- "range",
- "ranges",
- "regex",
- "sequence",
- "sh",
- "to",
- "year"
- ],
- "verb": {
- "related": {
- "list": [
- "expand-range",
- "fill-range",
- "micromatch",
- "repeat-element",
- "repeat-string"
- ]
- },
- "toc": false,
- "layout": "default",
- "tasks": [
- "readme"
- ],
- "plugins": [
- "gulp-format-md"
- ],
- "lint": {
- "reflinks": true
- },
- "helpers": [
- "./examples.js"
- ],
- "reflinks": [
- "0-5",
- "0-9",
- "1-5",
- "1-9"
- ]
- }
-}