[6a3a178] | 1 | "use strict";
|
---|
| 2 |
|
---|
| 3 | var _types = require("../selectors/types");
|
---|
| 4 |
|
---|
| 5 | var _helpers = require("./util/helpers");
|
---|
| 6 |
|
---|
| 7 | (0, _helpers.test)('multiple combinating spaces', 'h1 h2', function (t, tree) {
|
---|
| 8 | t.deepEqual(tree.nodes[0].nodes[0].value, 'h1');
|
---|
| 9 | t.deepEqual(tree.nodes[0].nodes[1].value, ' ');
|
---|
| 10 | t.deepEqual(tree.nodes[0].nodes[1].toString(), ' ');
|
---|
| 11 | t.deepEqual(tree.nodes[0].nodes[2].value, 'h2');
|
---|
| 12 | });
|
---|
| 13 | (0, _helpers.test)('column combinator', '.selected||td', function (t, tree) {
|
---|
| 14 | t.deepEqual(tree.nodes[0].nodes[0].value, 'selected');
|
---|
| 15 | t.deepEqual(tree.nodes[0].nodes[1].value, '||');
|
---|
| 16 | t.deepEqual(tree.nodes[0].nodes[2].value, 'td');
|
---|
| 17 | });
|
---|
| 18 | (0, _helpers.test)('column combinator (2)', '.selected || td', function (t, tree) {
|
---|
| 19 | t.deepEqual(tree.nodes[0].nodes[0].value, 'selected');
|
---|
| 20 | t.deepEqual(tree.nodes[0].nodes[1].spaces.before, ' ');
|
---|
| 21 | t.deepEqual(tree.nodes[0].nodes[1].value, '||');
|
---|
| 22 | t.deepEqual(tree.nodes[0].nodes[1].spaces.after, ' ');
|
---|
| 23 | t.deepEqual(tree.nodes[0].nodes[2].value, 'td');
|
---|
| 24 | });
|
---|
| 25 | (0, _helpers.test)('descendant combinator', 'h1 h2', function (t, tree) {
|
---|
| 26 | t.deepEqual(tree.nodes[0].nodes[0].value, 'h1');
|
---|
| 27 | t.deepEqual(tree.nodes[0].nodes[1].value, ' ');
|
---|
| 28 | t.deepEqual(tree.nodes[0].nodes[2].value, 'h2');
|
---|
| 29 | });
|
---|
| 30 | (0, _helpers.test)('multiple descendant combinators', 'h1 h2 h3 h4', function (t, tree) {
|
---|
| 31 | t.deepEqual(tree.nodes[0].nodes[1].value, ' ', 'should have a combinator');
|
---|
| 32 | t.deepEqual(tree.nodes[0].nodes[3].value, ' ', 'should have a combinator');
|
---|
| 33 | t.deepEqual(tree.nodes[0].nodes[5].value, ' ', 'should have a combinator');
|
---|
| 34 | });
|
---|
| 35 | (0, _helpers.test)('adjacent sibling combinator', 'h1~h2', function (t, tree) {
|
---|
| 36 | t.deepEqual(tree.nodes[0].nodes[0].value, 'h1');
|
---|
| 37 | t.deepEqual(tree.nodes[0].nodes[1].value, '~');
|
---|
| 38 | t.deepEqual(tree.nodes[0].nodes[2].value, 'h2');
|
---|
| 39 | });
|
---|
| 40 | (0, _helpers.test)('adjacent sibling combinator (2)', 'h1 ~h2', function (t, tree) {
|
---|
| 41 | t.deepEqual(tree.nodes[0].nodes[0].value, 'h1');
|
---|
| 42 | t.deepEqual(tree.nodes[0].nodes[1].spaces.before, ' ');
|
---|
| 43 | t.deepEqual(tree.nodes[0].nodes[1].value, '~');
|
---|
| 44 | t.deepEqual(tree.nodes[0].nodes[2].value, 'h2');
|
---|
| 45 | });
|
---|
| 46 | (0, _helpers.test)('adjacent sibling combinator (3)', 'h1~ h2', function (t, tree) {
|
---|
| 47 | t.deepEqual(tree.nodes[0].nodes[0].value, 'h1');
|
---|
| 48 | t.deepEqual(tree.nodes[0].nodes[1].value, '~');
|
---|
| 49 | t.deepEqual(tree.nodes[0].nodes[1].spaces.after, ' ');
|
---|
| 50 | t.deepEqual(tree.nodes[0].nodes[2].value, 'h2');
|
---|
| 51 | });
|
---|
| 52 | (0, _helpers.test)('adjacent sibling combinator (4)', 'h1 ~ h2', function (t, tree) {
|
---|
| 53 | t.deepEqual(tree.nodes[0].nodes[0].value, 'h1');
|
---|
| 54 | t.deepEqual(tree.nodes[0].nodes[1].spaces.before, ' ');
|
---|
| 55 | t.deepEqual(tree.nodes[0].nodes[1].value, '~');
|
---|
| 56 | t.deepEqual(tree.nodes[0].nodes[1].spaces.after, ' ');
|
---|
| 57 | t.deepEqual(tree.nodes[0].nodes[2].value, 'h2');
|
---|
| 58 | });
|
---|
| 59 | (0, _helpers.test)('adjacent sibling combinator (5)', 'h1~h2~h3', function (t, tree) {
|
---|
| 60 | t.deepEqual(tree.nodes[0].nodes[0].value, 'h1');
|
---|
| 61 | t.deepEqual(tree.nodes[0].nodes[1].value, '~');
|
---|
| 62 | t.deepEqual(tree.nodes[0].nodes[2].value, 'h2');
|
---|
| 63 | t.deepEqual(tree.nodes[0].nodes[3].value, '~');
|
---|
| 64 | t.deepEqual(tree.nodes[0].nodes[4].value, 'h3');
|
---|
| 65 | });
|
---|
| 66 | (0, _helpers.test)('piercing combinator', '.a >>> .b', function (t, tree) {
|
---|
| 67 | t.deepEqual(tree.nodes[0].nodes[0].value, 'a');
|
---|
| 68 | t.deepEqual(tree.nodes[0].nodes[1].spaces.before, ' ');
|
---|
| 69 | t.deepEqual(tree.nodes[0].nodes[1].value, '>>>');
|
---|
| 70 | t.deepEqual(tree.nodes[0].nodes[1].spaces.after, ' ');
|
---|
| 71 | t.deepEqual(tree.nodes[0].nodes[2].value, 'b');
|
---|
| 72 | });
|
---|
| 73 | (0, _helpers.test)('named combinators', 'a /deep/ b', function (t, tree) {
|
---|
| 74 | var nodes = tree.nodes[0].nodes;
|
---|
| 75 | t.deepEqual(nodes[0].value, 'a');
|
---|
| 76 | t.deepEqual(nodes[1].type, _types.COMBINATOR);
|
---|
| 77 | t.deepEqual(nodes[1].toString(), ' /deep/ ');
|
---|
| 78 | t.deepEqual(nodes[1].value, '/deep/');
|
---|
| 79 | t.deepEqual(nodes[2].value, 'b');
|
---|
| 80 | });
|
---|
| 81 | (0, _helpers.test)('named combinators with escapes', 'a /dee\\p/ b', function (t, tree) {
|
---|
| 82 | var nodes = tree.nodes[0].nodes;
|
---|
| 83 | t.deepEqual(nodes[0].value, 'a');
|
---|
| 84 | t.deepEqual(nodes[1].type, _types.COMBINATOR);
|
---|
| 85 | t.deepEqual(nodes[1].toString(), ' /dee\\p/ ');
|
---|
| 86 | t.deepEqual(nodes[1].value, '/deep/');
|
---|
| 87 | t.deepEqual(nodes[2].value, 'b');
|
---|
| 88 | });
|
---|
| 89 | (0, _helpers.test)('named combinators with escapes and uppercase', 'a /DeE\\p/ b', function (t, tree) {
|
---|
| 90 | var nodes = tree.nodes[0].nodes;
|
---|
| 91 | t.deepEqual(nodes[0].value, 'a');
|
---|
| 92 | t.deepEqual(nodes[1].type, _types.COMBINATOR);
|
---|
| 93 | t.deepEqual(nodes[1].toString(), ' /DeE\\p/ ');
|
---|
| 94 | t.deepEqual(nodes[1].value, '/deep/');
|
---|
| 95 | t.deepEqual(nodes[2].value, 'b');
|
---|
| 96 | });
|
---|
| 97 | (0, _helpers.test)('multiple combinators', 'h1~h2>h3', function (t, tree) {
|
---|
| 98 | t.deepEqual(tree.nodes[0].nodes[1].value, '~', 'should have a combinator');
|
---|
| 99 | t.deepEqual(tree.nodes[0].nodes[3].value, '>', 'should have a combinator');
|
---|
| 100 | });
|
---|
| 101 | (0, _helpers.test)('multiple combinators with whitespaces', 'h1 + h2 > h3', function (t, tree) {
|
---|
| 102 | t.deepEqual(tree.nodes[0].nodes[1].value, '+', 'should have a combinator');
|
---|
| 103 | t.deepEqual(tree.nodes[0].nodes[3].value, '>', 'should have a combinator');
|
---|
| 104 | });
|
---|
| 105 | (0, _helpers.test)('multiple combinators with whitespaces (2)', 'h1+ h2 >h3', function (t, tree) {
|
---|
| 106 | t.deepEqual(tree.nodes[0].nodes[1].value, '+', 'should have a combinator');
|
---|
| 107 | t.deepEqual(tree.nodes[0].nodes[3].value, '>', 'should have a combinator');
|
---|
| 108 | });
|
---|
| 109 | (0, _helpers.test)('trailing combinator & spaces', 'p + ', function (t, tree) {
|
---|
| 110 | t.deepEqual(tree.nodes[0].nodes[0].value, 'p', 'should be a paragraph');
|
---|
| 111 | t.deepEqual(tree.nodes[0].nodes[1].value, '+', 'should have a combinator');
|
---|
| 112 | });
|
---|
| 113 | (0, _helpers.test)('trailing sibling combinator', 'p ~', function (t, tree) {
|
---|
| 114 | t.deepEqual(tree.nodes[0].nodes[0].value, 'p', 'should be a paragraph');
|
---|
| 115 | t.deepEqual(tree.nodes[0].nodes[1].value, '~', 'should have a combinator');
|
---|
| 116 | });
|
---|
| 117 | (0, _helpers.test)('ending in comment has no trailing combinator', ".bar /* comment 3 */", function (t, tree) {
|
---|
| 118 | var nodeTypes = tree.nodes[0].map(function (n) {
|
---|
| 119 | return n.type;
|
---|
| 120 | });
|
---|
| 121 | t.deepEqual(nodeTypes, ["class"]);
|
---|
| 122 | });
|
---|
| 123 | (0, _helpers.test)('The combinating space is not a space character', ".bar\n.baz", function (t, tree) {
|
---|
| 124 | var nodeTypes = tree.nodes[0].map(function (n) {
|
---|
| 125 | return n.type;
|
---|
| 126 | });
|
---|
| 127 | t.deepEqual(nodeTypes, ["class", "combinator", "class"]);
|
---|
| 128 | t.deepEqual(tree.nodes[0].nodes[1].value, ' ', 'should have a combinator');
|
---|
| 129 | t.deepEqual(tree.nodes[0].nodes[1].raws.value, '\n', 'should have a raw combinator value');
|
---|
| 130 | });
|
---|
| 131 | (0, _helpers.test)('with spaces and a comment has only one combinator', ".bar /* comment 3 */ > .foo", function (t, tree) {
|
---|
| 132 | var nodeTypes = tree.nodes[0].map(function (n) {
|
---|
| 133 | return n.type;
|
---|
| 134 | });
|
---|
| 135 | t.deepEqual(nodeTypes, ["class", "combinator", "class"]);
|
---|
| 136 | });
|
---|
| 137 | (0, _helpers.test)('with a meaningful comment in the middle of a compound selector', "div/* wtf */.foo", function (t, tree) {
|
---|
| 138 | var nodeTypes = tree.nodes[0].map(function (n) {
|
---|
| 139 | return n.type;
|
---|
| 140 | });
|
---|
| 141 | t.deepEqual(nodeTypes, ["tag", "comment", "class"]);
|
---|
| 142 | });
|
---|
| 143 | (0, _helpers.test)('with a comment in the middle of a descendant selector', "div/* wtf */ .foo", function (t, tree) {
|
---|
| 144 | var nodeTypes = tree.nodes[0].map(function (n) {
|
---|
| 145 | return n.type;
|
---|
| 146 | });
|
---|
| 147 | t.deepEqual(nodeTypes, ["tag", "comment", "combinator", "class"]);
|
---|
| 148 | }); |
---|