New upstream version 1.0.2
Xavier Guimard
3 years ago
| 0 | |
language: node_js
|
| 1 | |
node_js:
|
| 2 | |
- 0.8
|
| 3 | |
- "0.10"
|
| 4 | |
- 0.11
|
|
0 |
Copyright (c) Felix Böhm
|
|
1 |
All rights reserved.
|
|
2 |
|
|
3 |
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
|
|
4 |
|
|
5 |
Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
|
|
6 |
|
|
7 |
Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
|
|
8 |
|
|
9 |
THIS IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS,
|
|
10 |
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| 0 | |
#nth-check [](https://travis-ci.org/fb55/nth-check)
|
|
0 |
# nth-check [](https://travis-ci.org/fb55/nth-check)
|
| 1 | 1 |
|
| 2 | 2 |
A performant nth-check parser & compiler.
|
| 3 | 3 |
|
| 4 | |
###About
|
|
4 |
### About
|
| 5 | 5 |
|
| 6 | 6 |
This module can be used to parse & compile nth-checks, as they are found in CSS 3's `nth-child()` and `nth-last-of-type()`.
|
| 7 | 7 |
|
| 8 | 8 |
`nth-check` focusses on speed, providing optimized functions for different kinds of nth-child formulas, while still following the [spec](http://www.w3.org/TR/css3-selectors/#nth-child-pseudo).
|
| 9 | 9 |
|
| 10 | |
###API
|
|
10 |
### API
|
| 11 | 11 |
|
| 12 | 12 |
```js
|
| 13 | 13 |
var nthCheck = require("nth-check");
|
| 14 | 14 |
```
|
| 15 | 15 |
|
| 16 | |
#####`nthCheck(formula)`
|
|
16 |
##### `nthCheck(formula)`
|
| 17 | 17 |
|
| 18 | 18 |
First parses, then compiles the formula.
|
| 19 | 19 |
|
| 20 | |
#####`nthCheck.parse(formula)`
|
|
20 |
##### `nthCheck.parse(formula)`
|
| 21 | 21 |
|
| 22 | 22 |
Parses the expression, throws a `SyntaxError` if it fails, otherwise returns an array containing two elements.
|
| 23 | 23 |
|
|
| 27 | 27 |
nthCheck.parse("2n+3") //[2, 3]
|
| 28 | 28 |
```
|
| 29 | 29 |
|
| 30 | |
#####`nthCheck.compile([a, b])`
|
|
30 |
##### `nthCheck.compile([a, b])`
|
| 31 | 31 |
|
| 32 | 32 |
Takes an array with two elements (as returned by `.parse`) and returns a highly optimized function.
|
| 33 | 33 |
|
|
0 |
{
|
|
1 |
"name": "nth-check",
|
|
2 |
"version": "1.0.2",
|
|
3 |
"lockfileVersion": 1,
|
|
4 |
"requires": true,
|
|
5 |
"dependencies": {
|
|
6 |
"boolbase": {
|
|
7 |
"version": "1.0.0",
|
|
8 |
"resolved": "https://registry.npmjs.org/boolbase/-/boolbase-1.0.0.tgz",
|
|
9 |
"integrity": "sha1-aN/1++YMUes3cl6p4+0xDcwed24="
|
|
10 |
}
|
|
11 |
}
|
|
12 |
}
|
| 0 | 0 |
{
|
| 1 | 1 |
"name": "nth-check",
|
| 2 | |
"version": "1.0.1",
|
|
2 |
"version": "1.0.2",
|
| 3 | 3 |
"description": "performant nth-check parser & compiler",
|
| 4 | 4 |
"main": "index.js",
|
| 5 | 5 |
"scripts": {
|
|
| 9 | 9 |
"type": "git",
|
| 10 | 10 |
"url": "https://github.com/fb55/nth-check"
|
| 11 | 11 |
},
|
|
12 |
"files": [
|
|
13 |
"compile.js",
|
|
14 |
"index.js",
|
|
15 |
"parse.js"
|
|
16 |
],
|
| 12 | 17 |
"keywords": [
|
| 13 | 18 |
"nth-child",
|
| 14 | 19 |
"nth",
|
| 15 | 20 |
"css"
|
| 16 | 21 |
],
|
| 17 | 22 |
"author": "Felix Boehm <me@feedic.com>",
|
| 18 | |
"license": "BSD",
|
|
23 |
"license": "BSD-2-Clause",
|
| 19 | 24 |
"bugs": {
|
| 20 | 25 |
"url": "https://github.com/fb55/nth-check/issues"
|
| 21 | 26 |
},
|
| 0 | 0 |
var nthCheck = require("./"),
|
| 1 | 1 |
assert = require("assert");
|
| 2 | 2 |
|
| 3 | |
var invalid = ["-", "asdf", "2n+-0", "2+0", "- 1n", "-1 n"];
|
|
3 |
var invalid = ["-", "- 1n", "-1 n", "2+0", "2n+-0", "an+b", "asdf", "b", "expr", "odd|even|x"];
|
| 4 | 4 |
|
| 5 | 5 |
function parseInvalid(){
|
| 6 | 6 |
invalid.forEach(function(formula){
|