Add node modules and new code for release (#39)
Co-authored-by: tbarnes94 <tbarnes94@users.noreply.github.com>
This commit is contained in:
github-actions[bot]
GitHub
parent
a10d84bc2e
commit
7ad2aa66bb
7655 changed files with 1763577 additions and 14 deletions
149
node_modules/sane/README.md
generated
vendored
Normal file
149
node_modules/sane/README.md
generated
vendored
Normal file
|
|
@ -0,0 +1,149 @@
|
|||
[](https://circleci.com/gh/amasad/sane)
|
||||
|
||||
sane
|
||||
----
|
||||
|
||||
I've been driven to insanity by node filesystem watcher wrappers.
|
||||
Sane aims to be fast, small, and reliable file system watcher. It does that by:
|
||||
|
||||
* By default stays away from fs polling because it's very slow and cpu intensive
|
||||
* Uses `fs.watch` by default and sensibly works around the various issues
|
||||
* Maintains a consistent API across different platforms
|
||||
* Where `fs.watch` is not reliable you have the choice of using the following alternatives:
|
||||
* [the facebook watchman library](https://facebook.github.io/watchman/)
|
||||
* [the watchexec library](https://github.com/watchexec/watchexec)
|
||||
* polling
|
||||
|
||||
## Install
|
||||
|
||||
```
|
||||
$ npm install sane
|
||||
```
|
||||
|
||||
## How to choose a mode
|
||||
|
||||
Don't worry too much about choosing the correct mode upfront because sane
|
||||
maintains the same API across all modes and will be easy to switch.
|
||||
|
||||
* If you're only supporting Linux and OS X, `watchman` would be the most reliable mode
|
||||
* If you're using node > v0.10.0 use the default mode
|
||||
* If you're running OS X and you're watching a lot of directories and you're running into https://github.com/joyent/node/issues/5463, use `watchman`
|
||||
* If you're in an environment where native file system events aren't available (like Vagrant), you should use polling
|
||||
* Otherwise, the default mode should work well for you
|
||||
|
||||
## API
|
||||
|
||||
### sane(dir, options)
|
||||
|
||||
Watches a directory and all its descendant directories for changes, deletions, and additions on files and directories.
|
||||
|
||||
```js
|
||||
var watcher = sane('path/to/dir', {glob: ['**/*.js', '**/*.css']});
|
||||
watcher.on('ready', function () { console.log('ready') });
|
||||
watcher.on('change', function (filepath, root, stat) { console.log('file changed', filepath); });
|
||||
watcher.on('add', function (filepath, root, stat) { console.log('file added', filepath); });
|
||||
watcher.on('delete', function (filepath, root) { console.log('file deleted', filepath); });
|
||||
// close
|
||||
watcher.close();
|
||||
```
|
||||
|
||||
options:
|
||||
|
||||
* `glob`: a single string glob pattern or an array of them.
|
||||
* `poll`: puts the watcher in polling mode. Under the hood that means `fs.watchFile`.
|
||||
* `watchman`: makes the watcher use [watchman](https://facebook.github.io/watchman/).
|
||||
* `watchmanPath`: sets a custom path for `watchman` binary.
|
||||
* `watchexec`: makes the watcher use [watchexec](https://github.com/watchexec/watchexec).
|
||||
* `dot`: enables watching files/directories that start with a dot.
|
||||
* `ignored`: a glob, regex, function, or array of any combination.
|
||||
|
||||
For the glob pattern documentation, see [micromatch](https://github.com/micromatch/micromatch).
|
||||
If you choose to use `watchman` you'll have to [install watchman yourself](https://facebook.github.io/watchman/docs/install.html)).
|
||||
If you choose to use `watchexec` you'll have to [install watchexec yourself](https://github.com/watchexec/watchexec)).
|
||||
For the ignored options, see [anymatch](https://github.com/es128/anymatch).
|
||||
|
||||
### sane.NodeWatcher(dir, options)
|
||||
|
||||
The default watcher class. Uses `fs.watch` under the hood, and takes the same options as `sane(dir, options)`.
|
||||
|
||||
### sane.WatchmanWatcher(dir, options)
|
||||
|
||||
The watchman watcher class. Takes the same options as `sane(dir, options)`.
|
||||
|
||||
### sane.Watchexec(dir, options)
|
||||
|
||||
The watchexec watcher class. Takes the same options as `sane(dir, options)`.
|
||||
|
||||
### sane.PollWatcher(dir, options)
|
||||
|
||||
The polling watcher class. Takes the same options as `sane(dir, options)` with the addition of:
|
||||
|
||||
* interval: indicates how often the files should be polled. (passed to fs.watchFile)
|
||||
|
||||
### sane.{Node|Watchman|Watchexec|Poll}Watcher#close
|
||||
|
||||
Stops watching.
|
||||
|
||||
### sane.{Node|Watchman|Watchexec|Poll}Watcher events
|
||||
|
||||
Emits the following events:
|
||||
|
||||
All events are passed the file/dir path relative to the root directory
|
||||
* `ready` when the program is ready to detect events in the directory
|
||||
* `change` when a file changes
|
||||
* `add` when a file or directory has been added
|
||||
* `delete` when a file or directory has been deleted
|
||||
|
||||
## CLI
|
||||
|
||||
This module includes a simple command line interface, which you can install with `npm install sane -g`.
|
||||
|
||||
```
|
||||
Usage: sane <command> [...directory] [--glob=<filePattern>] [--poll] [--watchman] [--watchman-path=<watchmanBinaryPath>] [--dot] [--wait=<seconds>]
|
||||
|
||||
OPTIONS:
|
||||
--glob=<filePattern>
|
||||
A single string glob pattern or an array of them.
|
||||
|
||||
--ignored=<filePattern>
|
||||
A glob, regex, function, or array of any combination.
|
||||
|
||||
--poll, -p
|
||||
Use polling mode.
|
||||
|
||||
--watchman, -w
|
||||
Use watchman (if available).
|
||||
|
||||
--watchman-path=<watchmanBinaryPath>
|
||||
Sets a custom path for watchman binary (if using this mode).
|
||||
|
||||
--dot, -d
|
||||
Enables watching files/directories that start with a dot.
|
||||
|
||||
--wait=<seconds>
|
||||
Duration, in seconds, that watching will be disabled
|
||||
after running <command>. Setting this option will
|
||||
throttle calls to <command> for the specified duration.
|
||||
--quiet, -q
|
||||
Disables sane's console output
|
||||
|
||||
--changes-only, -o
|
||||
Runs <command> only when a change occur. Skips running <command> at startup
|
||||
```
|
||||
|
||||
It will watch the given `directory` and run the given <command> every time a file changes.
|
||||
|
||||
### CLI example usage
|
||||
- `sane 'echo "A command ran"'`
|
||||
- `sane 'echo "A command ran"' --glob='**/*.css'`
|
||||
- `sane 'echo "A command ran"' site/assets/css --glob='**/*.css'`
|
||||
- `sane 'echo "A command ran"' --glob='**/*.css' --ignored='**/ignore.css'`
|
||||
- `sane 'echo "A command ran"' --wait=3`
|
||||
- `sane 'echo "A command ran"' -p`
|
||||
|
||||
## License
|
||||
|
||||
MIT
|
||||
|
||||
## Credits
|
||||
The CLI was originally based on the [watch CLI](https://github.com/mikeal/watch). Watch is licensed under the Apache License Version 2.0.
|
||||
40
node_modules/sane/index.js
generated
vendored
Executable file
40
node_modules/sane/index.js
generated
vendored
Executable file
|
|
@ -0,0 +1,40 @@
|
|||
'use strict';
|
||||
|
||||
const NodeWatcher = require('./src/node_watcher');
|
||||
const PollWatcher = require('./src/poll_watcher');
|
||||
const WatchmanWatcher = require('./src/watchman_watcher');
|
||||
const WatchexecWatcher = require('./src/watchexec_watcher');
|
||||
|
||||
function throwNoFSEventsSupports() {
|
||||
throw new Error('Sane >= 4 no longer support the fsevents module.');
|
||||
}
|
||||
|
||||
function sane(dir, options) {
|
||||
options = options || {};
|
||||
if (options.watcher) {
|
||||
const WatcherClass = require(options.watcher);
|
||||
return new WatcherClass(dir, options);
|
||||
} else if (options.poll) {
|
||||
return new PollWatcher(dir, options);
|
||||
} else if (options.watchman) {
|
||||
return new WatchmanWatcher(dir, options);
|
||||
} else if (options.watchexec) {
|
||||
return new WatchexecWatcher(dir, options);
|
||||
} else if (options.fsevents) {
|
||||
throwNoFSEventsSupports();
|
||||
} else {
|
||||
return new NodeWatcher(dir, options);
|
||||
}
|
||||
}
|
||||
|
||||
module.exports = sane;
|
||||
sane.NodeWatcher = NodeWatcher;
|
||||
sane.PollWatcher = PollWatcher;
|
||||
sane.WatchmanWatcher = WatchmanWatcher;
|
||||
sane.WatchexecWatcher = WatchexecWatcher;
|
||||
|
||||
Object.defineProperty(sane, 'FSEventsWatcher', {
|
||||
get() {
|
||||
return throwNoFSEventsSupports();
|
||||
},
|
||||
});
|
||||
15
node_modules/sane/node_modules/anymatch/LICENSE
generated
vendored
Normal file
15
node_modules/sane/node_modules/anymatch/LICENSE
generated
vendored
Normal file
|
|
@ -0,0 +1,15 @@
|
|||
The ISC License
|
||||
|
||||
Copyright (c) 2014 Elan Shanker
|
||||
|
||||
Permission to use, copy, modify, and/or distribute this software for any
|
||||
purpose with or without fee is hereby granted, provided that the above
|
||||
copyright notice and this permission notice appear in all copies.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
|
||||
WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
|
||||
MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
|
||||
ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
|
||||
WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
|
||||
ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR
|
||||
IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
|
||||
99
node_modules/sane/node_modules/anymatch/README.md
generated
vendored
Normal file
99
node_modules/sane/node_modules/anymatch/README.md
generated
vendored
Normal file
|
|
@ -0,0 +1,99 @@
|
|||
anymatch [](https://travis-ci.org/micromatch/anymatch) [](https://coveralls.io/r/micromatch/anymatch?branch=master)
|
||||
======
|
||||
Javascript module to match a string against a regular expression, glob, string,
|
||||
or function that takes the string as an argument and returns a truthy or falsy
|
||||
value. The matcher can also be an array of any or all of these. Useful for
|
||||
allowing a very flexible user-defined config to define things like file paths.
|
||||
|
||||
__Note: This module has Bash-parity, please be aware that Windows-style backslashes are not supported as separators. See https://github.com/micromatch/micromatch#backslashes for more information.__
|
||||
|
||||
[](https://nodei.co/npm/anymatch/)
|
||||
[](https://nodei.co/npm-dl/anymatch/)
|
||||
|
||||
Usage
|
||||
-----
|
||||
```sh
|
||||
npm install anymatch --save
|
||||
```
|
||||
|
||||
#### anymatch (matchers, testString, [returnIndex], [startIndex], [endIndex])
|
||||
* __matchers__: (_Array|String|RegExp|Function_)
|
||||
String to be directly matched, string with glob patterns, regular expression
|
||||
test, function that takes the testString as an argument and returns a truthy
|
||||
value if it should be matched, or an array of any number and mix of these types.
|
||||
* __testString__: (_String|Array_) The string to test against the matchers. If
|
||||
passed as an array, the first element of the array will be used as the
|
||||
`testString` for non-function matchers, while the entire array will be applied
|
||||
as the arguments for function matchers.
|
||||
* __returnIndex__: (_Boolean [optional]_) If true, return the array index of
|
||||
the first matcher that that testString matched, or -1 if no match, instead of a
|
||||
boolean result.
|
||||
* __startIndex, endIndex__: (_Integer [optional]_) Can be used to define a
|
||||
subset out of the array of provided matchers to test against. Can be useful
|
||||
with bound matcher functions (see below). When used with `returnIndex = true`
|
||||
preserves original indexing. Behaves the same as `Array.prototype.slice` (i.e.
|
||||
includes array members up to, but not including endIndex).
|
||||
|
||||
```js
|
||||
var anymatch = require('anymatch');
|
||||
|
||||
var matchers = [
|
||||
'path/to/file.js',
|
||||
'path/anyjs/**/*.js',
|
||||
/foo\.js$/,
|
||||
function (string) {
|
||||
return string.indexOf('bar') !== -1 && string.length > 10
|
||||
}
|
||||
];
|
||||
|
||||
anymatch(matchers, 'path/to/file.js'); // true
|
||||
anymatch(matchers, 'path/anyjs/baz.js'); // true
|
||||
anymatch(matchers, 'path/to/foo.js'); // true
|
||||
anymatch(matchers, 'path/to/bar.js'); // true
|
||||
anymatch(matchers, 'bar.js'); // false
|
||||
|
||||
// returnIndex = true
|
||||
anymatch(matchers, 'foo.js', true); // 2
|
||||
anymatch(matchers, 'path/anyjs/foo.js', true); // 1
|
||||
|
||||
// skip matchers
|
||||
anymatch(matchers, 'path/to/file.js', false, 1); // false
|
||||
anymatch(matchers, 'path/anyjs/foo.js', true, 2, 3); // 2
|
||||
anymatch(matchers, 'path/to/bar.js', true, 0, 3); // -1
|
||||
|
||||
// using globs to match directories and their children
|
||||
anymatch('node_modules', 'node_modules'); // true
|
||||
anymatch('node_modules', 'node_modules/somelib/index.js'); // false
|
||||
anymatch('node_modules/**', 'node_modules/somelib/index.js'); // true
|
||||
anymatch('node_modules/**', '/absolute/path/to/node_modules/somelib/index.js'); // false
|
||||
anymatch('**/node_modules/**', '/absolute/path/to/node_modules/somelib/index.js'); // true
|
||||
```
|
||||
|
||||
#### anymatch (matchers)
|
||||
You can also pass in only your matcher(s) to get a curried function that has
|
||||
already been bound to the provided matching criteria. This can be used as an
|
||||
`Array.prototype.filter` callback.
|
||||
|
||||
```js
|
||||
var matcher = anymatch(matchers);
|
||||
|
||||
matcher('path/to/file.js'); // true
|
||||
matcher('path/anyjs/baz.js', true); // 1
|
||||
matcher('path/anyjs/baz.js', true, 2); // -1
|
||||
|
||||
['foo.js', 'bar.js'].filter(matcher); // ['foo.js']
|
||||
```
|
||||
|
||||
Change Log
|
||||
----------
|
||||
[See release notes page on GitHub](https://github.com/micromatch/anymatch/releases)
|
||||
|
||||
NOTE: As of v2.0.0, [micromatch](https://github.com/jonschlinkert/micromatch) moves away from minimatch-parity and inline with Bash. This includes handling backslashes differently (see https://github.com/micromatch/micromatch#backslashes for more information).
|
||||
|
||||
NOTE: As of v1.2.0, anymatch uses [micromatch](https://github.com/jonschlinkert/micromatch)
|
||||
for glob pattern matching. Issues with glob pattern matching should be
|
||||
reported directly to the [micromatch issue tracker](https://github.com/jonschlinkert/micromatch/issues).
|
||||
|
||||
License
|
||||
-------
|
||||
[ISC](https://raw.github.com/micromatch/anymatch/master/LICENSE)
|
||||
67
node_modules/sane/node_modules/anymatch/index.js
generated
vendored
Normal file
67
node_modules/sane/node_modules/anymatch/index.js
generated
vendored
Normal file
|
|
@ -0,0 +1,67 @@
|
|||
'use strict';
|
||||
|
||||
var micromatch = require('micromatch');
|
||||
var normalize = require('normalize-path');
|
||||
var path = require('path'); // required for tests.
|
||||
var arrify = function(a) { return a == null ? [] : (Array.isArray(a) ? a : [a]); };
|
||||
|
||||
var anymatch = function(criteria, value, returnIndex, startIndex, endIndex) {
|
||||
criteria = arrify(criteria);
|
||||
value = arrify(value);
|
||||
if (arguments.length === 1) {
|
||||
return anymatch.bind(null, criteria.map(function(criterion) {
|
||||
return typeof criterion === 'string' && criterion[0] !== '!' ?
|
||||
micromatch.matcher(criterion) : criterion;
|
||||
}));
|
||||
}
|
||||
startIndex = startIndex || 0;
|
||||
var string = value[0];
|
||||
var altString, altValue;
|
||||
var matched = false;
|
||||
var matchIndex = -1;
|
||||
function testCriteria(criterion, index) {
|
||||
var result;
|
||||
switch (Object.prototype.toString.call(criterion)) {
|
||||
case '[object String]':
|
||||
result = string === criterion || altString && altString === criterion;
|
||||
result = result || micromatch.isMatch(string, criterion);
|
||||
break;
|
||||
case '[object RegExp]':
|
||||
result = criterion.test(string) || altString && criterion.test(altString);
|
||||
break;
|
||||
case '[object Function]':
|
||||
result = criterion.apply(null, value);
|
||||
result = result || altValue && criterion.apply(null, altValue);
|
||||
break;
|
||||
default:
|
||||
result = false;
|
||||
}
|
||||
if (result) {
|
||||
matchIndex = index + startIndex;
|
||||
}
|
||||
return result;
|
||||
}
|
||||
var crit = criteria;
|
||||
var negGlobs = crit.reduce(function(arr, criterion, index) {
|
||||
if (typeof criterion === 'string' && criterion[0] === '!') {
|
||||
if (crit === criteria) {
|
||||
// make a copy before modifying
|
||||
crit = crit.slice();
|
||||
}
|
||||
crit[index] = null;
|
||||
arr.push(criterion.substr(1));
|
||||
}
|
||||
return arr;
|
||||
}, []);
|
||||
if (!negGlobs.length || !micromatch.any(string, negGlobs)) {
|
||||
if (path.sep === '\\' && typeof string === 'string') {
|
||||
altString = normalize(string);
|
||||
altString = altString === string ? null : altString;
|
||||
if (altString) altValue = [altString].concat(value.slice(1));
|
||||
}
|
||||
matched = crit.slice(startIndex, endIndex).some(testCriteria);
|
||||
}
|
||||
return returnIndex === true ? matchIndex : matched;
|
||||
};
|
||||
|
||||
module.exports = anymatch;
|
||||
47
node_modules/sane/node_modules/anymatch/package.json
generated
vendored
Normal file
47
node_modules/sane/node_modules/anymatch/package.json
generated
vendored
Normal file
|
|
@ -0,0 +1,47 @@
|
|||
{
|
||||
"name": "anymatch",
|
||||
"version": "2.0.0",
|
||||
"description": "Matches strings against configurable strings, globs, regular expressions, and/or functions",
|
||||
"files": [
|
||||
"index.js"
|
||||
],
|
||||
"author": {
|
||||
"name": "Elan Shanker",
|
||||
"url": "http://github.com/es128"
|
||||
},
|
||||
"license": "ISC",
|
||||
"homepage": "https://github.com/micromatch/anymatch",
|
||||
"repository": {
|
||||
"type": "git",
|
||||
"url": "https://github.com/micromatch/anymatch"
|
||||
},
|
||||
"bugs": {
|
||||
"url": "https://github.com/micromatch/anymatch/issues"
|
||||
},
|
||||
"keywords": [
|
||||
"match",
|
||||
"any",
|
||||
"string",
|
||||
"file",
|
||||
"fs",
|
||||
"list",
|
||||
"glob",
|
||||
"regex",
|
||||
"regexp",
|
||||
"regular",
|
||||
"expression",
|
||||
"function"
|
||||
],
|
||||
"scripts": {
|
||||
"test": "istanbul cover _mocha && cat ./coverage/lcov.info | coveralls"
|
||||
},
|
||||
"dependencies": {
|
||||
"micromatch": "^3.1.4",
|
||||
"normalize-path": "^2.1.1"
|
||||
},
|
||||
"devDependencies": {
|
||||
"coveralls": "^2.7.0",
|
||||
"istanbul": "^0.4.5",
|
||||
"mocha": "^3.0.0"
|
||||
}
|
||||
}
|
||||
21
node_modules/sane/node_modules/braces/LICENSE
generated
vendored
Normal file
21
node_modules/sane/node_modules/braces/LICENSE
generated
vendored
Normal file
|
|
@ -0,0 +1,21 @@
|
|||
The MIT License (MIT)
|
||||
|
||||
Copyright (c) 2014-2018, 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.
|
||||
640
node_modules/sane/node_modules/braces/README.md
generated
vendored
Normal file
640
node_modules/sane/node_modules/braces/README.md
generated
vendored
Normal file
|
|
@ -0,0 +1,640 @@
|
|||
# braces [](https://www.npmjs.com/package/braces) [](https://npmjs.org/package/braces) [](https://npmjs.org/package/braces) [](https://travis-ci.org/micromatch/braces) [](https://ci.appveyor.com/project/micromatch/braces)
|
||||
|
||||
> Bash-like brace expansion, implemented in JavaScript. Safer than other brace expansion libs, with complete support for the Bash 4.3 braces specification, without sacrificing speed.
|
||||
|
||||
Please consider following this project's author, [Jon Schlinkert](https://github.com/jonschlinkert), and consider starring the project to show your :heart: and support.
|
||||
|
||||
## Install
|
||||
|
||||
Install with [npm](https://www.npmjs.com/):
|
||||
|
||||
```sh
|
||||
$ npm install --save braces
|
||||
```
|
||||
|
||||
## Why use braces?
|
||||
|
||||
Brace patterns are great for matching ranges. Users (and implementors) shouldn't have to think about whether or not they will break their application (or yours) from accidentally defining an aggressive brace pattern. _Braces is the only library that offers a [solution to this problem](#performance)_.
|
||||
|
||||
* **Safe(r)**: Braces isn't vulnerable to DoS attacks like [brace-expansion](https://github.com/juliangruber/brace-expansion), [minimatch](https://github.com/isaacs/minimatch) and [multimatch](https://github.com/sindresorhus/multimatch) (a different bug than the [other regex DoS bug](https://medium.com/node-security/minimatch-redos-vulnerability-590da24e6d3c#.jew0b6mpc)).
|
||||
* **Accurate**: complete support for the [Bash 4.3 Brace Expansion](www.gnu.org/software/bash/) specification (passes all of the Bash braces tests)
|
||||
* **[fast and performant](#benchmarks)**: Starts fast, runs fast and [scales well](#performance) as patterns increase in complexity.
|
||||
* **Organized code base**: with parser and compiler that are eas(y|ier) to maintain and update when edge cases crop up.
|
||||
* **Well-tested**: thousands of test assertions. Passes 100% of the [minimatch](https://github.com/isaacs/minimatch) and [brace-expansion](https://github.com/juliangruber/brace-expansion) unit tests as well (as of the writing of this).
|
||||
|
||||
## Usage
|
||||
|
||||
The main export is a function that takes one or more brace `patterns` and `options`.
|
||||
|
||||
```js
|
||||
var braces = require('braces');
|
||||
braces(pattern[, options]);
|
||||
```
|
||||
|
||||
By default, braces returns an optimized regex-source string. To get an array of brace patterns, use `brace.expand()`.
|
||||
|
||||
The following section explains the difference in more detail. _(If you're curious about "why" braces does this by default, see [brace matching pitfalls](#brace-matching-pitfalls)_.
|
||||
|
||||
### Optimized vs. expanded braces
|
||||
|
||||
**Optimized**
|
||||
|
||||
By default, patterns are optimized for regex and matching:
|
||||
|
||||
```js
|
||||
console.log(braces('a/{x,y,z}/b'));
|
||||
//=> ['a/(x|y|z)/b']
|
||||
```
|
||||
|
||||
**Expanded**
|
||||
|
||||
To expand patterns the same way as Bash or [minimatch](https://github.com/isaacs/minimatch), use the [.expand](#expand) method:
|
||||
|
||||
```js
|
||||
console.log(braces.expand('a/{x,y,z}/b'));
|
||||
//=> ['a/x/b', 'a/y/b', 'a/z/b']
|
||||
```
|
||||
|
||||
Or use [options.expand](#optionsexpand):
|
||||
|
||||
```js
|
||||
console.log(braces('a/{x,y,z}/b', {expand: true}));
|
||||
//=> ['a/x/b', 'a/y/b', 'a/z/b']
|
||||
```
|
||||
|
||||
## Features
|
||||
|
||||
* [lists](#lists): Supports "lists": `a/{b,c}/d` => `['a/b/d', 'a/c/d']`
|
||||
* [sequences](#sequences): Supports alphabetical or numerical "sequences" (ranges): `{1..3}` => `['1', '2', '3']`
|
||||
* [steps](#steps): Supports "steps" or increments: `{2..10..2}` => `['2', '4', '6', '8', '10']`
|
||||
* [escaping](#escaping)
|
||||
* [options](#options)
|
||||
|
||||
### Lists
|
||||
|
||||
Uses [fill-range](https://github.com/jonschlinkert/fill-range) for expanding alphabetical or numeric lists:
|
||||
|
||||
```js
|
||||
console.log(braces('a/{foo,bar,baz}/*.js'));
|
||||
//=> ['a/(foo|bar|baz)/*.js']
|
||||
|
||||
console.log(braces.expand('a/{foo,bar,baz}/*.js'));
|
||||
//=> ['a/foo/*.js', 'a/bar/*.js', 'a/baz/*.js']
|
||||
```
|
||||
|
||||
### Sequences
|
||||
|
||||
Uses [fill-range](https://github.com/jonschlinkert/fill-range) for expanding alphabetical or numeric ranges (bash "sequences"):
|
||||
|
||||
```js
|
||||
console.log(braces.expand('{1..3}')); // ['1', '2', '3']
|
||||
console.log(braces.expand('a{01..03}b')); // ['a01b', 'a02b', 'a03b']
|
||||
console.log(braces.expand('a{1..3}b')); // ['a1b', 'a2b', 'a3b']
|
||||
console.log(braces.expand('{a..c}')); // ['a', 'b', 'c']
|
||||
console.log(braces.expand('foo/{a..c}')); // ['foo/a', 'foo/b', 'foo/c']
|
||||
|
||||
// supports padded ranges
|
||||
console.log(braces('a{01..03}b')); //=> [ 'a(0[1-3])b' ]
|
||||
console.log(braces('a{001..300}b')); //=> [ 'a(0{2}[1-9]|0[1-9][0-9]|[12][0-9]{2}|300)b' ]
|
||||
```
|
||||
|
||||
### Steps
|
||||
|
||||
Steps, or increments, may be used with ranges:
|
||||
|
||||
```js
|
||||
console.log(braces.expand('{2..10..2}'));
|
||||
//=> ['2', '4', '6', '8', '10']
|
||||
|
||||
console.log(braces('{2..10..2}'));
|
||||
//=> ['(2|4|6|8|10)']
|
||||
```
|
||||
|
||||
When the [.optimize](#optimize) method is used, or [options.optimize](#optionsoptimize) is set to true, sequences are passed to [to-regex-range](https://github.com/jonschlinkert/to-regex-range) for expansion.
|
||||
|
||||
### Nesting
|
||||
|
||||
Brace patterns may be nested. The results of each expanded string are not sorted, and left to right order is preserved.
|
||||
|
||||
**"Expanded" braces**
|
||||
|
||||
```js
|
||||
console.log(braces.expand('a{b,c,/{x,y}}/e'));
|
||||
//=> ['ab/e', 'ac/e', 'a/x/e', 'a/y/e']
|
||||
|
||||
console.log(braces.expand('a/{x,{1..5},y}/c'));
|
||||
//=> ['a/x/c', 'a/1/c', 'a/2/c', 'a/3/c', 'a/4/c', 'a/5/c', 'a/y/c']
|
||||
```
|
||||
|
||||
**"Optimized" braces**
|
||||
|
||||
```js
|
||||
console.log(braces('a{b,c,/{x,y}}/e'));
|
||||
//=> ['a(b|c|/(x|y))/e']
|
||||
|
||||
console.log(braces('a/{x,{1..5},y}/c'));
|
||||
//=> ['a/(x|([1-5])|y)/c']
|
||||
```
|
||||
|
||||
### Escaping
|
||||
|
||||
**Escaping braces**
|
||||
|
||||
A brace pattern will not be expanded or evaluted if _either the opening or closing brace is escaped_:
|
||||
|
||||
```js
|
||||
console.log(braces.expand('a\\{d,c,b}e'));
|
||||
//=> ['a{d,c,b}e']
|
||||
|
||||
console.log(braces.expand('a{d,c,b\\}e'));
|
||||
//=> ['a{d,c,b}e']
|
||||
```
|
||||
|
||||
**Escaping commas**
|
||||
|
||||
Commas inside braces may also be escaped:
|
||||
|
||||
```js
|
||||
console.log(braces.expand('a{b\\,c}d'));
|
||||
//=> ['a{b,c}d']
|
||||
|
||||
console.log(braces.expand('a{d\\,c,b}e'));
|
||||
//=> ['ad,ce', 'abe']
|
||||
```
|
||||
|
||||
**Single items**
|
||||
|
||||
Following bash conventions, a brace pattern is also not expanded when it contains a single character:
|
||||
|
||||
```js
|
||||
console.log(braces.expand('a{b}c'));
|
||||
//=> ['a{b}c']
|
||||
```
|
||||
|
||||
## Options
|
||||
|
||||
### options.maxLength
|
||||
|
||||
**Type**: `Number`
|
||||
|
||||
**Default**: `65,536`
|
||||
|
||||
**Description**: Limit the length of the input string. Useful when the input string is generated or your application allows users to pass a string, et cetera.
|
||||
|
||||
```js
|
||||
console.log(braces('a/{b,c}/d', { maxLength: 3 })); //=> throws an error
|
||||
```
|
||||
|
||||
### options.expand
|
||||
|
||||
**Type**: `Boolean`
|
||||
|
||||
**Default**: `undefined`
|
||||
|
||||
**Description**: Generate an "expanded" brace pattern (this option is unncessary with the `.expand` method, which does the same thing).
|
||||
|
||||
```js
|
||||
console.log(braces('a/{b,c}/d', {expand: true}));
|
||||
//=> [ 'a/b/d', 'a/c/d' ]
|
||||
```
|
||||
|
||||
### options.optimize
|
||||
|
||||
**Type**: `Boolean`
|
||||
|
||||
**Default**: `true`
|
||||
|
||||
**Description**: Enabled by default.
|
||||
|
||||
```js
|
||||
console.log(braces('a/{b,c}/d'));
|
||||
//=> [ 'a/(b|c)/d' ]
|
||||
```
|
||||
|
||||
### options.nodupes
|
||||
|
||||
**Type**: `Boolean`
|
||||
|
||||
**Default**: `true`
|
||||
|
||||
**Description**: Duplicates are removed by default. To keep duplicates, pass `{nodupes: false}` on the options
|
||||
|
||||
### options.rangeLimit
|
||||
|
||||
**Type**: `Number`
|
||||
|
||||
**Default**: `250`
|
||||
|
||||
**Description**: When `braces.expand()` is used, or `options.expand` is true, brace patterns will automatically be [optimized](#optionsoptimize) when the difference between the range minimum and range maximum exceeds the `rangeLimit`. This is to prevent huge ranges from freezing your application.
|
||||
|
||||
You can set this to any number, or change `options.rangeLimit` to `Inifinity` to disable this altogether.
|
||||
|
||||
**Examples**
|
||||
|
||||
```js
|
||||
// pattern exceeds the "rangeLimit", so it's optimized automatically
|
||||
console.log(braces.expand('{1..1000}'));
|
||||
//=> ['([1-9]|[1-9][0-9]{1,2}|1000)']
|
||||
|
||||
// pattern does not exceed "rangeLimit", so it's NOT optimized
|
||||
console.log(braces.expand('{1..100}'));
|
||||
//=> ['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']
|
||||
```
|
||||
|
||||
### options.transform
|
||||
|
||||
**Type**: `Function`
|
||||
|
||||
**Default**: `undefined`
|
||||
|
||||
**Description**: Customize range expansion.
|
||||
|
||||
```js
|
||||
var range = braces.expand('x{a..e}y', {
|
||||
transform: function(str) {
|
||||
return 'foo' + str;
|
||||
}
|
||||
});
|
||||
|
||||
console.log(range);
|
||||
//=> [ 'xfooay', 'xfooby', 'xfoocy', 'xfoody', 'xfooey' ]
|
||||
```
|
||||
|
||||
### options.quantifiers
|
||||
|
||||
**Type**: `Boolean`
|
||||
|
||||
**Default**: `undefined`
|
||||
|
||||
**Description**: In regular expressions, quanitifiers can be used to specify how many times a token can be repeated. For example, `a{1,3}` will match the letter `a` one to three times.
|
||||
|
||||
Unfortunately, regex quantifiers happen to share the same syntax as [Bash lists](#lists)
|
||||
|
||||
The `quantifiers` option tells braces to detect when [regex quantifiers](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/RegExp#quantifiers) are defined in the given pattern, and not to try to expand them as lists.
|
||||
|
||||
**Examples**
|
||||
|
||||
```js
|
||||
var braces = require('braces');
|
||||
console.log(braces('a/b{1,3}/{x,y,z}'));
|
||||
//=> [ 'a/b(1|3)/(x|y|z)' ]
|
||||
console.log(braces('a/b{1,3}/{x,y,z}', {quantifiers: true}));
|
||||
//=> [ 'a/b{1,3}/(x|y|z)' ]
|
||||
console.log(braces('a/b{1,3}/{x,y,z}', {quantifiers: true, expand: true}));
|
||||
//=> [ 'a/b{1,3}/x', 'a/b{1,3}/y', 'a/b{1,3}/z' ]
|
||||
```
|
||||
|
||||
### options.unescape
|
||||
|
||||
**Type**: `Boolean`
|
||||
|
||||
**Default**: `undefined`
|
||||
|
||||
**Description**: Strip backslashes that were used for escaping from the result.
|
||||
|
||||
## What is "brace expansion"?
|
||||
|
||||
Brace expansion is a type of parameter expansion that was made popular by unix shells for generating lists of strings, as well as regex-like matching when used alongside wildcards (globs).
|
||||
|
||||
In addition to "expansion", braces are also used for matching. In other words:
|
||||
|
||||
* [brace expansion](#brace-expansion) is for generating new lists
|
||||
* [brace matching](#brace-matching) is for filtering existing lists
|
||||
|
||||
<details>
|
||||
<summary><strong>More about brace expansion</strong> (click to expand)</summary>
|
||||
|
||||
There are two main types of brace expansion:
|
||||
|
||||
1. **lists**: which are defined using comma-separated values inside curly braces: `{a,b,c}`
|
||||
2. **sequences**: which are defined using a starting value and an ending value, separated by two dots: `a{1..3}b`. Optionally, a third argument may be passed to define a "step" or increment to use: `a{1..100..10}b`. These are also sometimes referred to as "ranges".
|
||||
|
||||
Here are some example brace patterns to illustrate how they work:
|
||||
|
||||
**Sets**
|
||||
|
||||
```
|
||||
{a,b,c} => a b c
|
||||
{a,b,c}{1,2} => a1 a2 b1 b2 c1 c2
|
||||
```
|
||||
|
||||
**Sequences**
|
||||
|
||||
```
|
||||
{1..9} => 1 2 3 4 5 6 7 8 9
|
||||
{4..-4} => 4 3 2 1 0 -1 -2 -3 -4
|
||||
{1..20..3} => 1 4 7 10 13 16 19
|
||||
{a..j} => a b c d e f g h i j
|
||||
{j..a} => j i h g f e d c b a
|
||||
{a..z..3} => a d g j m p s v y
|
||||
```
|
||||
|
||||
**Combination**
|
||||
|
||||
Sets and sequences can be mixed together or used along with any other strings.
|
||||
|
||||
```
|
||||
{a,b,c}{1..3} => a1 a2 a3 b1 b2 b3 c1 c2 c3
|
||||
foo/{a,b,c}/bar => foo/a/bar foo/b/bar foo/c/bar
|
||||
```
|
||||
|
||||
The fact that braces can be "expanded" from relatively simple patterns makes them ideal for quickly generating test fixtures, file paths, and similar use cases.
|
||||
|
||||
## Brace matching
|
||||
|
||||
In addition to _expansion_, brace patterns are also useful for performing regular-expression-like matching.
|
||||
|
||||
For example, the pattern `foo/{1..3}/bar` would match any of following strings:
|
||||
|
||||
```
|
||||
foo/1/bar
|
||||
foo/2/bar
|
||||
foo/3/bar
|
||||
```
|
||||
|
||||
But not:
|
||||
|
||||
```
|
||||
baz/1/qux
|
||||
baz/2/qux
|
||||
baz/3/qux
|
||||
```
|
||||
|
||||
Braces can also be combined with [glob patterns](https://github.com/jonschlinkert/micromatch) to perform more advanced wildcard matching. For example, the pattern `*/{1..3}/*` would match any of following strings:
|
||||
|
||||
```
|
||||
foo/1/bar
|
||||
foo/2/bar
|
||||
foo/3/bar
|
||||
baz/1/qux
|
||||
baz/2/qux
|
||||
baz/3/qux
|
||||
```
|
||||
|
||||
## Brace matching pitfalls
|
||||
|
||||
Although brace patterns offer a user-friendly way of matching ranges or sets of strings, there are also some major disadvantages and potential risks you should be aware of.
|
||||
|
||||
### tldr
|
||||
|
||||
**"brace bombs"**
|
||||
|
||||
* brace expansion can eat up a huge amount of processing resources
|
||||
* as brace patterns increase _linearly in size_, the system resources required to expand the pattern increase exponentially
|
||||
* users can accidentally (or intentially) exhaust your system's resources resulting in the equivalent of a DoS attack (bonus: no programming knowledge is required!)
|
||||
|
||||
For a more detailed explanation with examples, see the [geometric complexity](#geometric-complexity) section.
|
||||
|
||||
### The solution
|
||||
|
||||
Jump to the [performance section](#performance) to see how Braces solves this problem in comparison to other libraries.
|
||||
|
||||
### Geometric complexity
|
||||
|
||||
At minimum, brace patterns with sets limited to two elements have quadradic or `O(n^2)` complexity. But the complexity of the algorithm increases exponentially as the number of sets, _and elements per set_, increases, which is `O(n^c)`.
|
||||
|
||||
For example, the following sets demonstrate quadratic (`O(n^2)`) complexity:
|
||||
|
||||
```
|
||||
{1,2}{3,4} => (2X2) => 13 14 23 24
|
||||
{1,2}{3,4}{5,6} => (2X2X2) => 135 136 145 146 235 236 245 246
|
||||
```
|
||||
|
||||
But add an element to a set, and we get a n-fold Cartesian product with `O(n^c)` complexity:
|
||||
|
||||
```
|
||||
{1,2,3}{4,5,6}{7,8,9} => (3X3X3) => 147 148 149 157 158 159 167 168 169 247 248
|
||||
249 257 258 259 267 268 269 347 348 349 357
|
||||
358 359 367 368 369
|
||||
```
|
||||
|
||||
Now, imagine how this complexity grows given that each element is a n-tuple:
|
||||
|
||||
```
|
||||
{1..100}{1..100} => (100X100) => 10,000 elements (38.4 kB)
|
||||
{1..100}{1..100}{1..100} => (100X100X100) => 1,000,000 elements (5.76 MB)
|
||||
```
|
||||
|
||||
Although these examples are clearly contrived, they demonstrate how brace patterns can quickly grow out of control.
|
||||
|
||||
**More information**
|
||||
|
||||
Interested in learning more about brace expansion?
|
||||
|
||||
* [linuxjournal/bash-brace-expansion](http://www.linuxjournal.com/content/bash-brace-expansion)
|
||||
* [rosettacode/Brace_expansion](https://rosettacode.org/wiki/Brace_expansion)
|
||||
* [cartesian product](https://en.wikipedia.org/wiki/Cartesian_product)
|
||||
|
||||
</details>
|
||||
|
||||
## Performance
|
||||
|
||||
Braces is not only screaming fast, it's also more accurate the other brace expansion libraries.
|
||||
|
||||
### Better algorithms
|
||||
|
||||
Fortunately there is a solution to the ["brace bomb" problem](#brace-matching-pitfalls): _don't expand brace patterns into an array when they're used for matching_.
|
||||
|
||||
Instead, convert the pattern into an optimized regular expression. This is easier said than done, and braces is the only library that does this currently.
|
||||
|
||||
**The proof is in the numbers**
|
||||
|
||||
Minimatch gets exponentially slower as patterns increase in complexity, braces does not. The following results were generated using `braces()` and `minimatch.braceExpand()`, respectively.
|
||||
|
||||
| **Pattern** | **braces** | **[minimatch](https://github.com/isaacs/minimatch)** |
|
||||
| --- | --- | --- |
|
||||
| `{1..9007199254740991}`<sup class="footnote-ref"><a href="#fn1" id="fnref1">[1]</a></sup> | `298 B` (5ms 459μs) | N/A (freezes) |
|
||||
| `{1..1000000000000000}` | `41 B` (1ms 15μs) | N/A (freezes) |
|
||||
| `{1..100000000000000}` | `40 B` (890μs) | N/A (freezes) |
|
||||
| `{1..10000000000000}` | `39 B` (2ms 49μs) | N/A (freezes) |
|
||||
| `{1..1000000000000}` | `38 B` (608μs) | N/A (freezes) |
|
||||
| `{1..100000000000}` | `37 B` (397μs) | N/A (freezes) |
|
||||
| `{1..10000000000}` | `35 B` (983μs) | N/A (freezes) |
|
||||
| `{1..1000000000}` | `34 B` (798μs) | N/A (freezes) |
|
||||
| `{1..100000000}` | `33 B` (733μs) | N/A (freezes) |
|
||||
| `{1..10000000}` | `32 B` (5ms 632μs) | `78.89 MB` (16s 388ms 569μs) |
|
||||
| `{1..1000000}` | `31 B` (1ms 381μs) | `6.89 MB` (1s 496ms 887μs) |
|
||||
| `{1..100000}` | `30 B` (950μs) | `588.89 kB` (146ms 921μs) |
|
||||
| `{1..10000}` | `29 B` (1ms 114μs) | `48.89 kB` (14ms 187μs) |
|
||||
| `{1..1000}` | `28 B` (760μs) | `3.89 kB` (1ms 453μs) |
|
||||
| `{1..100}` | `22 B` (345μs) | `291 B` (196μs) |
|
||||
| `{1..10}` | `10 B` (533μs) | `20 B` (37μs) |
|
||||
| `{1..3}` | `7 B` (190μs) | `5 B` (27μs) |
|
||||
|
||||
### Faster algorithms
|
||||
|
||||
When you need expansion, braces is still much faster.
|
||||
|
||||
_(the following results were generated using `braces.expand()` and `minimatch.braceExpand()`, respectively)_
|
||||
|
||||
| **Pattern** | **braces** | **[minimatch](https://github.com/isaacs/minimatch)** |
|
||||
| --- | --- | --- |
|
||||
| `{1..10000000}` | `78.89 MB` (2s 698ms 642μs) | `78.89 MB` (18s 601ms 974μs) |
|
||||
| `{1..1000000}` | `6.89 MB` (458ms 576μs) | `6.89 MB` (1s 491ms 621μs) |
|
||||
| `{1..100000}` | `588.89 kB` (20ms 728μs) | `588.89 kB` (156ms 919μs) |
|
||||
| `{1..10000}` | `48.89 kB` (2ms 202μs) | `48.89 kB` (13ms 641μs) |
|
||||
| `{1..1000}` | `3.89 kB` (1ms 796μs) | `3.89 kB` (1ms 958μs) |
|
||||
| `{1..100}` | `291 B` (424μs) | `291 B` (211μs) |
|
||||
| `{1..10}` | `20 B` (487μs) | `20 B` (72μs) |
|
||||
| `{1..3}` | `5 B` (166μs) | `5 B` (27μs) |
|
||||
|
||||
If you'd like to run these comparisons yourself, see [test/support/generate.js](test/support/generate.js).
|
||||
|
||||
## Benchmarks
|
||||
|
||||
### Running benchmarks
|
||||
|
||||
Install dev dependencies:
|
||||
|
||||
```bash
|
||||
npm i -d && npm benchmark
|
||||
```
|
||||
|
||||
### Latest results
|
||||
|
||||
```bash
|
||||
Benchmarking: (8 of 8)
|
||||
· combination-nested
|
||||
· combination
|
||||
· escaped
|
||||
· list-basic
|
||||
· list-multiple
|
||||
· no-braces
|
||||
· sequence-basic
|
||||
· sequence-multiple
|
||||
|
||||
# benchmark/fixtures/combination-nested.js (52 bytes)
|
||||
brace-expansion x 4,756 ops/sec ±1.09% (86 runs sampled)
|
||||
braces x 11,202,303 ops/sec ±1.06% (88 runs sampled)
|
||||
minimatch x 4,816 ops/sec ±0.99% (87 runs sampled)
|
||||
|
||||
fastest is braces
|
||||
|
||||
# benchmark/fixtures/combination.js (51 bytes)
|
||||
brace-expansion x 625 ops/sec ±0.87% (87 runs sampled)
|
||||
braces x 11,031,884 ops/sec ±0.72% (90 runs sampled)
|
||||
minimatch x 637 ops/sec ±0.84% (88 runs sampled)
|
||||
|
||||
fastest is braces
|
||||
|
||||
# benchmark/fixtures/escaped.js (44 bytes)
|
||||
brace-expansion x 163,325 ops/sec ±1.05% (87 runs sampled)
|
||||
braces x 10,655,071 ops/sec ±1.22% (88 runs sampled)
|
||||
minimatch x 147,495 ops/sec ±0.96% (88 runs sampled)
|
||||
|
||||
fastest is braces
|
||||
|
||||
# benchmark/fixtures/list-basic.js (40 bytes)
|
||||
brace-expansion x 99,726 ops/sec ±1.07% (83 runs sampled)
|
||||
braces x 10,596,584 ops/sec ±0.98% (88 runs sampled)
|
||||
minimatch x 100,069 ops/sec ±1.17% (86 runs sampled)
|
||||
|
||||
fastest is braces
|
||||
|
||||
# benchmark/fixtures/list-multiple.js (52 bytes)
|
||||
brace-expansion x 34,348 ops/sec ±1.08% (88 runs sampled)
|
||||
braces x 9,264,131 ops/sec ±1.12% (88 runs sampled)
|
||||
minimatch x 34,893 ops/sec ±0.87% (87 runs sampled)
|
||||
|
||||
fastest is braces
|
||||
|
||||
# benchmark/fixtures/no-braces.js (48 bytes)
|
||||
brace-expansion x 275,368 ops/sec ±1.18% (89 runs sampled)
|
||||
braces x 9,134,677 ops/sec ±0.95% (88 runs sampled)
|
||||
minimatch x 3,755,954 ops/sec ±1.13% (89 runs sampled)
|
||||
|
||||
fastest is braces
|
||||
|
||||
# benchmark/fixtures/sequence-basic.js (41 bytes)
|
||||
brace-expansion x 5,492 ops/sec ±1.35% (87 runs sampled)
|
||||
braces x 8,485,034 ops/sec ±1.28% (89 runs sampled)
|
||||
minimatch x 5,341 ops/sec ±1.17% (87 runs sampled)
|
||||
|
||||
fastest is braces
|
||||
|
||||
# benchmark/fixtures/sequence-multiple.js (51 bytes)
|
||||
brace-expansion x 116 ops/sec ±0.77% (77 runs sampled)
|
||||
braces x 9,445,118 ops/sec ±1.32% (84 runs sampled)
|
||||
minimatch x 109 ops/sec ±1.16% (76 runs sampled)
|
||||
|
||||
fastest is braces
|
||||
```
|
||||
|
||||
## About
|
||||
|
||||
<details>
|
||||
<summary><strong>Contributing</strong></summary>
|
||||
|
||||
Pull requests and stars are always welcome. For bugs and feature requests, [please create an issue](../../issues/new).
|
||||
|
||||
</details>
|
||||
|
||||
<details>
|
||||
<summary><strong>Running Tests</strong></summary>
|
||||
|
||||
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
|
||||
```
|
||||
|
||||
</details>
|
||||
|
||||
<details>
|
||||
<summary><strong>Building docs</strong></summary>
|
||||
|
||||
_(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
|
||||
```
|
||||
|
||||
</details>
|
||||
|
||||
### Related projects
|
||||
|
||||
You might also be interested in these projects:
|
||||
|
||||
* [expand-brackets](https://www.npmjs.com/package/expand-brackets): Expand POSIX bracket expressions (character classes) in glob patterns. | [homepage](https://github.com/jonschlinkert/expand-brackets "Expand POSIX bracket expressions (character classes) in glob patterns.")
|
||||
* [extglob](https://www.npmjs.com/package/extglob): Extended glob support for JavaScript. Adds (almost) the expressive power of regular expressions to glob… [more](https://github.com/micromatch/extglob) | [homepage](https://github.com/micromatch/extglob "Extended glob support for JavaScript. Adds (almost) the expressive power of regular expressions to glob patterns.")
|
||||
* [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/micromatch/micromatch "Glob matching for javascript/node.js. A drop-in replacement and faster alternative to minimatch and multimatch.")
|
||||
* [nanomatch](https://www.npmjs.com/package/nanomatch): Fast, minimal glob matcher for node.js. Similar to micromatch, minimatch and multimatch, but complete Bash… [more](https://github.com/micromatch/nanomatch) | [homepage](https://github.com/micromatch/nanomatch "Fast, minimal glob matcher for node.js. Similar to micromatch, minimatch and multimatch, but complete Bash 4.3 wildcard support only (no support for exglobs, posix brackets or braces)")
|
||||
|
||||
### Contributors
|
||||
|
||||
| **Commits** | **Contributor** |
|
||||
| --- | --- |
|
||||
| 188 | [jonschlinkert](https://github.com/jonschlinkert) |
|
||||
| 4 | [doowb](https://github.com/doowb) |
|
||||
| 1 | [es128](https://github.com/es128) |
|
||||
| 1 | [eush77](https://github.com/eush77) |
|
||||
| 1 | [hemanth](https://github.com/hemanth) |
|
||||
|
||||
### Author
|
||||
|
||||
**Jon Schlinkert**
|
||||
|
||||
* [linkedin/in/jonschlinkert](https://linkedin.com/in/jonschlinkert)
|
||||
* [github/jonschlinkert](https://github.com/jonschlinkert)
|
||||
* [twitter/jonschlinkert](https://twitter.com/jonschlinkert)
|
||||
|
||||
### License
|
||||
|
||||
Copyright © 2018, [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 February 17, 2018._
|
||||
|
||||
<hr class="footnotes-sep">
|
||||
<section class="footnotes">
|
||||
<ol class="footnotes-list">
|
||||
<li id="fn1" class="footnote-item">this is the largest safe integer allowed in JavaScript. <a href="#fnref1" class="footnote-backref">↩</a>
|
||||
|
||||
</li>
|
||||
</ol>
|
||||
</section>
|
||||
318
node_modules/sane/node_modules/braces/index.js
generated
vendored
Normal file
318
node_modules/sane/node_modules/braces/index.js
generated
vendored
Normal file
|
|
@ -0,0 +1,318 @@
|
|||
'use strict';
|
||||
|
||||
/**
|
||||
* Module dependencies
|
||||
*/
|
||||
|
||||
var toRegex = require('to-regex');
|
||||
var unique = require('array-unique');
|
||||
var extend = require('extend-shallow');
|
||||
|
||||
/**
|
||||
* Local dependencies
|
||||
*/
|
||||
|
||||
var compilers = require('./lib/compilers');
|
||||
var parsers = require('./lib/parsers');
|
||||
var Braces = require('./lib/braces');
|
||||
var utils = require('./lib/utils');
|
||||
var MAX_LENGTH = 1024 * 64;
|
||||
var cache = {};
|
||||
|
||||
/**
|
||||
* Convert the given `braces` pattern into a regex-compatible string. By default, only one string is generated for every input string. Set `options.expand` to true to return an array of patterns (similar to Bash or minimatch. Before using `options.expand`, it's recommended that you read the [performance notes](#performance)).
|
||||
*
|
||||
* ```js
|
||||
* var braces = require('braces');
|
||||
* console.log(braces('{a,b,c}'));
|
||||
* //=> ['(a|b|c)']
|
||||
*
|
||||
* console.log(braces('{a,b,c}', {expand: true}));
|
||||
* //=> ['a', 'b', 'c']
|
||||
* ```
|
||||
* @param {String} `str`
|
||||
* @param {Object} `options`
|
||||
* @return {String}
|
||||
* @api public
|
||||
*/
|
||||
|
||||
function braces(pattern, options) {
|
||||
var key = utils.createKey(String(pattern), options);
|
||||
var arr = [];
|
||||
|
||||
var disabled = options && options.cache === false;
|
||||
if (!disabled && cache.hasOwnProperty(key)) {
|
||||
return cache[key];
|
||||
}
|
||||
|
||||
if (Array.isArray(pattern)) {
|
||||
for (var i = 0; i < pattern.length; i++) {
|
||||
arr.push.apply(arr, braces.create(pattern[i], options));
|
||||
}
|
||||
} else {
|
||||
arr = braces.create(pattern, options);
|
||||
}
|
||||
|
||||
if (options && options.nodupes === true) {
|
||||
arr = unique(arr);
|
||||
}
|
||||
|
||||
if (!disabled) {
|
||||
cache[key] = arr;
|
||||
}
|
||||
return arr;
|
||||
}
|
||||
|
||||
/**
|
||||
* Expands a brace pattern into an array. This method is called by the main [braces](#braces) function when `options.expand` is true. Before using this method it's recommended that you read the [performance notes](#performance)) and advantages of using [.optimize](#optimize) instead.
|
||||
*
|
||||
* ```js
|
||||
* var braces = require('braces');
|
||||
* console.log(braces.expand('a/{b,c}/d'));
|
||||
* //=> ['a/b/d', 'a/c/d'];
|
||||
* ```
|
||||
* @param {String} `pattern` Brace pattern
|
||||
* @param {Object} `options`
|
||||
* @return {Array} Returns an array of expanded values.
|
||||
* @api public
|
||||
*/
|
||||
|
||||
braces.expand = function(pattern, options) {
|
||||
return braces.create(pattern, extend({}, options, {expand: true}));
|
||||
};
|
||||
|
||||
/**
|
||||
* Expands a brace pattern into a regex-compatible, optimized string. This method is called by the main [braces](#braces) function by default.
|
||||
*
|
||||
* ```js
|
||||
* var braces = require('braces');
|
||||
* console.log(braces.expand('a/{b,c}/d'));
|
||||
* //=> ['a/(b|c)/d']
|
||||
* ```
|
||||
* @param {String} `pattern` Brace pattern
|
||||
* @param {Object} `options`
|
||||
* @return {Array} Returns an array of expanded values.
|
||||
* @api public
|
||||
*/
|
||||
|
||||
braces.optimize = function(pattern, options) {
|
||||
return braces.create(pattern, options);
|
||||
};
|
||||
|
||||
/**
|
||||
* Processes a brace pattern and returns either an expanded array (if `options.expand` is true), a highly optimized regex-compatible string. This method is called by the main [braces](#braces) function.
|
||||
*
|
||||
* ```js
|
||||
* var braces = require('braces');
|
||||
* console.log(braces.create('user-{200..300}/project-{a,b,c}-{1..10}'))
|
||||
* //=> 'user-(20[0-9]|2[1-9][0-9]|300)/project-(a|b|c)-([1-9]|10)'
|
||||
* ```
|
||||
* @param {String} `pattern` Brace pattern
|
||||
* @param {Object} `options`
|
||||
* @return {Array} Returns an array of expanded values.
|
||||
* @api public
|
||||
*/
|
||||
|
||||
braces.create = function(pattern, options) {
|
||||
if (typeof pattern !== 'string') {
|
||||
throw new TypeError('expected a string');
|
||||
}
|
||||
|
||||
var maxLength = (options && options.maxLength) || MAX_LENGTH;
|
||||
if (pattern.length >= maxLength) {
|
||||
throw new Error('expected pattern to be less than ' + maxLength + ' characters');
|
||||
}
|
||||
|
||||
function create() {
|
||||
if (pattern === '' || pattern.length < 3) {
|
||||
return [pattern];
|
||||
}
|
||||
|
||||
if (utils.isEmptySets(pattern)) {
|
||||
return [];
|
||||
}
|
||||
|
||||
if (utils.isQuotedString(pattern)) {
|
||||
return [pattern.slice(1, -1)];
|
||||
}
|
||||
|
||||
var proto = new Braces(options);
|
||||
var result = !options || options.expand !== true
|
||||
? proto.optimize(pattern, options)
|
||||
: proto.expand(pattern, options);
|
||||
|
||||
// get the generated pattern(s)
|
||||
var arr = result.output;
|
||||
|
||||
// filter out empty strings if specified
|
||||
if (options && options.noempty === true) {
|
||||
arr = arr.filter(Boolean);
|
||||
}
|
||||
|
||||
// filter out duplicates if specified
|
||||
if (options && options.nodupes === true) {
|
||||
arr = unique(arr);
|
||||
}
|
||||
|
||||
Object.defineProperty(arr, 'result', {
|
||||
enumerable: false,
|
||||
value: result
|
||||
});
|
||||
|
||||
return arr;
|
||||
}
|
||||
|
||||
return memoize('create', pattern, options, create);
|
||||
};
|
||||
|
||||
/**
|
||||
* Create a regular expression from the given string `pattern`.
|
||||
*
|
||||
* ```js
|
||||
* var braces = require('braces');
|
||||
*
|
||||
* console.log(braces.makeRe('id-{200..300}'));
|
||||
* //=> /^(?:id-(20[0-9]|2[1-9][0-9]|300))$/
|
||||
* ```
|
||||
* @param {String} `pattern` The pattern to convert to regex.
|
||||
* @param {Object} `options`
|
||||
* @return {RegExp}
|
||||
* @api public
|
||||
*/
|
||||
|
||||
braces.makeRe = function(pattern, options) {
|
||||
if (typeof pattern !== 'string') {
|
||||
throw new TypeError('expected a string');
|
||||
}
|
||||
|
||||
var maxLength = (options && options.maxLength) || MAX_LENGTH;
|
||||
if (pattern.length >= maxLength) {
|
||||
throw new Error('expected pattern to be less than ' + maxLength + ' characters');
|
||||
}
|
||||
|
||||
function makeRe() {
|
||||
var arr = braces(pattern, options);
|
||||
var opts = extend({strictErrors: false}, options);
|
||||
return toRegex(arr, opts);
|
||||
}
|
||||
|
||||
return memoize('makeRe', pattern, options, makeRe);
|
||||
};
|
||||
|
||||
/**
|
||||
* Parse the given `str` with the given `options`.
|
||||
*
|
||||
* ```js
|
||||
* var braces = require('braces');
|
||||
* var ast = braces.parse('a/{b,c}/d');
|
||||
* console.log(ast);
|
||||
* // { type: 'root',
|
||||
* // errors: [],
|
||||
* // input: 'a/{b,c}/d',
|
||||
* // nodes:
|
||||
* // [ { type: 'bos', val: '' },
|
||||
* // { type: 'text', val: 'a/' },
|
||||
* // { type: 'brace',
|
||||
* // nodes:
|
||||
* // [ { type: 'brace.open', val: '{' },
|
||||
* // { type: 'text', val: 'b,c' },
|
||||
* // { type: 'brace.close', val: '}' } ] },
|
||||
* // { type: 'text', val: '/d' },
|
||||
* // { type: 'eos', val: '' } ] }
|
||||
* ```
|
||||
* @param {String} `pattern` Brace pattern to parse
|
||||
* @param {Object} `options`
|
||||
* @return {Object} Returns an AST
|
||||
* @api public
|
||||
*/
|
||||
|
||||
braces.parse = function(pattern, options) {
|
||||
var proto = new Braces(options);
|
||||
return proto.parse(pattern, options);
|
||||
};
|
||||
|
||||
/**
|
||||
* Compile the given `ast` or string with the given `options`.
|
||||
*
|
||||
* ```js
|
||||
* var braces = require('braces');
|
||||
* var ast = braces.parse('a/{b,c}/d');
|
||||
* console.log(braces.compile(ast));
|
||||
* // { options: { source: 'string' },
|
||||
* // state: {},
|
||||
* // compilers:
|
||||
* // { eos: [Function],
|
||||
* // noop: [Function],
|
||||
* // bos: [Function],
|
||||
* // brace: [Function],
|
||||
* // 'brace.open': [Function],
|
||||
* // text: [Function],
|
||||
* // 'brace.close': [Function] },
|
||||
* // output: [ 'a/(b|c)/d' ],
|
||||
* // ast:
|
||||
* // { ... },
|
||||
* // parsingErrors: [] }
|
||||
* ```
|
||||
* @param {Object|String} `ast` AST from [.parse](#parse). If a string is passed it will be parsed first.
|
||||
* @param {Object} `options`
|
||||
* @return {Object} Returns an object that has an `output` property with the compiled string.
|
||||
* @api public
|
||||
*/
|
||||
|
||||
braces.compile = function(ast, options) {
|
||||
var proto = new Braces(options);
|
||||
return proto.compile(ast, options);
|
||||
};
|
||||
|
||||
/**
|
||||
* Clear the regex cache.
|
||||
*
|
||||
* ```js
|
||||
* braces.clearCache();
|
||||
* ```
|
||||
* @api public
|
||||
*/
|
||||
|
||||
braces.clearCache = function() {
|
||||
cache = braces.cache = {};
|
||||
};
|
||||
|
||||
/**
|
||||
* Memoize a generated regex or function. A unique key is generated
|
||||
* from the method name, pattern, and user-defined options. Set
|
||||
* options.memoize to false to disable.
|
||||
*/
|
||||
|
||||
function memoize(type, pattern, options, fn) {
|
||||
var key = utils.createKey(type + ':' + pattern, options);
|
||||
var disabled = options && options.cache === false;
|
||||
if (disabled) {
|
||||
braces.clearCache();
|
||||
return fn(pattern, options);
|
||||
}
|
||||
|
||||
if (cache.hasOwnProperty(key)) {
|
||||
return cache[key];
|
||||
}
|
||||
|
||||
var res = fn(pattern, options);
|
||||
cache[key] = res;
|
||||
return res;
|
||||
}
|
||||
|
||||
/**
|
||||
* Expose `Braces` constructor and methods
|
||||
* @type {Function}
|
||||
*/
|
||||
|
||||
braces.Braces = Braces;
|
||||
braces.compilers = compilers;
|
||||
braces.parsers = parsers;
|
||||
braces.cache = cache;
|
||||
|
||||
/**
|
||||
* Expose `braces`
|
||||
* @type {Function}
|
||||
*/
|
||||
|
||||
module.exports = braces;
|
||||
104
node_modules/sane/node_modules/braces/lib/braces.js
generated
vendored
Normal file
104
node_modules/sane/node_modules/braces/lib/braces.js
generated
vendored
Normal file
|
|
@ -0,0 +1,104 @@
|
|||
'use strict';
|
||||
|
||||
var extend = require('extend-shallow');
|
||||
var Snapdragon = require('snapdragon');
|
||||
var compilers = require('./compilers');
|
||||
var parsers = require('./parsers');
|
||||
var utils = require('./utils');
|
||||
|
||||
/**
|
||||
* Customize Snapdragon parser and renderer
|
||||
*/
|
||||
|
||||
function Braces(options) {
|
||||
this.options = extend({}, options);
|
||||
}
|
||||
|
||||
/**
|
||||
* Initialize braces
|
||||
*/
|
||||
|
||||
Braces.prototype.init = function(options) {
|
||||
if (this.isInitialized) return;
|
||||
this.isInitialized = true;
|
||||
var opts = utils.createOptions({}, this.options, options);
|
||||
this.snapdragon = this.options.snapdragon || new Snapdragon(opts);
|
||||
this.compiler = this.snapdragon.compiler;
|
||||
this.parser = this.snapdragon.parser;
|
||||
|
||||
compilers(this.snapdragon, opts);
|
||||
parsers(this.snapdragon, opts);
|
||||
|
||||
/**
|
||||
* Call Snapdragon `.parse` method. When AST is returned, we check to
|
||||
* see if any unclosed braces are left on the stack and, if so, we iterate
|
||||
* over the stack and correct the AST so that compilers are called in the correct
|
||||
* order and unbalance braces are properly escaped.
|
||||
*/
|
||||
|
||||
utils.define(this.snapdragon, 'parse', function(pattern, options) {
|
||||
var parsed = Snapdragon.prototype.parse.apply(this, arguments);
|
||||
this.parser.ast.input = pattern;
|
||||
|
||||
var stack = this.parser.stack;
|
||||
while (stack.length) {
|
||||
addParent({type: 'brace.close', val: ''}, stack.pop());
|
||||
}
|
||||
|
||||
function addParent(node, parent) {
|
||||
utils.define(node, 'parent', parent);
|
||||
parent.nodes.push(node);
|
||||
}
|
||||
|
||||
// add non-enumerable parser reference
|
||||
utils.define(parsed, 'parser', this.parser);
|
||||
return parsed;
|
||||
});
|
||||
};
|
||||
|
||||
/**
|
||||
* Decorate `.parse` method
|
||||
*/
|
||||
|
||||
Braces.prototype.parse = function(ast, options) {
|
||||
if (ast && typeof ast === 'object' && ast.nodes) return ast;
|
||||
this.init(options);
|
||||
return this.snapdragon.parse(ast, options);
|
||||
};
|
||||
|
||||
/**
|
||||
* Decorate `.compile` method
|
||||
*/
|
||||
|
||||
Braces.prototype.compile = function(ast, options) {
|
||||
if (typeof ast === 'string') {
|
||||
ast = this.parse(ast, options);
|
||||
} else {
|
||||
this.init(options);
|
||||
}
|
||||
return this.snapdragon.compile(ast, options);
|
||||
};
|
||||
|
||||
/**
|
||||
* Expand
|
||||
*/
|
||||
|
||||
Braces.prototype.expand = function(pattern) {
|
||||
var ast = this.parse(pattern, {expand: true});
|
||||
return this.compile(ast, {expand: true});
|
||||
};
|
||||
|
||||
/**
|
||||
* Optimize
|
||||
*/
|
||||
|
||||
Braces.prototype.optimize = function(pattern) {
|
||||
var ast = this.parse(pattern, {optimize: true});
|
||||
return this.compile(ast, {optimize: true});
|
||||
};
|
||||
|
||||
/**
|
||||
* Expose `Braces`
|
||||
*/
|
||||
|
||||
module.exports = Braces;
|
||||
282
node_modules/sane/node_modules/braces/lib/compilers.js
generated
vendored
Normal file
282
node_modules/sane/node_modules/braces/lib/compilers.js
generated
vendored
Normal file
|
|
@ -0,0 +1,282 @@
|
|||
'use strict';
|
||||
|
||||
var utils = require('./utils');
|
||||
|
||||
module.exports = function(braces, options) {
|
||||
braces.compiler
|
||||
|
||||
/**
|
||||
* bos
|
||||
*/
|
||||
|
||||
.set('bos', function() {
|
||||
if (this.output) return;
|
||||
this.ast.queue = isEscaped(this.ast) ? [this.ast.val] : [];
|
||||
this.ast.count = 1;
|
||||
})
|
||||
|
||||
/**
|
||||
* Square brackets
|
||||
*/
|
||||
|
||||
.set('bracket', function(node) {
|
||||
var close = node.close;
|
||||
var open = !node.escaped ? '[' : '\\[';
|
||||
var negated = node.negated;
|
||||
var inner = node.inner;
|
||||
|
||||
inner = inner.replace(/\\(?=[\\\w]|$)/g, '\\\\');
|
||||
if (inner === ']-') {
|
||||
inner = '\\]\\-';
|
||||
}
|
||||
|
||||
if (negated && inner.indexOf('.') === -1) {
|
||||
inner += '.';
|
||||
}
|
||||
if (negated && inner.indexOf('/') === -1) {
|
||||
inner += '/';
|
||||
}
|
||||
|
||||
var val = open + negated + inner + close;
|
||||
var queue = node.parent.queue;
|
||||
var last = utils.arrayify(queue.pop());
|
||||
|
||||
queue.push(utils.join(last, val));
|
||||
queue.push.apply(queue, []);
|
||||
})
|
||||
|
||||
/**
|
||||
* Brace
|
||||
*/
|
||||
|
||||
.set('brace', function(node) {
|
||||
node.queue = isEscaped(node) ? [node.val] : [];
|
||||
node.count = 1;
|
||||
return this.mapVisit(node.nodes);
|
||||
})
|
||||
|
||||
/**
|
||||
* Open
|
||||
*/
|
||||
|
||||
.set('brace.open', function(node) {
|
||||
node.parent.open = node.val;
|
||||
})
|
||||
|
||||
/**
|
||||
* Inner
|
||||
*/
|
||||
|
||||
.set('text', function(node) {
|
||||
var queue = node.parent.queue;
|
||||
var escaped = node.escaped;
|
||||
var segs = [node.val];
|
||||
|
||||
if (node.optimize === false) {
|
||||
options = utils.extend({}, options, {optimize: false});
|
||||
}
|
||||
|
||||
if (node.multiplier > 1) {
|
||||
node.parent.count *= node.multiplier;
|
||||
}
|
||||
|
||||
if (options.quantifiers === true && utils.isQuantifier(node.val)) {
|
||||
escaped = true;
|
||||
|
||||
} else if (node.val.length > 1) {
|
||||
if (isType(node.parent, 'brace') && !isEscaped(node)) {
|
||||
var expanded = utils.expand(node.val, options);
|
||||
segs = expanded.segs;
|
||||
|
||||
if (expanded.isOptimized) {
|
||||
node.parent.isOptimized = true;
|
||||
}
|
||||
|
||||
// if nothing was expanded, we probably have a literal brace
|
||||
if (!segs.length) {
|
||||
var val = (expanded.val || node.val);
|
||||
if (options.unescape !== false) {
|
||||
// unescape unexpanded brace sequence/set separators
|
||||
val = val.replace(/\\([,.])/g, '$1');
|
||||
// strip quotes
|
||||
val = val.replace(/["'`]/g, '');
|
||||
}
|
||||
|
||||
segs = [val];
|
||||
escaped = true;
|
||||
}
|
||||
}
|
||||
|
||||
} else if (node.val === ',') {
|
||||
if (options.expand) {
|
||||
node.parent.queue.push(['']);
|
||||
segs = [''];
|
||||
} else {
|
||||
segs = ['|'];
|
||||
}
|
||||
} else {
|
||||
escaped = true;
|
||||
}
|
||||
|
||||
if (escaped && isType(node.parent, 'brace')) {
|
||||
if (node.parent.nodes.length <= 4 && node.parent.count === 1) {
|
||||
node.parent.escaped = true;
|
||||
} else if (node.parent.length <= 3) {
|
||||
node.parent.escaped = true;
|
||||
}
|
||||
}
|
||||
|
||||
if (!hasQueue(node.parent)) {
|
||||
node.parent.queue = segs;
|
||||
return;
|
||||
}
|
||||
|
||||
var last = utils.arrayify(queue.pop());
|
||||
if (node.parent.count > 1 && options.expand) {
|
||||
last = multiply(last, node.parent.count);
|
||||
node.parent.count = 1;
|
||||
}
|
||||
|
||||
queue.push(utils.join(utils.flatten(last), segs.shift()));
|
||||
queue.push.apply(queue, segs);
|
||||
})
|
||||
|
||||
/**
|
||||
* Close
|
||||
*/
|
||||
|
||||
.set('brace.close', function(node) {
|
||||
var queue = node.parent.queue;
|
||||
var prev = node.parent.parent;
|
||||
var last = prev.queue.pop();
|
||||
var open = node.parent.open;
|
||||
var close = node.val;
|
||||
|
||||
if (open && close && isOptimized(node, options)) {
|
||||
open = '(';
|
||||
close = ')';
|
||||
}
|
||||
|
||||
// if a close brace exists, and the previous segment is one character
|
||||
// don't wrap the result in braces or parens
|
||||
var ele = utils.last(queue);
|
||||
if (node.parent.count > 1 && options.expand) {
|
||||
ele = multiply(queue.pop(), node.parent.count);
|
||||
node.parent.count = 1;
|
||||
queue.push(ele);
|
||||
}
|
||||
|
||||
if (close && typeof ele === 'string' && ele.length === 1) {
|
||||
open = '';
|
||||
close = '';
|
||||
}
|
||||
|
||||
if ((isLiteralBrace(node, options) || noInner(node)) && !node.parent.hasEmpty) {
|
||||
queue.push(utils.join(open, queue.pop() || ''));
|
||||
queue = utils.flatten(utils.join(queue, close));
|
||||
}
|
||||
|
||||
if (typeof last === 'undefined') {
|
||||
prev.queue = [queue];
|
||||
} else {
|
||||
prev.queue.push(utils.flatten(utils.join(last, queue)));
|
||||
}
|
||||
})
|
||||
|
||||
/**
|
||||
* eos
|
||||
*/
|
||||
|
||||
.set('eos', function(node) {
|
||||
if (this.input) return;
|
||||
|
||||
if (options.optimize !== false) {
|
||||
this.output = utils.last(utils.flatten(this.ast.queue));
|
||||
} else if (Array.isArray(utils.last(this.ast.queue))) {
|
||||
this.output = utils.flatten(this.ast.queue.pop());
|
||||
} else {
|
||||
this.output = utils.flatten(this.ast.queue);
|
||||
}
|
||||
|
||||
if (node.parent.count > 1 && options.expand) {
|
||||
this.output = multiply(this.output, node.parent.count);
|
||||
}
|
||||
|
||||
this.output = utils.arrayify(this.output);
|
||||
this.ast.queue = [];
|
||||
});
|
||||
|
||||
};
|
||||
|
||||
/**
|
||||
* Multiply the segments in the current brace level
|
||||
*/
|
||||
|
||||
function multiply(queue, n, options) {
|
||||
return utils.flatten(utils.repeat(utils.arrayify(queue), n));
|
||||
}
|
||||
|
||||
/**
|
||||
* Return true if `node` is escaped
|
||||
*/
|
||||
|
||||
function isEscaped(node) {
|
||||
return node.escaped === true;
|
||||
}
|
||||
|
||||
/**
|
||||
* Returns true if regex parens should be used for sets. If the parent `type`
|
||||
* is not `brace`, then we're on a root node, which means we should never
|
||||
* expand segments and open/close braces should be `{}` (since this indicates
|
||||
* a brace is missing from the set)
|
||||
*/
|
||||
|
||||
function isOptimized(node, options) {
|
||||
if (node.parent.isOptimized) return true;
|
||||
return isType(node.parent, 'brace')
|
||||
&& !isEscaped(node.parent)
|
||||
&& options.expand !== true;
|
||||
}
|
||||
|
||||
/**
|
||||
* Returns true if the value in `node` should be wrapped in a literal brace.
|
||||
* @return {Boolean}
|
||||
*/
|
||||
|
||||
function isLiteralBrace(node, options) {
|
||||
return isEscaped(node.parent) || options.optimize !== false;
|
||||
}
|
||||
|
||||
/**
|
||||
* Returns true if the given `node` does not have an inner value.
|
||||
* @return {Boolean}
|
||||
*/
|
||||
|
||||
function noInner(node, type) {
|
||||
if (node.parent.queue.length === 1) {
|
||||
return true;
|
||||
}
|
||||
var nodes = node.parent.nodes;
|
||||
return nodes.length === 3
|
||||
&& isType(nodes[0], 'brace.open')
|
||||
&& !isType(nodes[1], 'text')
|
||||
&& isType(nodes[2], 'brace.close');
|
||||
}
|
||||
|
||||
/**
|
||||
* Returns true if the given `node` is the given `type`
|
||||
* @return {Boolean}
|
||||
*/
|
||||
|
||||
function isType(node, type) {
|
||||
return typeof node !== 'undefined' && node.type === type;
|
||||
}
|
||||
|
||||
/**
|
||||
* Returns true if the given `node` has a non-empty queue.
|
||||
* @return {Boolean}
|
||||
*/
|
||||
|
||||
function hasQueue(node) {
|
||||
return Array.isArray(node.queue) && node.queue.length;
|
||||
}
|
||||
360
node_modules/sane/node_modules/braces/lib/parsers.js
generated
vendored
Normal file
360
node_modules/sane/node_modules/braces/lib/parsers.js
generated
vendored
Normal file
|
|
@ -0,0 +1,360 @@
|
|||
'use strict';
|
||||
|
||||
var Node = require('snapdragon-node');
|
||||
var utils = require('./utils');
|
||||
|
||||
/**
|
||||
* Braces parsers
|
||||
*/
|
||||
|
||||
module.exports = function(braces, options) {
|
||||
braces.parser
|
||||
.set('bos', function() {
|
||||
if (!this.parsed) {
|
||||
this.ast = this.nodes[0] = new Node(this.ast);
|
||||
}
|
||||
})
|
||||
|
||||
/**
|
||||
* Character parsers
|
||||
*/
|
||||
|
||||
.set('escape', function() {
|
||||
var pos = this.position();
|
||||
var m = this.match(/^(?:\\(.)|\$\{)/);
|
||||
if (!m) return;
|
||||
|
||||
var prev = this.prev();
|
||||
var last = utils.last(prev.nodes);
|
||||
|
||||
var node = pos(new Node({
|
||||
type: 'text',
|
||||
multiplier: 1,
|
||||
val: m[0]
|
||||
}));
|
||||
|
||||
if (node.val === '\\\\') {
|
||||
return node;
|
||||
}
|
||||
|
||||
if (node.val === '${') {
|
||||
var str = this.input;
|
||||
var idx = -1;
|
||||
var ch;
|
||||
|
||||
while ((ch = str[++idx])) {
|
||||
this.consume(1);
|
||||
node.val += ch;
|
||||
if (ch === '\\') {
|
||||
node.val += str[++idx];
|
||||
continue;
|
||||
}
|
||||
if (ch === '}') {
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if (this.options.unescape !== false) {
|
||||
node.val = node.val.replace(/\\([{}])/g, '$1');
|
||||
}
|
||||
|
||||
if (last.val === '"' && this.input.charAt(0) === '"') {
|
||||
last.val = node.val;
|
||||
this.consume(1);
|
||||
return;
|
||||
}
|
||||
|
||||
return concatNodes.call(this, pos, node, prev, options);
|
||||
})
|
||||
|
||||
/**
|
||||
* Brackets: "[...]" (basic, this is overridden by
|
||||
* other parsers in more advanced implementations)
|
||||
*/
|
||||
|
||||
.set('bracket', function() {
|
||||
var isInside = this.isInside('brace');
|
||||
var pos = this.position();
|
||||
var m = this.match(/^(?:\[([!^]?)([^\]]{2,}|\]-)(\]|[^*+?]+)|\[)/);
|
||||
if (!m) return;
|
||||
|
||||
var prev = this.prev();
|
||||
var val = m[0];
|
||||
var negated = m[1] ? '^' : '';
|
||||
var inner = m[2] || '';
|
||||
var close = m[3] || '';
|
||||
|
||||
if (isInside && prev.type === 'brace') {
|
||||
prev.text = prev.text || '';
|
||||
prev.text += val;
|
||||
}
|
||||
|
||||
var esc = this.input.slice(0, 2);
|
||||
if (inner === '' && esc === '\\]') {
|
||||
inner += esc;
|
||||
this.consume(2);
|
||||
|
||||
var str = this.input;
|
||||
var idx = -1;
|
||||
var ch;
|
||||
|
||||
while ((ch = str[++idx])) {
|
||||
this.consume(1);
|
||||
if (ch === ']') {
|
||||
close = ch;
|
||||
break;
|
||||
}
|
||||
inner += ch;
|
||||
}
|
||||
}
|
||||
|
||||
return pos(new Node({
|
||||
type: 'bracket',
|
||||
val: val,
|
||||
escaped: close !== ']',
|
||||
negated: negated,
|
||||
inner: inner,
|
||||
close: close
|
||||
}));
|
||||
})
|
||||
|
||||
/**
|
||||
* Empty braces (we capture these early to
|
||||
* speed up processing in the compiler)
|
||||
*/
|
||||
|
||||
.set('multiplier', function() {
|
||||
var isInside = this.isInside('brace');
|
||||
var pos = this.position();
|
||||
var m = this.match(/^\{((?:,|\{,+\})+)\}/);
|
||||
if (!m) return;
|
||||
|
||||
this.multiplier = true;
|
||||
var prev = this.prev();
|
||||
var val = m[0];
|
||||
|
||||
if (isInside && prev.type === 'brace') {
|
||||
prev.text = prev.text || '';
|
||||
prev.text += val;
|
||||
}
|
||||
|
||||
var node = pos(new Node({
|
||||
type: 'text',
|
||||
multiplier: 1,
|
||||
match: m,
|
||||
val: val
|
||||
}));
|
||||
|
||||
return concatNodes.call(this, pos, node, prev, options);
|
||||
})
|
||||
|
||||
/**
|
||||
* Open
|
||||
*/
|
||||
|
||||
.set('brace.open', function() {
|
||||
var pos = this.position();
|
||||
var m = this.match(/^\{(?!(?:[^\\}]?|,+)\})/);
|
||||
if (!m) return;
|
||||
|
||||
var prev = this.prev();
|
||||
var last = utils.last(prev.nodes);
|
||||
|
||||
// if the last parsed character was an extglob character
|
||||
// we need to _not optimize_ the brace pattern because
|
||||
// it might be mistaken for an extglob by a downstream parser
|
||||
if (last && last.val && isExtglobChar(last.val.slice(-1))) {
|
||||
last.optimize = false;
|
||||
}
|
||||
|
||||
var open = pos(new Node({
|
||||
type: 'brace.open',
|
||||
val: m[0]
|
||||
}));
|
||||
|
||||
var node = pos(new Node({
|
||||
type: 'brace',
|
||||
nodes: []
|
||||
}));
|
||||
|
||||
node.push(open);
|
||||
prev.push(node);
|
||||
this.push('brace', node);
|
||||
})
|
||||
|
||||
/**
|
||||
* Close
|
||||
*/
|
||||
|
||||
.set('brace.close', function() {
|
||||
var pos = this.position();
|
||||
var m = this.match(/^\}/);
|
||||
if (!m || !m[0]) return;
|
||||
|
||||
var brace = this.pop('brace');
|
||||
var node = pos(new Node({
|
||||
type: 'brace.close',
|
||||
val: m[0]
|
||||
}));
|
||||
|
||||
if (!this.isType(brace, 'brace')) {
|
||||
if (this.options.strict) {
|
||||
throw new Error('missing opening "{"');
|
||||
}
|
||||
node.type = 'text';
|
||||
node.multiplier = 0;
|
||||
node.escaped = true;
|
||||
return node;
|
||||
}
|
||||
|
||||
var prev = this.prev();
|
||||
var last = utils.last(prev.nodes);
|
||||
if (last.text) {
|
||||
var lastNode = utils.last(last.nodes);
|
||||
if (lastNode.val === ')' && /[!@*?+]\(/.test(last.text)) {
|
||||
var open = last.nodes[0];
|
||||
var text = last.nodes[1];
|
||||
if (open.type === 'brace.open' && text && text.type === 'text') {
|
||||
text.optimize = false;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if (brace.nodes.length > 2) {
|
||||
var first = brace.nodes[1];
|
||||
if (first.type === 'text' && first.val === ',') {
|
||||
brace.nodes.splice(1, 1);
|
||||
brace.nodes.push(first);
|
||||
}
|
||||
}
|
||||
|
||||
brace.push(node);
|
||||
})
|
||||
|
||||
/**
|
||||
* Capture boundary characters
|
||||
*/
|
||||
|
||||
.set('boundary', function() {
|
||||
var pos = this.position();
|
||||
var m = this.match(/^[$^](?!\{)/);
|
||||
if (!m) return;
|
||||
return pos(new Node({
|
||||
type: 'text',
|
||||
val: m[0]
|
||||
}));
|
||||
})
|
||||
|
||||
/**
|
||||
* One or zero, non-comma characters wrapped in braces
|
||||
*/
|
||||
|
||||
.set('nobrace', function() {
|
||||
var isInside = this.isInside('brace');
|
||||
var pos = this.position();
|
||||
var m = this.match(/^\{[^,]?\}/);
|
||||
if (!m) return;
|
||||
|
||||
var prev = this.prev();
|
||||
var val = m[0];
|
||||
|
||||
if (isInside && prev.type === 'brace') {
|
||||
prev.text = prev.text || '';
|
||||
prev.text += val;
|
||||
}
|
||||
|
||||
return pos(new Node({
|
||||
type: 'text',
|
||||
multiplier: 0,
|
||||
val: val
|
||||
}));
|
||||
})
|
||||
|
||||
/**
|
||||
* Text
|
||||
*/
|
||||
|
||||
.set('text', function() {
|
||||
var isInside = this.isInside('brace');
|
||||
var pos = this.position();
|
||||
var m = this.match(/^((?!\\)[^${}[\]])+/);
|
||||
if (!m) return;
|
||||
|
||||
var prev = this.prev();
|
||||
var val = m[0];
|
||||
|
||||
if (isInside && prev.type === 'brace') {
|
||||
prev.text = prev.text || '';
|
||||
prev.text += val;
|
||||
}
|
||||
|
||||
var node = pos(new Node({
|
||||
type: 'text',
|
||||
multiplier: 1,
|
||||
val: val
|
||||
}));
|
||||
|
||||
return concatNodes.call(this, pos, node, prev, options);
|
||||
});
|
||||
};
|
||||
|
||||
/**
|
||||
* Returns true if the character is an extglob character.
|
||||
*/
|
||||
|
||||
function isExtglobChar(ch) {
|
||||
return ch === '!' || ch === '@' || ch === '*' || ch === '?' || ch === '+';
|
||||
}
|
||||
|
||||
/**
|
||||
* Combine text nodes, and calculate empty sets (`{,,}`)
|
||||
* @param {Function} `pos` Function to calculate node position
|
||||
* @param {Object} `node` AST node
|
||||
* @return {Object}
|
||||
*/
|
||||
|
||||
function concatNodes(pos, node, parent, options) {
|
||||
node.orig = node.val;
|
||||
var prev = this.prev();
|
||||
var last = utils.last(prev.nodes);
|
||||
var isEscaped = false;
|
||||
|
||||
if (node.val.length > 1) {
|
||||
var a = node.val.charAt(0);
|
||||
var b = node.val.slice(-1);
|
||||
|
||||
isEscaped = (a === '"' && b === '"')
|
||||
|| (a === "'" && b === "'")
|
||||
|| (a === '`' && b === '`');
|
||||
}
|
||||
|
||||
if (isEscaped && options.unescape !== false) {
|
||||
node.val = node.val.slice(1, node.val.length - 1);
|
||||
node.escaped = true;
|
||||
}
|
||||
|
||||
if (node.match) {
|
||||
var match = node.match[1];
|
||||
if (!match || match.indexOf('}') === -1) {
|
||||
match = node.match[0];
|
||||
}
|
||||
|
||||
// replace each set with a single ","
|
||||
var val = match.replace(/\{/g, ',').replace(/\}/g, '');
|
||||
node.multiplier *= val.length;
|
||||
node.val = '';
|
||||
}
|
||||
|
||||
var simpleText = last.type === 'text'
|
||||
&& last.multiplier === 1
|
||||
&& node.multiplier === 1
|
||||
&& node.val;
|
||||
|
||||
if (simpleText) {
|
||||
last.val += node.val;
|
||||
return;
|
||||
}
|
||||
|
||||
prev.push(node);
|
||||
}
|
||||
343
node_modules/sane/node_modules/braces/lib/utils.js
generated
vendored
Normal file
343
node_modules/sane/node_modules/braces/lib/utils.js
generated
vendored
Normal file
|
|
@ -0,0 +1,343 @@
|
|||
'use strict';
|
||||
|
||||
var splitString = require('split-string');
|
||||
var utils = module.exports;
|
||||
|
||||
/**
|
||||
* Module dependencies
|
||||
*/
|
||||
|
||||
utils.extend = require('extend-shallow');
|
||||
utils.flatten = require('arr-flatten');
|
||||
utils.isObject = require('isobject');
|
||||
utils.fillRange = require('fill-range');
|
||||
utils.repeat = require('repeat-element');
|
||||
utils.unique = require('array-unique');
|
||||
|
||||
utils.define = function(obj, key, val) {
|
||||
Object.defineProperty(obj, key, {
|
||||
writable: true,
|
||||
configurable: true,
|
||||
enumerable: false,
|
||||
value: val
|
||||
});
|
||||
};
|
||||
|
||||
/**
|
||||
* Returns true if the given string contains only empty brace sets.
|
||||
*/
|
||||
|
||||
utils.isEmptySets = function(str) {
|
||||
return /^(?:\{,\})+$/.test(str);
|
||||
};
|
||||
|
||||
/**
|
||||
* Returns true if the given string contains only empty brace sets.
|
||||
*/
|
||||
|
||||
utils.isQuotedString = function(str) {
|
||||
var open = str.charAt(0);
|
||||
if (open === '\'' || open === '"' || open === '`') {
|
||||
return str.slice(-1) === open;
|
||||
}
|
||||
return false;
|
||||
};
|
||||
|
||||
/**
|
||||
* Create the key to use for memoization. The unique key is generated
|
||||
* by iterating over the options and concatenating key-value pairs
|
||||
* to the pattern string.
|
||||
*/
|
||||
|
||||
utils.createKey = function(pattern, options) {
|
||||
var id = pattern;
|
||||
if (typeof options === 'undefined') {
|
||||
return id;
|
||||
}
|
||||
var keys = Object.keys(options);
|
||||
for (var i = 0; i < keys.length; i++) {
|
||||
var key = keys[i];
|
||||
id += ';' + key + '=' + String(options[key]);
|
||||
}
|
||||
return id;
|
||||
};
|
||||
|
||||
/**
|
||||
* Normalize options
|
||||
*/
|
||||
|
||||
utils.createOptions = function(options) {
|
||||
var opts = utils.extend.apply(null, arguments);
|
||||
if (typeof opts.expand === 'boolean') {
|
||||
opts.optimize = !opts.expand;
|
||||
}
|
||||
if (typeof opts.optimize === 'boolean') {
|
||||
opts.expand = !opts.optimize;
|
||||
}
|
||||
if (opts.optimize === true) {
|
||||
opts.makeRe = true;
|
||||
}
|
||||
return opts;
|
||||
};
|
||||
|
||||
/**
|
||||
* Join patterns in `a` to patterns in `b`
|
||||
*/
|
||||
|
||||
utils.join = function(a, b, options) {
|
||||
options = options || {};
|
||||
a = utils.arrayify(a);
|
||||
b = utils.arrayify(b);
|
||||
|
||||
if (!a.length) return b;
|
||||
if (!b.length) return a;
|
||||
|
||||
var len = a.length;
|
||||
var idx = -1;
|
||||
var arr = [];
|
||||
|
||||
while (++idx < len) {
|
||||
var val = a[idx];
|
||||
if (Array.isArray(val)) {
|
||||
for (var i = 0; i < val.length; i++) {
|
||||
val[i] = utils.join(val[i], b, options);
|
||||
}
|
||||
arr.push(val);
|
||||
continue;
|
||||
}
|
||||
|
||||
for (var j = 0; j < b.length; j++) {
|
||||
var bval = b[j];
|
||||
|
||||
if (Array.isArray(bval)) {
|
||||
arr.push(utils.join(val, bval, options));
|
||||
} else {
|
||||
arr.push(val + bval);
|
||||
}
|
||||
}
|
||||
}
|
||||
return arr;
|
||||
};
|
||||
|
||||
/**
|
||||
* Split the given string on `,` if not escaped.
|
||||
*/
|
||||
|
||||
utils.split = function(str, options) {
|
||||
var opts = utils.extend({sep: ','}, options);
|
||||
if (typeof opts.keepQuotes !== 'boolean') {
|
||||
opts.keepQuotes = true;
|
||||
}
|
||||
if (opts.unescape === false) {
|
||||
opts.keepEscaping = true;
|
||||
}
|
||||
return splitString(str, opts, utils.escapeBrackets(opts));
|
||||
};
|
||||
|
||||
/**
|
||||
* Expand ranges or sets in the given `pattern`.
|
||||
*
|
||||
* @param {String} `str`
|
||||
* @param {Object} `options`
|
||||
* @return {Object}
|
||||
*/
|
||||
|
||||
utils.expand = function(str, options) {
|
||||
var opts = utils.extend({rangeLimit: 10000}, options);
|
||||
var segs = utils.split(str, opts);
|
||||
var tok = { segs: segs };
|
||||
|
||||
if (utils.isQuotedString(str)) {
|
||||
return tok;
|
||||
}
|
||||
|
||||
if (opts.rangeLimit === true) {
|
||||
opts.rangeLimit = 10000;
|
||||
}
|
||||
|
||||
if (segs.length > 1) {
|
||||
if (opts.optimize === false) {
|
||||
tok.val = segs[0];
|
||||
return tok;
|
||||
}
|
||||
|
||||
tok.segs = utils.stringifyArray(tok.segs);
|
||||
} else if (segs.length === 1) {
|
||||
var arr = str.split('..');
|
||||
|
||||
if (arr.length === 1) {
|
||||
tok.val = tok.segs[tok.segs.length - 1] || tok.val || str;
|
||||
tok.segs = [];
|
||||
return tok;
|
||||
}
|
||||
|
||||
if (arr.length === 2 && arr[0] === arr[1]) {
|
||||
tok.escaped = true;
|
||||
tok.val = arr[0];
|
||||
tok.segs = [];
|
||||
return tok;
|
||||
}
|
||||
|
||||
if (arr.length > 1) {
|
||||
if (opts.optimize !== false) {
|
||||
opts.optimize = true;
|
||||
delete opts.expand;
|
||||
}
|
||||
|
||||
if (opts.optimize !== true) {
|
||||
var min = Math.min(arr[0], arr[1]);
|
||||
var max = Math.max(arr[0], arr[1]);
|
||||
var step = arr[2] || 1;
|
||||
|
||||
if (opts.rangeLimit !== false && ((max - min) / step >= opts.rangeLimit)) {
|
||||
throw new RangeError('expanded array length exceeds range limit. Use options.rangeLimit to increase or disable the limit.');
|
||||
}
|
||||
}
|
||||
|
||||
arr.push(opts);
|
||||
tok.segs = utils.fillRange.apply(null, arr);
|
||||
|
||||
if (!tok.segs.length) {
|
||||
tok.escaped = true;
|
||||
tok.val = str;
|
||||
return tok;
|
||||
}
|
||||
|
||||
if (opts.optimize === true) {
|
||||
tok.segs = utils.stringifyArray(tok.segs);
|
||||
}
|
||||
|
||||
if (tok.segs === '') {
|
||||
tok.val = str;
|
||||
} else {
|
||||
tok.val = tok.segs[0];
|
||||
}
|
||||
return tok;
|
||||
}
|
||||
} else {
|
||||
tok.val = str;
|
||||
}
|
||||
return tok;
|
||||
};
|
||||
|
||||
/**
|
||||
* Ensure commas inside brackets and parens are not split.
|
||||
* @param {Object} `tok` Token from the `split-string` module
|
||||
* @return {undefined}
|
||||
*/
|
||||
|
||||
utils.escapeBrackets = function(options) {
|
||||
return function(tok) {
|
||||
if (tok.escaped && tok.val === 'b') {
|
||||
tok.val = '\\b';
|
||||
return;
|
||||
}
|
||||
|
||||
if (tok.val !== '(' && tok.val !== '[') return;
|
||||
var opts = utils.extend({}, options);
|
||||
var brackets = [];
|
||||
var parens = [];
|
||||
var stack = [];
|
||||
var val = tok.val;
|
||||
var str = tok.str;
|
||||
var i = tok.idx - 1;
|
||||
|
||||
while (++i < str.length) {
|
||||
var ch = str[i];
|
||||
|
||||
if (ch === '\\') {
|
||||
val += (opts.keepEscaping === false ? '' : ch) + str[++i];
|
||||
continue;
|
||||
}
|
||||
|
||||
if (ch === '(') {
|
||||
parens.push(ch);
|
||||
stack.push(ch);
|
||||
}
|
||||
|
||||
if (ch === '[') {
|
||||
brackets.push(ch);
|
||||
stack.push(ch);
|
||||
}
|
||||
|
||||
if (ch === ')') {
|
||||
parens.pop();
|
||||
stack.pop();
|
||||
if (!stack.length) {
|
||||
val += ch;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
if (ch === ']') {
|
||||
brackets.pop();
|
||||
stack.pop();
|
||||
if (!stack.length) {
|
||||
val += ch;
|
||||
break;
|
||||
}
|
||||
}
|
||||
val += ch;
|
||||
}
|
||||
|
||||
tok.split = false;
|
||||
tok.val = val.slice(1);
|
||||
tok.idx = i;
|
||||
};
|
||||
};
|
||||
|
||||
/**
|
||||
* Returns true if the given string looks like a regex quantifier
|
||||
* @return {Boolean}
|
||||
*/
|
||||
|
||||
utils.isQuantifier = function(str) {
|
||||
return /^(?:[0-9]?,[0-9]|[0-9],)$/.test(str);
|
||||
};
|
||||
|
||||
/**
|
||||
* Cast `val` to an array.
|
||||
* @param {*} `val`
|
||||
*/
|
||||
|
||||
utils.stringifyArray = function(arr) {
|
||||
return [utils.arrayify(arr).join('|')];
|
||||
};
|
||||
|
||||
/**
|
||||
* Cast `val` to an array.
|
||||
* @param {*} `val`
|
||||
*/
|
||||
|
||||
utils.arrayify = function(arr) {
|
||||
if (typeof arr === 'undefined') {
|
||||
return [];
|
||||
}
|
||||
if (typeof arr === 'string') {
|
||||
return [arr];
|
||||
}
|
||||
return arr;
|
||||
};
|
||||
|
||||
/**
|
||||
* Returns true if the given `str` is a non-empty string
|
||||
* @return {Boolean}
|
||||
*/
|
||||
|
||||
utils.isString = function(str) {
|
||||
return str != null && typeof str === 'string';
|
||||
};
|
||||
|
||||
/**
|
||||
* Get the last element from `array`
|
||||
* @param {Array} `array`
|
||||
* @return {*}
|
||||
*/
|
||||
|
||||
utils.last = function(arr, n) {
|
||||
return arr[arr.length - (n || 1)];
|
||||
};
|
||||
|
||||
utils.escapeRegex = function(str) {
|
||||
return str.replace(/\\?([!^*?()[\]{}+?/])/g, '\\$1');
|
||||
};
|
||||
21
node_modules/sane/node_modules/braces/node_modules/extend-shallow/LICENSE
generated
vendored
Normal file
21
node_modules/sane/node_modules/braces/node_modules/extend-shallow/LICENSE
generated
vendored
Normal file
|
|
@ -0,0 +1,21 @@
|
|||
The MIT License (MIT)
|
||||
|
||||
Copyright (c) 2014-2015, 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.
|
||||
61
node_modules/sane/node_modules/braces/node_modules/extend-shallow/README.md
generated
vendored
Normal file
61
node_modules/sane/node_modules/braces/node_modules/extend-shallow/README.md
generated
vendored
Normal file
|
|
@ -0,0 +1,61 @@
|
|||
# extend-shallow [](http://badge.fury.io/js/extend-shallow) [](https://travis-ci.org/jonschlinkert/extend-shallow)
|
||||
|
||||
> Extend an object with the properties of additional objects. node.js/javascript util.
|
||||
|
||||
## Install
|
||||
|
||||
Install with [npm](https://www.npmjs.com/)
|
||||
|
||||
```sh
|
||||
$ npm i extend-shallow --save
|
||||
```
|
||||
|
||||
## Usage
|
||||
|
||||
```js
|
||||
var extend = require('extend-shallow');
|
||||
|
||||
extend({a: 'b'}, {c: 'd'})
|
||||
//=> {a: 'b', c: 'd'}
|
||||
```
|
||||
|
||||
Pass an empty object to shallow clone:
|
||||
|
||||
```js
|
||||
var obj = {};
|
||||
extend(obj, {a: 'b'}, {c: 'd'})
|
||||
//=> {a: 'b', c: 'd'}
|
||||
```
|
||||
|
||||
## Related
|
||||
|
||||
* [extend-shallow](https://github.com/jonschlinkert/extend-shallow): Extend an object with the properties of additional objects. node.js/javascript util.
|
||||
* [for-own](https://github.com/jonschlinkert/for-own): Iterate over the own enumerable properties of an object, and return an object with properties… [more](https://github.com/jonschlinkert/for-own)
|
||||
* [for-in](https://github.com/jonschlinkert/for-in): Iterate over the own and inherited enumerable properties of an objecte, and return an object… [more](https://github.com/jonschlinkert/for-in)
|
||||
* [is-plain-object](https://github.com/jonschlinkert/is-plain-object): Returns true if an object was created by the `Object` constructor.
|
||||
* [isobject](https://github.com/jonschlinkert/isobject): Returns true if the value is an object and not an array or null.
|
||||
* [kind-of](https://github.com/jonschlinkert/kind-of): Get the native type of a value.
|
||||
|
||||
## Running tests
|
||||
|
||||
Install dev dependencies:
|
||||
|
||||
```sh
|
||||
$ npm i -d && npm test
|
||||
```
|
||||
|
||||
## Author
|
||||
|
||||
**Jon Schlinkert**
|
||||
|
||||
+ [github/jonschlinkert](https://github.com/jonschlinkert)
|
||||
+ [twitter/jonschlinkert](http://twitter.com/jonschlinkert)
|
||||
|
||||
## License
|
||||
|
||||
Copyright © 2015 Jon Schlinkert
|
||||
Released under the MIT license.
|
||||
|
||||
***
|
||||
|
||||
_This file was generated by [verb-cli](https://github.com/assemble/verb-cli) on June 29, 2015._
|
||||
33
node_modules/sane/node_modules/braces/node_modules/extend-shallow/index.js
generated
vendored
Normal file
33
node_modules/sane/node_modules/braces/node_modules/extend-shallow/index.js
generated
vendored
Normal file
|
|
@ -0,0 +1,33 @@
|
|||
'use strict';
|
||||
|
||||
var isObject = require('is-extendable');
|
||||
|
||||
module.exports = function extend(o/*, objects*/) {
|
||||
if (!isObject(o)) { o = {}; }
|
||||
|
||||
var len = arguments.length;
|
||||
for (var i = 1; i < len; i++) {
|
||||
var obj = arguments[i];
|
||||
|
||||
if (isObject(obj)) {
|
||||
assign(o, obj);
|
||||
}
|
||||
}
|
||||
return o;
|
||||
};
|
||||
|
||||
function assign(a, b) {
|
||||
for (var key in b) {
|
||||
if (hasOwn(b, key)) {
|
||||
a[key] = b[key];
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* Returns true if the given `key` is an own property of `obj`.
|
||||
*/
|
||||
|
||||
function hasOwn(obj, key) {
|
||||
return Object.prototype.hasOwnProperty.call(obj, key);
|
||||
}
|
||||
56
node_modules/sane/node_modules/braces/node_modules/extend-shallow/package.json
generated
vendored
Normal file
56
node_modules/sane/node_modules/braces/node_modules/extend-shallow/package.json
generated
vendored
Normal file
|
|
@ -0,0 +1,56 @@
|
|||
{
|
||||
"name": "extend-shallow",
|
||||
"description": "Extend an object with the properties of additional objects. node.js/javascript util.",
|
||||
"version": "2.0.1",
|
||||
"homepage": "https://github.com/jonschlinkert/extend-shallow",
|
||||
"author": "Jon Schlinkert (https://github.com/jonschlinkert)",
|
||||
"repository": "jonschlinkert/extend-shallow",
|
||||
"bugs": {
|
||||
"url": "https://github.com/jonschlinkert/extend-shallow/issues"
|
||||
},
|
||||
"license": "MIT",
|
||||
"files": [
|
||||
"index.js"
|
||||
],
|
||||
"main": "index.js",
|
||||
"engines": {
|
||||
"node": ">=0.10.0"
|
||||
},
|
||||
"scripts": {
|
||||
"test": "mocha"
|
||||
},
|
||||
"dependencies": {
|
||||
"is-extendable": "^0.1.0"
|
||||
},
|
||||
"devDependencies": {
|
||||
"array-slice": "^0.2.3",
|
||||
"benchmarked": "^0.1.4",
|
||||
"chalk": "^1.0.0",
|
||||
"for-own": "^0.1.3",
|
||||
"glob": "^5.0.12",
|
||||
"is-plain-object": "^2.0.1",
|
||||
"kind-of": "^2.0.0",
|
||||
"minimist": "^1.1.1",
|
||||
"mocha": "^2.2.5",
|
||||
"should": "^7.0.1"
|
||||
},
|
||||
"keywords": [
|
||||
"assign",
|
||||
"extend",
|
||||
"javascript",
|
||||
"js",
|
||||
"keys",
|
||||
"merge",
|
||||
"obj",
|
||||
"object",
|
||||
"prop",
|
||||
"properties",
|
||||
"property",
|
||||
"props",
|
||||
"shallow",
|
||||
"util",
|
||||
"utility",
|
||||
"utils",
|
||||
"value"
|
||||
]
|
||||
}
|
||||
108
node_modules/sane/node_modules/braces/package.json
generated
vendored
Normal file
108
node_modules/sane/node_modules/braces/package.json
generated
vendored
Normal file
|
|
@ -0,0 +1,108 @@
|
|||
{
|
||||
"name": "braces",
|
||||
"description": "Bash-like brace expansion, implemented in JavaScript. Safer than other brace expansion libs, with complete support for the Bash 4.3 braces specification, without sacrificing speed.",
|
||||
"version": "2.3.2",
|
||||
"homepage": "https://github.com/micromatch/braces",
|
||||
"author": "Jon Schlinkert (https://github.com/jonschlinkert)",
|
||||
"contributors": [
|
||||
"Brian Woodward (https://twitter.com/doowb)",
|
||||
"Elan Shanker (https://github.com/es128)",
|
||||
"Eugene Sharygin (https://github.com/eush77)",
|
||||
"hemanth.hm (http://h3manth.com)",
|
||||
"Jon Schlinkert (http://twitter.com/jonschlinkert)"
|
||||
],
|
||||
"repository": "micromatch/braces",
|
||||
"bugs": {
|
||||
"url": "https://github.com/micromatch/braces/issues"
|
||||
},
|
||||
"license": "MIT",
|
||||
"files": [
|
||||
"index.js",
|
||||
"lib"
|
||||
],
|
||||
"main": "index.js",
|
||||
"engines": {
|
||||
"node": ">=0.10.0"
|
||||
},
|
||||
"scripts": {
|
||||
"test": "mocha",
|
||||
"benchmark": "node benchmark"
|
||||
},
|
||||
"dependencies": {
|
||||
"arr-flatten": "^1.1.0",
|
||||
"array-unique": "^0.3.2",
|
||||
"extend-shallow": "^2.0.1",
|
||||
"fill-range": "^4.0.0",
|
||||
"isobject": "^3.0.1",
|
||||
"repeat-element": "^1.1.2",
|
||||
"snapdragon": "^0.8.1",
|
||||
"snapdragon-node": "^2.0.1",
|
||||
"split-string": "^3.0.2",
|
||||
"to-regex": "^3.0.1"
|
||||
},
|
||||
"devDependencies": {
|
||||
"ansi-cyan": "^0.1.1",
|
||||
"benchmarked": "^2.0.0",
|
||||
"brace-expansion": "^1.1.8",
|
||||
"cross-spawn": "^5.1.0",
|
||||
"gulp": "^3.9.1",
|
||||
"gulp-eslint": "^4.0.0",
|
||||
"gulp-format-md": "^1.0.0",
|
||||
"gulp-istanbul": "^1.1.2",
|
||||
"gulp-mocha": "^3.0.1",
|
||||
"gulp-unused": "^0.2.1",
|
||||
"is-windows": "^1.0.1",
|
||||
"minimatch": "^3.0.4",
|
||||
"mocha": "^3.2.0",
|
||||
"noncharacters": "^1.1.0",
|
||||
"text-table": "^0.2.0",
|
||||
"time-diff": "^0.3.1",
|
||||
"yargs-parser": "^8.0.0"
|
||||
},
|
||||
"keywords": [
|
||||
"alpha",
|
||||
"alphabetical",
|
||||
"bash",
|
||||
"brace",
|
||||
"braces",
|
||||
"expand",
|
||||
"expansion",
|
||||
"filepath",
|
||||
"fill",
|
||||
"fs",
|
||||
"glob",
|
||||
"globbing",
|
||||
"letter",
|
||||
"match",
|
||||
"matches",
|
||||
"matching",
|
||||
"number",
|
||||
"numerical",
|
||||
"path",
|
||||
"range",
|
||||
"ranges",
|
||||
"sh"
|
||||
],
|
||||
"verb": {
|
||||
"toc": false,
|
||||
"layout": "default",
|
||||
"tasks": [
|
||||
"readme"
|
||||
],
|
||||
"lint": {
|
||||
"reflinks": true
|
||||
},
|
||||
"plugins": [
|
||||
"gulp-format-md"
|
||||
],
|
||||
"related": {
|
||||
"list": [
|
||||
"expand-brackets",
|
||||
"extglob",
|
||||
"fill-range",
|
||||
"micromatch",
|
||||
"nanomatch"
|
||||
]
|
||||
}
|
||||
}
|
||||
}
|
||||
21
node_modules/sane/node_modules/fill-range/LICENSE
generated
vendored
Normal file
21
node_modules/sane/node_modules/fill-range/LICENSE
generated
vendored
Normal file
|
|
@ -0,0 +1,21 @@
|
|||
The MIT License (MIT)
|
||||
|
||||
Copyright (c) 2014-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.
|
||||
250
node_modules/sane/node_modules/fill-range/README.md
generated
vendored
Normal file
250
node_modules/sane/node_modules/fill-range/README.md
generated
vendored
Normal file
|
|
@ -0,0 +1,250 @@
|
|||
# fill-range [](https://www.npmjs.com/package/fill-range) [](https://npmjs.org/package/fill-range) [](https://npmjs.org/package/fill-range) [](https://travis-ci.org/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`
|
||||
|
||||
## Table of Contents
|
||||
|
||||
- [Install](#install)
|
||||
- [Usage](#usage)
|
||||
- [Examples](#examples)
|
||||
- [Options](#options)
|
||||
* [options.step](#optionsstep)
|
||||
* [options.strictRanges](#optionsstrictranges)
|
||||
* [options.stringify](#optionsstringify)
|
||||
* [options.toRegex](#optionstoregex)
|
||||
* [options.transform](#optionstransform)
|
||||
- [About](#about)
|
||||
|
||||
_(TOC generated by [verb](https://github.com/verbose/verb) using [markdown-toc](https://github.com/jonschlinkert/markdown-toc))_
|
||||
|
||||
## Install
|
||||
|
||||
Install with [npm](https://www.npmjs.com/):
|
||||
|
||||
```sh
|
||||
$ npm install --save fill-range
|
||||
```
|
||||
|
||||
Install with [yarn](https://yarnpkg.com):
|
||||
|
||||
```sh
|
||||
$ yarn add fill-range
|
||||
```
|
||||
|
||||
## Usage
|
||||
|
||||
Expands numbers and letters, optionally using a `step` as the last argument. _(Numbers may be defined as JavaScript numbers or strings)_.
|
||||
|
||||
```js
|
||||
var fill = require('fill-range');
|
||||
fill(from, to[, step, options]);
|
||||
|
||||
// examples
|
||||
console.log(fill('1', '10')); //=> '[ '1', '2', '3', '4', '5', '6', '7', '8', '9', '10' ]'
|
||||
console.log(fill('1', '10', {toRegex: true})); //=> [1-9]|10
|
||||
```
|
||||
|
||||
**Params**
|
||||
|
||||
* `from`: **{String|Number}** the number or letter to start with
|
||||
* `to`: **{String|Number}** the number or letter to end with
|
||||
* `step`: **{String|Number|Object|Function}** Optionally pass a [step](#optionsstep) to use.
|
||||
* `options`: **{Object|Function}**: See all available [options](#options)
|
||||
|
||||
## Examples
|
||||
|
||||
By default, an array of values is returned.
|
||||
|
||||
**Alphabetical ranges**
|
||||
|
||||
```js
|
||||
console.log(fill('a', 'e')); //=> ['a', 'b', 'c', 'd', 'e']
|
||||
console.log(fill('A', 'E')); //=> [ 'A', 'B', 'C', 'D', 'E' ]
|
||||
```
|
||||
|
||||
**Numerical ranges**
|
||||
|
||||
Numbers can be defined as actual numbers or strings.
|
||||
|
||||
```js
|
||||
console.log(fill(1, 5)); //=> [ 1, 2, 3, 4, 5 ]
|
||||
console.log(fill('1', '5')); //=> [ 1, 2, 3, 4, 5 ]
|
||||
```
|
||||
|
||||
**Negative ranges**
|
||||
|
||||
Numbers can be defined as actual numbers or strings.
|
||||
|
||||
```js
|
||||
console.log(fill('-5', '-1')); //=> [ '-5', '-4', '-3', '-2', '-1' ]
|
||||
console.log(fill('-5', '5')); //=> [ '-5', '-4', '-3', '-2', '-1', '0', '1', '2', '3', '4', '5' ]
|
||||
```
|
||||
|
||||
**Steps (increments)**
|
||||
|
||||
```js
|
||||
// numerical ranges with increments
|
||||
console.log(fill('0', '25', 4)); //=> [ '0', '4', '8', '12', '16', '20', '24' ]
|
||||
console.log(fill('0', '25', 5)); //=> [ '0', '5', '10', '15', '20', '25' ]
|
||||
console.log(fill('0', '25', 6)); //=> [ '0', '6', '12', '18', '24' ]
|
||||
|
||||
// alphabetical ranges with increments
|
||||
console.log(fill('a', 'z', 4)); //=> [ 'a', 'e', 'i', 'm', 'q', 'u', 'y' ]
|
||||
console.log(fill('a', 'z', 5)); //=> [ 'a', 'f', 'k', 'p', 'u', 'z' ]
|
||||
console.log(fill('a', 'z', 6)); //=> [ 'a', 'g', 'm', 's', 'y' ]
|
||||
```
|
||||
|
||||
## Options
|
||||
|
||||
### options.step
|
||||
|
||||
**Type**: `number` (formatted as a string or number)
|
||||
|
||||
**Default**: `undefined`
|
||||
|
||||
**Description**: The increment to use for the range. Can be used with letters or numbers.
|
||||
|
||||
**Example(s)**
|
||||
|
||||
```js
|
||||
// numbers
|
||||
console.log(fill('1', '10', 2)); //=> [ '1', '3', '5', '7', '9' ]
|
||||
console.log(fill('1', '10', 3)); //=> [ '1', '4', '7', '10' ]
|
||||
console.log(fill('1', '10', 4)); //=> [ '1', '5', '9' ]
|
||||
|
||||
// letters
|
||||
console.log(fill('a', 'z', 5)); //=> [ 'a', 'f', 'k', 'p', 'u', 'z' ]
|
||||
console.log(fill('a', 'z', 7)); //=> [ 'a', 'h', 'o', 'v' ]
|
||||
console.log(fill('a', 'z', 9)); //=> [ 'a', 'j', 's' ]
|
||||
```
|
||||
|
||||
### options.strictRanges
|
||||
|
||||
**Type**: `boolean`
|
||||
|
||||
**Default**: `false`
|
||||
|
||||
**Description**: By default, `null` is returned when an invalid range is passed. Enable this option to throw a `RangeError` on invalid ranges.
|
||||
|
||||
**Example(s)**
|
||||
|
||||
The following are all invalid:
|
||||
|
||||
```js
|
||||
fill('1.1', '2'); // decimals not supported in ranges
|
||||
fill('a', '2'); // incompatible range values
|
||||
fill(1, 10, 'foo'); // invalid "step" argument
|
||||
```
|
||||
|
||||
### options.stringify
|
||||
|
||||
**Type**: `boolean`
|
||||
|
||||
**Default**: `undefined`
|
||||
|
||||
**Description**: Cast all returned values to strings. By default, integers are returned as numbers.
|
||||
|
||||
**Example(s)**
|
||||
|
||||
```js
|
||||
console.log(fill(1, 5)); //=> [ 1, 2, 3, 4, 5 ]
|
||||
console.log(fill(1, 5, {stringify: true})); //=> [ '1', '2', '3', '4', '5' ]
|
||||
```
|
||||
|
||||
### options.toRegex
|
||||
|
||||
**Type**: `boolean`
|
||||
|
||||
**Default**: `undefined`
|
||||
|
||||
**Description**: Create a regex-compatible source string, instead of expanding values to an array.
|
||||
|
||||
**Example(s)**
|
||||
|
||||
```js
|
||||
// alphabetical range
|
||||
console.log(fill('a', 'e', {toRegex: true})); //=> '[a-e]'
|
||||
// alphabetical with step
|
||||
console.log(fill('a', 'z', 3, {toRegex: true})); //=> 'a|d|g|j|m|p|s|v|y'
|
||||
// numerical range
|
||||
console.log(fill('1', '100', {toRegex: true})); //=> '[1-9]|[1-9][0-9]|100'
|
||||
// numerical range with zero padding
|
||||
console.log(fill('000001', '100000', {toRegex: true}));
|
||||
//=> '0{5}[1-9]|0{4}[1-9][0-9]|0{3}[1-9][0-9]{2}|0{2}[1-9][0-9]{3}|0[1-9][0-9]{4}|100000'
|
||||
```
|
||||
|
||||
### options.transform
|
||||
|
||||
**Type**: `function`
|
||||
|
||||
**Default**: `undefined`
|
||||
|
||||
**Description**: Customize each value in the returned array (or [string](#optionstoRegex)). _(you can also pass this function as the last argument to `fill()`)_.
|
||||
|
||||
**Example(s)**
|
||||
|
||||
```js
|
||||
// increase padding by two
|
||||
var arr = fill('01', '05', function(val, a, b, step, idx, arr, options) {
|
||||
return repeat('0', (options.maxLength + 2) - val.length) + val;
|
||||
});
|
||||
|
||||
console.log(arr);
|
||||
//=> ['0001', '0002', '0003', '0004', '0005']
|
||||
```
|
||||
|
||||
## About
|
||||
|
||||
### Related projects
|
||||
|
||||
* [braces](https://www.npmjs.com/package/braces): Fast, comprehensive, bash-like brace expansion implemented in JavaScript. Complete support for the Bash 4.3 braces… [more](https://github.com/jonschlinkert/braces) | [homepage](https://github.com/jonschlinkert/braces "Fast, comprehensive, bash-like brace expansion implemented in JavaScript. Complete support for the Bash 4.3 braces specification, without sacrificing speed.")
|
||||
* [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.")
|
||||
* [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.")
|
||||
* [to-regex-range](https://www.npmjs.com/package/to-regex-range): Pass two numbers, get a regex-compatible source string for matching ranges. Validated against more than… [more](https://github.com/jonschlinkert/to-regex-range) | [homepage](https://github.com/jonschlinkert/to-regex-range "Pass two numbers, get a regex-compatible source string for matching ranges. Validated against more than 2.87 million test assertions.")
|
||||
|
||||
### Contributing
|
||||
|
||||
Pull requests and stars are always welcome. For bugs and feature requests, [please create an issue](../../issues/new).
|
||||
|
||||
### Contributors
|
||||
|
||||
| **Commits** | **Contributor** |
|
||||
| --- | --- |
|
||||
| 103 | [jonschlinkert](https://github.com/jonschlinkert) |
|
||||
| 2 | [paulmillr](https://github.com/paulmillr) |
|
||||
| 1 | [edorivai](https://github.com/edorivai) |
|
||||
| 1 | [wtgtybhertgeghgtwtg](https://github.com/wtgtybhertgeghgtwtg) |
|
||||
|
||||
### 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.5.0, on April 23, 2017._
|
||||
208
node_modules/sane/node_modules/fill-range/index.js
generated
vendored
Normal file
208
node_modules/sane/node_modules/fill-range/index.js
generated
vendored
Normal file
|
|
@ -0,0 +1,208 @@
|
|||
/*!
|
||||
* fill-range <https://github.com/jonschlinkert/fill-range>
|
||||
*
|
||||
* Copyright (c) 2014-2015, 2017, Jon Schlinkert.
|
||||
* Released under the MIT License.
|
||||
*/
|
||||
|
||||
'use strict';
|
||||
|
||||
var util = require('util');
|
||||
var isNumber = require('is-number');
|
||||
var extend = require('extend-shallow');
|
||||
var repeat = require('repeat-string');
|
||||
var toRegex = require('to-regex-range');
|
||||
|
||||
/**
|
||||
* Return a range of numbers or letters.
|
||||
*
|
||||
* @param {String} `start` Start of the range
|
||||
* @param {String} `stop` End of the range
|
||||
* @param {String} `step` Increment or decrement to use.
|
||||
* @param {Function} `fn` Custom function to modify each element in the range.
|
||||
* @return {Array}
|
||||
*/
|
||||
|
||||
function fillRange(start, stop, step, options) {
|
||||
if (typeof start === 'undefined') {
|
||||
return [];
|
||||
}
|
||||
|
||||
if (typeof stop === 'undefined' || start === stop) {
|
||||
// special case, for handling negative zero
|
||||
var isString = typeof start === 'string';
|
||||
if (isNumber(start) && !toNumber(start)) {
|
||||
return [isString ? '0' : 0];
|
||||
}
|
||||
return [start];
|
||||
}
|
||||
|
||||
if (typeof step !== 'number' && typeof step !== 'string') {
|
||||
options = step;
|
||||
step = undefined;
|
||||
}
|
||||
|
||||
if (typeof options === 'function') {
|
||||
options = { transform: options };
|
||||
}
|
||||
|
||||
var opts = extend({step: step}, options);
|
||||
if (opts.step && !isValidNumber(opts.step)) {
|
||||
if (opts.strictRanges === true) {
|
||||
throw new TypeError('expected options.step to be a number');
|
||||
}
|
||||
return [];
|
||||
}
|
||||
|
||||
opts.isNumber = isValidNumber(start) && isValidNumber(stop);
|
||||
if (!opts.isNumber && !isValid(start, stop)) {
|
||||
if (opts.strictRanges === true) {
|
||||
throw new RangeError('invalid range arguments: ' + util.inspect([start, stop]));
|
||||
}
|
||||
return [];
|
||||
}
|
||||
|
||||
opts.isPadded = isPadded(start) || isPadded(stop);
|
||||
opts.toString = opts.stringify
|
||||
|| typeof opts.step === 'string'
|
||||
|| typeof start === 'string'
|
||||
|| typeof stop === 'string'
|
||||
|| !opts.isNumber;
|
||||
|
||||
if (opts.isPadded) {
|
||||
opts.maxLength = Math.max(String(start).length, String(stop).length);
|
||||
}
|
||||
|
||||
// support legacy minimatch/fill-range options
|
||||
if (typeof opts.optimize === 'boolean') opts.toRegex = opts.optimize;
|
||||
if (typeof opts.makeRe === 'boolean') opts.toRegex = opts.makeRe;
|
||||
return expand(start, stop, opts);
|
||||
}
|
||||
|
||||
function expand(start, stop, options) {
|
||||
var a = options.isNumber ? toNumber(start) : start.charCodeAt(0);
|
||||
var b = options.isNumber ? toNumber(stop) : stop.charCodeAt(0);
|
||||
|
||||
var step = Math.abs(toNumber(options.step)) || 1;
|
||||
if (options.toRegex && step === 1) {
|
||||
return toRange(a, b, start, stop, options);
|
||||
}
|
||||
|
||||
var zero = {greater: [], lesser: []};
|
||||
var asc = a < b;
|
||||
var arr = new Array(Math.round((asc ? b - a : a - b) / step));
|
||||
var idx = 0;
|
||||
|
||||
while (asc ? a <= b : a >= b) {
|
||||
var val = options.isNumber ? a : String.fromCharCode(a);
|
||||
if (options.toRegex && (val >= 0 || !options.isNumber)) {
|
||||
zero.greater.push(val);
|
||||
} else {
|
||||
zero.lesser.push(Math.abs(val));
|
||||
}
|
||||
|
||||
if (options.isPadded) {
|
||||
val = zeros(val, options);
|
||||
}
|
||||
|
||||
if (options.toString) {
|
||||
val = String(val);
|
||||
}
|
||||
|
||||
if (typeof options.transform === 'function') {
|
||||
arr[idx++] = options.transform(val, a, b, step, idx, arr, options);
|
||||
} else {
|
||||
arr[idx++] = val;
|
||||
}
|
||||
|
||||
if (asc) {
|
||||
a += step;
|
||||
} else {
|
||||
a -= step;
|
||||
}
|
||||
}
|
||||
|
||||
if (options.toRegex === true) {
|
||||
return toSequence(arr, zero, options);
|
||||
}
|
||||
return arr;
|
||||
}
|
||||
|
||||
function toRange(a, b, start, stop, options) {
|
||||
if (options.isPadded) {
|
||||
return toRegex(start, stop, options);
|
||||
}
|
||||
|
||||
if (options.isNumber) {
|
||||
return toRegex(Math.min(a, b), Math.max(a, b), options);
|
||||
}
|
||||
|
||||
var start = String.fromCharCode(Math.min(a, b));
|
||||
var stop = String.fromCharCode(Math.max(a, b));
|
||||
return '[' + start + '-' + stop + ']';
|
||||
}
|
||||
|
||||
function toSequence(arr, zeros, options) {
|
||||
var greater = '', lesser = '';
|
||||
if (zeros.greater.length) {
|
||||
greater = zeros.greater.join('|');
|
||||
}
|
||||
if (zeros.lesser.length) {
|
||||
lesser = '-(' + zeros.lesser.join('|') + ')';
|
||||
}
|
||||
var res = greater && lesser
|
||||
? greater + '|' + lesser
|
||||
: greater || lesser;
|
||||
|
||||
if (options.capture) {
|
||||
return '(' + res + ')';
|
||||
}
|
||||
return res;
|
||||
}
|
||||
|
||||
function zeros(val, options) {
|
||||
if (options.isPadded) {
|
||||
var str = String(val);
|
||||
var len = str.length;
|
||||
var dash = '';
|
||||
if (str.charAt(0) === '-') {
|
||||
dash = '-';
|
||||
str = str.slice(1);
|
||||
}
|
||||
var diff = options.maxLength - len;
|
||||
var pad = repeat('0', diff);
|
||||
val = (dash + pad + str);
|
||||
}
|
||||
if (options.stringify) {
|
||||
return String(val);
|
||||
}
|
||||
return val;
|
||||
}
|
||||
|
||||
function toNumber(val) {
|
||||
return Number(val) || 0;
|
||||
}
|
||||
|
||||
function isPadded(str) {
|
||||
return /^-?0\d/.test(str);
|
||||
}
|
||||
|
||||
function isValid(min, max) {
|
||||
return (isValidNumber(min) || isValidLetter(min))
|
||||
&& (isValidNumber(max) || isValidLetter(max));
|
||||
}
|
||||
|
||||
function isValidLetter(ch) {
|
||||
return typeof ch === 'string' && ch.length === 1 && /^\w+$/.test(ch);
|
||||
}
|
||||
|
||||
function isValidNumber(n) {
|
||||
return isNumber(n) && !/\./.test(n);
|
||||
}
|
||||
|
||||
/**
|
||||
* Expose `fillRange`
|
||||
* @type {Function}
|
||||
*/
|
||||
|
||||
module.exports = fillRange;
|
||||
21
node_modules/sane/node_modules/fill-range/node_modules/extend-shallow/LICENSE
generated
vendored
Normal file
21
node_modules/sane/node_modules/fill-range/node_modules/extend-shallow/LICENSE
generated
vendored
Normal file
|
|
@ -0,0 +1,21 @@
|
|||
The MIT License (MIT)
|
||||
|
||||
Copyright (c) 2014-2015, 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.
|
||||
61
node_modules/sane/node_modules/fill-range/node_modules/extend-shallow/README.md
generated
vendored
Normal file
61
node_modules/sane/node_modules/fill-range/node_modules/extend-shallow/README.md
generated
vendored
Normal file
|
|
@ -0,0 +1,61 @@
|
|||
# extend-shallow [](http://badge.fury.io/js/extend-shallow) [](https://travis-ci.org/jonschlinkert/extend-shallow)
|
||||
|
||||
> Extend an object with the properties of additional objects. node.js/javascript util.
|
||||
|
||||
## Install
|
||||
|
||||
Install with [npm](https://www.npmjs.com/)
|
||||
|
||||
```sh
|
||||
$ npm i extend-shallow --save
|
||||
```
|
||||
|
||||
## Usage
|
||||
|
||||
```js
|
||||
var extend = require('extend-shallow');
|
||||
|
||||
extend({a: 'b'}, {c: 'd'})
|
||||
//=> {a: 'b', c: 'd'}
|
||||
```
|
||||
|
||||
Pass an empty object to shallow clone:
|
||||
|
||||
```js
|
||||
var obj = {};
|
||||
extend(obj, {a: 'b'}, {c: 'd'})
|
||||
//=> {a: 'b', c: 'd'}
|
||||
```
|
||||
|
||||
## Related
|
||||
|
||||
* [extend-shallow](https://github.com/jonschlinkert/extend-shallow): Extend an object with the properties of additional objects. node.js/javascript util.
|
||||
* [for-own](https://github.com/jonschlinkert/for-own): Iterate over the own enumerable properties of an object, and return an object with properties… [more](https://github.com/jonschlinkert/for-own)
|
||||
* [for-in](https://github.com/jonschlinkert/for-in): Iterate over the own and inherited enumerable properties of an objecte, and return an object… [more](https://github.com/jonschlinkert/for-in)
|
||||
* [is-plain-object](https://github.com/jonschlinkert/is-plain-object): Returns true if an object was created by the `Object` constructor.
|
||||
* [isobject](https://github.com/jonschlinkert/isobject): Returns true if the value is an object and not an array or null.
|
||||
* [kind-of](https://github.com/jonschlinkert/kind-of): Get the native type of a value.
|
||||
|
||||
## Running tests
|
||||
|
||||
Install dev dependencies:
|
||||
|
||||
```sh
|
||||
$ npm i -d && npm test
|
||||
```
|
||||
|
||||
## Author
|
||||
|
||||
**Jon Schlinkert**
|
||||
|
||||
+ [github/jonschlinkert](https://github.com/jonschlinkert)
|
||||
+ [twitter/jonschlinkert](http://twitter.com/jonschlinkert)
|
||||
|
||||
## License
|
||||
|
||||
Copyright © 2015 Jon Schlinkert
|
||||
Released under the MIT license.
|
||||
|
||||
***
|
||||
|
||||
_This file was generated by [verb-cli](https://github.com/assemble/verb-cli) on June 29, 2015._
|
||||
33
node_modules/sane/node_modules/fill-range/node_modules/extend-shallow/index.js
generated
vendored
Normal file
33
node_modules/sane/node_modules/fill-range/node_modules/extend-shallow/index.js
generated
vendored
Normal file
|
|
@ -0,0 +1,33 @@
|
|||
'use strict';
|
||||
|
||||
var isObject = require('is-extendable');
|
||||
|
||||
module.exports = function extend(o/*, objects*/) {
|
||||
if (!isObject(o)) { o = {}; }
|
||||
|
||||
var len = arguments.length;
|
||||
for (var i = 1; i < len; i++) {
|
||||
var obj = arguments[i];
|
||||
|
||||
if (isObject(obj)) {
|
||||
assign(o, obj);
|
||||
}
|
||||
}
|
||||
return o;
|
||||
};
|
||||
|
||||
function assign(a, b) {
|
||||
for (var key in b) {
|
||||
if (hasOwn(b, key)) {
|
||||
a[key] = b[key];
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* Returns true if the given `key` is an own property of `obj`.
|
||||
*/
|
||||
|
||||
function hasOwn(obj, key) {
|
||||
return Object.prototype.hasOwnProperty.call(obj, key);
|
||||
}
|
||||
56
node_modules/sane/node_modules/fill-range/node_modules/extend-shallow/package.json
generated
vendored
Normal file
56
node_modules/sane/node_modules/fill-range/node_modules/extend-shallow/package.json
generated
vendored
Normal file
|
|
@ -0,0 +1,56 @@
|
|||
{
|
||||
"name": "extend-shallow",
|
||||
"description": "Extend an object with the properties of additional objects. node.js/javascript util.",
|
||||
"version": "2.0.1",
|
||||
"homepage": "https://github.com/jonschlinkert/extend-shallow",
|
||||
"author": "Jon Schlinkert (https://github.com/jonschlinkert)",
|
||||
"repository": "jonschlinkert/extend-shallow",
|
||||
"bugs": {
|
||||
"url": "https://github.com/jonschlinkert/extend-shallow/issues"
|
||||
},
|
||||
"license": "MIT",
|
||||
"files": [
|
||||
"index.js"
|
||||
],
|
||||
"main": "index.js",
|
||||
"engines": {
|
||||
"node": ">=0.10.0"
|
||||
},
|
||||
"scripts": {
|
||||
"test": "mocha"
|
||||
},
|
||||
"dependencies": {
|
||||
"is-extendable": "^0.1.0"
|
||||
},
|
||||
"devDependencies": {
|
||||
"array-slice": "^0.2.3",
|
||||
"benchmarked": "^0.1.4",
|
||||
"chalk": "^1.0.0",
|
||||
"for-own": "^0.1.3",
|
||||
"glob": "^5.0.12",
|
||||
"is-plain-object": "^2.0.1",
|
||||
"kind-of": "^2.0.0",
|
||||
"minimist": "^1.1.1",
|
||||
"mocha": "^2.2.5",
|
||||
"should": "^7.0.1"
|
||||
},
|
||||
"keywords": [
|
||||
"assign",
|
||||
"extend",
|
||||
"javascript",
|
||||
"js",
|
||||
"keys",
|
||||
"merge",
|
||||
"obj",
|
||||
"object",
|
||||
"prop",
|
||||
"properties",
|
||||
"property",
|
||||
"props",
|
||||
"shallow",
|
||||
"util",
|
||||
"utility",
|
||||
"utils",
|
||||
"value"
|
||||
]
|
||||
}
|
||||
82
node_modules/sane/node_modules/fill-range/package.json
generated
vendored
Normal file
82
node_modules/sane/node_modules/fill-range/package.json
generated
vendored
Normal file
|
|
@ -0,0 +1,82 @@
|
|||
{
|
||||
"name": "fill-range",
|
||||
"description": "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`",
|
||||
"version": "4.0.0",
|
||||
"homepage": "https://github.com/jonschlinkert/fill-range",
|
||||
"author": "Jon Schlinkert (https://github.com/jonschlinkert)",
|
||||
"contributors": [
|
||||
"<wtgtybhertgeghgtwtg@gmail.com> (https://github.com/wtgtybhertgeghgtwtg)",
|
||||
"Edo Rivai <edo.rivai@gmail.com> (edo.rivai.nl)",
|
||||
"Jon Schlinkert <jon.schlinkert@sellside.com> (http://twitter.com/jonschlinkert)",
|
||||
"Paul Miller <paul+gh@paulmillr.com> (paulmillr.com)"
|
||||
],
|
||||
"repository": "jonschlinkert/fill-range",
|
||||
"bugs": {
|
||||
"url": "https://github.com/jonschlinkert/fill-range/issues"
|
||||
},
|
||||
"license": "MIT",
|
||||
"files": [
|
||||
"index.js"
|
||||
],
|
||||
"main": "index.js",
|
||||
"engines": {
|
||||
"node": ">=0.10.0"
|
||||
},
|
||||
"scripts": {
|
||||
"test": "mocha"
|
||||
},
|
||||
"dependencies": {
|
||||
"extend-shallow": "^2.0.1",
|
||||
"is-number": "^3.0.0",
|
||||
"repeat-string": "^1.6.1",
|
||||
"to-regex-range": "^2.1.0"
|
||||
},
|
||||
"devDependencies": {
|
||||
"ansi-cyan": "^0.1.1",
|
||||
"benchmarked": "^1.0.0",
|
||||
"gulp-format-md": "^0.1.12",
|
||||
"minimist": "^1.2.0",
|
||||
"mocha": "^3.2.0"
|
||||
},
|
||||
"keywords": [
|
||||
"alpha",
|
||||
"alphabetical",
|
||||
"array",
|
||||
"bash",
|
||||
"brace",
|
||||
"expand",
|
||||
"expansion",
|
||||
"fill",
|
||||
"glob",
|
||||
"match",
|
||||
"matches",
|
||||
"matching",
|
||||
"number",
|
||||
"numerical",
|
||||
"range",
|
||||
"ranges",
|
||||
"regex",
|
||||
"sh"
|
||||
],
|
||||
"verb": {
|
||||
"related": {
|
||||
"list": [
|
||||
"braces",
|
||||
"expand-range",
|
||||
"micromatch",
|
||||
"to-regex-range"
|
||||
]
|
||||
},
|
||||
"toc": true,
|
||||
"layout": "default",
|
||||
"tasks": [
|
||||
"readme"
|
||||
],
|
||||
"plugins": [
|
||||
"gulp-format-md"
|
||||
],
|
||||
"lint": {
|
||||
"reflinks": true
|
||||
}
|
||||
}
|
||||
}
|
||||
21
node_modules/sane/node_modules/is-number/LICENSE
generated
vendored
Normal file
21
node_modules/sane/node_modules/is-number/LICENSE
generated
vendored
Normal file
|
|
@ -0,0 +1,21 @@
|
|||
The MIT License (MIT)
|
||||
|
||||
Copyright (c) 2014-2016, 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.
|
||||
115
node_modules/sane/node_modules/is-number/README.md
generated
vendored
Normal file
115
node_modules/sane/node_modules/is-number/README.md
generated
vendored
Normal file
|
|
@ -0,0 +1,115 @@
|
|||
# is-number [](https://www.npmjs.com/package/is-number) [](https://npmjs.org/package/is-number) [](https://travis-ci.org/jonschlinkert/is-number)
|
||||
|
||||
> Returns true if the value is a number. comprehensive tests.
|
||||
|
||||
## Install
|
||||
|
||||
Install with [npm](https://www.npmjs.com/):
|
||||
|
||||
```sh
|
||||
$ npm install --save is-number
|
||||
```
|
||||
|
||||
## Usage
|
||||
|
||||
To understand some of the rationale behind the decisions made in this library (and to learn about some oddities of number evaluation in JavaScript), [see this gist](https://gist.github.com/jonschlinkert/e30c70c713da325d0e81).
|
||||
|
||||
```js
|
||||
var isNumber = require('is-number');
|
||||
```
|
||||
|
||||
### true
|
||||
|
||||
See the [tests](./test.js) for more examples.
|
||||
|
||||
```js
|
||||
isNumber(5e3) //=> 'true'
|
||||
isNumber(0xff) //=> 'true'
|
||||
isNumber(-1.1) //=> 'true'
|
||||
isNumber(0) //=> 'true'
|
||||
isNumber(1) //=> 'true'
|
||||
isNumber(1.1) //=> 'true'
|
||||
isNumber(10) //=> 'true'
|
||||
isNumber(10.10) //=> 'true'
|
||||
isNumber(100) //=> 'true'
|
||||
isNumber('-1.1') //=> 'true'
|
||||
isNumber('0') //=> 'true'
|
||||
isNumber('012') //=> 'true'
|
||||
isNumber('0xff') //=> 'true'
|
||||
isNumber('1') //=> 'true'
|
||||
isNumber('1.1') //=> 'true'
|
||||
isNumber('10') //=> 'true'
|
||||
isNumber('10.10') //=> 'true'
|
||||
isNumber('100') //=> 'true'
|
||||
isNumber('5e3') //=> 'true'
|
||||
isNumber(parseInt('012')) //=> 'true'
|
||||
isNumber(parseFloat('012')) //=> 'true'
|
||||
```
|
||||
|
||||
### False
|
||||
|
||||
See the [tests](./test.js) for more examples.
|
||||
|
||||
```js
|
||||
isNumber('foo') //=> 'false'
|
||||
isNumber([1]) //=> 'false'
|
||||
isNumber([]) //=> 'false'
|
||||
isNumber(function () {}) //=> 'false'
|
||||
isNumber(Infinity) //=> 'false'
|
||||
isNumber(NaN) //=> 'false'
|
||||
isNumber(new Array('abc')) //=> 'false'
|
||||
isNumber(new Array(2)) //=> 'false'
|
||||
isNumber(new Buffer('abc')) //=> 'false'
|
||||
isNumber(null) //=> 'false'
|
||||
isNumber(undefined) //=> 'false'
|
||||
isNumber({abc: 'abc'}) //=> 'false'
|
||||
```
|
||||
|
||||
## About
|
||||
|
||||
### Related projects
|
||||
|
||||
* [even](https://www.npmjs.com/package/even): Get the even numbered items from an array. | [homepage](https://github.com/jonschlinkert/even "Get the even numbered items from an array.")
|
||||
* [is-even](https://www.npmjs.com/package/is-even): Return true if the given number is even. | [homepage](https://github.com/jonschlinkert/is-even "Return true if the given number is even.")
|
||||
* [is-odd](https://www.npmjs.com/package/is-odd): Returns true if the given number is odd. | [homepage](https://github.com/jonschlinkert/is-odd "Returns true if the given number is odd.")
|
||||
* [is-primitive](https://www.npmjs.com/package/is-primitive): Returns `true` if the value is a primitive. | [homepage](https://github.com/jonschlinkert/is-primitive "Returns `true` if the value is a primitive. ")
|
||||
* [kind-of](https://www.npmjs.com/package/kind-of): Get the native type of a value. | [homepage](https://github.com/jonschlinkert/kind-of "Get the native type of a value.")
|
||||
* [odd](https://www.npmjs.com/package/odd): Get the odd numbered items from an array. | [homepage](https://github.com/jonschlinkert/odd "Get the odd numbered items from an array.")
|
||||
|
||||
### Contributing
|
||||
|
||||
Pull requests and stars are always welcome. For bugs and feature requests, [please create an issue](../../issues/new).
|
||||
|
||||
### Building docs
|
||||
|
||||
_(This document was generated by [verb-generate-readme](https://github.com/verbose/verb-generate-readme) (a [verb](https://github.com/verbose/verb) generator), please don't edit the readme directly. Any changes to the readme must be made in [.verb.md](.verb.md).)_
|
||||
|
||||
To generate the readme and API documentation with [verb](https://github.com/verbose/verb):
|
||||
|
||||
```sh
|
||||
$ npm install -g verb verb-generate-readme && verb
|
||||
```
|
||||
|
||||
### Running tests
|
||||
|
||||
Install dev dependencies:
|
||||
|
||||
```sh
|
||||
$ npm install -d && npm test
|
||||
```
|
||||
|
||||
### Author
|
||||
|
||||
**Jon Schlinkert**
|
||||
|
||||
* [github/jonschlinkert](https://github.com/jonschlinkert)
|
||||
* [twitter/jonschlinkert](http://twitter.com/jonschlinkert)
|
||||
|
||||
### License
|
||||
|
||||
Copyright © 2016, [Jon Schlinkert](https://github.com/jonschlinkert).
|
||||
Released under the [MIT license](https://github.com/jonschlinkert/is-number/blob/master/LICENSE).
|
||||
|
||||
***
|
||||
|
||||
_This file was generated by [verb-generate-readme](https://github.com/verbose/verb-generate-readme), v0.1.30, on September 10, 2016._
|
||||
22
node_modules/sane/node_modules/is-number/index.js
generated
vendored
Normal file
22
node_modules/sane/node_modules/is-number/index.js
generated
vendored
Normal file
|
|
@ -0,0 +1,22 @@
|
|||
/*!
|
||||
* is-number <https://github.com/jonschlinkert/is-number>
|
||||
*
|
||||
* Copyright (c) 2014-2015, Jon Schlinkert.
|
||||
* Licensed under the MIT License.
|
||||
*/
|
||||
|
||||
'use strict';
|
||||
|
||||
var typeOf = require('kind-of');
|
||||
|
||||
module.exports = function isNumber(num) {
|
||||
var type = typeOf(num);
|
||||
|
||||
if (type === 'string') {
|
||||
if (!num.trim()) return false;
|
||||
} else if (type !== 'number') {
|
||||
return false;
|
||||
}
|
||||
|
||||
return (num - num + 1) >= 0;
|
||||
};
|
||||
21
node_modules/sane/node_modules/is-number/node_modules/kind-of/LICENSE
generated
vendored
Normal file
21
node_modules/sane/node_modules/is-number/node_modules/kind-of/LICENSE
generated
vendored
Normal file
|
|
@ -0,0 +1,21 @@
|
|||
The MIT License (MIT)
|
||||
|
||||
Copyright (c) 2014-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.
|
||||
261
node_modules/sane/node_modules/is-number/node_modules/kind-of/README.md
generated
vendored
Normal file
261
node_modules/sane/node_modules/is-number/node_modules/kind-of/README.md
generated
vendored
Normal file
|
|
@ -0,0 +1,261 @@
|
|||
# kind-of [](https://www.npmjs.com/package/kind-of) [](https://npmjs.org/package/kind-of) [](https://npmjs.org/package/kind-of) [](https://travis-ci.org/jonschlinkert/kind-of)
|
||||
|
||||
> Get the native type of a value.
|
||||
|
||||
## Install
|
||||
|
||||
Install with [npm](https://www.npmjs.com/):
|
||||
|
||||
```sh
|
||||
$ npm install --save kind-of
|
||||
```
|
||||
|
||||
## Install
|
||||
|
||||
Install with [bower](https://bower.io/)
|
||||
|
||||
```sh
|
||||
$ bower install kind-of --save
|
||||
```
|
||||
|
||||
## Usage
|
||||
|
||||
> es5, browser and es6 ready
|
||||
|
||||
```js
|
||||
var kindOf = require('kind-of');
|
||||
|
||||
kindOf(undefined);
|
||||
//=> 'undefined'
|
||||
|
||||
kindOf(null);
|
||||
//=> 'null'
|
||||
|
||||
kindOf(true);
|
||||
//=> 'boolean'
|
||||
|
||||
kindOf(false);
|
||||
//=> 'boolean'
|
||||
|
||||
kindOf(new Boolean(true));
|
||||
//=> 'boolean'
|
||||
|
||||
kindOf(new Buffer(''));
|
||||
//=> 'buffer'
|
||||
|
||||
kindOf(42);
|
||||
//=> 'number'
|
||||
|
||||
kindOf(new Number(42));
|
||||
//=> 'number'
|
||||
|
||||
kindOf('str');
|
||||
//=> 'string'
|
||||
|
||||
kindOf(new String('str'));
|
||||
//=> 'string'
|
||||
|
||||
kindOf(arguments);
|
||||
//=> 'arguments'
|
||||
|
||||
kindOf({});
|
||||
//=> 'object'
|
||||
|
||||
kindOf(Object.create(null));
|
||||
//=> 'object'
|
||||
|
||||
kindOf(new Test());
|
||||
//=> 'object'
|
||||
|
||||
kindOf(new Date());
|
||||
//=> 'date'
|
||||
|
||||
kindOf([]);
|
||||
//=> 'array'
|
||||
|
||||
kindOf([1, 2, 3]);
|
||||
//=> 'array'
|
||||
|
||||
kindOf(new Array());
|
||||
//=> 'array'
|
||||
|
||||
kindOf(/foo/);
|
||||
//=> 'regexp'
|
||||
|
||||
kindOf(new RegExp('foo'));
|
||||
//=> 'regexp'
|
||||
|
||||
kindOf(function () {});
|
||||
//=> 'function'
|
||||
|
||||
kindOf(function * () {});
|
||||
//=> 'function'
|
||||
|
||||
kindOf(new Function());
|
||||
//=> 'function'
|
||||
|
||||
kindOf(new Map());
|
||||
//=> 'map'
|
||||
|
||||
kindOf(new WeakMap());
|
||||
//=> 'weakmap'
|
||||
|
||||
kindOf(new Set());
|
||||
//=> 'set'
|
||||
|
||||
kindOf(new WeakSet());
|
||||
//=> 'weakset'
|
||||
|
||||
kindOf(Symbol('str'));
|
||||
//=> 'symbol'
|
||||
|
||||
kindOf(new Int8Array());
|
||||
//=> 'int8array'
|
||||
|
||||
kindOf(new Uint8Array());
|
||||
//=> 'uint8array'
|
||||
|
||||
kindOf(new Uint8ClampedArray());
|
||||
//=> 'uint8clampedarray'
|
||||
|
||||
kindOf(new Int16Array());
|
||||
//=> 'int16array'
|
||||
|
||||
kindOf(new Uint16Array());
|
||||
//=> 'uint16array'
|
||||
|
||||
kindOf(new Int32Array());
|
||||
//=> 'int32array'
|
||||
|
||||
kindOf(new Uint32Array());
|
||||
//=> 'uint32array'
|
||||
|
||||
kindOf(new Float32Array());
|
||||
//=> 'float32array'
|
||||
|
||||
kindOf(new Float64Array());
|
||||
//=> 'float64array'
|
||||
```
|
||||
|
||||
## Benchmarks
|
||||
|
||||
Benchmarked against [typeof](http://github.com/CodingFu/typeof) and [type-of](https://github.com/ForbesLindesay/type-of).
|
||||
Note that performaces is slower for es6 features `Map`, `WeakMap`, `Set` and `WeakSet`.
|
||||
|
||||
```bash
|
||||
#1: array
|
||||
current x 23,329,397 ops/sec ±0.82% (94 runs sampled)
|
||||
lib-type-of x 4,170,273 ops/sec ±0.55% (94 runs sampled)
|
||||
lib-typeof x 9,686,935 ops/sec ±0.59% (98 runs sampled)
|
||||
|
||||
#2: boolean
|
||||
current x 27,197,115 ops/sec ±0.85% (94 runs sampled)
|
||||
lib-type-of x 3,145,791 ops/sec ±0.73% (97 runs sampled)
|
||||
lib-typeof x 9,199,562 ops/sec ±0.44% (99 runs sampled)
|
||||
|
||||
#3: date
|
||||
current x 20,190,117 ops/sec ±0.86% (92 runs sampled)
|
||||
lib-type-of x 5,166,970 ops/sec ±0.74% (94 runs sampled)
|
||||
lib-typeof x 9,610,821 ops/sec ±0.50% (96 runs sampled)
|
||||
|
||||
#4: function
|
||||
current x 23,855,460 ops/sec ±0.60% (97 runs sampled)
|
||||
lib-type-of x 5,667,740 ops/sec ±0.54% (100 runs sampled)
|
||||
lib-typeof x 10,010,644 ops/sec ±0.44% (100 runs sampled)
|
||||
|
||||
#5: null
|
||||
current x 27,061,047 ops/sec ±0.97% (96 runs sampled)
|
||||
lib-type-of x 13,965,573 ops/sec ±0.62% (97 runs sampled)
|
||||
lib-typeof x 8,460,194 ops/sec ±0.61% (97 runs sampled)
|
||||
|
||||
#6: number
|
||||
current x 25,075,682 ops/sec ±0.53% (99 runs sampled)
|
||||
lib-type-of x 2,266,405 ops/sec ±0.41% (98 runs sampled)
|
||||
lib-typeof x 9,821,481 ops/sec ±0.45% (99 runs sampled)
|
||||
|
||||
#7: object
|
||||
current x 3,348,980 ops/sec ±0.49% (99 runs sampled)
|
||||
lib-type-of x 3,245,138 ops/sec ±0.60% (94 runs sampled)
|
||||
lib-typeof x 9,262,952 ops/sec ±0.59% (99 runs sampled)
|
||||
|
||||
#8: regex
|
||||
current x 21,284,827 ops/sec ±0.72% (96 runs sampled)
|
||||
lib-type-of x 4,689,241 ops/sec ±0.43% (100 runs sampled)
|
||||
lib-typeof x 8,957,593 ops/sec ±0.62% (98 runs sampled)
|
||||
|
||||
#9: string
|
||||
current x 25,379,234 ops/sec ±0.58% (96 runs sampled)
|
||||
lib-type-of x 3,635,148 ops/sec ±0.76% (93 runs sampled)
|
||||
lib-typeof x 9,494,134 ops/sec ±0.49% (98 runs sampled)
|
||||
|
||||
#10: undef
|
||||
current x 27,459,221 ops/sec ±1.01% (93 runs sampled)
|
||||
lib-type-of x 14,360,433 ops/sec ±0.52% (99 runs sampled)
|
||||
lib-typeof x 23,202,868 ops/sec ±0.59% (94 runs sampled)
|
||||
|
||||
```
|
||||
|
||||
## Optimizations
|
||||
|
||||
In 7 out of 8 cases, this library is 2x-10x faster than other top libraries included in the benchmarks. There are a few things that lead to this performance advantage, none of them hard and fast rules, but all of them simple and repeatable in almost any code library:
|
||||
|
||||
1. Optimize around the fastest and most common use cases first. Of course, this will change from project-to-project, but I took some time to understand how and why `typeof` checks were being used in my own libraries and other libraries I use a lot.
|
||||
2. Optimize around bottlenecks - In other words, the order in which conditionals are implemented is significant, because each check is only as fast as the failing checks that came before it. Here, the biggest bottleneck by far is checking for plain objects (an object that was created by the `Object` constructor). I opted to make this check happen by process of elimination rather than brute force up front (e.g. by using something like `val.constructor.name`), so that every other type check would not be penalized it.
|
||||
3. Don't do uneccessary processing - why do `.slice(8, -1).toLowerCase();` just to get the word `regex`? It's much faster to do `if (type === '[object RegExp]') return 'regex'`
|
||||
|
||||
## About
|
||||
|
||||
### Related projects
|
||||
|
||||
* [is-glob](https://www.npmjs.com/package/is-glob): Returns `true` if the given string looks like a glob pattern or an extglob pattern… [more](https://github.com/jonschlinkert/is-glob) | [homepage](https://github.com/jonschlinkert/is-glob "Returns `true` if the given string looks like a glob pattern or an extglob pattern. This makes it easy to create code that only uses external modules like node-glob when necessary, resulting in much faster code execution and initialization time, and a bet")
|
||||
* [is-number](https://www.npmjs.com/package/is-number): Returns true if the value is a number. comprehensive tests. | [homepage](https://github.com/jonschlinkert/is-number "Returns true if the value is a number. comprehensive tests.")
|
||||
* [is-primitive](https://www.npmjs.com/package/is-primitive): Returns `true` if the value is a primitive. | [homepage](https://github.com/jonschlinkert/is-primitive "Returns `true` if the value is a primitive. ")
|
||||
|
||||
### Contributing
|
||||
|
||||
Pull requests and stars are always welcome. For bugs and feature requests, [please create an issue](../../issues/new).
|
||||
|
||||
### Contributors
|
||||
|
||||
| **Commits** | **Contributor** |
|
||||
| --- | --- |
|
||||
| 59 | [jonschlinkert](https://github.com/jonschlinkert) |
|
||||
| 2 | [miguelmota](https://github.com/miguelmota) |
|
||||
| 1 | [dtothefp](https://github.com/dtothefp) |
|
||||
| 1 | [ksheedlo](https://github.com/ksheedlo) |
|
||||
| 1 | [pdehaan](https://github.com/pdehaan) |
|
||||
| 1 | [laggingreflex](https://github.com/laggingreflex) |
|
||||
|
||||
### 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 May 16, 2017._
|
||||
116
node_modules/sane/node_modules/is-number/node_modules/kind-of/index.js
generated
vendored
Normal file
116
node_modules/sane/node_modules/is-number/node_modules/kind-of/index.js
generated
vendored
Normal file
|
|
@ -0,0 +1,116 @@
|
|||
var isBuffer = require('is-buffer');
|
||||
var toString = Object.prototype.toString;
|
||||
|
||||
/**
|
||||
* Get the native `typeof` a value.
|
||||
*
|
||||
* @param {*} `val`
|
||||
* @return {*} Native javascript type
|
||||
*/
|
||||
|
||||
module.exports = function kindOf(val) {
|
||||
// primitivies
|
||||
if (typeof val === 'undefined') {
|
||||
return 'undefined';
|
||||
}
|
||||
if (val === null) {
|
||||
return 'null';
|
||||
}
|
||||
if (val === true || val === false || val instanceof Boolean) {
|
||||
return 'boolean';
|
||||
}
|
||||
if (typeof val === 'string' || val instanceof String) {
|
||||
return 'string';
|
||||
}
|
||||
if (typeof val === 'number' || val instanceof Number) {
|
||||
return 'number';
|
||||
}
|
||||
|
||||
// functions
|
||||
if (typeof val === 'function' || val instanceof Function) {
|
||||
return 'function';
|
||||
}
|
||||
|
||||
// array
|
||||
if (typeof Array.isArray !== 'undefined' && Array.isArray(val)) {
|
||||
return 'array';
|
||||
}
|
||||
|
||||
// check for instances of RegExp and Date before calling `toString`
|
||||
if (val instanceof RegExp) {
|
||||
return 'regexp';
|
||||
}
|
||||
if (val instanceof Date) {
|
||||
return 'date';
|
||||
}
|
||||
|
||||
// other objects
|
||||
var type = toString.call(val);
|
||||
|
||||
if (type === '[object RegExp]') {
|
||||
return 'regexp';
|
||||
}
|
||||
if (type === '[object Date]') {
|
||||
return 'date';
|
||||
}
|
||||
if (type === '[object Arguments]') {
|
||||
return 'arguments';
|
||||
}
|
||||
if (type === '[object Error]') {
|
||||
return 'error';
|
||||
}
|
||||
|
||||
// buffer
|
||||
if (isBuffer(val)) {
|
||||
return 'buffer';
|
||||
}
|
||||
|
||||
// es6: Map, WeakMap, Set, WeakSet
|
||||
if (type === '[object Set]') {
|
||||
return 'set';
|
||||
}
|
||||
if (type === '[object WeakSet]') {
|
||||
return 'weakset';
|
||||
}
|
||||
if (type === '[object Map]') {
|
||||
return 'map';
|
||||
}
|
||||
if (type === '[object WeakMap]') {
|
||||
return 'weakmap';
|
||||
}
|
||||
if (type === '[object Symbol]') {
|
||||
return 'symbol';
|
||||
}
|
||||
|
||||
// typed arrays
|
||||
if (type === '[object Int8Array]') {
|
||||
return 'int8array';
|
||||
}
|
||||
if (type === '[object Uint8Array]') {
|
||||
return 'uint8array';
|
||||
}
|
||||
if (type === '[object Uint8ClampedArray]') {
|
||||
return 'uint8clampedarray';
|
||||
}
|
||||
if (type === '[object Int16Array]') {
|
||||
return 'int16array';
|
||||
}
|
||||
if (type === '[object Uint16Array]') {
|
||||
return 'uint16array';
|
||||
}
|
||||
if (type === '[object Int32Array]') {
|
||||
return 'int32array';
|
||||
}
|
||||
if (type === '[object Uint32Array]') {
|
||||
return 'uint32array';
|
||||
}
|
||||
if (type === '[object Float32Array]') {
|
||||
return 'float32array';
|
||||
}
|
||||
if (type === '[object Float64Array]') {
|
||||
return 'float64array';
|
||||
}
|
||||
|
||||
// must be a plain object
|
||||
return 'object';
|
||||
};
|
||||
90
node_modules/sane/node_modules/is-number/node_modules/kind-of/package.json
generated
vendored
Normal file
90
node_modules/sane/node_modules/is-number/node_modules/kind-of/package.json
generated
vendored
Normal file
|
|
@ -0,0 +1,90 @@
|
|||
{
|
||||
"name": "kind-of",
|
||||
"description": "Get the native type of a value.",
|
||||
"version": "3.2.2",
|
||||
"homepage": "https://github.com/jonschlinkert/kind-of",
|
||||
"author": "Jon Schlinkert (https://github.com/jonschlinkert)",
|
||||
"contributors": [
|
||||
"David Fox-Powell (https://dtothefp.github.io/me)",
|
||||
"Jon Schlinkert (http://twitter.com/jonschlinkert)",
|
||||
"Ken Sheedlo (kensheedlo.com)",
|
||||
"laggingreflex (https://github.com/laggingreflex)",
|
||||
"Miguel Mota (https://miguelmota.com)",
|
||||
"Peter deHaan (http://about.me/peterdehaan)"
|
||||
],
|
||||
"repository": "jonschlinkert/kind-of",
|
||||
"bugs": {
|
||||
"url": "https://github.com/jonschlinkert/kind-of/issues"
|
||||
},
|
||||
"license": "MIT",
|
||||
"files": [
|
||||
"index.js"
|
||||
],
|
||||
"main": "index.js",
|
||||
"engines": {
|
||||
"node": ">=0.10.0"
|
||||
},
|
||||
"scripts": {
|
||||
"test": "mocha",
|
||||
"prepublish": "browserify -o browser.js -e index.js -s index --bare"
|
||||
},
|
||||
"dependencies": {
|
||||
"is-buffer": "^1.1.5"
|
||||
},
|
||||
"devDependencies": {
|
||||
"ansi-bold": "^0.1.1",
|
||||
"benchmarked": "^1.0.0",
|
||||
"browserify": "^14.3.0",
|
||||
"glob": "^7.1.1",
|
||||
"gulp-format-md": "^0.1.12",
|
||||
"mocha": "^3.3.0",
|
||||
"type-of": "^2.0.1",
|
||||
"typeof": "^1.0.0"
|
||||
},
|
||||
"keywords": [
|
||||
"arguments",
|
||||
"array",
|
||||
"boolean",
|
||||
"check",
|
||||
"date",
|
||||
"function",
|
||||
"is",
|
||||
"is-type",
|
||||
"is-type-of",
|
||||
"kind",
|
||||
"kind-of",
|
||||
"number",
|
||||
"object",
|
||||
"of",
|
||||
"regexp",
|
||||
"string",
|
||||
"test",
|
||||
"type",
|
||||
"type-of",
|
||||
"typeof",
|
||||
"types"
|
||||
],
|
||||
"verb": {
|
||||
"related": {
|
||||
"list": [
|
||||
"is-glob",
|
||||
"is-number",
|
||||
"is-primitive"
|
||||
]
|
||||
},
|
||||
"toc": false,
|
||||
"layout": "default",
|
||||
"tasks": [
|
||||
"readme"
|
||||
],
|
||||
"plugins": [
|
||||
"gulp-format-md"
|
||||
],
|
||||
"lint": {
|
||||
"reflinks": true
|
||||
},
|
||||
"reflinks": [
|
||||
"verb"
|
||||
]
|
||||
}
|
||||
}
|
||||
83
node_modules/sane/node_modules/is-number/package.json
generated
vendored
Normal file
83
node_modules/sane/node_modules/is-number/package.json
generated
vendored
Normal file
|
|
@ -0,0 +1,83 @@
|
|||
{
|
||||
"name": "is-number",
|
||||
"description": "Returns true if the value is a number. comprehensive tests.",
|
||||
"version": "3.0.0",
|
||||
"homepage": "https://github.com/jonschlinkert/is-number",
|
||||
"author": "Jon Schlinkert (https://github.com/jonschlinkert)",
|
||||
"contributors": [
|
||||
"Charlike Mike Reagent (http://www.tunnckocore.tk)",
|
||||
"Jon Schlinkert <jon.schlinkert@sellside.com> (http://twitter.com/jonschlinkert)"
|
||||
],
|
||||
"repository": "jonschlinkert/is-number",
|
||||
"bugs": {
|
||||
"url": "https://github.com/jonschlinkert/is-number/issues"
|
||||
},
|
||||
"license": "MIT",
|
||||
"files": [
|
||||
"index.js"
|
||||
],
|
||||
"main": "index.js",
|
||||
"engines": {
|
||||
"node": ">=0.10.0"
|
||||
},
|
||||
"scripts": {
|
||||
"test": "mocha"
|
||||
},
|
||||
"dependencies": {
|
||||
"kind-of": "^3.0.2"
|
||||
},
|
||||
"devDependencies": {
|
||||
"benchmarked": "^0.2.5",
|
||||
"chalk": "^1.1.3",
|
||||
"gulp-format-md": "^0.1.10",
|
||||
"mocha": "^3.0.2"
|
||||
},
|
||||
"keywords": [
|
||||
"check",
|
||||
"coerce",
|
||||
"coercion",
|
||||
"integer",
|
||||
"is",
|
||||
"is-nan",
|
||||
"is-num",
|
||||
"is-number",
|
||||
"istype",
|
||||
"kind",
|
||||
"math",
|
||||
"nan",
|
||||
"num",
|
||||
"number",
|
||||
"numeric",
|
||||
"test",
|
||||
"type",
|
||||
"typeof",
|
||||
"value"
|
||||
],
|
||||
"verb": {
|
||||
"related": {
|
||||
"list": [
|
||||
"even",
|
||||
"is-even",
|
||||
"is-odd",
|
||||
"is-primitive",
|
||||
"kind-of",
|
||||
"odd"
|
||||
]
|
||||
},
|
||||
"toc": false,
|
||||
"layout": "default",
|
||||
"tasks": [
|
||||
"readme"
|
||||
],
|
||||
"plugins": [
|
||||
"gulp-format-md"
|
||||
],
|
||||
"lint": {
|
||||
"reflinks": true
|
||||
},
|
||||
"reflinks": [
|
||||
"verb",
|
||||
"verb-generate-readme"
|
||||
]
|
||||
}
|
||||
}
|
||||
37
node_modules/sane/node_modules/micromatch/CHANGELOG.md
generated
vendored
Normal file
37
node_modules/sane/node_modules/micromatch/CHANGELOG.md
generated
vendored
Normal file
|
|
@ -0,0 +1,37 @@
|
|||
## History
|
||||
|
||||
### key
|
||||
|
||||
Changelog entries are classified using the following labels _(from [keep-a-changelog][]_):
|
||||
|
||||
- `added`: for new features
|
||||
- `changed`: for changes in existing functionality
|
||||
- `deprecated`: for once-stable features removed in upcoming releases
|
||||
- `removed`: for deprecated features removed in this release
|
||||
- `fixed`: for any bug fixes
|
||||
- `bumped`: updated dependencies, only minor or higher will be listed.
|
||||
|
||||
### [3.0.0] - 2017-04-11
|
||||
|
||||
TODO. There should be no breaking changes. Please report any regressions. I will [reformat these release notes](https://github.com/micromatch/micromatch/pull/76) and add them to the changelog as soon as I have a chance.
|
||||
|
||||
### [1.0.1] - 2016-12-12
|
||||
|
||||
**Added**
|
||||
|
||||
- Support for windows path edge cases where backslashes are used in brackets or other unusual combinations.
|
||||
|
||||
### [1.0.0] - 2016-12-12
|
||||
|
||||
Stable release.
|
||||
|
||||
### [0.1.0] - 2016-10-08
|
||||
|
||||
First release.
|
||||
|
||||
|
||||
[Unreleased]: https://github.com/jonschlinkert/micromatch/compare/0.1.0...HEAD
|
||||
[0.2.0]: https://github.com/jonschlinkert/micromatch/compare/0.1.0...0.2.0
|
||||
|
||||
[keep-a-changelog]: https://github.com/olivierlacan/keep-a-changelog
|
||||
|
||||
21
node_modules/sane/node_modules/micromatch/LICENSE
generated
vendored
Executable file
21
node_modules/sane/node_modules/micromatch/LICENSE
generated
vendored
Executable file
|
|
@ -0,0 +1,21 @@
|
|||
The MIT License (MIT)
|
||||
|
||||
Copyright (c) 2014-2018, 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.
|
||||
1150
node_modules/sane/node_modules/micromatch/README.md
generated
vendored
Normal file
1150
node_modules/sane/node_modules/micromatch/README.md
generated
vendored
Normal file
File diff suppressed because it is too large
Load diff
877
node_modules/sane/node_modules/micromatch/index.js
generated
vendored
Normal file
877
node_modules/sane/node_modules/micromatch/index.js
generated
vendored
Normal file
|
|
@ -0,0 +1,877 @@
|
|||
'use strict';
|
||||
|
||||
/**
|
||||
* Module dependencies
|
||||
*/
|
||||
|
||||
var util = require('util');
|
||||
var braces = require('braces');
|
||||
var toRegex = require('to-regex');
|
||||
var extend = require('extend-shallow');
|
||||
|
||||
/**
|
||||
* Local dependencies
|
||||
*/
|
||||
|
||||
var compilers = require('./lib/compilers');
|
||||
var parsers = require('./lib/parsers');
|
||||
var cache = require('./lib/cache');
|
||||
var utils = require('./lib/utils');
|
||||
var MAX_LENGTH = 1024 * 64;
|
||||
|
||||
/**
|
||||
* The main function takes a list of strings and one or more
|
||||
* glob patterns to use for matching.
|
||||
*
|
||||
* ```js
|
||||
* var mm = require('micromatch');
|
||||
* mm(list, patterns[, options]);
|
||||
*
|
||||
* console.log(mm(['a.js', 'a.txt'], ['*.js']));
|
||||
* //=> [ 'a.js' ]
|
||||
* ```
|
||||
* @param {Array} `list` A list of strings to match
|
||||
* @param {String|Array} `patterns` One or more glob patterns to use for matching.
|
||||
* @param {Object} `options` See available [options](#options) for changing how matches are performed
|
||||
* @return {Array} Returns an array of matches
|
||||
* @summary false
|
||||
* @api public
|
||||
*/
|
||||
|
||||
function micromatch(list, patterns, options) {
|
||||
patterns = utils.arrayify(patterns);
|
||||
list = utils.arrayify(list);
|
||||
|
||||
var len = patterns.length;
|
||||
if (list.length === 0 || len === 0) {
|
||||
return [];
|
||||
}
|
||||
|
||||
if (len === 1) {
|
||||
return micromatch.match(list, patterns[0], options);
|
||||
}
|
||||
|
||||
var omit = [];
|
||||
var keep = [];
|
||||
var idx = -1;
|
||||
|
||||
while (++idx < len) {
|
||||
var pattern = patterns[idx];
|
||||
|
||||
if (typeof pattern === 'string' && pattern.charCodeAt(0) === 33 /* ! */) {
|
||||
omit.push.apply(omit, micromatch.match(list, pattern.slice(1), options));
|
||||
} else {
|
||||
keep.push.apply(keep, micromatch.match(list, pattern, options));
|
||||
}
|
||||
}
|
||||
|
||||
var matches = utils.diff(keep, omit);
|
||||
if (!options || options.nodupes !== false) {
|
||||
return utils.unique(matches);
|
||||
}
|
||||
|
||||
return matches;
|
||||
}
|
||||
|
||||
/**
|
||||
* Similar to the main function, but `pattern` must be a string.
|
||||
*
|
||||
* ```js
|
||||
* var mm = require('micromatch');
|
||||
* mm.match(list, pattern[, options]);
|
||||
*
|
||||
* console.log(mm.match(['a.a', 'a.aa', 'a.b', 'a.c'], '*.a'));
|
||||
* //=> ['a.a', 'a.aa']
|
||||
* ```
|
||||
* @param {Array} `list` Array of strings to match
|
||||
* @param {String} `pattern` Glob pattern to use for matching.
|
||||
* @param {Object} `options` See available [options](#options) for changing how matches are performed
|
||||
* @return {Array} Returns an array of matches
|
||||
* @api public
|
||||
*/
|
||||
|
||||
micromatch.match = function(list, pattern, options) {
|
||||
if (Array.isArray(pattern)) {
|
||||
throw new TypeError('expected pattern to be a string');
|
||||
}
|
||||
|
||||
var unixify = utils.unixify(options);
|
||||
var isMatch = memoize('match', pattern, options, micromatch.matcher);
|
||||
var matches = [];
|
||||
|
||||
list = utils.arrayify(list);
|
||||
var len = list.length;
|
||||
var idx = -1;
|
||||
|
||||
while (++idx < len) {
|
||||
var ele = list[idx];
|
||||
if (ele === pattern || isMatch(ele)) {
|
||||
matches.push(utils.value(ele, unixify, options));
|
||||
}
|
||||
}
|
||||
|
||||
// if no options were passed, uniquify results and return
|
||||
if (typeof options === 'undefined') {
|
||||
return utils.unique(matches);
|
||||
}
|
||||
|
||||
if (matches.length === 0) {
|
||||
if (options.failglob === true) {
|
||||
throw new Error('no matches found for "' + pattern + '"');
|
||||
}
|
||||
if (options.nonull === true || options.nullglob === true) {
|
||||
return [options.unescape ? utils.unescape(pattern) : pattern];
|
||||
}
|
||||
}
|
||||
|
||||
// if `opts.ignore` was defined, diff ignored list
|
||||
if (options.ignore) {
|
||||
matches = micromatch.not(matches, options.ignore, options);
|
||||
}
|
||||
|
||||
return options.nodupes !== false ? utils.unique(matches) : matches;
|
||||
};
|
||||
|
||||
/**
|
||||
* Returns true if the specified `string` matches the given glob `pattern`.
|
||||
*
|
||||
* ```js
|
||||
* var mm = require('micromatch');
|
||||
* mm.isMatch(string, pattern[, options]);
|
||||
*
|
||||
* console.log(mm.isMatch('a.a', '*.a'));
|
||||
* //=> true
|
||||
* console.log(mm.isMatch('a.b', '*.a'));
|
||||
* //=> false
|
||||
* ```
|
||||
* @param {String} `string` String to match
|
||||
* @param {String} `pattern` Glob pattern to use for matching.
|
||||
* @param {Object} `options` See available [options](#options) for changing how matches are performed
|
||||
* @return {Boolean} Returns true if the string matches the glob pattern.
|
||||
* @api public
|
||||
*/
|
||||
|
||||
micromatch.isMatch = function(str, pattern, options) {
|
||||
if (typeof str !== 'string') {
|
||||
throw new TypeError('expected a string: "' + util.inspect(str) + '"');
|
||||
}
|
||||
|
||||
if (isEmptyString(str) || isEmptyString(pattern)) {
|
||||
return false;
|
||||
}
|
||||
|
||||
var equals = utils.equalsPattern(options);
|
||||
if (equals(str)) {
|
||||
return true;
|
||||
}
|
||||
|
||||
var isMatch = memoize('isMatch', pattern, options, micromatch.matcher);
|
||||
return isMatch(str);
|
||||
};
|
||||
|
||||
/**
|
||||
* Returns true if some of the strings in the given `list` match any of the
|
||||
* given glob `patterns`.
|
||||
*
|
||||
* ```js
|
||||
* var mm = require('micromatch');
|
||||
* mm.some(list, patterns[, options]);
|
||||
*
|
||||
* console.log(mm.some(['foo.js', 'bar.js'], ['*.js', '!foo.js']));
|
||||
* // true
|
||||
* console.log(mm.some(['foo.js'], ['*.js', '!foo.js']));
|
||||
* // false
|
||||
* ```
|
||||
* @param {String|Array} `list` The string or array of strings to test. Returns as soon as the first match is found.
|
||||
* @param {String|Array} `patterns` One or more glob patterns to use for matching.
|
||||
* @param {Object} `options` See available [options](#options) for changing how matches are performed
|
||||
* @return {Boolean} Returns true if any patterns match `str`
|
||||
* @api public
|
||||
*/
|
||||
|
||||
micromatch.some = function(list, patterns, options) {
|
||||
if (typeof list === 'string') {
|
||||
list = [list];
|
||||
}
|
||||
for (var i = 0; i < list.length; i++) {
|
||||
if (micromatch(list[i], patterns, options).length === 1) {
|
||||
return true;
|
||||
}
|
||||
}
|
||||
return false;
|
||||
};
|
||||
|
||||
/**
|
||||
* Returns true if every string in the given `list` matches
|
||||
* any of the given glob `patterns`.
|
||||
*
|
||||
* ```js
|
||||
* var mm = require('micromatch');
|
||||
* mm.every(list, patterns[, options]);
|
||||
*
|
||||
* console.log(mm.every('foo.js', ['foo.js']));
|
||||
* // true
|
||||
* console.log(mm.every(['foo.js', 'bar.js'], ['*.js']));
|
||||
* // true
|
||||
* console.log(mm.every(['foo.js', 'bar.js'], ['*.js', '!foo.js']));
|
||||
* // false
|
||||
* console.log(mm.every(['foo.js'], ['*.js', '!foo.js']));
|
||||
* // false
|
||||
* ```
|
||||
* @param {String|Array} `list` The string or array of strings to test.
|
||||
* @param {String|Array} `patterns` One or more glob patterns to use for matching.
|
||||
* @param {Object} `options` See available [options](#options) for changing how matches are performed
|
||||
* @return {Boolean} Returns true if any patterns match `str`
|
||||
* @api public
|
||||
*/
|
||||
|
||||
micromatch.every = function(list, patterns, options) {
|
||||
if (typeof list === 'string') {
|
||||
list = [list];
|
||||
}
|
||||
for (var i = 0; i < list.length; i++) {
|
||||
if (micromatch(list[i], patterns, options).length !== 1) {
|
||||
return false;
|
||||
}
|
||||
}
|
||||
return true;
|
||||
};
|
||||
|
||||
/**
|
||||
* Returns true if **any** of the given glob `patterns`
|
||||
* match the specified `string`.
|
||||
*
|
||||
* ```js
|
||||
* var mm = require('micromatch');
|
||||
* mm.any(string, patterns[, options]);
|
||||
*
|
||||
* console.log(mm.any('a.a', ['b.*', '*.a']));
|
||||
* //=> true
|
||||
* console.log(mm.any('a.a', 'b.*'));
|
||||
* //=> false
|
||||
* ```
|
||||
* @param {String|Array} `str` The string to test.
|
||||
* @param {String|Array} `patterns` One or more glob patterns to use for matching.
|
||||
* @param {Object} `options` See available [options](#options) for changing how matches are performed
|
||||
* @return {Boolean} Returns true if any patterns match `str`
|
||||
* @api public
|
||||
*/
|
||||
|
||||
micromatch.any = function(str, patterns, options) {
|
||||
if (typeof str !== 'string') {
|
||||
throw new TypeError('expected a string: "' + util.inspect(str) + '"');
|
||||
}
|
||||
|
||||
if (isEmptyString(str) || isEmptyString(patterns)) {
|
||||
return false;
|
||||
}
|
||||
|
||||
if (typeof patterns === 'string') {
|
||||
patterns = [patterns];
|
||||
}
|
||||
|
||||
for (var i = 0; i < patterns.length; i++) {
|
||||
if (micromatch.isMatch(str, patterns[i], options)) {
|
||||
return true;
|
||||
}
|
||||
}
|
||||
return false;
|
||||
};
|
||||
|
||||
/**
|
||||
* Returns true if **all** of the given `patterns` match
|
||||
* the specified string.
|
||||
*
|
||||
* ```js
|
||||
* var mm = require('micromatch');
|
||||
* mm.all(string, patterns[, options]);
|
||||
*
|
||||
* console.log(mm.all('foo.js', ['foo.js']));
|
||||
* // true
|
||||
*
|
||||
* console.log(mm.all('foo.js', ['*.js', '!foo.js']));
|
||||
* // false
|
||||
*
|
||||
* console.log(mm.all('foo.js', ['*.js', 'foo.js']));
|
||||
* // true
|
||||
*
|
||||
* console.log(mm.all('foo.js', ['*.js', 'f*', '*o*', '*o.js']));
|
||||
* // true
|
||||
* ```
|
||||
* @param {String|Array} `str` The string to test.
|
||||
* @param {String|Array} `patterns` One or more glob patterns to use for matching.
|
||||
* @param {Object} `options` See available [options](#options) for changing how matches are performed
|
||||
* @return {Boolean} Returns true if any patterns match `str`
|
||||
* @api public
|
||||
*/
|
||||
|
||||
micromatch.all = function(str, patterns, options) {
|
||||
if (typeof str !== 'string') {
|
||||
throw new TypeError('expected a string: "' + util.inspect(str) + '"');
|
||||
}
|
||||
if (typeof patterns === 'string') {
|
||||
patterns = [patterns];
|
||||
}
|
||||
for (var i = 0; i < patterns.length; i++) {
|
||||
if (!micromatch.isMatch(str, patterns[i], options)) {
|
||||
return false;
|
||||
}
|
||||
}
|
||||
return true;
|
||||
};
|
||||
|
||||
/**
|
||||
* Returns a list of strings that _**do not match any**_ of the given `patterns`.
|
||||
*
|
||||
* ```js
|
||||
* var mm = require('micromatch');
|
||||
* mm.not(list, patterns[, options]);
|
||||
*
|
||||
* console.log(mm.not(['a.a', 'b.b', 'c.c'], '*.a'));
|
||||
* //=> ['b.b', 'c.c']
|
||||
* ```
|
||||
* @param {Array} `list` Array of strings to match.
|
||||
* @param {String|Array} `patterns` One or more glob pattern to use for matching.
|
||||
* @param {Object} `options` See available [options](#options) for changing how matches are performed
|
||||
* @return {Array} Returns an array of strings that **do not match** the given patterns.
|
||||
* @api public
|
||||
*/
|
||||
|
||||
micromatch.not = function(list, patterns, options) {
|
||||
var opts = extend({}, options);
|
||||
var ignore = opts.ignore;
|
||||
delete opts.ignore;
|
||||
|
||||
var unixify = utils.unixify(opts);
|
||||
list = utils.arrayify(list).map(unixify);
|
||||
|
||||
var matches = utils.diff(list, micromatch(list, patterns, opts));
|
||||
if (ignore) {
|
||||
matches = utils.diff(matches, micromatch(list, ignore));
|
||||
}
|
||||
|
||||
return opts.nodupes !== false ? utils.unique(matches) : matches;
|
||||
};
|
||||
|
||||
/**
|
||||
* Returns true if the given `string` contains the given pattern. Similar
|
||||
* to [.isMatch](#isMatch) but the pattern can match any part of the string.
|
||||
*
|
||||
* ```js
|
||||
* var mm = require('micromatch');
|
||||
* mm.contains(string, pattern[, options]);
|
||||
*
|
||||
* console.log(mm.contains('aa/bb/cc', '*b'));
|
||||
* //=> true
|
||||
* console.log(mm.contains('aa/bb/cc', '*d'));
|
||||
* //=> false
|
||||
* ```
|
||||
* @param {String} `str` The string to match.
|
||||
* @param {String|Array} `patterns` Glob pattern to use for matching.
|
||||
* @param {Object} `options` See available [options](#options) for changing how matches are performed
|
||||
* @return {Boolean} Returns true if the patter matches any part of `str`.
|
||||
* @api public
|
||||
*/
|
||||
|
||||
micromatch.contains = function(str, patterns, options) {
|
||||
if (typeof str !== 'string') {
|
||||
throw new TypeError('expected a string: "' + util.inspect(str) + '"');
|
||||
}
|
||||
|
||||
if (typeof patterns === 'string') {
|
||||
if (isEmptyString(str) || isEmptyString(patterns)) {
|
||||
return false;
|
||||
}
|
||||
|
||||
var equals = utils.equalsPattern(patterns, options);
|
||||
if (equals(str)) {
|
||||
return true;
|
||||
}
|
||||
var contains = utils.containsPattern(patterns, options);
|
||||
if (contains(str)) {
|
||||
return true;
|
||||
}
|
||||
}
|
||||
|
||||
var opts = extend({}, options, {contains: true});
|
||||
return micromatch.any(str, patterns, opts);
|
||||
};
|
||||
|
||||
/**
|
||||
* Returns true if the given pattern and options should enable
|
||||
* the `matchBase` option.
|
||||
* @return {Boolean}
|
||||
* @api private
|
||||
*/
|
||||
|
||||
micromatch.matchBase = function(pattern, options) {
|
||||
if (pattern && pattern.indexOf('/') !== -1 || !options) return false;
|
||||
return options.basename === true || options.matchBase === true;
|
||||
};
|
||||
|
||||
/**
|
||||
* Filter the keys of the given object with the given `glob` pattern
|
||||
* and `options`. Does not attempt to match nested keys. If you need this feature,
|
||||
* use [glob-object][] instead.
|
||||
*
|
||||
* ```js
|
||||
* var mm = require('micromatch');
|
||||
* mm.matchKeys(object, patterns[, options]);
|
||||
*
|
||||
* var obj = { aa: 'a', ab: 'b', ac: 'c' };
|
||||
* console.log(mm.matchKeys(obj, '*b'));
|
||||
* //=> { ab: 'b' }
|
||||
* ```
|
||||
* @param {Object} `object` The object with keys to filter.
|
||||
* @param {String|Array} `patterns` One or more glob patterns to use for matching.
|
||||
* @param {Object} `options` See available [options](#options) for changing how matches are performed
|
||||
* @return {Object} Returns an object with only keys that match the given patterns.
|
||||
* @api public
|
||||
*/
|
||||
|
||||
micromatch.matchKeys = function(obj, patterns, options) {
|
||||
if (!utils.isObject(obj)) {
|
||||
throw new TypeError('expected the first argument to be an object');
|
||||
}
|
||||
var keys = micromatch(Object.keys(obj), patterns, options);
|
||||
return utils.pick(obj, keys);
|
||||
};
|
||||
|
||||
/**
|
||||
* Returns a memoized matcher function from the given glob `pattern` and `options`.
|
||||
* The returned function takes a string to match as its only argument and returns
|
||||
* true if the string is a match.
|
||||
*
|
||||
* ```js
|
||||
* var mm = require('micromatch');
|
||||
* mm.matcher(pattern[, options]);
|
||||
*
|
||||
* var isMatch = mm.matcher('*.!(*a)');
|
||||
* console.log(isMatch('a.a'));
|
||||
* //=> false
|
||||
* console.log(isMatch('a.b'));
|
||||
* //=> true
|
||||
* ```
|
||||
* @param {String} `pattern` Glob pattern
|
||||
* @param {Object} `options` See available [options](#options) for changing how matches are performed.
|
||||
* @return {Function} Returns a matcher function.
|
||||
* @api public
|
||||
*/
|
||||
|
||||
micromatch.matcher = function matcher(pattern, options) {
|
||||
if (Array.isArray(pattern)) {
|
||||
return compose(pattern, options, matcher);
|
||||
}
|
||||
|
||||
// if pattern is a regex
|
||||
if (pattern instanceof RegExp) {
|
||||
return test(pattern);
|
||||
}
|
||||
|
||||
// if pattern is invalid
|
||||
if (!utils.isString(pattern)) {
|
||||
throw new TypeError('expected pattern to be an array, string or regex');
|
||||
}
|
||||
|
||||
// if pattern is a non-glob string
|
||||
if (!utils.hasSpecialChars(pattern)) {
|
||||
if (options && options.nocase === true) {
|
||||
pattern = pattern.toLowerCase();
|
||||
}
|
||||
return utils.matchPath(pattern, options);
|
||||
}
|
||||
|
||||
// if pattern is a glob string
|
||||
var re = micromatch.makeRe(pattern, options);
|
||||
|
||||
// if `options.matchBase` or `options.basename` is defined
|
||||
if (micromatch.matchBase(pattern, options)) {
|
||||
return utils.matchBasename(re, options);
|
||||
}
|
||||
|
||||
function test(regex) {
|
||||
var equals = utils.equalsPattern(options);
|
||||
var unixify = utils.unixify(options);
|
||||
|
||||
return function(str) {
|
||||
if (equals(str)) {
|
||||
return true;
|
||||
}
|
||||
|
||||
if (regex.test(unixify(str))) {
|
||||
return true;
|
||||
}
|
||||
return false;
|
||||
};
|
||||
}
|
||||
|
||||
var fn = test(re);
|
||||
Object.defineProperty(fn, 'result', {
|
||||
configurable: true,
|
||||
enumerable: false,
|
||||
value: re.result
|
||||
});
|
||||
return fn;
|
||||
};
|
||||
|
||||
/**
|
||||
* Returns an array of matches captured by `pattern` in `string, or `null` if the pattern did not match.
|
||||
*
|
||||
* ```js
|
||||
* var mm = require('micromatch');
|
||||
* mm.capture(pattern, string[, options]);
|
||||
*
|
||||
* console.log(mm.capture('test/*.js', 'test/foo.js'));
|
||||
* //=> ['foo']
|
||||
* console.log(mm.capture('test/*.js', 'foo/bar.css'));
|
||||
* //=> null
|
||||
* ```
|
||||
* @param {String} `pattern` Glob pattern to use for matching.
|
||||
* @param {String} `string` String to match
|
||||
* @param {Object} `options` See available [options](#options) for changing how matches are performed
|
||||
* @return {Boolean} Returns an array of captures if the string matches the glob pattern, otherwise `null`.
|
||||
* @api public
|
||||
*/
|
||||
|
||||
micromatch.capture = function(pattern, str, options) {
|
||||
var re = micromatch.makeRe(pattern, extend({capture: true}, options));
|
||||
var unixify = utils.unixify(options);
|
||||
|
||||
function match() {
|
||||
return function(string) {
|
||||
var match = re.exec(unixify(string));
|
||||
if (!match) {
|
||||
return null;
|
||||
}
|
||||
|
||||
return match.slice(1);
|
||||
};
|
||||
}
|
||||
|
||||
var capture = memoize('capture', pattern, options, match);
|
||||
return capture(str);
|
||||
};
|
||||
|
||||
/**
|
||||
* Create a regular expression from the given glob `pattern`.
|
||||
*
|
||||
* ```js
|
||||
* var mm = require('micromatch');
|
||||
* mm.makeRe(pattern[, options]);
|
||||
*
|
||||
* console.log(mm.makeRe('*.js'));
|
||||
* //=> /^(?:(\.[\\\/])?(?!\.)(?=.)[^\/]*?\.js)$/
|
||||
* ```
|
||||
* @param {String} `pattern` A glob pattern to convert to regex.
|
||||
* @param {Object} `options` See available [options](#options) for changing how matches are performed.
|
||||
* @return {RegExp} Returns a regex created from the given pattern.
|
||||
* @api public
|
||||
*/
|
||||
|
||||
micromatch.makeRe = function(pattern, options) {
|
||||
if (typeof pattern !== 'string') {
|
||||
throw new TypeError('expected pattern to be a string');
|
||||
}
|
||||
|
||||
if (pattern.length > MAX_LENGTH) {
|
||||
throw new Error('expected pattern to be less than ' + MAX_LENGTH + ' characters');
|
||||
}
|
||||
|
||||
function makeRe() {
|
||||
var result = micromatch.create(pattern, options);
|
||||
var ast_array = [];
|
||||
var output = result.map(function(obj) {
|
||||
obj.ast.state = obj.state;
|
||||
ast_array.push(obj.ast);
|
||||
return obj.output;
|
||||
});
|
||||
|
||||
var regex = toRegex(output.join('|'), options);
|
||||
Object.defineProperty(regex, 'result', {
|
||||
configurable: true,
|
||||
enumerable: false,
|
||||
value: ast_array
|
||||
});
|
||||
return regex;
|
||||
}
|
||||
|
||||
return memoize('makeRe', pattern, options, makeRe);
|
||||
};
|
||||
|
||||
/**
|
||||
* Expand the given brace `pattern`.
|
||||
*
|
||||
* ```js
|
||||
* var mm = require('micromatch');
|
||||
* console.log(mm.braces('foo/{a,b}/bar'));
|
||||
* //=> ['foo/(a|b)/bar']
|
||||
*
|
||||
* console.log(mm.braces('foo/{a,b}/bar', {expand: true}));
|
||||
* //=> ['foo/(a|b)/bar']
|
||||
* ```
|
||||
* @param {String} `pattern` String with brace pattern to expand.
|
||||
* @param {Object} `options` Any [options](#options) to change how expansion is performed. See the [braces][] library for all available options.
|
||||
* @return {Array}
|
||||
* @api public
|
||||
*/
|
||||
|
||||
micromatch.braces = function(pattern, options) {
|
||||
if (typeof pattern !== 'string' && !Array.isArray(pattern)) {
|
||||
throw new TypeError('expected pattern to be an array or string');
|
||||
}
|
||||
|
||||
function expand() {
|
||||
if (options && options.nobrace === true || !/\{.*\}/.test(pattern)) {
|
||||
return utils.arrayify(pattern);
|
||||
}
|
||||
return braces(pattern, options);
|
||||
}
|
||||
|
||||
return memoize('braces', pattern, options, expand);
|
||||
};
|
||||
|
||||
/**
|
||||
* Proxy to the [micromatch.braces](#method), for parity with
|
||||
* minimatch.
|
||||
*/
|
||||
|
||||
micromatch.braceExpand = function(pattern, options) {
|
||||
var opts = extend({}, options, {expand: true});
|
||||
return micromatch.braces(pattern, opts);
|
||||
};
|
||||
|
||||
/**
|
||||
* Parses the given glob `pattern` and returns an array of abstract syntax
|
||||
* trees (ASTs), with the compiled `output` and optional source `map` on
|
||||
* each AST.
|
||||
*
|
||||
* ```js
|
||||
* var mm = require('micromatch');
|
||||
* mm.create(pattern[, options]);
|
||||
*
|
||||
* console.log(mm.create('abc/*.js'));
|
||||
* // [{ options: { source: 'string', sourcemap: true },
|
||||
* // state: {},
|
||||
* // compilers:
|
||||
* // { ... },
|
||||
* // output: '(\\.[\\\\\\/])?abc\\/(?!\\.)(?=.)[^\\/]*?\\.js',
|
||||
* // ast:
|
||||
* // { type: 'root',
|
||||
* // errors: [],
|
||||
* // nodes:
|
||||
* // [ ... ],
|
||||
* // dot: false,
|
||||
* // input: 'abc/*.js' },
|
||||
* // parsingErrors: [],
|
||||
* // map:
|
||||
* // { version: 3,
|
||||
* // sources: [ 'string' ],
|
||||
* // names: [],
|
||||
* // mappings: 'AAAA,GAAG,EAAC,kBAAC,EAAC,EAAE',
|
||||
* // sourcesContent: [ 'abc/*.js' ] },
|
||||
* // position: { line: 1, column: 28 },
|
||||
* // content: {},
|
||||
* // files: {},
|
||||
* // idx: 6 }]
|
||||
* ```
|
||||
* @param {String} `pattern` Glob pattern to parse and compile.
|
||||
* @param {Object} `options` Any [options](#options) to change how parsing and compiling is performed.
|
||||
* @return {Object} Returns an object with the parsed AST, compiled string and optional source map.
|
||||
* @api public
|
||||
*/
|
||||
|
||||
micromatch.create = function(pattern, options) {
|
||||
return memoize('create', pattern, options, function() {
|
||||
function create(str, opts) {
|
||||
return micromatch.compile(micromatch.parse(str, opts), opts);
|
||||
}
|
||||
|
||||
pattern = micromatch.braces(pattern, options);
|
||||
var len = pattern.length;
|
||||
var idx = -1;
|
||||
var res = [];
|
||||
|
||||
while (++idx < len) {
|
||||
res.push(create(pattern[idx], options));
|
||||
}
|
||||
return res;
|
||||
});
|
||||
};
|
||||
|
||||
/**
|
||||
* Parse the given `str` with the given `options`.
|
||||
*
|
||||
* ```js
|
||||
* var mm = require('micromatch');
|
||||
* mm.parse(pattern[, options]);
|
||||
*
|
||||
* var ast = mm.parse('a/{b,c}/d');
|
||||
* console.log(ast);
|
||||
* // { type: 'root',
|
||||
* // errors: [],
|
||||
* // input: 'a/{b,c}/d',
|
||||
* // nodes:
|
||||
* // [ { type: 'bos', val: '' },
|
||||
* // { type: 'text', val: 'a/' },
|
||||
* // { type: 'brace',
|
||||
* // nodes:
|
||||
* // [ { type: 'brace.open', val: '{' },
|
||||
* // { type: 'text', val: 'b,c' },
|
||||
* // { type: 'brace.close', val: '}' } ] },
|
||||
* // { type: 'text', val: '/d' },
|
||||
* // { type: 'eos', val: '' } ] }
|
||||
* ```
|
||||
* @param {String} `str`
|
||||
* @param {Object} `options`
|
||||
* @return {Object} Returns an AST
|
||||
* @api public
|
||||
*/
|
||||
|
||||
micromatch.parse = function(pattern, options) {
|
||||
if (typeof pattern !== 'string') {
|
||||
throw new TypeError('expected a string');
|
||||
}
|
||||
|
||||
function parse() {
|
||||
var snapdragon = utils.instantiate(null, options);
|
||||
parsers(snapdragon, options);
|
||||
|
||||
var ast = snapdragon.parse(pattern, options);
|
||||
utils.define(ast, 'snapdragon', snapdragon);
|
||||
ast.input = pattern;
|
||||
return ast;
|
||||
}
|
||||
|
||||
return memoize('parse', pattern, options, parse);
|
||||
};
|
||||
|
||||
/**
|
||||
* Compile the given `ast` or string with the given `options`.
|
||||
*
|
||||
* ```js
|
||||
* var mm = require('micromatch');
|
||||
* mm.compile(ast[, options]);
|
||||
*
|
||||
* var ast = mm.parse('a/{b,c}/d');
|
||||
* console.log(mm.compile(ast));
|
||||
* // { options: { source: 'string' },
|
||||
* // state: {},
|
||||
* // compilers:
|
||||
* // { eos: [Function],
|
||||
* // noop: [Function],
|
||||
* // bos: [Function],
|
||||
* // brace: [Function],
|
||||
* // 'brace.open': [Function],
|
||||
* // text: [Function],
|
||||
* // 'brace.close': [Function] },
|
||||
* // output: [ 'a/(b|c)/d' ],
|
||||
* // ast:
|
||||
* // { ... },
|
||||
* // parsingErrors: [] }
|
||||
* ```
|
||||
* @param {Object|String} `ast`
|
||||
* @param {Object} `options`
|
||||
* @return {Object} Returns an object that has an `output` property with the compiled string.
|
||||
* @api public
|
||||
*/
|
||||
|
||||
micromatch.compile = function(ast, options) {
|
||||
if (typeof ast === 'string') {
|
||||
ast = micromatch.parse(ast, options);
|
||||
}
|
||||
|
||||
return memoize('compile', ast.input, options, function() {
|
||||
var snapdragon = utils.instantiate(ast, options);
|
||||
compilers(snapdragon, options);
|
||||
return snapdragon.compile(ast, options);
|
||||
});
|
||||
};
|
||||
|
||||
/**
|
||||
* Clear the regex cache.
|
||||
*
|
||||
* ```js
|
||||
* mm.clearCache();
|
||||
* ```
|
||||
* @api public
|
||||
*/
|
||||
|
||||
micromatch.clearCache = function() {
|
||||
micromatch.cache.caches = {};
|
||||
};
|
||||
|
||||
/**
|
||||
* Returns true if the given value is effectively an empty string
|
||||
*/
|
||||
|
||||
function isEmptyString(val) {
|
||||
return String(val) === '' || String(val) === './';
|
||||
}
|
||||
|
||||
/**
|
||||
* Compose a matcher function with the given patterns.
|
||||
* This allows matcher functions to be compiled once and
|
||||
* called multiple times.
|
||||
*/
|
||||
|
||||
function compose(patterns, options, matcher) {
|
||||
var matchers;
|
||||
|
||||
return memoize('compose', String(patterns), options, function() {
|
||||
return function(file) {
|
||||
// delay composition until it's invoked the first time,
|
||||
// after that it won't be called again
|
||||
if (!matchers) {
|
||||
matchers = [];
|
||||
for (var i = 0; i < patterns.length; i++) {
|
||||
matchers.push(matcher(patterns[i], options));
|
||||
}
|
||||
}
|
||||
|
||||
var len = matchers.length;
|
||||
while (len--) {
|
||||
if (matchers[len](file) === true) {
|
||||
return true;
|
||||
}
|
||||
}
|
||||
return false;
|
||||
};
|
||||
});
|
||||
}
|
||||
|
||||
/**
|
||||
* Memoize a generated regex or function. A unique key is generated
|
||||
* from the `type` (usually method name), the `pattern`, and
|
||||
* user-defined options.
|
||||
*/
|
||||
|
||||
function memoize(type, pattern, options, fn) {
|
||||
var key = utils.createKey(type + '=' + pattern, options);
|
||||
|
||||
if (options && options.cache === false) {
|
||||
return fn(pattern, options);
|
||||
}
|
||||
|
||||
if (cache.has(type, key)) {
|
||||
return cache.get(type, key);
|
||||
}
|
||||
|
||||
var val = fn(pattern, options);
|
||||
cache.set(type, key, val);
|
||||
return val;
|
||||
}
|
||||
|
||||
/**
|
||||
* Expose compiler, parser and cache on `micromatch`
|
||||
*/
|
||||
|
||||
micromatch.compilers = compilers;
|
||||
micromatch.parsers = parsers;
|
||||
micromatch.caches = cache.caches;
|
||||
|
||||
/**
|
||||
* Expose `micromatch`
|
||||
* @type {Function}
|
||||
*/
|
||||
|
||||
module.exports = micromatch;
|
||||
BIN
node_modules/sane/node_modules/micromatch/lib/.DS_Store
generated
vendored
Normal file
BIN
node_modules/sane/node_modules/micromatch/lib/.DS_Store
generated
vendored
Normal file
Binary file not shown.
1
node_modules/sane/node_modules/micromatch/lib/cache.js
generated
vendored
Normal file
1
node_modules/sane/node_modules/micromatch/lib/cache.js
generated
vendored
Normal file
|
|
@ -0,0 +1 @@
|
|||
module.exports = new (require('fragment-cache'))();
|
||||
77
node_modules/sane/node_modules/micromatch/lib/compilers.js
generated
vendored
Normal file
77
node_modules/sane/node_modules/micromatch/lib/compilers.js
generated
vendored
Normal file
|
|
@ -0,0 +1,77 @@
|
|||
'use strict';
|
||||
|
||||
var nanomatch = require('nanomatch');
|
||||
var extglob = require('extglob');
|
||||
|
||||
module.exports = function(snapdragon) {
|
||||
var compilers = snapdragon.compiler.compilers;
|
||||
var opts = snapdragon.options;
|
||||
|
||||
// register nanomatch compilers
|
||||
snapdragon.use(nanomatch.compilers);
|
||||
|
||||
// get references to some specific nanomatch compilers before they
|
||||
// are overridden by the extglob and/or custom compilers
|
||||
var escape = compilers.escape;
|
||||
var qmark = compilers.qmark;
|
||||
var slash = compilers.slash;
|
||||
var star = compilers.star;
|
||||
var text = compilers.text;
|
||||
var plus = compilers.plus;
|
||||
var dot = compilers.dot;
|
||||
|
||||
// register extglob compilers or escape exglobs if disabled
|
||||
if (opts.extglob === false || opts.noext === true) {
|
||||
snapdragon.compiler.use(escapeExtglobs);
|
||||
} else {
|
||||
snapdragon.use(extglob.compilers);
|
||||
}
|
||||
|
||||
snapdragon.use(function() {
|
||||
this.options.star = this.options.star || function(/*node*/) {
|
||||
return '[^\\\\/]*?';
|
||||
};
|
||||
});
|
||||
|
||||
// custom micromatch compilers
|
||||
snapdragon.compiler
|
||||
|
||||
// reset referenced compiler
|
||||
.set('dot', dot)
|
||||
.set('escape', escape)
|
||||
.set('plus', plus)
|
||||
.set('slash', slash)
|
||||
.set('qmark', qmark)
|
||||
.set('star', star)
|
||||
.set('text', text);
|
||||
};
|
||||
|
||||
function escapeExtglobs(compiler) {
|
||||
compiler.set('paren', function(node) {
|
||||
var val = '';
|
||||
visit(node, function(tok) {
|
||||
if (tok.val) val += (/^\W/.test(tok.val) ? '\\' : '') + tok.val;
|
||||
});
|
||||
return this.emit(val, node);
|
||||
});
|
||||
|
||||
/**
|
||||
* Visit `node` with the given `fn`
|
||||
*/
|
||||
|
||||
function visit(node, fn) {
|
||||
return node.nodes ? mapVisit(node.nodes, fn) : fn(node);
|
||||
}
|
||||
|
||||
/**
|
||||
* Map visit over array of `nodes`.
|
||||
*/
|
||||
|
||||
function mapVisit(nodes, fn) {
|
||||
var len = nodes.length;
|
||||
var idx = -1;
|
||||
while (++idx < len) {
|
||||
visit(nodes[idx], fn);
|
||||
}
|
||||
}
|
||||
}
|
||||
83
node_modules/sane/node_modules/micromatch/lib/parsers.js
generated
vendored
Normal file
83
node_modules/sane/node_modules/micromatch/lib/parsers.js
generated
vendored
Normal file
|
|
@ -0,0 +1,83 @@
|
|||
'use strict';
|
||||
|
||||
var extglob = require('extglob');
|
||||
var nanomatch = require('nanomatch');
|
||||
var regexNot = require('regex-not');
|
||||
var toRegex = require('to-regex');
|
||||
var not;
|
||||
|
||||
/**
|
||||
* Characters to use in negation regex (we want to "not" match
|
||||
* characters that are matched by other parsers)
|
||||
*/
|
||||
|
||||
var TEXT = '([!@*?+]?\\(|\\)|\\[:?(?=.*?:?\\])|:?\\]|[*+?!^$.\\\\/])+';
|
||||
var createNotRegex = function(opts) {
|
||||
return not || (not = textRegex(TEXT));
|
||||
};
|
||||
|
||||
/**
|
||||
* Parsers
|
||||
*/
|
||||
|
||||
module.exports = function(snapdragon) {
|
||||
var parsers = snapdragon.parser.parsers;
|
||||
|
||||
// register nanomatch parsers
|
||||
snapdragon.use(nanomatch.parsers);
|
||||
|
||||
// get references to some specific nanomatch parsers before they
|
||||
// are overridden by the extglob and/or parsers
|
||||
var escape = parsers.escape;
|
||||
var slash = parsers.slash;
|
||||
var qmark = parsers.qmark;
|
||||
var plus = parsers.plus;
|
||||
var star = parsers.star;
|
||||
var dot = parsers.dot;
|
||||
|
||||
// register extglob parsers
|
||||
snapdragon.use(extglob.parsers);
|
||||
|
||||
// custom micromatch parsers
|
||||
snapdragon.parser
|
||||
.use(function() {
|
||||
// override "notRegex" created in nanomatch parser
|
||||
this.notRegex = /^\!+(?!\()/;
|
||||
})
|
||||
// reset the referenced parsers
|
||||
.capture('escape', escape)
|
||||
.capture('slash', slash)
|
||||
.capture('qmark', qmark)
|
||||
.capture('star', star)
|
||||
.capture('plus', plus)
|
||||
.capture('dot', dot)
|
||||
|
||||
/**
|
||||
* Override `text` parser
|
||||
*/
|
||||
|
||||
.capture('text', function() {
|
||||
if (this.isInside('bracket')) return;
|
||||
var pos = this.position();
|
||||
var m = this.match(createNotRegex(this.options));
|
||||
if (!m || !m[0]) return;
|
||||
|
||||
// escape regex boundary characters and simple brackets
|
||||
var val = m[0].replace(/([[\]^$])/g, '\\$1');
|
||||
|
||||
return pos({
|
||||
type: 'text',
|
||||
val: val
|
||||
});
|
||||
});
|
||||
};
|
||||
|
||||
/**
|
||||
* Create text regex
|
||||
*/
|
||||
|
||||
function textRegex(pattern) {
|
||||
var notStr = regexNot.create(pattern, {contains: true, strictClose: false});
|
||||
var prefix = '(?:[\\^]|\\\\|';
|
||||
return toRegex(prefix + notStr + ')', {strictClose: false});
|
||||
}
|
||||
309
node_modules/sane/node_modules/micromatch/lib/utils.js
generated
vendored
Normal file
309
node_modules/sane/node_modules/micromatch/lib/utils.js
generated
vendored
Normal file
|
|
@ -0,0 +1,309 @@
|
|||
'use strict';
|
||||
|
||||
var utils = module.exports;
|
||||
var path = require('path');
|
||||
|
||||
/**
|
||||
* Module dependencies
|
||||
*/
|
||||
|
||||
var Snapdragon = require('snapdragon');
|
||||
utils.define = require('define-property');
|
||||
utils.diff = require('arr-diff');
|
||||
utils.extend = require('extend-shallow');
|
||||
utils.pick = require('object.pick');
|
||||
utils.typeOf = require('kind-of');
|
||||
utils.unique = require('array-unique');
|
||||
|
||||
/**
|
||||
* Returns true if the platform is windows, or `path.sep` is `\\`.
|
||||
* This is defined as a function to allow `path.sep` to be set in unit tests,
|
||||
* or by the user, if there is a reason to do so.
|
||||
* @return {Boolean}
|
||||
*/
|
||||
|
||||
utils.isWindows = function() {
|
||||
return path.sep === '\\' || process.platform === 'win32';
|
||||
};
|
||||
|
||||
/**
|
||||
* Get the `Snapdragon` instance to use
|
||||
*/
|
||||
|
||||
utils.instantiate = function(ast, options) {
|
||||
var snapdragon;
|
||||
// if an instance was created by `.parse`, use that instance
|
||||
if (utils.typeOf(ast) === 'object' && ast.snapdragon) {
|
||||
snapdragon = ast.snapdragon;
|
||||
// if the user supplies an instance on options, use that instance
|
||||
} else if (utils.typeOf(options) === 'object' && options.snapdragon) {
|
||||
snapdragon = options.snapdragon;
|
||||
// create a new instance
|
||||
} else {
|
||||
snapdragon = new Snapdragon(options);
|
||||
}
|
||||
|
||||
utils.define(snapdragon, 'parse', function(str, options) {
|
||||
var parsed = Snapdragon.prototype.parse.apply(this, arguments);
|
||||
parsed.input = str;
|
||||
|
||||
// escape unmatched brace/bracket/parens
|
||||
var last = this.parser.stack.pop();
|
||||
if (last && this.options.strictErrors !== true) {
|
||||
var open = last.nodes[0];
|
||||
var inner = last.nodes[1];
|
||||
if (last.type === 'bracket') {
|
||||
if (inner.val.charAt(0) === '[') {
|
||||
inner.val = '\\' + inner.val;
|
||||
}
|
||||
|
||||
} else {
|
||||
open.val = '\\' + open.val;
|
||||
var sibling = open.parent.nodes[1];
|
||||
if (sibling.type === 'star') {
|
||||
sibling.loose = true;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// add non-enumerable parser reference
|
||||
utils.define(parsed, 'parser', this.parser);
|
||||
return parsed;
|
||||
});
|
||||
|
||||
return snapdragon;
|
||||
};
|
||||
|
||||
/**
|
||||
* Create the key to use for memoization. The key is generated
|
||||
* by iterating over the options and concatenating key-value pairs
|
||||
* to the pattern string.
|
||||
*/
|
||||
|
||||
utils.createKey = function(pattern, options) {
|
||||
if (utils.typeOf(options) !== 'object') {
|
||||
return pattern;
|
||||
}
|
||||
var val = pattern;
|
||||
var keys = Object.keys(options);
|
||||
for (var i = 0; i < keys.length; i++) {
|
||||
var key = keys[i];
|
||||
val += ';' + key + '=' + String(options[key]);
|
||||
}
|
||||
return val;
|
||||
};
|
||||
|
||||
/**
|
||||
* Cast `val` to an array
|
||||
* @return {Array}
|
||||
*/
|
||||
|
||||
utils.arrayify = function(val) {
|
||||
if (typeof val === 'string') return [val];
|
||||
return val ? (Array.isArray(val) ? val : [val]) : [];
|
||||
};
|
||||
|
||||
/**
|
||||
* Return true if `val` is a non-empty string
|
||||
*/
|
||||
|
||||
utils.isString = function(val) {
|
||||
return typeof val === 'string';
|
||||
};
|
||||
|
||||
/**
|
||||
* Return true if `val` is a non-empty string
|
||||
*/
|
||||
|
||||
utils.isObject = function(val) {
|
||||
return utils.typeOf(val) === 'object';
|
||||
};
|
||||
|
||||
/**
|
||||
* Returns true if the given `str` has special characters
|
||||
*/
|
||||
|
||||
utils.hasSpecialChars = function(str) {
|
||||
return /(?:(?:(^|\/)[!.])|[*?+()|\[\]{}]|[+@]\()/.test(str);
|
||||
};
|
||||
|
||||
/**
|
||||
* Escape regex characters in the given string
|
||||
*/
|
||||
|
||||
utils.escapeRegex = function(str) {
|
||||
return str.replace(/[-[\]{}()^$|*+?.\\\/\s]/g, '\\$&');
|
||||
};
|
||||
|
||||
/**
|
||||
* Normalize slashes in the given filepath.
|
||||
*
|
||||
* @param {String} `filepath`
|
||||
* @return {String}
|
||||
*/
|
||||
|
||||
utils.toPosixPath = function(str) {
|
||||
return str.replace(/\\+/g, '/');
|
||||
};
|
||||
|
||||
/**
|
||||
* Strip backslashes before special characters in a string.
|
||||
*
|
||||
* @param {String} `str`
|
||||
* @return {String}
|
||||
*/
|
||||
|
||||
utils.unescape = function(str) {
|
||||
return utils.toPosixPath(str.replace(/\\(?=[*+?!.])/g, ''));
|
||||
};
|
||||
|
||||
/**
|
||||
* Strip the prefix from a filepath
|
||||
* @param {String} `fp`
|
||||
* @return {String}
|
||||
*/
|
||||
|
||||
utils.stripPrefix = function(str) {
|
||||
if (str.charAt(0) !== '.') {
|
||||
return str;
|
||||
}
|
||||
var ch = str.charAt(1);
|
||||
if (utils.isSlash(ch)) {
|
||||
return str.slice(2);
|
||||
}
|
||||
return str;
|
||||
};
|
||||
|
||||
/**
|
||||
* Returns true if the given str is an escaped or
|
||||
* unescaped path character
|
||||
*/
|
||||
|
||||
utils.isSlash = function(str) {
|
||||
return str === '/' || str === '\\/' || str === '\\' || str === '\\\\';
|
||||
};
|
||||
|
||||
/**
|
||||
* Returns a function that returns true if the given
|
||||
* pattern matches or contains a `filepath`
|
||||
*
|
||||
* @param {String} `pattern`
|
||||
* @return {Function}
|
||||
*/
|
||||
|
||||
utils.matchPath = function(pattern, options) {
|
||||
return (options && options.contains)
|
||||
? utils.containsPattern(pattern, options)
|
||||
: utils.equalsPattern(pattern, options);
|
||||
};
|
||||
|
||||
/**
|
||||
* Returns true if the given (original) filepath or unixified path are equal
|
||||
* to the given pattern.
|
||||
*/
|
||||
|
||||
utils._equals = function(filepath, unixPath, pattern) {
|
||||
return pattern === filepath || pattern === unixPath;
|
||||
};
|
||||
|
||||
/**
|
||||
* Returns true if the given (original) filepath or unixified path contain
|
||||
* the given pattern.
|
||||
*/
|
||||
|
||||
utils._contains = function(filepath, unixPath, pattern) {
|
||||
return filepath.indexOf(pattern) !== -1 || unixPath.indexOf(pattern) !== -1;
|
||||
};
|
||||
|
||||
/**
|
||||
* Returns a function that returns true if the given
|
||||
* pattern is the same as a given `filepath`
|
||||
*
|
||||
* @param {String} `pattern`
|
||||
* @return {Function}
|
||||
*/
|
||||
|
||||
utils.equalsPattern = function(pattern, options) {
|
||||
var unixify = utils.unixify(options);
|
||||
options = options || {};
|
||||
|
||||
return function fn(filepath) {
|
||||
var equal = utils._equals(filepath, unixify(filepath), pattern);
|
||||
if (equal === true || options.nocase !== true) {
|
||||
return equal;
|
||||
}
|
||||
var lower = filepath.toLowerCase();
|
||||
return utils._equals(lower, unixify(lower), pattern);
|
||||
};
|
||||
};
|
||||
|
||||
/**
|
||||
* Returns a function that returns true if the given
|
||||
* pattern contains a `filepath`
|
||||
*
|
||||
* @param {String} `pattern`
|
||||
* @return {Function}
|
||||
*/
|
||||
|
||||
utils.containsPattern = function(pattern, options) {
|
||||
var unixify = utils.unixify(options);
|
||||
options = options || {};
|
||||
|
||||
return function(filepath) {
|
||||
var contains = utils._contains(filepath, unixify(filepath), pattern);
|
||||
if (contains === true || options.nocase !== true) {
|
||||
return contains;
|
||||
}
|
||||
var lower = filepath.toLowerCase();
|
||||
return utils._contains(lower, unixify(lower), pattern);
|
||||
};
|
||||
};
|
||||
|
||||
/**
|
||||
* Returns a function that returns true if the given
|
||||
* regex matches the `filename` of a file path.
|
||||
*
|
||||
* @param {RegExp} `re` Matching regex
|
||||
* @return {Function}
|
||||
*/
|
||||
|
||||
utils.matchBasename = function(re) {
|
||||
return function(filepath) {
|
||||
return re.test(path.basename(filepath));
|
||||
};
|
||||
};
|
||||
|
||||
/**
|
||||
* Determines the filepath to return based on the provided options.
|
||||
* @return {any}
|
||||
*/
|
||||
|
||||
utils.value = function(str, unixify, options) {
|
||||
if (options && options.unixify === false) {
|
||||
return str;
|
||||
}
|
||||
return unixify(str);
|
||||
};
|
||||
|
||||
/**
|
||||
* Returns a function that normalizes slashes in a string to forward
|
||||
* slashes, strips `./` from beginning of paths, and optionally unescapes
|
||||
* special characters.
|
||||
* @return {Function}
|
||||
*/
|
||||
|
||||
utils.unixify = function(options) {
|
||||
options = options || {};
|
||||
return function(filepath) {
|
||||
if (utils.isWindows() || options.unixify === true) {
|
||||
filepath = utils.toPosixPath(filepath);
|
||||
}
|
||||
if (options.stripPrefix !== false) {
|
||||
filepath = utils.stripPrefix(filepath);
|
||||
}
|
||||
if (options.unescape === true) {
|
||||
filepath = utils.unescape(filepath);
|
||||
}
|
||||
return filepath;
|
||||
};
|
||||
};
|
||||
147
node_modules/sane/node_modules/micromatch/package.json
generated
vendored
Normal file
147
node_modules/sane/node_modules/micromatch/package.json
generated
vendored
Normal file
|
|
@ -0,0 +1,147 @@
|
|||
{
|
||||
"name": "micromatch",
|
||||
"description": "Glob matching for javascript/node.js. A drop-in replacement and faster alternative to minimatch and multimatch.",
|
||||
"version": "3.1.10",
|
||||
"homepage": "https://github.com/micromatch/micromatch",
|
||||
"author": "Jon Schlinkert (https://github.com/jonschlinkert)",
|
||||
"contributors": [
|
||||
"Amila Welihinda (amilajack.com)",
|
||||
"Bogdan Chadkin (https://github.com/TrySound)",
|
||||
"Brian Woodward (https://twitter.com/doowb)",
|
||||
"Devon Govett (http://badassjs.com)",
|
||||
"Elan Shanker (https://github.com/es128)",
|
||||
"Fabrício Matté (https://ultcombo.js.org)",
|
||||
"Jon Schlinkert (http://twitter.com/jonschlinkert)",
|
||||
"Martin Kolárik (https://kolarik.sk)",
|
||||
"Olsten Larck (https://i.am.charlike.online)",
|
||||
"Paul Miller (paulmillr.com)",
|
||||
"Tom Byrer (https://github.com/tomByrer)",
|
||||
"Tyler Akins (http://rumkin.com)",
|
||||
"(https://github.com/DianeLooney)"
|
||||
],
|
||||
"repository": "micromatch/micromatch",
|
||||
"bugs": {
|
||||
"url": "https://github.com/micromatch/micromatch/issues"
|
||||
},
|
||||
"license": "MIT",
|
||||
"files": [
|
||||
"index.js",
|
||||
"lib"
|
||||
],
|
||||
"main": "index.js",
|
||||
"engines": {
|
||||
"node": ">=0.10.0"
|
||||
},
|
||||
"scripts": {
|
||||
"test": "mocha"
|
||||
},
|
||||
"dependencies": {
|
||||
"arr-diff": "^4.0.0",
|
||||
"array-unique": "^0.3.2",
|
||||
"braces": "^2.3.1",
|
||||
"define-property": "^2.0.2",
|
||||
"extend-shallow": "^3.0.2",
|
||||
"extglob": "^2.0.4",
|
||||
"fragment-cache": "^0.2.1",
|
||||
"kind-of": "^6.0.2",
|
||||
"nanomatch": "^1.2.9",
|
||||
"object.pick": "^1.3.0",
|
||||
"regex-not": "^1.0.0",
|
||||
"snapdragon": "^0.8.1",
|
||||
"to-regex": "^3.0.2"
|
||||
},
|
||||
"devDependencies": {
|
||||
"bash-match": "^1.0.2",
|
||||
"for-own": "^1.0.0",
|
||||
"gulp": "^3.9.1",
|
||||
"gulp-format-md": "^1.0.0",
|
||||
"gulp-istanbul": "^1.1.3",
|
||||
"gulp-mocha": "^5.0.0",
|
||||
"gulp-unused": "^0.2.1",
|
||||
"is-windows": "^1.0.2",
|
||||
"minimatch": "^3.0.4",
|
||||
"minimist": "^1.2.0",
|
||||
"mocha": "^3.5.3",
|
||||
"multimatch": "^2.1.0"
|
||||
},
|
||||
"keywords": [
|
||||
"bash",
|
||||
"expand",
|
||||
"expansion",
|
||||
"expression",
|
||||
"file",
|
||||
"files",
|
||||
"filter",
|
||||
"find",
|
||||
"glob",
|
||||
"globbing",
|
||||
"globs",
|
||||
"globstar",
|
||||
"match",
|
||||
"matcher",
|
||||
"matches",
|
||||
"matching",
|
||||
"micromatch",
|
||||
"minimatch",
|
||||
"multimatch",
|
||||
"path",
|
||||
"pattern",
|
||||
"patterns",
|
||||
"regex",
|
||||
"regexp",
|
||||
"regular",
|
||||
"shell",
|
||||
"wildcard"
|
||||
],
|
||||
"lintDeps": {
|
||||
"dependencies": {
|
||||
"options": {
|
||||
"lock": {
|
||||
"snapdragon": "^0.8.1"
|
||||
}
|
||||
}
|
||||
},
|
||||
"devDependencies": {
|
||||
"files": {
|
||||
"options": {
|
||||
"ignore": [
|
||||
"benchmark/**"
|
||||
]
|
||||
}
|
||||
}
|
||||
}
|
||||
},
|
||||
"verb": {
|
||||
"toc": "collapsible",
|
||||
"layout": "default",
|
||||
"tasks": [
|
||||
"readme"
|
||||
],
|
||||
"plugins": [
|
||||
"gulp-format-md"
|
||||
],
|
||||
"helpers": [
|
||||
"./benchmark/helper.js"
|
||||
],
|
||||
"related": {
|
||||
"list": [
|
||||
"braces",
|
||||
"expand-brackets",
|
||||
"extglob",
|
||||
"fill-range",
|
||||
"nanomatch"
|
||||
]
|
||||
},
|
||||
"lint": {
|
||||
"reflinks": true
|
||||
},
|
||||
"reflinks": [
|
||||
"expand-brackets",
|
||||
"extglob",
|
||||
"glob-object",
|
||||
"minimatch",
|
||||
"multimatch",
|
||||
"snapdragon"
|
||||
]
|
||||
}
|
||||
}
|
||||
21
node_modules/sane/node_modules/normalize-path/LICENSE
generated
vendored
Normal file
21
node_modules/sane/node_modules/normalize-path/LICENSE
generated
vendored
Normal file
|
|
@ -0,0 +1,21 @@
|
|||
The MIT License (MIT)
|
||||
|
||||
Copyright (c) 2014-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.
|
||||
92
node_modules/sane/node_modules/normalize-path/README.md
generated
vendored
Normal file
92
node_modules/sane/node_modules/normalize-path/README.md
generated
vendored
Normal file
|
|
@ -0,0 +1,92 @@
|
|||
# normalize-path [](https://www.npmjs.com/package/normalize-path) [](https://npmjs.org/package/normalize-path) [](https://npmjs.org/package/normalize-path) [](https://travis-ci.org/jonschlinkert/normalize-path)
|
||||
|
||||
> Normalize file path slashes to be unix-like forward slashes. Also condenses repeat slashes to a single slash and removes and trailing slashes unless disabled.
|
||||
|
||||
## Install
|
||||
|
||||
Install with [npm](https://www.npmjs.com/):
|
||||
|
||||
```sh
|
||||
$ npm install --save normalize-path
|
||||
```
|
||||
|
||||
## Usage
|
||||
|
||||
```js
|
||||
var normalize = require('normalize-path');
|
||||
|
||||
normalize('\\foo\\bar\\baz\\');
|
||||
//=> '/foo/bar/baz'
|
||||
|
||||
normalize('./foo/bar/baz/');
|
||||
//=> './foo/bar/baz'
|
||||
```
|
||||
|
||||
Pass `false` as the last argument to **keep** trailing slashes:
|
||||
|
||||
```js
|
||||
normalize('./foo/bar/baz/', false);
|
||||
//=> './foo/bar/baz/'
|
||||
|
||||
normalize('foo\\bar\\baz\\', false);
|
||||
//=> 'foo/bar/baz/'
|
||||
```
|
||||
|
||||
## About
|
||||
|
||||
### Related projects
|
||||
|
||||
* [contains-path](https://www.npmjs.com/package/contains-path): Return true if a file path contains the given path. | [homepage](https://github.com/jonschlinkert/contains-path "Return true if a file path contains the given path.")
|
||||
* [ends-with](https://www.npmjs.com/package/ends-with): Returns `true` if the given `string` or `array` ends with `suffix` using strict equality for… [more](https://github.com/jonschlinkert/ends-with) | [homepage](https://github.com/jonschlinkert/ends-with "Returns `true` if the given `string` or `array` ends with `suffix` using strict equality for comparisons.")
|
||||
* [is-absolute](https://www.npmjs.com/package/is-absolute): Polyfill for node.js `path.isAbolute`. Returns true if a file path is absolute. | [homepage](https://github.com/jonschlinkert/is-absolute "Polyfill for node.js `path.isAbolute`. Returns true if a file path is absolute.")
|
||||
* [is-relative](https://www.npmjs.com/package/is-relative): Returns `true` if the path appears to be relative. | [homepage](https://github.com/jonschlinkert/is-relative "Returns `true` if the path appears to be relative.")
|
||||
* [parse-filepath](https://www.npmjs.com/package/parse-filepath): Pollyfill for node.js `path.parse`, parses a filepath into an object. | [homepage](https://github.com/jonschlinkert/parse-filepath "Pollyfill for node.js `path.parse`, parses a filepath into an object.")
|
||||
* [path-ends-with](https://www.npmjs.com/package/path-ends-with): Return `true` if a file path ends with the given string/suffix. | [homepage](https://github.com/jonschlinkert/path-ends-with "Return `true` if a file path ends with the given string/suffix.")
|
||||
* [path-segments](https://www.npmjs.com/package/path-segments): Get n specific segments of a file path, e.g. first 2, last 3, etc. | [homepage](https://github.com/jonschlinkert/path-segments "Get n specific segments of a file path, e.g. first 2, last 3, etc.")
|
||||
* [rewrite-ext](https://www.npmjs.com/package/rewrite-ext): Automatically re-write the destination extension of a filepath based on the source extension. e.g… [more](https://github.com/jonschlinkert/rewrite-ext) | [homepage](https://github.com/jonschlinkert/rewrite-ext "Automatically re-write the destination extension of a filepath based on the source extension. e.g `.coffee` => `.js`. This will only rename the ext, no other path parts are modified.")
|
||||
* [unixify](https://www.npmjs.com/package/unixify): Convert Windows file paths to unix paths. | [homepage](https://github.com/jonschlinkert/unixify "Convert Windows file paths to unix paths.")
|
||||
|
||||
### Contributing
|
||||
|
||||
Pull requests and stars are always welcome. For bugs and feature requests, [please create an issue](../../issues/new).
|
||||
|
||||
### Contributors
|
||||
|
||||
| **Commits** | **Contributor** |
|
||||
| --- | --- |
|
||||
| 31 | [jonschlinkert](https://github.com/jonschlinkert) |
|
||||
| 1 | [phated](https://github.com/phated) |
|
||||
|
||||
### 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.4.3, on March 29, 2017._
|
||||
19
node_modules/sane/node_modules/normalize-path/index.js
generated
vendored
Normal file
19
node_modules/sane/node_modules/normalize-path/index.js
generated
vendored
Normal file
|
|
@ -0,0 +1,19 @@
|
|||
/*!
|
||||
* normalize-path <https://github.com/jonschlinkert/normalize-path>
|
||||
*
|
||||
* Copyright (c) 2014-2017, Jon Schlinkert.
|
||||
* Released under the MIT License.
|
||||
*/
|
||||
|
||||
var removeTrailingSeparator = require('remove-trailing-separator');
|
||||
|
||||
module.exports = function normalizePath(str, stripTrailing) {
|
||||
if (typeof str !== 'string') {
|
||||
throw new TypeError('expected a string');
|
||||
}
|
||||
str = str.replace(/[\\\/]+/g, '/');
|
||||
if (stripTrailing !== false) {
|
||||
str = removeTrailingSeparator(str);
|
||||
}
|
||||
return str;
|
||||
};
|
||||
78
node_modules/sane/node_modules/normalize-path/package.json
generated
vendored
Normal file
78
node_modules/sane/node_modules/normalize-path/package.json
generated
vendored
Normal file
|
|
@ -0,0 +1,78 @@
|
|||
{
|
||||
"name": "normalize-path",
|
||||
"description": "Normalize file path slashes to be unix-like forward slashes. Also condenses repeat slashes to a single slash and removes and trailing slashes unless disabled.",
|
||||
"version": "2.1.1",
|
||||
"homepage": "https://github.com/jonschlinkert/normalize-path",
|
||||
"author": "Jon Schlinkert (https://github.com/jonschlinkert)",
|
||||
"contributors": [
|
||||
"Blaine Bublitz <blaine.bublitz@gmail.com> (https://twitter.com/BlaineBublitz)",
|
||||
"Jon Schlinkert <jon.schlinkert@sellside.com> (http://twitter.com/jonschlinkert)"
|
||||
],
|
||||
"repository": "jonschlinkert/normalize-path",
|
||||
"bugs": {
|
||||
"url": "https://github.com/jonschlinkert/normalize-path/issues"
|
||||
},
|
||||
"license": "MIT",
|
||||
"files": [
|
||||
"index.js"
|
||||
],
|
||||
"main": "index.js",
|
||||
"engines": {
|
||||
"node": ">=0.10.0"
|
||||
},
|
||||
"scripts": {
|
||||
"test": "mocha"
|
||||
},
|
||||
"dependencies": {
|
||||
"remove-trailing-separator": "^1.0.1"
|
||||
},
|
||||
"devDependencies": {
|
||||
"benchmarked": "^0.1.1",
|
||||
"gulp-format-md": "^0.1.11",
|
||||
"minimist": "^1.2.0",
|
||||
"mocha": "*"
|
||||
},
|
||||
"keywords": [
|
||||
"backslash",
|
||||
"file",
|
||||
"filepath",
|
||||
"fix",
|
||||
"forward",
|
||||
"fp",
|
||||
"fs",
|
||||
"normalize",
|
||||
"path",
|
||||
"slash",
|
||||
"slashes",
|
||||
"trailing",
|
||||
"unix",
|
||||
"urix"
|
||||
],
|
||||
"verb": {
|
||||
"related": {
|
||||
"list": [
|
||||
"contains-path",
|
||||
"ends-with",
|
||||
"is-absolute",
|
||||
"is-relative",
|
||||
"parse-filepath",
|
||||
"path-ends-with",
|
||||
"path-segments",
|
||||
"rewrite-ext",
|
||||
"unixify"
|
||||
],
|
||||
"description": "Other useful libraries for working with paths in node.js:"
|
||||
},
|
||||
"toc": false,
|
||||
"layout": "default",
|
||||
"tasks": [
|
||||
"readme"
|
||||
],
|
||||
"plugins": [
|
||||
"gulp-format-md"
|
||||
],
|
||||
"lint": {
|
||||
"reflinks": true
|
||||
}
|
||||
}
|
||||
}
|
||||
21
node_modules/sane/node_modules/to-regex-range/LICENSE
generated
vendored
Normal file
21
node_modules/sane/node_modules/to-regex-range/LICENSE
generated
vendored
Normal file
|
|
@ -0,0 +1,21 @@
|
|||
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.
|
||||
281
node_modules/sane/node_modules/to-regex-range/README.md
generated
vendored
Normal file
281
node_modules/sane/node_modules/to-regex-range/README.md
generated
vendored
Normal file
|
|
@ -0,0 +1,281 @@
|
|||
# to-regex-range [](https://www.npmjs.com/package/to-regex-range) [](https://npmjs.org/package/to-regex-range) [](https://npmjs.org/package/to-regex-range) [](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._
|
||||
294
node_modules/sane/node_modules/to-regex-range/index.js
generated
vendored
Normal file
294
node_modules/sane/node_modules/to-regex-range/index.js
generated
vendored
Normal file
|
|
@ -0,0 +1,294 @@
|
|||
/*!
|
||||
* 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;
|
||||
86
node_modules/sane/node_modules/to-regex-range/package.json
generated
vendored
Normal file
86
node_modules/sane/node_modules/to-regex-range/package.json
generated
vendored
Normal file
|
|
@ -0,0 +1,86 @@
|
|||
{
|
||||
"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"
|
||||
]
|
||||
}
|
||||
}
|
||||
55
node_modules/sane/package.json
generated
vendored
Normal file
55
node_modules/sane/package.json
generated
vendored
Normal file
|
|
@ -0,0 +1,55 @@
|
|||
{
|
||||
"name": "sane",
|
||||
"version": "4.1.0",
|
||||
"description": "Sane aims to be fast, small, and reliable file system watcher.",
|
||||
"main": "index.js",
|
||||
"repository": {
|
||||
"type": "git",
|
||||
"url": "https://github.com/amasad/sane"
|
||||
},
|
||||
"files": [
|
||||
"src",
|
||||
"index.js"
|
||||
],
|
||||
"scripts": {
|
||||
"test": "npm run format && eslint src/ test/ index.js && mocha --bail test/test.js && mocha --bail test/utils-test.js && mocha --bail 'test/watchexec_*-test.js'",
|
||||
"test:debug": "mocha debug --bail",
|
||||
"format": "prettier --trailing-comma es5 --single-quote --write index.js 'src/**/*.js' 'test/**/*.js'"
|
||||
},
|
||||
"bin": "./src/cli.js",
|
||||
"keywords": [
|
||||
"watch",
|
||||
"file",
|
||||
"fswatcher",
|
||||
"watchfile",
|
||||
"fs",
|
||||
"watching"
|
||||
],
|
||||
"author": "amasad",
|
||||
"license": "MIT",
|
||||
"dependencies": {
|
||||
"@cnakazawa/watch": "^1.0.3",
|
||||
"anymatch": "^2.0.0",
|
||||
"capture-exit": "^2.0.0",
|
||||
"exec-sh": "^0.3.2",
|
||||
"execa": "^1.0.0",
|
||||
"fb-watchman": "^2.0.0",
|
||||
"micromatch": "^3.1.4",
|
||||
"minimist": "^1.1.1",
|
||||
"walker": "~1.0.5"
|
||||
},
|
||||
"devDependencies": {
|
||||
"eslint": "^5.15.1",
|
||||
"mocha": "^6.0.2",
|
||||
"prettier": "^1.16.4",
|
||||
"rimraf": "~2.6.3",
|
||||
"tmp": "0.0.33"
|
||||
},
|
||||
"engines": {
|
||||
"node": "6.* || 8.* || >= 10.*"
|
||||
},
|
||||
"bugs": {
|
||||
"url": "https://github.com/amasad/sane/issues"
|
||||
},
|
||||
"homepage": "https://github.com/amasad/sane"
|
||||
}
|
||||
76
node_modules/sane/src/cli.js
generated
vendored
Executable file
76
node_modules/sane/src/cli.js
generated
vendored
Executable file
|
|
@ -0,0 +1,76 @@
|
|||
#!/usr/bin/env node
|
||||
'use strict';
|
||||
|
||||
const sane = require('../');
|
||||
const argv = require('minimist')(process.argv.slice(2));
|
||||
const execshell = require('exec-sh');
|
||||
|
||||
if (argv._.length === 0) {
|
||||
const msg =
|
||||
'Usage: sane <command> [...directory] [--glob=<filePattern>] ' +
|
||||
'[--ignored=<filePattern>] [--poll] [--watchman] [--watchman-path=<watchmanBinaryPath>] [--dot] ' +
|
||||
'[--wait=<seconds>] [--only-changes] [--quiet]';
|
||||
console.error(msg);
|
||||
process.exit();
|
||||
}
|
||||
|
||||
const opts = {};
|
||||
const command = argv._[0];
|
||||
const dir = argv._[1] || process.cwd();
|
||||
const waitTime = Number(argv.wait || argv.w);
|
||||
const dot = argv.dot || argv.d;
|
||||
const glob = argv.glob || argv.g;
|
||||
const ignored = argv.ignored || argv.i;
|
||||
const poll = argv.poll || argv.p;
|
||||
const watchman = argv.watchman || argv.w;
|
||||
const watchmanPath = argv['watchman-path'];
|
||||
const onlyChanges = argv['only-changes'] | argv.o;
|
||||
const quiet = argv.quiet | argv.q;
|
||||
|
||||
if (dot) {
|
||||
opts.dot = true;
|
||||
}
|
||||
if (glob) {
|
||||
opts.glob = glob;
|
||||
}
|
||||
if (ignored) {
|
||||
opts.ignored = ignored;
|
||||
}
|
||||
if (poll) {
|
||||
opts.poll = true;
|
||||
}
|
||||
if (watchman) {
|
||||
opts.watchman = true;
|
||||
}
|
||||
if (watchmanPath) {
|
||||
opts.watchmanPath = watchmanPath;
|
||||
}
|
||||
|
||||
let wait = false;
|
||||
const watcher = sane(dir, opts);
|
||||
|
||||
watcher.on('ready', function() {
|
||||
if (!quiet) {
|
||||
console.log('Watching: ', dir + '/' + (opts.glob || ''));
|
||||
}
|
||||
if (!onlyChanges) {
|
||||
execshell(command);
|
||||
}
|
||||
});
|
||||
|
||||
watcher.on('change', function(filepath) {
|
||||
if (wait) {
|
||||
return;
|
||||
}
|
||||
if (!quiet) {
|
||||
console.log('Change detected in:', filepath);
|
||||
}
|
||||
execshell(command);
|
||||
|
||||
if (waitTime > 0) {
|
||||
wait = true;
|
||||
setTimeout(function() {
|
||||
wait = false;
|
||||
}, waitTime * 1000);
|
||||
}
|
||||
});
|
||||
110
node_modules/sane/src/common.js
generated
vendored
Normal file
110
node_modules/sane/src/common.js
generated
vendored
Normal file
|
|
@ -0,0 +1,110 @@
|
|||
'use strict';
|
||||
|
||||
const walker = require('walker');
|
||||
const anymatch = require('anymatch');
|
||||
const micromatch = require('micromatch');
|
||||
const path = require('path');
|
||||
const platform = require('os').platform();
|
||||
|
||||
/**
|
||||
* Constants
|
||||
*/
|
||||
|
||||
exports.DEFAULT_DELAY = 100;
|
||||
exports.CHANGE_EVENT = 'change';
|
||||
exports.DELETE_EVENT = 'delete';
|
||||
exports.ADD_EVENT = 'add';
|
||||
exports.ALL_EVENT = 'all';
|
||||
|
||||
/**
|
||||
* Assigns options to the watcher.
|
||||
*
|
||||
* @param {NodeWatcher|PollWatcher|WatchmanWatcher} watcher
|
||||
* @param {?object} opts
|
||||
* @return {boolean}
|
||||
* @public
|
||||
*/
|
||||
|
||||
exports.assignOptions = function(watcher, opts) {
|
||||
opts = opts || {};
|
||||
watcher.globs = opts.glob || [];
|
||||
watcher.dot = opts.dot || false;
|
||||
watcher.ignored = opts.ignored || false;
|
||||
|
||||
if (!Array.isArray(watcher.globs)) {
|
||||
watcher.globs = [watcher.globs];
|
||||
}
|
||||
watcher.hasIgnore =
|
||||
Boolean(opts.ignored) && !(Array.isArray(opts) && opts.length > 0);
|
||||
watcher.doIgnore = opts.ignored ? anymatch(opts.ignored) : () => false;
|
||||
|
||||
if (opts.watchman && opts.watchmanPath) {
|
||||
watcher.watchmanPath = opts.watchmanPath;
|
||||
}
|
||||
|
||||
return opts;
|
||||
};
|
||||
|
||||
/**
|
||||
* Checks a file relative path against the globs array.
|
||||
*
|
||||
* @param {array} globs
|
||||
* @param {string} relativePath
|
||||
* @return {boolean}
|
||||
* @public
|
||||
*/
|
||||
|
||||
exports.isFileIncluded = function(globs, dot, doIgnore, relativePath) {
|
||||
if (doIgnore(relativePath)) {
|
||||
return false;
|
||||
}
|
||||
return globs.length
|
||||
? micromatch.some(relativePath, globs, { dot: dot })
|
||||
: dot || micromatch.some(relativePath, '**/*');
|
||||
};
|
||||
|
||||
/**
|
||||
* Traverse a directory recursively calling `callback` on every directory.
|
||||
*
|
||||
* @param {string} dir
|
||||
* @param {function} dirCallback
|
||||
* @param {function} fileCallback
|
||||
* @param {function} endCallback
|
||||
* @param {*} ignored
|
||||
* @public
|
||||
*/
|
||||
|
||||
exports.recReaddir = function(
|
||||
dir,
|
||||
dirCallback,
|
||||
fileCallback,
|
||||
endCallback,
|
||||
errorCallback,
|
||||
ignored
|
||||
) {
|
||||
walker(dir)
|
||||
.filterDir(currentDir => !anymatch(ignored, currentDir))
|
||||
.on('dir', normalizeProxy(dirCallback))
|
||||
.on('file', normalizeProxy(fileCallback))
|
||||
.on('error', errorCallback)
|
||||
.on('end', () => {
|
||||
if (platform === 'win32') {
|
||||
setTimeout(endCallback, 1000);
|
||||
} else {
|
||||
endCallback();
|
||||
}
|
||||
});
|
||||
};
|
||||
|
||||
/**
|
||||
* Returns a callback that when called will normalize a path and call the
|
||||
* original callback
|
||||
*
|
||||
* @param {function} callback
|
||||
* @return {function}
|
||||
* @private
|
||||
*/
|
||||
|
||||
function normalizeProxy(callback) {
|
||||
return (filepath, stats) => callback(path.normalize(filepath), stats);
|
||||
}
|
||||
398
node_modules/sane/src/node_watcher.js
generated
vendored
Normal file
398
node_modules/sane/src/node_watcher.js
generated
vendored
Normal file
|
|
@ -0,0 +1,398 @@
|
|||
'use strict';
|
||||
|
||||
const fs = require('fs');
|
||||
const path = require('path');
|
||||
const common = require('./common');
|
||||
const platform = require('os').platform();
|
||||
const EventEmitter = require('events').EventEmitter;
|
||||
|
||||
/**
|
||||
* Constants
|
||||
*/
|
||||
|
||||
const DEFAULT_DELAY = common.DEFAULT_DELAY;
|
||||
const CHANGE_EVENT = common.CHANGE_EVENT;
|
||||
const DELETE_EVENT = common.DELETE_EVENT;
|
||||
const ADD_EVENT = common.ADD_EVENT;
|
||||
const ALL_EVENT = common.ALL_EVENT;
|
||||
|
||||
/**
|
||||
* Export `NodeWatcher` class.
|
||||
* Watches `dir`.
|
||||
*
|
||||
* @class NodeWatcher
|
||||
* @param {String} dir
|
||||
* @param {Object} opts
|
||||
* @public
|
||||
*/
|
||||
|
||||
module.exports = class NodeWatcher extends EventEmitter {
|
||||
constructor(dir, opts) {
|
||||
super();
|
||||
|
||||
common.assignOptions(this, opts);
|
||||
|
||||
this.watched = Object.create(null);
|
||||
this.changeTimers = Object.create(null);
|
||||
this.dirRegistery = Object.create(null);
|
||||
this.root = path.resolve(dir);
|
||||
this.watchdir = this.watchdir.bind(this);
|
||||
this.register = this.register.bind(this);
|
||||
this.checkedEmitError = this.checkedEmitError.bind(this);
|
||||
|
||||
this.watchdir(this.root);
|
||||
common.recReaddir(
|
||||
this.root,
|
||||
this.watchdir,
|
||||
this.register,
|
||||
this.emit.bind(this, 'ready'),
|
||||
this.checkedEmitError,
|
||||
this.ignored
|
||||
);
|
||||
}
|
||||
|
||||
/**
|
||||
* Register files that matches our globs to know what to type of event to
|
||||
* emit in the future.
|
||||
*
|
||||
* Registery looks like the following:
|
||||
*
|
||||
* dirRegister => Map {
|
||||
* dirpath => Map {
|
||||
* filename => true
|
||||
* }
|
||||
* }
|
||||
*
|
||||
* @param {string} filepath
|
||||
* @return {boolean} whether or not we have registered the file.
|
||||
* @private
|
||||
*/
|
||||
|
||||
register(filepath) {
|
||||
let relativePath = path.relative(this.root, filepath);
|
||||
if (
|
||||
!common.isFileIncluded(this.globs, this.dot, this.doIgnore, relativePath)
|
||||
) {
|
||||
return false;
|
||||
}
|
||||
|
||||
let dir = path.dirname(filepath);
|
||||
if (!this.dirRegistery[dir]) {
|
||||
this.dirRegistery[dir] = Object.create(null);
|
||||
}
|
||||
|
||||
let filename = path.basename(filepath);
|
||||
this.dirRegistery[dir][filename] = true;
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
/**
|
||||
* Removes a file from the registery.
|
||||
*
|
||||
* @param {string} filepath
|
||||
* @private
|
||||
*/
|
||||
|
||||
unregister(filepath) {
|
||||
let dir = path.dirname(filepath);
|
||||
if (this.dirRegistery[dir]) {
|
||||
let filename = path.basename(filepath);
|
||||
delete this.dirRegistery[dir][filename];
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* Removes a dir from the registery.
|
||||
*
|
||||
* @param {string} dirpath
|
||||
* @private
|
||||
*/
|
||||
|
||||
unregisterDir(dirpath) {
|
||||
if (this.dirRegistery[dirpath]) {
|
||||
delete this.dirRegistery[dirpath];
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* Checks if a file or directory exists in the registery.
|
||||
*
|
||||
* @param {string} fullpath
|
||||
* @return {boolean}
|
||||
* @private
|
||||
*/
|
||||
|
||||
registered(fullpath) {
|
||||
let dir = path.dirname(fullpath);
|
||||
return (
|
||||
this.dirRegistery[fullpath] ||
|
||||
(this.dirRegistery[dir] &&
|
||||
this.dirRegistery[dir][path.basename(fullpath)])
|
||||
);
|
||||
}
|
||||
|
||||
/**
|
||||
* Emit "error" event if it's not an ignorable event
|
||||
*
|
||||
* @param error
|
||||
* @private
|
||||
*/
|
||||
checkedEmitError(error) {
|
||||
if (!isIgnorableFileError(error)) {
|
||||
this.emit('error', error);
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* Watch a directory.
|
||||
*
|
||||
* @param {string} dir
|
||||
* @private
|
||||
*/
|
||||
|
||||
watchdir(dir) {
|
||||
if (this.watched[dir]) {
|
||||
return;
|
||||
}
|
||||
|
||||
let watcher = fs.watch(
|
||||
dir,
|
||||
{ persistent: true },
|
||||
this.normalizeChange.bind(this, dir)
|
||||
);
|
||||
this.watched[dir] = watcher;
|
||||
|
||||
watcher.on('error', this.checkedEmitError);
|
||||
|
||||
if (this.root !== dir) {
|
||||
this.register(dir);
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* Stop watching a directory.
|
||||
*
|
||||
* @param {string} dir
|
||||
* @private
|
||||
*/
|
||||
|
||||
stopWatching(dir) {
|
||||
if (this.watched[dir]) {
|
||||
this.watched[dir].close();
|
||||
delete this.watched[dir];
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* End watching.
|
||||
*
|
||||
* @public
|
||||
*/
|
||||
|
||||
close(callback) {
|
||||
Object.keys(this.watched).forEach(this.stopWatching, this);
|
||||
this.removeAllListeners();
|
||||
if (typeof callback === 'function') {
|
||||
setImmediate(callback.bind(null, null, true));
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* On some platforms, as pointed out on the fs docs (most likely just win32)
|
||||
* the file argument might be missing from the fs event. Try to detect what
|
||||
* change by detecting if something was deleted or the most recent file change.
|
||||
*
|
||||
* @param {string} dir
|
||||
* @param {string} event
|
||||
* @param {string} file
|
||||
* @public
|
||||
*/
|
||||
|
||||
detectChangedFile(dir, event, callback) {
|
||||
if (!this.dirRegistery[dir]) {
|
||||
return;
|
||||
}
|
||||
|
||||
let found = false;
|
||||
let closest = { mtime: 0 };
|
||||
let c = 0;
|
||||
Object.keys(this.dirRegistery[dir]).forEach(function(file, i, arr) {
|
||||
fs.lstat(
|
||||
path.join(dir, file),
|
||||
function(error, stat) {
|
||||
if (found) {
|
||||
return;
|
||||
}
|
||||
|
||||
if (error) {
|
||||
if (isIgnorableFileError(error)) {
|
||||
found = true;
|
||||
callback(file);
|
||||
} else {
|
||||
this.emit('error', error);
|
||||
}
|
||||
} else {
|
||||
if (stat.mtime > closest.mtime) {
|
||||
stat.file = file;
|
||||
closest = stat;
|
||||
}
|
||||
if (arr.length === ++c) {
|
||||
callback(closest.file);
|
||||
}
|
||||
}
|
||||
}.bind(this)
|
||||
);
|
||||
}, this);
|
||||
}
|
||||
|
||||
/**
|
||||
* Normalize fs events and pass it on to be processed.
|
||||
*
|
||||
* @param {string} dir
|
||||
* @param {string} event
|
||||
* @param {string} file
|
||||
* @public
|
||||
*/
|
||||
|
||||
normalizeChange(dir, event, file) {
|
||||
if (!file) {
|
||||
this.detectChangedFile(
|
||||
dir,
|
||||
event,
|
||||
function(actualFile) {
|
||||
if (actualFile) {
|
||||
this.processChange(dir, event, actualFile);
|
||||
}
|
||||
}.bind(this)
|
||||
);
|
||||
} else {
|
||||
this.processChange(dir, event, path.normalize(file));
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* Process changes.
|
||||
*
|
||||
* @param {string} dir
|
||||
* @param {string} event
|
||||
* @param {string} file
|
||||
* @public
|
||||
*/
|
||||
|
||||
processChange(dir, event, file) {
|
||||
let fullPath = path.join(dir, file);
|
||||
let relativePath = path.join(path.relative(this.root, dir), file);
|
||||
|
||||
fs.lstat(
|
||||
fullPath,
|
||||
function(error, stat) {
|
||||
if (error && error.code !== 'ENOENT') {
|
||||
this.emit('error', error);
|
||||
} else if (!error && stat.isDirectory()) {
|
||||
// win32 emits usless change events on dirs.
|
||||
if (event !== 'change') {
|
||||
this.watchdir(fullPath);
|
||||
if (
|
||||
common.isFileIncluded(
|
||||
this.globs,
|
||||
this.dot,
|
||||
this.doIgnore,
|
||||
relativePath
|
||||
)
|
||||
) {
|
||||
this.emitEvent(ADD_EVENT, relativePath, stat);
|
||||
}
|
||||
}
|
||||
} else {
|
||||
let registered = this.registered(fullPath);
|
||||
if (error && error.code === 'ENOENT') {
|
||||
this.unregister(fullPath);
|
||||
this.stopWatching(fullPath);
|
||||
this.unregisterDir(fullPath);
|
||||
if (registered) {
|
||||
this.emitEvent(DELETE_EVENT, relativePath);
|
||||
}
|
||||
} else if (registered) {
|
||||
this.emitEvent(CHANGE_EVENT, relativePath, stat);
|
||||
} else {
|
||||
if (this.register(fullPath)) {
|
||||
this.emitEvent(ADD_EVENT, relativePath, stat);
|
||||
}
|
||||
}
|
||||
}
|
||||
}.bind(this)
|
||||
);
|
||||
}
|
||||
|
||||
/**
|
||||
* Triggers a 'change' event after debounding it to take care of duplicate
|
||||
* events on os x.
|
||||
*
|
||||
* @private
|
||||
*/
|
||||
|
||||
emitEvent(type, file, stat) {
|
||||
let key = type + '-' + file;
|
||||
let addKey = ADD_EVENT + '-' + file;
|
||||
if (type === CHANGE_EVENT && this.changeTimers[addKey]) {
|
||||
// Ignore the change event that is immediately fired after an add event.
|
||||
// (This happens on Linux).
|
||||
return;
|
||||
}
|
||||
clearTimeout(this.changeTimers[key]);
|
||||
this.changeTimers[key] = setTimeout(
|
||||
function() {
|
||||
delete this.changeTimers[key];
|
||||
if (type === ADD_EVENT && stat.isDirectory()) {
|
||||
// Recursively emit add events and watch for sub-files/folders
|
||||
common.recReaddir(
|
||||
path.resolve(this.root, file),
|
||||
function emitAddDir(dir, stats) {
|
||||
this.watchdir(dir);
|
||||
this.rawEmitEvent(
|
||||
ADD_EVENT,
|
||||
path.relative(this.root, dir),
|
||||
stats
|
||||
);
|
||||
}.bind(this),
|
||||
function emitAddFile(file, stats) {
|
||||
this.register(file);
|
||||
this.rawEmitEvent(
|
||||
ADD_EVENT,
|
||||
path.relative(this.root, file),
|
||||
stats
|
||||
);
|
||||
}.bind(this),
|
||||
function endCallback() {},
|
||||
this.checkedEmitError,
|
||||
this.ignored
|
||||
);
|
||||
} else {
|
||||
this.rawEmitEvent(type, file, stat);
|
||||
}
|
||||
}.bind(this),
|
||||
DEFAULT_DELAY
|
||||
);
|
||||
}
|
||||
|
||||
/**
|
||||
* Actually emit the events
|
||||
*/
|
||||
rawEmitEvent(type, file, stat) {
|
||||
this.emit(type, file, this.root, stat);
|
||||
this.emit(ALL_EVENT, type, file, this.root, stat);
|
||||
}
|
||||
};
|
||||
/**
|
||||
* Determine if a given FS error can be ignored
|
||||
*
|
||||
* @private
|
||||
*/
|
||||
function isIgnorableFileError(error) {
|
||||
return (
|
||||
error.code === 'ENOENT' ||
|
||||
// Workaround Windows node issue #4337.
|
||||
(error.code === 'EPERM' && platform === 'win32')
|
||||
);
|
||||
}
|
||||
117
node_modules/sane/src/poll_watcher.js
generated
vendored
Normal file
117
node_modules/sane/src/poll_watcher.js
generated
vendored
Normal file
|
|
@ -0,0 +1,117 @@
|
|||
'use strict';
|
||||
|
||||
const fs = require('fs');
|
||||
const path = require('path');
|
||||
const watch = require('@cnakazawa/watch');
|
||||
const common = require('./common');
|
||||
const EventEmitter = require('events').EventEmitter;
|
||||
|
||||
/**
|
||||
* Constants
|
||||
*/
|
||||
|
||||
const DEFAULT_DELAY = common.DEFAULT_DELAY;
|
||||
const CHANGE_EVENT = common.CHANGE_EVENT;
|
||||
const DELETE_EVENT = common.DELETE_EVENT;
|
||||
const ADD_EVENT = common.ADD_EVENT;
|
||||
const ALL_EVENT = common.ALL_EVENT;
|
||||
|
||||
/**
|
||||
* Export `PollWatcher` class.
|
||||
* Watches `dir`.
|
||||
*
|
||||
* @class PollWatcher
|
||||
* @param String dir
|
||||
* @param {Object} opts
|
||||
* @public
|
||||
*/
|
||||
|
||||
module.exports = class PollWatcher extends EventEmitter {
|
||||
constructor(dir, opts) {
|
||||
super();
|
||||
|
||||
opts = common.assignOptions(this, opts);
|
||||
|
||||
this.watched = Object.create(null);
|
||||
this.root = path.resolve(dir);
|
||||
|
||||
watch.createMonitor(
|
||||
this.root,
|
||||
{
|
||||
interval: (opts.interval || DEFAULT_DELAY) / 1000,
|
||||
filter: this.filter.bind(this),
|
||||
},
|
||||
this.init.bind(this)
|
||||
);
|
||||
}
|
||||
|
||||
/**
|
||||
* Given a fullpath of a file or directory check if we need to watch it.
|
||||
*
|
||||
* @param {string} filepath
|
||||
* @param {object} stat
|
||||
* @private
|
||||
*/
|
||||
|
||||
filter(filepath, stat) {
|
||||
return (
|
||||
stat.isDirectory() ||
|
||||
common.isFileIncluded(
|
||||
this.globs,
|
||||
this.dot,
|
||||
this.doIgnore,
|
||||
path.relative(this.root, filepath)
|
||||
)
|
||||
);
|
||||
}
|
||||
|
||||
/**
|
||||
* Initiate the polling file watcher with the event emitter passed from
|
||||
* `watch.watchTree`.
|
||||
*
|
||||
* @param {EventEmitter} monitor
|
||||
* @public
|
||||
*/
|
||||
|
||||
init(monitor) {
|
||||
this.watched = monitor.files;
|
||||
monitor.on('changed', this.emitEvent.bind(this, CHANGE_EVENT));
|
||||
monitor.on('removed', this.emitEvent.bind(this, DELETE_EVENT));
|
||||
monitor.on('created', this.emitEvent.bind(this, ADD_EVENT));
|
||||
// 1 second wait because mtime is second-based.
|
||||
setTimeout(this.emit.bind(this, 'ready'), 1000);
|
||||
}
|
||||
|
||||
/**
|
||||
* Transform and emit an event comming from the poller.
|
||||
*
|
||||
* @param {EventEmitter} monitor
|
||||
* @public
|
||||
*/
|
||||
|
||||
emitEvent(type, file, stat) {
|
||||
file = path.relative(this.root, file);
|
||||
|
||||
if (type === DELETE_EVENT) {
|
||||
// Matching the non-polling API
|
||||
stat = null;
|
||||
}
|
||||
|
||||
this.emit(type, file, this.root, stat);
|
||||
this.emit(ALL_EVENT, type, file, this.root, stat);
|
||||
}
|
||||
|
||||
/**
|
||||
* End watching.
|
||||
*
|
||||
* @public
|
||||
*/
|
||||
|
||||
close(callback) {
|
||||
Object.keys(this.watched).forEach(filepath => fs.unwatchFile(filepath));
|
||||
this.removeAllListeners();
|
||||
if (typeof callback === 'function') {
|
||||
setImmediate(callback.bind(null, null, true));
|
||||
}
|
||||
}
|
||||
};
|
||||
51
node_modules/sane/src/utils/recrawl-warning-dedupe.js
generated
vendored
Normal file
51
node_modules/sane/src/utils/recrawl-warning-dedupe.js
generated
vendored
Normal file
|
|
@ -0,0 +1,51 @@
|
|||
'use strict';
|
||||
|
||||
class RecrawlWarning {
|
||||
constructor(root, count) {
|
||||
this.root = root;
|
||||
this.count = count;
|
||||
}
|
||||
|
||||
static findByRoot(root) {
|
||||
for (let i = 0; i < this.RECRAWL_WARNINGS.length; i++) {
|
||||
let warning = this.RECRAWL_WARNINGS[i];
|
||||
if (warning.root === root) {
|
||||
return warning;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
static isRecrawlWarningDupe(warningMessage) {
|
||||
if (typeof warningMessage !== 'string') {
|
||||
return false;
|
||||
}
|
||||
let match = warningMessage.match(this.REGEXP);
|
||||
if (!match) {
|
||||
return false;
|
||||
}
|
||||
let count = Number(match[1]);
|
||||
let root = match[2];
|
||||
|
||||
let warning = this.findByRoot(root);
|
||||
|
||||
if (warning) {
|
||||
// only keep the highest count, assume count to either stay the same or
|
||||
// increase.
|
||||
if (warning.count >= count) {
|
||||
return true;
|
||||
} else {
|
||||
// update the existing warning to the latest (highest) count
|
||||
warning.count = count;
|
||||
return false;
|
||||
}
|
||||
} else {
|
||||
this.RECRAWL_WARNINGS.push(new RecrawlWarning(root, count));
|
||||
return false;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
RecrawlWarning.RECRAWL_WARNINGS = [];
|
||||
RecrawlWarning.REGEXP = /Recrawled this watch (\d+) times, most recently because:\n([^:]+)/;
|
||||
|
||||
module.exports = RecrawlWarning;
|
||||
63
node_modules/sane/src/watchexec_client.js
generated
vendored
Normal file
63
node_modules/sane/src/watchexec_client.js
generated
vendored
Normal file
|
|
@ -0,0 +1,63 @@
|
|||
/*
|
||||
This file is the executable run by watchexec
|
||||
when a change is detected.
|
||||
|
||||
It will extract changes from the environment variables
|
||||
set by watchexec and write to stdout in a format
|
||||
readable by the file `../watchexec_watcher.js`.
|
||||
*/
|
||||
'use strict';
|
||||
|
||||
const { EOL } = require('os');
|
||||
|
||||
function withPrefixes(prefixes) {
|
||||
return function withPrefix(arr, i) {
|
||||
return arr.map(str => {
|
||||
return `${prefixes[i]} ${str}`;
|
||||
});
|
||||
};
|
||||
}
|
||||
|
||||
let allPrefixes = ['write', 'rename', 'remove', 'create'];
|
||||
|
||||
function extractChanges(context) {
|
||||
const {
|
||||
WATCHEXEC_COMMON_PATH,
|
||||
WATCHEXEC_WRITTEN_PATH,
|
||||
WATCHEXEC_RENAMED_PATH,
|
||||
WATCHEXEC_REMOVED_PATH,
|
||||
WATCHEXEC_CREATED_PATH,
|
||||
} = context;
|
||||
|
||||
let events = [
|
||||
WATCHEXEC_WRITTEN_PATH,
|
||||
WATCHEXEC_RENAMED_PATH,
|
||||
WATCHEXEC_REMOVED_PATH,
|
||||
WATCHEXEC_CREATED_PATH,
|
||||
];
|
||||
|
||||
let currentPrefixes = events
|
||||
.map((l, i) => l && allPrefixes[i])
|
||||
.filter(Boolean);
|
||||
|
||||
function toFullPath(arr) {
|
||||
return arr.map(path => (WATCHEXEC_COMMON_PATH || '') + path);
|
||||
}
|
||||
|
||||
let message = events
|
||||
.filter(Boolean)
|
||||
.map(str => str.split(':'))
|
||||
.map(toFullPath)
|
||||
.map(withPrefixes(currentPrefixes))
|
||||
.reduce((e, memo) => memo.concat(e), [])
|
||||
.join(EOL);
|
||||
|
||||
return message;
|
||||
}
|
||||
|
||||
if (require.main === module) {
|
||||
let message = extractChanges(process.env);
|
||||
console.log(message);
|
||||
}
|
||||
|
||||
module.exports = extractChanges;
|
||||
116
node_modules/sane/src/watchexec_watcher.js
generated
vendored
Normal file
116
node_modules/sane/src/watchexec_watcher.js
generated
vendored
Normal file
|
|
@ -0,0 +1,116 @@
|
|||
'use strict';
|
||||
|
||||
const execa = require('execa');
|
||||
|
||||
const { statSync } = require('fs');
|
||||
const path = require('path');
|
||||
const common = require('./common');
|
||||
const EventEmitter = require('events').EventEmitter;
|
||||
|
||||
const { EOL } = require('os');
|
||||
|
||||
/**
|
||||
* Constants
|
||||
*/
|
||||
|
||||
const CHANGE_EVENT = common.CHANGE_EVENT;
|
||||
const DELETE_EVENT = common.DELETE_EVENT;
|
||||
const ADD_EVENT = common.ADD_EVENT;
|
||||
const ALL_EVENT = common.ALL_EVENT;
|
||||
|
||||
const typeMap = {
|
||||
rename: CHANGE_EVENT,
|
||||
write: CHANGE_EVENT,
|
||||
remove: DELETE_EVENT,
|
||||
create: ADD_EVENT,
|
||||
};
|
||||
|
||||
const messageRegexp = /(rename|write|remove|create)\s(.+)/;
|
||||
|
||||
/**
|
||||
* Manages streams from subprocess and turns into sane events
|
||||
*
|
||||
* @param {Stream} data
|
||||
* @private
|
||||
*/
|
||||
function _messageHandler(data) {
|
||||
data
|
||||
.toString()
|
||||
.split(EOL)
|
||||
.filter(str => str.trim().length)
|
||||
.filter(str => messageRegexp.test(str))
|
||||
.map(line => {
|
||||
const [, command, path] = [...line.match(messageRegexp)];
|
||||
return [command, path];
|
||||
})
|
||||
.forEach(([command, file]) => {
|
||||
let stat;
|
||||
const type = typeMap[command];
|
||||
if (type === DELETE_EVENT) {
|
||||
stat = null;
|
||||
} else {
|
||||
try {
|
||||
stat = statSync(file);
|
||||
} catch (e) {
|
||||
// There is likely a delete coming down the pipe.
|
||||
if (e.code === 'ENOENT') {
|
||||
return;
|
||||
}
|
||||
throw e;
|
||||
}
|
||||
}
|
||||
this.emitEvent(type, path.relative(this.root, file), stat);
|
||||
});
|
||||
}
|
||||
|
||||
/**
|
||||
* Export `WatchexecWatcher` class.
|
||||
* Watches `dir`.
|
||||
*
|
||||
* @class WatchexecWatcher
|
||||
* @param String dir
|
||||
* @param {Object} opts
|
||||
* @public
|
||||
*/
|
||||
class WatchexecWatcher extends EventEmitter {
|
||||
constructor(dir, opts) {
|
||||
super();
|
||||
|
||||
common.assignOptions(this, opts);
|
||||
|
||||
this.root = path.resolve(dir);
|
||||
|
||||
this._process = execa(
|
||||
'watchexec',
|
||||
['-n', '--', 'node', __dirname + '/watchexec_client.js'],
|
||||
{ cwd: dir }
|
||||
);
|
||||
|
||||
this._process.stdout.on('data', _messageHandler.bind(this));
|
||||
this._readyTimer = setTimeout(this.emit.bind(this, 'ready'), 1000);
|
||||
}
|
||||
|
||||
close(callback) {
|
||||
clearTimeout(this._readyTimer);
|
||||
this.removeAllListeners();
|
||||
this._process && !this._process.killed && this._process.kill();
|
||||
if (typeof callback === 'function') {
|
||||
setImmediate(callback.bind(null, null, true));
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* Transform and emit an event comming from the poller.
|
||||
*
|
||||
* @param {EventEmitter} monitor
|
||||
* @public
|
||||
*/
|
||||
emitEvent(type, file, stat) {
|
||||
this.emit(type, file, this.root, stat);
|
||||
this.emit(ALL_EVENT, type, file, this.root, stat);
|
||||
}
|
||||
}
|
||||
|
||||
WatchexecWatcher._messageHandler = _messageHandler;
|
||||
|
||||
module.exports = WatchexecWatcher;
|
||||
525
node_modules/sane/src/watchman_client.js
generated
vendored
Normal file
525
node_modules/sane/src/watchman_client.js
generated
vendored
Normal file
|
|
@ -0,0 +1,525 @@
|
|||
'use strict';
|
||||
|
||||
const watchman = require('fb-watchman');
|
||||
const captureExit = require('capture-exit');
|
||||
|
||||
function values(obj) {
|
||||
return Object.keys(obj).map(key => obj[key]);
|
||||
}
|
||||
|
||||
/**
|
||||
* Constants
|
||||
*/
|
||||
|
||||
/**
|
||||
* Singleton that provides a public API for a connection to a watchman instance for 'sane'.
|
||||
* It tries to abstract/remove as much of the boilerplate processing as necessary
|
||||
* from WatchmanWatchers that use it. In particular, they have no idea whether
|
||||
* we're using 'watch-project' or 'watch', what the 'project root' is when
|
||||
* we internally use watch-project, whether a connection has been lost
|
||||
* and reestablished, etc. Also switched to doing things with promises and known-name
|
||||
* methods in WatchmanWatcher, so as much information as possible can be kept in
|
||||
* the WatchmanClient, ultimately making this the only object listening directly
|
||||
* to watchman.Client, then forwarding appropriately (via the known-name methods) to
|
||||
* the relevant WatchmanWatcher(s).
|
||||
*
|
||||
* Note: WatchmanWatcher also added a 'watchmanPath' option for use with the sane CLI.
|
||||
* Because of that, we actually need a map of watchman binary path to WatchmanClient instance.
|
||||
* That is set up in getInstance(). Once the WatchmanWatcher has a given client, it doesn't
|
||||
* change.
|
||||
*
|
||||
* @class WatchmanClient
|
||||
* @param String watchmanBinaryPath
|
||||
* @public
|
||||
*/
|
||||
|
||||
class WatchmanClient {
|
||||
constructor(watchmanBinaryPath) {
|
||||
captureExit.captureExit();
|
||||
|
||||
// define/clear some local state. The properties will be initialized
|
||||
// in _handleClientAndCheck(). This is also called again in _onEnd when
|
||||
// trying to reestablish connection to watchman.
|
||||
this._clearLocalVars();
|
||||
|
||||
this._watchmanBinaryPath = watchmanBinaryPath;
|
||||
|
||||
this._backoffTimes = this._setupBackoffTimes();
|
||||
|
||||
this._clientListeners = null; // direct listeners from here to watchman.Client.
|
||||
|
||||
// Define a handler for if somehow the Node process gets interrupted. We need to
|
||||
// close down the watchman.Client, if we have one.
|
||||
captureExit.onExit(() => this._clearLocalVars());
|
||||
}
|
||||
|
||||
// Define 'wildmatch' property, which must be available when we call the
|
||||
// WatchmanWatcher.createOptions() method.
|
||||
get wildmatch() {
|
||||
return this._wildmatch;
|
||||
}
|
||||
|
||||
/**
|
||||
* Called from WatchmanWatcher (or WatchmanClient during reconnect) to create
|
||||
* a watcherInfo entry in our _watcherMap and issue a 'subscribe' to the
|
||||
* watchman.Client, to be handled here.
|
||||
*/
|
||||
subscribe(watchmanWatcher, root) {
|
||||
let subscription;
|
||||
let watcherInfo;
|
||||
|
||||
return this._setupClient()
|
||||
.then(() => {
|
||||
watcherInfo = this._createWatcherInfo(watchmanWatcher);
|
||||
subscription = watcherInfo.subscription;
|
||||
return this._watch(subscription, root);
|
||||
})
|
||||
.then(() => this._clock(subscription))
|
||||
.then(() => this._subscribe(subscription));
|
||||
// Note: callers are responsible for noting any subscription failure.
|
||||
}
|
||||
|
||||
/**
|
||||
* Remove the information about a specific WatchmanWatcher.
|
||||
* Once done, if no watchers are left, clear the local vars,
|
||||
* which will end the connection to the watchman.Client, too.
|
||||
*/
|
||||
closeWatcher(watchmanWatcher) {
|
||||
let watcherInfos = values(this._watcherMap);
|
||||
let numWatchers = watcherInfos.length;
|
||||
|
||||
if (numWatchers > 0) {
|
||||
let watcherInfo;
|
||||
|
||||
for (let info of watcherInfos) {
|
||||
if (info.watchmanWatcher === watchmanWatcher) {
|
||||
watcherInfo = info;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
if (watcherInfo) {
|
||||
delete this._watcherMap[watcherInfo.subscription];
|
||||
|
||||
numWatchers--;
|
||||
|
||||
if (numWatchers === 0) {
|
||||
this._clearLocalVars(); // nobody watching, so shut the watchman.Client down.
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* Simple backoff-time iterator. next() returns times in ms.
|
||||
* When it's at the last value, it stays there until reset()
|
||||
* is called.
|
||||
*/
|
||||
_setupBackoffTimes() {
|
||||
return {
|
||||
_times: [0, 1000, 5000, 10000, 60000],
|
||||
|
||||
_next: 0,
|
||||
|
||||
next() {
|
||||
let val = this._times[this._next];
|
||||
if (this._next < this._times.length - 1) {
|
||||
this._next++;
|
||||
}
|
||||
return val;
|
||||
},
|
||||
|
||||
reset() {
|
||||
this._next = 0;
|
||||
},
|
||||
};
|
||||
}
|
||||
|
||||
/**
|
||||
* Set up the connection to the watchman client. Return a promise
|
||||
* that is fulfilled when we have a client that has finished the
|
||||
* capabilityCheck.
|
||||
*/
|
||||
_setupClient() {
|
||||
if (!this._clientPromise) {
|
||||
this._clientPromise = new Promise((resolve, reject) => {
|
||||
this._handleClientAndCheck(resolve, reject);
|
||||
});
|
||||
}
|
||||
|
||||
return this._clientPromise;
|
||||
}
|
||||
|
||||
/**
|
||||
* Handle the process of creating a client and doing a capability check and
|
||||
* getting a valid response, then setting up local data based on that.
|
||||
*
|
||||
* This is split from _setupClient and _createClientAndCheck so it can
|
||||
* provide the backoff handling needed during attempts to reconnect.
|
||||
*/
|
||||
_handleClientAndCheck(resolve, reject) {
|
||||
this._createClientAndCheck().then(
|
||||
value => {
|
||||
let resp = value.resp;
|
||||
let client = value.client;
|
||||
|
||||
try {
|
||||
this._wildmatch = resp.capabilities.wildmatch;
|
||||
this._relative_root = resp.capabilities.relative_root;
|
||||
this._client = client;
|
||||
|
||||
client.on('subscription', this._onSubscription.bind(this));
|
||||
client.on('error', this._onError.bind(this));
|
||||
client.on('end', this._onEnd.bind(this));
|
||||
|
||||
this._backoffTimes.reset();
|
||||
resolve(this);
|
||||
} catch (error) {
|
||||
// somehow, even though we supposedly got a valid value back, it's
|
||||
// malformed, or some other internal error occurred. Reject so
|
||||
// the promise itself doesn't hang forever.
|
||||
reject(error);
|
||||
}
|
||||
},
|
||||
() => {
|
||||
// create & capability check failed in any of several ways,
|
||||
// do the retry with backoff.
|
||||
|
||||
// XXX May want to change this later to actually reject/terminate with
|
||||
// an error in certain of the inner errors (e.g. when we
|
||||
// can figure out the server is definitely not coming
|
||||
// back, or something else is not recoverable by just waiting).
|
||||
// Could also decide after N retries to just quit.
|
||||
|
||||
let backoffMillis = this._backoffTimes.next();
|
||||
|
||||
// XXX may want to fact we'll attempt reconnect in backoffMillis ms.
|
||||
setTimeout(() => {
|
||||
this._handleClientAndCheck(resolve, reject);
|
||||
}, backoffMillis);
|
||||
}
|
||||
);
|
||||
}
|
||||
|
||||
/**
|
||||
* Create a promise that will only be fulfilled when either
|
||||
* we correctly get capabilities back or we get an 'error' or 'end'
|
||||
* callback, indicating a problem. The caller _handleClientAndCheck
|
||||
* then deals with providing a retry and backoff mechanism.
|
||||
*/
|
||||
_createClientAndCheck() {
|
||||
return new Promise((resolve, reject) => {
|
||||
let client;
|
||||
|
||||
try {
|
||||
client = new watchman.Client(
|
||||
this._watchmanBinaryPath
|
||||
? { watchmanBinaryPath: this._watchmanBinaryPath }
|
||||
: {}
|
||||
);
|
||||
} catch (error) {
|
||||
// if we're here, either the binary path is bad or something
|
||||
// else really bad happened. The client doesn't even attempt
|
||||
// to connect until we send it a command, though.
|
||||
reject(error);
|
||||
return;
|
||||
}
|
||||
|
||||
client.on('error', error => {
|
||||
client.removeAllListeners();
|
||||
reject(error);
|
||||
});
|
||||
|
||||
client.on('end', () => {
|
||||
client.removeAllListeners();
|
||||
reject(new Error('Disconnected during client capabilities check'));
|
||||
});
|
||||
|
||||
client.capabilityCheck(
|
||||
{ optional: ['wildmatch', 'relative_root'] },
|
||||
(error, resp) => {
|
||||
try {
|
||||
client.removeAllListeners();
|
||||
|
||||
if (error) {
|
||||
reject(error);
|
||||
} else {
|
||||
resolve({ resp, client });
|
||||
}
|
||||
} catch (err) {
|
||||
// In case we get something weird in the block using 'resp'.
|
||||
// XXX We could also just remove the try/catch if we believe
|
||||
// the resp stuff should always work, but just in case...
|
||||
reject(err);
|
||||
}
|
||||
}
|
||||
);
|
||||
});
|
||||
}
|
||||
|
||||
/**
|
||||
* Clear out local state at the beginning and if we end up
|
||||
* getting disconnected and try to reconnect.
|
||||
*/
|
||||
_clearLocalVars() {
|
||||
if (this._client) {
|
||||
this._client.removeAllListeners();
|
||||
this._client.end();
|
||||
}
|
||||
|
||||
this._client = null;
|
||||
this._clientPromise = null;
|
||||
this._wildmatch = false;
|
||||
this._relative_root = false;
|
||||
this._subscriptionId = 1;
|
||||
this._watcherMap = Object.create(null);
|
||||
|
||||
// Note that we do not clear _clientListeners or _watchmanBinaryPath.
|
||||
}
|
||||
|
||||
_genSubscription() {
|
||||
let val = 'sane_' + this._subscriptionId++;
|
||||
return val;
|
||||
}
|
||||
|
||||
/**
|
||||
* Create a new watcherInfo entry for the given watchmanWatcher and
|
||||
* initialize it.
|
||||
*/
|
||||
_createWatcherInfo(watchmanWatcher) {
|
||||
let watcherInfo = {
|
||||
subscription: this._genSubscription(),
|
||||
watchmanWatcher: watchmanWatcher,
|
||||
root: null, // set during 'watch' or 'watch-project'
|
||||
relativePath: null, // same
|
||||
since: null, // set during 'clock'
|
||||
options: null, // created and set during 'subscribe'.
|
||||
};
|
||||
|
||||
this._watcherMap[watcherInfo.subscription] = watcherInfo;
|
||||
|
||||
return watcherInfo;
|
||||
}
|
||||
|
||||
/**
|
||||
* Find an existing watcherInfo instance.
|
||||
*/
|
||||
_getWatcherInfo(subscription) {
|
||||
return this._watcherMap[subscription];
|
||||
}
|
||||
|
||||
/**
|
||||
* Given a watchmanWatcher and a root, issue the correct 'watch'
|
||||
* or 'watch-project' command and handle it with the callback.
|
||||
* Because we're operating in 'sane', we'll keep the results
|
||||
* of the 'watch' or 'watch-project' here.
|
||||
*/
|
||||
_watch(subscription, root) {
|
||||
return new Promise((resolve, reject) => {
|
||||
let watcherInfo = this._getWatcherInfo(subscription);
|
||||
|
||||
if (this._relative_root) {
|
||||
this._client.command(['watch-project', root], (error, resp) => {
|
||||
if (error) {
|
||||
reject(error);
|
||||
} else {
|
||||
watcherInfo.root = resp.watch;
|
||||
watcherInfo.relativePath = resp.relative_path
|
||||
? resp.relative_path
|
||||
: '';
|
||||
resolve(resp);
|
||||
}
|
||||
});
|
||||
} else {
|
||||
this._client.command(['watch', root], (error, resp) => {
|
||||
if (error) {
|
||||
reject(error);
|
||||
} else {
|
||||
watcherInfo.root = root;
|
||||
watcherInfo.relativePath = '';
|
||||
resolve(resp);
|
||||
}
|
||||
});
|
||||
}
|
||||
});
|
||||
}
|
||||
|
||||
/**
|
||||
* Issue the 'clock' command to get the time value for use with the 'since'
|
||||
* option during 'subscribe'.
|
||||
*/
|
||||
_clock(subscription) {
|
||||
return new Promise((resolve, reject) => {
|
||||
let watcherInfo = this._getWatcherInfo(subscription);
|
||||
|
||||
this._client.command(['clock', watcherInfo.root], (error, resp) => {
|
||||
if (error) {
|
||||
reject(error);
|
||||
} else {
|
||||
watcherInfo.since = resp.clock;
|
||||
resolve(resp);
|
||||
}
|
||||
});
|
||||
});
|
||||
}
|
||||
|
||||
/**
|
||||
* Do the internal handling of calling the watchman.Client for
|
||||
* a subscription.
|
||||
*/
|
||||
_subscribe(subscription) {
|
||||
return new Promise((resolve, reject) => {
|
||||
let watcherInfo = this._getWatcherInfo(subscription);
|
||||
|
||||
// create the 'bare' options w/o 'since' or relative_root.
|
||||
// Store in watcherInfo for later use if we need to reset
|
||||
// things after an 'end' caught here.
|
||||
let options = watcherInfo.watchmanWatcher.createOptions();
|
||||
watcherInfo.options = options;
|
||||
|
||||
// Dup the options object so we can add 'relative_root' and 'since'
|
||||
// and leave the original options object alone. We'll do this again
|
||||
// later if we need to resubscribe after 'end' and reconnect.
|
||||
options = Object.assign({}, options);
|
||||
|
||||
if (this._relative_root) {
|
||||
options.relative_root = watcherInfo.relativePath;
|
||||
}
|
||||
|
||||
options.since = watcherInfo.since;
|
||||
|
||||
this._client.command(
|
||||
['subscribe', watcherInfo.root, subscription, options],
|
||||
(error, resp) => {
|
||||
if (error) {
|
||||
reject(error);
|
||||
} else {
|
||||
resolve(resp);
|
||||
}
|
||||
}
|
||||
);
|
||||
});
|
||||
}
|
||||
|
||||
/**
|
||||
* Handle the 'subscription' (file change) event, by calling the
|
||||
* handler on the relevant WatchmanWatcher.
|
||||
*/
|
||||
_onSubscription(resp) {
|
||||
let watcherInfo = this._getWatcherInfo(resp.subscription);
|
||||
|
||||
if (watcherInfo) {
|
||||
// we're assuming the watchmanWatcher does not throw during
|
||||
// handling of the change event.
|
||||
watcherInfo.watchmanWatcher.handleChangeEvent(resp);
|
||||
} else {
|
||||
// Note it in the log, but otherwise ignore it
|
||||
console.error(
|
||||
"WatchmanClient error - received 'subscription' event " +
|
||||
"for non-existent subscription '" +
|
||||
resp.subscription +
|
||||
"'"
|
||||
);
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* Handle the 'error' event by forwarding to the
|
||||
* handler on all WatchmanWatchers (errors are generally during processing
|
||||
* a particular command, but it's not given which command that was, or
|
||||
* which subscription it belonged to).
|
||||
*/
|
||||
_onError(error) {
|
||||
values(this._watcherMap).forEach(watcherInfo =>
|
||||
watcherInfo.watchmanWatcher.handleErrorEvent(error)
|
||||
);
|
||||
}
|
||||
|
||||
/**
|
||||
* Handle the 'end' event by creating a new watchman.Client and
|
||||
* attempting to resubscribe all the existing subscriptions, but
|
||||
* without notifying the WatchmanWatchers about it. They should
|
||||
* not be aware the connection was lost and recreated.
|
||||
* If something goes wrong during any part of the reconnect/setup,
|
||||
* call the error handler on each existing WatchmanWatcher.
|
||||
*/
|
||||
_onEnd() {
|
||||
console.warn(
|
||||
'[sane.WatchmanClient] Warning: Lost connection to watchman, reconnecting..'
|
||||
);
|
||||
|
||||
// Hold the old watcher map so we use it to recreate all subscriptions.
|
||||
let oldWatcherInfos = values(this._watcherMap);
|
||||
|
||||
this._clearLocalVars();
|
||||
|
||||
this._setupClient().then(
|
||||
() => {
|
||||
let promises = oldWatcherInfos.map(watcherInfo =>
|
||||
this.subscribe(
|
||||
watcherInfo.watchmanWatcher,
|
||||
watcherInfo.watchmanWatcher.root
|
||||
)
|
||||
);
|
||||
Promise.all(promises).then(
|
||||
() => {
|
||||
console.log('[sane.WatchmanClient]: Reconnected to watchman');
|
||||
},
|
||||
error => {
|
||||
console.error(
|
||||
'[sane.WatchmanClient]: Reconnected to watchman, but failed to ' +
|
||||
'reestablish at least one subscription, cannot continue'
|
||||
);
|
||||
console.error(error);
|
||||
oldWatcherInfos.forEach(watcherInfo =>
|
||||
watcherInfo.watchmanWatcher.handleErrorEvent(error)
|
||||
);
|
||||
// XXX not sure whether to clear all _watcherMap instances here,
|
||||
// but basically this client is inconsistent now, since at least one
|
||||
// subscribe failed.
|
||||
}
|
||||
);
|
||||
},
|
||||
error => {
|
||||
console.error(
|
||||
'[sane.WatchmanClient]: Lost connection to watchman, ' +
|
||||
'reconnect failed, cannot continue'
|
||||
);
|
||||
console.error(error);
|
||||
oldWatcherInfos.forEach(watcherInfo =>
|
||||
watcherInfo.watchmanWatcher.handleErrorEvent(error)
|
||||
);
|
||||
}
|
||||
);
|
||||
}
|
||||
}
|
||||
|
||||
module.exports = {
|
||||
/**
|
||||
* Create/retrieve an instance of the WatchmanClient. See the header comment
|
||||
* about the map of client instances, one per watchmanPath.
|
||||
* Export the getInstance method by itself so the callers cannot do anything until
|
||||
* they get a real WatchmanClient instance here.
|
||||
*/
|
||||
getInstance(watchmanBinaryPath) {
|
||||
let clientMap = WatchmanClient.prototype._clientMap;
|
||||
|
||||
if (!clientMap) {
|
||||
clientMap = Object.create(null);
|
||||
WatchmanClient.prototype._clientMap = clientMap;
|
||||
}
|
||||
|
||||
if (watchmanBinaryPath == undefined || watchmanBinaryPath === null) {
|
||||
watchmanBinaryPath = '';
|
||||
}
|
||||
|
||||
let watchmanClient = clientMap[watchmanBinaryPath];
|
||||
|
||||
if (!watchmanClient) {
|
||||
watchmanClient = new WatchmanClient(watchmanBinaryPath);
|
||||
clientMap[watchmanBinaryPath] = watchmanClient;
|
||||
}
|
||||
|
||||
return watchmanClient;
|
||||
},
|
||||
};
|
||||
249
node_modules/sane/src/watchman_watcher.js
generated
vendored
Normal file
249
node_modules/sane/src/watchman_watcher.js
generated
vendored
Normal file
|
|
@ -0,0 +1,249 @@
|
|||
'use strict';
|
||||
|
||||
const fs = require('fs');
|
||||
const path = require('path');
|
||||
const common = require('./common');
|
||||
const watchmanClient = require('./watchman_client');
|
||||
const EventEmitter = require('events').EventEmitter;
|
||||
const RecrawlWarning = require('./utils/recrawl-warning-dedupe');
|
||||
|
||||
/**
|
||||
* Constants
|
||||
*/
|
||||
|
||||
const CHANGE_EVENT = common.CHANGE_EVENT;
|
||||
const DELETE_EVENT = common.DELETE_EVENT;
|
||||
const ADD_EVENT = common.ADD_EVENT;
|
||||
const ALL_EVENT = common.ALL_EVENT;
|
||||
|
||||
/**
|
||||
* Export `WatchmanWatcher` class.
|
||||
*/
|
||||
|
||||
module.exports = WatchmanWatcher;
|
||||
|
||||
/**
|
||||
* Watches `dir`.
|
||||
*
|
||||
* @class WatchmanWatcher
|
||||
* @param String dir
|
||||
* @param {Object} opts
|
||||
* @public
|
||||
*/
|
||||
|
||||
function WatchmanWatcher(dir, opts) {
|
||||
common.assignOptions(this, opts);
|
||||
this.root = path.resolve(dir);
|
||||
this._init();
|
||||
}
|
||||
|
||||
WatchmanWatcher.prototype.__proto__ = EventEmitter.prototype;
|
||||
|
||||
/**
|
||||
* Run the watchman `watch` command on the root and subscribe to changes.
|
||||
*
|
||||
* @private
|
||||
*/
|
||||
WatchmanWatcher.prototype._init = function() {
|
||||
if (this._client) {
|
||||
this._client = null;
|
||||
}
|
||||
|
||||
// Get the WatchmanClient instance corresponding to our watchmanPath (or nothing).
|
||||
// Then subscribe, which will do the appropriate setup so that we will receive
|
||||
// calls to handleChangeEvent when files change.
|
||||
this._client = watchmanClient.getInstance(this.watchmanPath);
|
||||
|
||||
return this._client.subscribe(this, this.root).then(
|
||||
resp => {
|
||||
this._handleWarning(resp);
|
||||
this.emit('ready');
|
||||
},
|
||||
error => {
|
||||
this._handleError(error);
|
||||
}
|
||||
);
|
||||
};
|
||||
|
||||
/**
|
||||
* Called by WatchmanClient to create the options, either during initial 'subscribe'
|
||||
* or to resubscribe after a disconnect+reconnect. Note that we are leaving out
|
||||
* the watchman 'since' and 'relative_root' options, which are handled inside the
|
||||
* WatchmanClient.
|
||||
*/
|
||||
WatchmanWatcher.prototype.createOptions = function() {
|
||||
let options = {
|
||||
fields: ['name', 'exists', 'new'],
|
||||
};
|
||||
|
||||
// If the server has the wildmatch capability available it supports
|
||||
// the recursive **/*.foo style match and we can offload our globs
|
||||
// to the watchman server. This saves both on data size to be
|
||||
// communicated back to us and compute for evaluating the globs
|
||||
// in our node process.
|
||||
if (this._client.wildmatch) {
|
||||
if (this.globs.length === 0) {
|
||||
if (!this.dot) {
|
||||
// Make sure we honor the dot option if even we're not using globs.
|
||||
options.expression = [
|
||||
'match',
|
||||
'**',
|
||||
'wholename',
|
||||
{
|
||||
includedotfiles: false,
|
||||
},
|
||||
];
|
||||
}
|
||||
} else {
|
||||
options.expression = ['anyof'];
|
||||
for (let i in this.globs) {
|
||||
options.expression.push([
|
||||
'match',
|
||||
this.globs[i],
|
||||
'wholename',
|
||||
{
|
||||
includedotfiles: this.dot,
|
||||
},
|
||||
]);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return options;
|
||||
};
|
||||
|
||||
/**
|
||||
* Called by WatchmanClient when it receives an error from the watchman daemon.
|
||||
*
|
||||
* @param {Object} resp
|
||||
*/
|
||||
WatchmanWatcher.prototype.handleErrorEvent = function(error) {
|
||||
this.emit('error', error);
|
||||
};
|
||||
|
||||
/**
|
||||
* Called by the WatchmanClient when it is notified about a file change in
|
||||
* the tree for this particular watcher's root.
|
||||
*
|
||||
* @param {Object} resp
|
||||
* @private
|
||||
*/
|
||||
|
||||
WatchmanWatcher.prototype.handleChangeEvent = function(resp) {
|
||||
if (Array.isArray(resp.files)) {
|
||||
resp.files.forEach(this.handleFileChange, this);
|
||||
}
|
||||
};
|
||||
|
||||
/**
|
||||
* Handles a single change event record.
|
||||
*
|
||||
* @param {Object} changeDescriptor
|
||||
* @private
|
||||
*/
|
||||
|
||||
WatchmanWatcher.prototype.handleFileChange = function(changeDescriptor) {
|
||||
let absPath;
|
||||
let relativePath;
|
||||
|
||||
relativePath = changeDescriptor.name;
|
||||
absPath = path.join(this.root, relativePath);
|
||||
|
||||
if (
|
||||
!(this._client.wildmatch && !this.hasIgnore) &&
|
||||
!common.isFileIncluded(this.globs, this.dot, this.doIgnore, relativePath)
|
||||
) {
|
||||
return;
|
||||
}
|
||||
|
||||
if (!changeDescriptor.exists) {
|
||||
this.emitEvent(DELETE_EVENT, relativePath, this.root);
|
||||
} else {
|
||||
fs.lstat(absPath, (error, stat) => {
|
||||
// Files can be deleted between the event and the lstat call
|
||||
// the most reliable thing to do here is to ignore the event.
|
||||
if (error && error.code === 'ENOENT') {
|
||||
return;
|
||||
}
|
||||
|
||||
if (this._handleError(error)) {
|
||||
return;
|
||||
}
|
||||
|
||||
let eventType = changeDescriptor.new ? ADD_EVENT : CHANGE_EVENT;
|
||||
|
||||
// Change event on dirs are mostly useless.
|
||||
if (!(eventType === CHANGE_EVENT && stat.isDirectory())) {
|
||||
this.emitEvent(eventType, relativePath, this.root, stat);
|
||||
}
|
||||
});
|
||||
}
|
||||
};
|
||||
|
||||
/**
|
||||
* Dispatches an event.
|
||||
*
|
||||
* @param {string} eventType
|
||||
* @param {string} filepath
|
||||
* @param {string} root
|
||||
* @param {fs.Stat} stat
|
||||
* @private
|
||||
*/
|
||||
|
||||
WatchmanWatcher.prototype.emitEvent = function(
|
||||
eventType,
|
||||
filepath,
|
||||
root,
|
||||
stat
|
||||
) {
|
||||
this.emit(eventType, filepath, root, stat);
|
||||
this.emit(ALL_EVENT, eventType, filepath, root, stat);
|
||||
};
|
||||
|
||||
/**
|
||||
* Closes the watcher.
|
||||
*
|
||||
* @param {function} callback
|
||||
* @private
|
||||
*/
|
||||
|
||||
WatchmanWatcher.prototype.close = function(callback) {
|
||||
this._client.closeWatcher(this);
|
||||
callback && callback(null, true);
|
||||
};
|
||||
|
||||
/**
|
||||
* Handles an error and returns true if exists.
|
||||
*
|
||||
* @param {WatchmanWatcher} self
|
||||
* @param {Error} error
|
||||
* @private
|
||||
*/
|
||||
|
||||
WatchmanWatcher.prototype._handleError = function(error) {
|
||||
if (error != null) {
|
||||
this.emit('error', error);
|
||||
return true;
|
||||
} else {
|
||||
return false;
|
||||
}
|
||||
};
|
||||
|
||||
/**
|
||||
* Handles a warning in the watchman resp object.
|
||||
*
|
||||
* @param {object} resp
|
||||
* @private
|
||||
*/
|
||||
|
||||
WatchmanWatcher.prototype._handleWarning = function(resp) {
|
||||
if ('warning' in resp) {
|
||||
if (RecrawlWarning.isRecrawlWarningDupe(resp.warning)) {
|
||||
return true;
|
||||
}
|
||||
console.warn(resp.warning);
|
||||
return true;
|
||||
} else {
|
||||
return false;
|
||||
}
|
||||
};
|
||||
Loading…
Add table
Add a link
Reference in a new issue