pax_global_header 0000666 0000000 0000000 00000000064 13117440077 0014516 g ustar 00root root 0000000 0000000 52 comment=d701a549a7653a874eebce7eca25d3577dc868ac
balanced-match-1.0.0/ 0000775 0000000 0000000 00000000000 13117440077 0014337 5 ustar 00root root 0000000 0000000 balanced-match-1.0.0/.gitignore 0000664 0000000 0000000 00000000027 13117440077 0016326 0 ustar 00root root 0000000 0000000 node_modules
.DS_Store
balanced-match-1.0.0/.npmignore 0000664 0000000 0000000 00000000060 13117440077 0016332 0 ustar 00root root 0000000 0000000 test
.gitignore
.travis.yml
Makefile
example.js
balanced-match-1.0.0/.travis.yml 0000664 0000000 0000000 00000000076 13117440077 0016453 0 ustar 00root root 0000000 0000000 language: node_js
node_js:
- "0.12"
- "4"
- "5"
- "6"
balanced-match-1.0.0/LICENSE.md 0000664 0000000 0000000 00000002110 13117440077 0015735 0 ustar 00root root 0000000 0000000 (MIT)
Copyright (c) 2013 Julian Gruber <julian@juliangruber.com>
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.
balanced-match-1.0.0/Makefile 0000664 0000000 0000000 00000000161 13117440077 0015775 0 ustar 00root root 0000000 0000000 test:
@node_modules/.bin/tape test/test.js
bench:
@node_modules/.bin/matcha test/bench.js
.PHONY: test bench
balanced-match-1.0.0/README.md 0000664 0000000 0000000 00000006354 13117440077 0015626 0 ustar 00root root 0000000 0000000 # balanced-match
Match balanced string pairs, like `{` and `}` or `` and ``. Supports regular expressions as well!
[](http://travis-ci.org/juliangruber/balanced-match)
[](https://www.npmjs.org/package/balanced-match)
[](https://ci.testling.com/juliangruber/balanced-match)
## Example
Get the first matching pair of braces:
```js
var balanced = require('balanced-match');
console.log(balanced('{', '}', 'pre{in{nested}}post'));
console.log(balanced('{', '}', 'pre{first}between{second}post'));
console.log(balanced(/\s+\{\s+/, /\s+\}\s+/, 'pre { in{nest} } post'));
```
The matches are:
```bash
$ node example.js
{ start: 3, end: 14, pre: 'pre', body: 'in{nested}', post: 'post' }
{ start: 3,
end: 9,
pre: 'pre',
body: 'first',
post: 'between{second}post' }
{ start: 3, end: 17, pre: 'pre', body: 'in{nest}', post: 'post' }
```
## API
### var m = balanced(a, b, str)
For the first non-nested matching pair of `a` and `b` in `str`, return an
object with those keys:
* **start** the index of the first match of `a`
* **end** the index of the matching `b`
* **pre** the preamble, `a` and `b` not included
* **body** the match, `a` and `b` not included
* **post** the postscript, `a` and `b` not included
If there's no match, `undefined` will be returned.
If the `str` contains more `a` than `b` / there are unmatched pairs, the first match that was closed will be used. For example, `{{a}` will match `['{', 'a', '']` and `{a}}` will match `['', 'a', '}']`.
### var r = balanced.range(a, b, str)
For the first non-nested matching pair of `a` and `b` in `str`, return an
array with indexes: `[ , ]`.
If there's no match, `undefined` will be returned.
If the `str` contains more `a` than `b` / there are unmatched pairs, the first match that was closed will be used. For example, `{{a}` will match `[ 1, 3 ]` and `{a}}` will match `[0, 2]`.
## Installation
With [npm](https://npmjs.org) do:
```bash
npm install balanced-match
```
## License
(MIT)
Copyright (c) 2013 Julian Gruber <julian@juliangruber.com>
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.
balanced-match-1.0.0/example.js 0000664 0000000 0000000 00000000232 13117440077 0016325 0 ustar 00root root 0000000 0000000 var balanced = require('./');
console.log(balanced('{', '}', 'pre{in{nested}}post'));
console.log(balanced('{', '}', 'pre{first}between{second}post'));
balanced-match-1.0.0/index.js 0000664 0000000 0000000 00000002226 13117440077 0016006 0 ustar 00root root 0000000 0000000 'use strict';
module.exports = balanced;
function balanced(a, b, str) {
if (a instanceof RegExp) a = maybeMatch(a, str);
if (b instanceof RegExp) b = maybeMatch(b, str);
var r = range(a, b, str);
return r && {
start: r[0],
end: r[1],
pre: str.slice(0, r[0]),
body: str.slice(r[0] + a.length, r[1]),
post: str.slice(r[1] + b.length)
};
}
function maybeMatch(reg, str) {
var m = str.match(reg);
return m ? m[0] : null;
}
balanced.range = range;
function range(a, b, str) {
var begs, beg, left, right, result;
var ai = str.indexOf(a);
var bi = str.indexOf(b, ai + 1);
var i = ai;
if (ai >= 0 && bi > 0) {
begs = [];
left = str.length;
while (i >= 0 && !result) {
if (i == ai) {
begs.push(i);
ai = str.indexOf(a, i + 1);
} else if (begs.length == 1) {
result = [ begs.pop(), bi ];
} else {
beg = begs.pop();
if (beg < left) {
left = beg;
right = bi;
}
bi = str.indexOf(b, i + 1);
}
i = ai < bi && ai >= 0 ? ai : bi;
}
if (begs.length) {
result = [ left, right ];
}
}
return result;
}
balanced-match-1.0.0/package.json 0000664 0000000 0000000 00000002061 13117440077 0016624 0 ustar 00root root 0000000 0000000 {
"name": "balanced-match",
"description": "Match balanced character pairs, like \"{\" and \"}\"",
"version": "1.0.0",
"repository": {
"type": "git",
"url": "git://github.com/juliangruber/balanced-match.git"
},
"homepage": "https://github.com/juliangruber/balanced-match",
"main": "index.js",
"scripts": {
"test": "make test",
"bench": "make bench"
},
"dependencies": {},
"devDependencies": {
"matcha": "^0.7.0",
"tape": "^4.6.0"
},
"keywords": [
"match",
"regexp",
"test",
"balanced",
"parse"
],
"author": {
"name": "Julian Gruber",
"email": "mail@juliangruber.com",
"url": "http://juliangruber.com"
},
"license": "MIT",
"testling": {
"files": "test/*.js",
"browsers": [
"ie/8..latest",
"firefox/20..latest",
"firefox/nightly",
"chrome/25..latest",
"chrome/canary",
"opera/12..latest",
"opera/next",
"safari/5.1..latest",
"ipad/6.0..latest",
"iphone/6.0..latest",
"android-browser/4.2..latest"
]
}
}
balanced-match-1.0.0/test/ 0000775 0000000 0000000 00000000000 13117440077 0015316 5 ustar 00root root 0000000 0000000 balanced-match-1.0.0/test/bench.js 0000664 0000000 0000000 00000002614 13117440077 0016736 0 ustar 00root root 0000000 0000000 'use strict';
var indexOf = require('../');
var looping = require('./looping');
bench('indexOf', function() {
indexOf('{', '}', 'pre{in{nest}}post');
indexOf('{', '}', '{{{{{{{{{in}post');
indexOf('{', '}', 'pre{body{in}post');
indexOf('{', '}', 'pre}{in{nest}}post');
indexOf('{', '}', 'pre{body}between{body2}post');
indexOf('{', '}', 'nope');
indexOf('', '', 'preinnestpost');
indexOf('', '', 'preinnestpost');
indexOf('{{', '}}', 'pre{{{in}}}post');
indexOf('{{{', '}}', 'pre{{{in}}}post');
indexOf('{', '}', 'pre{{first}in{second}post');
indexOf('', 'prepost');
indexOf(/\{/, /\}/, 'nope');
indexOf(/\s+\{\s+/, /\s+\}\s+/, 'pre { in{nest} } post');
});
bench('looping', function() {
looping('{', '}', 'pre{in{nest}}post');
looping('{', '}', '{{{{{{{{{in}post');
looping('{', '}', 'pre{body{in}post');
looping('{', '}', 'pre}{in{nest}}post');
looping('{', '}', 'pre{body}between{body2}post');
looping('{', '}', 'nope');
looping('', '', 'preinnestpost');
looping('', '', 'preinnestpost');
looping('{{', '}}', 'pre{{{in}}}post');
looping('{{{', '}}', 'pre{{{in}}}post');
looping('{', '}', 'pre{{first}in{second}post');
looping('', 'prepost');
looping(/\{/, /\}/, 'nope');
looping(/\s+\{\s+/, /\s+\}\s+/, 'pre { in{nest} } post');
});
balanced-match-1.0.0/test/looping.js 0000664 0000000 0000000 00000002030 13117440077 0017316 0 ustar 00root root 0000000 0000000 'use strict';
module.exports = balanced;
function balanced(a, b, str) {
if (a instanceof RegExp) a = maybeMatch(a, str);
if (b instanceof RegExp) b = maybeMatch(b, str);
if (!a || !b) {
return;
}
var r = range(a, b, str);
if (r) {
return {
start: r[0],
end: r[1],
pre: str.substring(0, r[0]),
body: str.slice(r[0] + a.length, r[1]),
post: str.substring(r[1] + b.length)
}
}
}
function maybeMatch(reg, str) {
var m = str.match(reg);
return m ? m[0] : null;
}
balanced.range = range;
function range(a, b, str) {
var ais = [];
var bis = [];
for (var i = 0; i < str.length; i++) {
if (str.substring(i, i + a.length) === a) {
if ((bis.length && i < bis[bis.length]) || !bis.length) {
ais.push(i);
} else {
break;
}
}
if (str.substring(i, i + b.length) === b && i > ais[0] && bis.length < ais.length) {
bis.push(i);
}
}
if (!ais.length) {
return;
}
return [ais[ais.length - bis.length], bis[bis.length - 1]];
}
balanced-match-1.0.0/test/test.js 0000664 0000000 0000000 00000004500 13117440077 0016632 0 ustar 00root root 0000000 0000000 'use strict';
var test = require('tape');
var balanced = require('..');
test('balanced', function(t) {
t.deepEqual(balanced('{', '}', 'pre{in{nest}}post'), {
start: 3,
end: 12,
pre: 'pre',
body: 'in{nest}',
post: 'post'
});
t.deepEqual(balanced('{', '}', '{{{{{{{{{in}post'), {
start: 8,
end: 11,
pre: '{{{{{{{{',
body: 'in',
post: 'post'
});
t.deepEqual(balanced('{', '}', 'pre{body{in}post'), {
start: 8,
end: 11,
pre: 'pre{body',
body: 'in',
post: 'post'
});
t.deepEqual(balanced('{', '}', 'pre{in}po}st'), {
start: 3,
end: 6,
pre: 'pre',
body: 'in',
post: 'po}st'
});
t.deepEqual(balanced('{', '}', 'pre}{in{nest}}post'), {
start: 4,
end: 13,
pre: 'pre}',
body: 'in{nest}',
post: 'post'
});
t.deepEqual(balanced('{', '}', 'pre{body}between{body2}post'), {
start: 3,
end: 8,
pre: 'pre',
body: 'body',
post: 'between{body2}post'
});
t.notOk(balanced('{', '}', 'nope'), 'should be notOk');
t.deepEqual(balanced('', '', 'preinnestpost'), {
start: 3,
end: 19,
pre: 'pre',
body: 'innest',
post: 'post'
});
t.deepEqual(balanced('', '', 'preinnestpost'), {
start: 7,
end: 23,
pre: 'pre',
body: 'innest',
post: 'post'
});
t.deepEqual(balanced('{{', '}}', 'pre{{{in}}}post'), {
start: 3,
end: 9,
pre: 'pre',
body: '{in}',
post: 'post'
});
t.deepEqual(balanced('{{{', '}}', 'pre{{{in}}}post'), {
start: 3,
end: 8,
pre: 'pre',
body: 'in',
post: '}post'
});
t.deepEqual(balanced('{', '}', 'pre{{first}in{second}post'), {
start: 4,
end: 10,
pre: 'pre{',
body: 'first',
post: 'in{second}post'
});
t.deepEqual(balanced('', 'prepost'), {
start: 3,
end: 4,
pre: 'pre',
body: '',
post: 'post'
});
t.notOk(balanced('{', '}', 'nope'), 'should be notOk');
t.notOk(balanced('{', '}', '{nope'), 'should be notOk');
t.notOk(balanced('{', '}', 'nope}'), 'should be notOk');
t.notOk(balanced(/\{/, /\}/, 'nope'), 'should be notOk');
t.deepEqual(balanced(/\s+\{\s+/, /\s+\}\s+/, 'pre { in{nest} } post'), {
start: 3,
end: 17,
pre: 'pre',
body: 'in{nest}',
post: 'post'
});
t.end();
});