|
1 |
| -'use strict'; |
| 1 | +'use strict' |
2 | 2 |
|
3 |
| -var assert = require('assert'); |
4 |
| -var test = require('tape'); |
5 |
| -var remark = require('remark'); |
6 |
| -var findAfter = require('.'); |
| 3 | +var assert = require('assert') |
| 4 | +var test = require('tape') |
| 5 | +var remark = require('remark') |
| 6 | +var findAfter = require('.') |
7 | 7 |
|
8 |
| -var tree = remark().parse('Some _emphasis_, **importance**, and `code`.'); |
9 |
| -var paragraph = tree.children[0]; |
10 |
| -var children = paragraph.children; |
| 8 | +var tree = remark().parse('Some _emphasis_, **importance**, and `code`.') |
| 9 | +var paragraph = tree.children[0] |
| 10 | +var children = paragraph.children |
11 | 11 |
|
12 |
| -test('unist-util-find-after', function (t) { |
| 12 | +test('unist-util-find-after', function(t) { |
13 | 13 | t.throws(
|
14 |
| - function () { |
15 |
| - findAfter(); |
| 14 | + function() { |
| 15 | + findAfter() |
16 | 16 | },
|
17 | 17 | /Expected parent node/,
|
18 | 18 | 'should fail without parent'
|
19 |
| - ); |
| 19 | + ) |
20 | 20 |
|
21 | 21 | t.throws(
|
22 |
| - function () { |
23 |
| - findAfter({type: 'foo'}); |
| 22 | + function() { |
| 23 | + findAfter({type: 'foo'}) |
24 | 24 | },
|
25 | 25 | /Expected parent node/,
|
26 | 26 | 'should fail without parent node'
|
27 |
| - ); |
| 27 | + ) |
28 | 28 |
|
29 |
| - t.doesNotThrow( |
30 |
| - function () { |
31 |
| - assert.throws( |
32 |
| - function () { |
33 |
| - findAfter({type: 'foo', children: []}); |
34 |
| - }, |
35 |
| - /Expected positive finite index or child node/ |
36 |
| - ); |
| 29 | + t.doesNotThrow(function() { |
| 30 | + assert.throws(function() { |
| 31 | + findAfter({type: 'foo', children: []}) |
| 32 | + }, /Expected positive finite index or child node/) |
37 | 33 |
|
38 |
| - assert.throws( |
39 |
| - function () { |
40 |
| - findAfter({type: 'foo', children: []}, -1); |
41 |
| - }, |
42 |
| - /Expected positive finite index or child node/ |
43 |
| - ); |
| 34 | + assert.throws(function() { |
| 35 | + findAfter({type: 'foo', children: []}, -1) |
| 36 | + }, /Expected positive finite index or child node/) |
44 | 37 |
|
45 |
| - assert.throws( |
46 |
| - function () { |
47 |
| - findAfter({type: 'foo', children: []}, {type: 'bar'}); |
48 |
| - }, |
49 |
| - /Expected positive finite index or child node/ |
50 |
| - ); |
51 |
| - }, |
52 |
| - 'should fail without index' |
53 |
| - ); |
| 38 | + assert.throws(function() { |
| 39 | + findAfter({type: 'foo', children: []}, {type: 'bar'}) |
| 40 | + }, /Expected positive finite index or child node/) |
| 41 | + }, 'should fail without index') |
54 | 42 |
|
55 |
| - t.doesNotThrow( |
56 |
| - function () { |
57 |
| - assert.throws( |
58 |
| - function () { |
59 |
| - findAfter({ |
60 |
| - type: 'foo', |
61 |
| - children: [{type: 'bar'}, {type: 'baz'}] |
62 |
| - }, 0, false); |
| 43 | + t.doesNotThrow(function() { |
| 44 | + assert.throws(function() { |
| 45 | + findAfter( |
| 46 | + { |
| 47 | + type: 'foo', |
| 48 | + children: [{type: 'bar'}, {type: 'baz'}] |
63 | 49 | },
|
64 |
| - /Expected function, string, or object as test/ |
65 |
| - ); |
| 50 | + 0, |
| 51 | + false |
| 52 | + ) |
| 53 | + }, /Expected function, string, or object as test/) |
66 | 54 |
|
67 |
| - assert.throws( |
68 |
| - function () { |
69 |
| - findAfter({ |
70 |
| - type: 'foo', |
71 |
| - children: [{type: 'bar'}, {type: 'baz'}] |
72 |
| - }, 0, true); |
| 55 | + assert.throws(function() { |
| 56 | + findAfter( |
| 57 | + { |
| 58 | + type: 'foo', |
| 59 | + children: [{type: 'bar'}, {type: 'baz'}] |
73 | 60 | },
|
74 |
| - /Expected function, string, or object as test/ |
75 |
| - ); |
76 |
| - }, |
77 |
| - 'should fail for invalid `test`' |
78 |
| - ); |
| 61 | + 0, |
| 62 | + true |
| 63 | + ) |
| 64 | + }, /Expected function, string, or object as test/) |
| 65 | + }, 'should fail for invalid `test`') |
79 | 66 |
|
80 |
| - t.doesNotThrow( |
81 |
| - function () { |
82 |
| - assert.strictEqual(findAfter(paragraph, children[1]), children[2]); |
83 |
| - assert.strictEqual(findAfter(paragraph, 1), children[2]); |
84 |
| - assert.strictEqual(findAfter(paragraph, 7), null); |
85 |
| - }, |
86 |
| - 'should return the following node when without `test`' |
87 |
| - ); |
| 67 | + t.doesNotThrow(function() { |
| 68 | + assert.strictEqual(findAfter(paragraph, children[1]), children[2]) |
| 69 | + assert.strictEqual(findAfter(paragraph, 1), children[2]) |
| 70 | + assert.strictEqual(findAfter(paragraph, 7), null) |
| 71 | + }, 'should return the following node when without `test`') |
88 | 72 |
|
89 |
| - t.doesNotThrow( |
90 |
| - function () { |
91 |
| - assert.strictEqual(findAfter(paragraph, 0, children[6]), children[6]); |
92 |
| - assert.strictEqual(findAfter(paragraph, children[0], children[1]), children[1]); |
93 |
| - assert.strictEqual(findAfter(paragraph, 0, children[1]), children[1]); |
94 |
| - assert.strictEqual(findAfter(paragraph, children[0], children[0]), null); |
95 |
| - assert.strictEqual(findAfter(paragraph, 0, children[0]), null); |
96 |
| - assert.strictEqual(findAfter(paragraph, 1, children[1]), null); |
97 |
| - }, |
98 |
| - 'should return `node` when given a `node` and existing' |
99 |
| - ); |
| 73 | + t.doesNotThrow(function() { |
| 74 | + assert.strictEqual(findAfter(paragraph, 0, children[6]), children[6]) |
| 75 | + assert.strictEqual( |
| 76 | + findAfter(paragraph, children[0], children[1]), |
| 77 | + children[1] |
| 78 | + ) |
| 79 | + assert.strictEqual(findAfter(paragraph, 0, children[1]), children[1]) |
| 80 | + assert.strictEqual(findAfter(paragraph, children[0], children[0]), null) |
| 81 | + assert.strictEqual(findAfter(paragraph, 0, children[0]), null) |
| 82 | + assert.strictEqual(findAfter(paragraph, 1, children[1]), null) |
| 83 | + }, 'should return `node` when given a `node` and existing') |
100 | 84 |
|
101 |
| - t.doesNotThrow( |
102 |
| - function () { |
103 |
| - assert.strictEqual(findAfter(paragraph, 0, 'strong'), children[3]); |
104 |
| - assert.strictEqual(findAfter(paragraph, 3, 'strong'), null); |
105 |
| - assert.strictEqual(findAfter(paragraph, children[0], 'strong'), children[3]); |
106 |
| - assert.strictEqual(findAfter(paragraph, children[3], 'strong'), null); |
107 |
| - }, |
108 |
| - 'should return a child when given a `type` and existing' |
109 |
| - ); |
| 85 | + t.doesNotThrow(function() { |
| 86 | + assert.strictEqual(findAfter(paragraph, 0, 'strong'), children[3]) |
| 87 | + assert.strictEqual(findAfter(paragraph, 3, 'strong'), null) |
| 88 | + assert.strictEqual(findAfter(paragraph, children[0], 'strong'), children[3]) |
| 89 | + assert.strictEqual(findAfter(paragraph, children[3], 'strong'), null) |
| 90 | + }, 'should return a child when given a `type` and existing') |
110 | 91 |
|
111 |
| - t.doesNotThrow( |
112 |
| - function () { |
113 |
| - assert.strictEqual(findAfter(paragraph, 0, test), children[5]); |
114 |
| - assert.strictEqual(findAfter(paragraph, 5, test), null); |
115 |
| - assert.strictEqual(findAfter(paragraph, children[4], test), children[5]); |
116 |
| - assert.strictEqual(findAfter(paragraph, children[6], test), null); |
| 92 | + t.doesNotThrow(function() { |
| 93 | + assert.strictEqual(findAfter(paragraph, 0, test), children[5]) |
| 94 | + assert.strictEqual(findAfter(paragraph, 5, test), null) |
| 95 | + assert.strictEqual(findAfter(paragraph, children[4], test), children[5]) |
| 96 | + assert.strictEqual(findAfter(paragraph, children[6], test), null) |
117 | 97 |
|
118 |
| - function test(node, n) { |
119 |
| - return n === 5; |
120 |
| - } |
121 |
| - }, |
122 |
| - 'should return a child when given a `test` and existing' |
123 |
| - ); |
| 98 | + function test(node, n) { |
| 99 | + return n === 5 |
| 100 | + } |
| 101 | + }, 'should return a child when given a `test` and existing') |
124 | 102 |
|
125 |
| - t.end(); |
126 |
| -}); |
| 103 | + t.end() |
| 104 | +}) |
0 commit comments