1 | "use strict";
|
---|
2 |
|
---|
3 | var _helpers = require("./util/helpers");
|
---|
4 |
|
---|
5 | (0, _helpers.test)('universal selector', '*', function (t, tree) {
|
---|
6 | t.deepEqual(tree.nodes[0].nodes[0].source.start.column, 1);
|
---|
7 | t.deepEqual(tree.nodes[0].nodes[0].source.end.column, 1);
|
---|
8 | t.deepEqual(tree.nodes[0].nodes[0].sourceIndex, 0);
|
---|
9 | });
|
---|
10 | (0, _helpers.test)('lobotomized owl selector', ' * + * ', function (t, tree) {
|
---|
11 | t.deepEqual(tree.nodes[0].nodes[0].source.start.column, 2);
|
---|
12 | t.deepEqual(tree.nodes[0].nodes[0].source.end.column, 2);
|
---|
13 | t.deepEqual(tree.nodes[0].nodes[0].sourceIndex, 1);
|
---|
14 | t.deepEqual(tree.nodes[0].nodes[1].source.start.column, 4);
|
---|
15 | t.deepEqual(tree.nodes[0].nodes[1].source.end.column, 4);
|
---|
16 | t.deepEqual(tree.nodes[0].nodes[1].sourceIndex, 3);
|
---|
17 | t.deepEqual(tree.nodes[0].nodes[2].source.start.column, 6);
|
---|
18 | t.deepEqual(tree.nodes[0].nodes[2].source.end.column, 6);
|
---|
19 | t.deepEqual(tree.nodes[0].nodes[2].sourceIndex, 5);
|
---|
20 | });
|
---|
21 | (0, _helpers.test)('comment', '/**\n * Hello!\n */', function (t, tree) {
|
---|
22 | t.deepEqual(tree.nodes[0].nodes[0].source.start.column, 1);
|
---|
23 | t.deepEqual(tree.nodes[0].nodes[0].source.end.column, 3);
|
---|
24 | t.deepEqual(tree.nodes[0].nodes[0].sourceIndex, 0);
|
---|
25 | });
|
---|
26 | (0, _helpers.test)('comment & universal selectors', '*/*test*/*', function (t, tree) {
|
---|
27 | t.deepEqual(tree.nodes[0].nodes[0].source.start.column, 1);
|
---|
28 | t.deepEqual(tree.nodes[0].nodes[0].source.end.column, 1);
|
---|
29 | t.deepEqual(tree.nodes[0].nodes[0].sourceIndex, 0);
|
---|
30 | t.deepEqual(tree.nodes[0].nodes[1].source.start.column, 2);
|
---|
31 | t.deepEqual(tree.nodes[0].nodes[1].source.end.column, 9);
|
---|
32 | t.deepEqual(tree.nodes[0].nodes[1].sourceIndex, 1);
|
---|
33 | t.deepEqual(tree.nodes[0].nodes[2].source.start.column, 10);
|
---|
34 | t.deepEqual(tree.nodes[0].nodes[2].source.end.column, 10);
|
---|
35 | t.deepEqual(tree.nodes[0].nodes[2].sourceIndex, 9);
|
---|
36 | });
|
---|
37 | (0, _helpers.test)('tag selector', 'h1', function (t, tree) {
|
---|
38 | t.deepEqual(tree.nodes[0].nodes[0].source.start.column, 1);
|
---|
39 | t.deepEqual(tree.nodes[0].nodes[0].source.end.column, 2);
|
---|
40 | t.deepEqual(tree.nodes[0].nodes[0].sourceIndex, 0);
|
---|
41 | });
|
---|
42 | (0, _helpers.test)('id selector', '#id', function (t, tree) {
|
---|
43 | t.deepEqual(tree.nodes[0].nodes[0].source.start.column, 1);
|
---|
44 | t.deepEqual(tree.nodes[0].nodes[0].source.end.column, 3);
|
---|
45 | t.deepEqual(tree.nodes[0].nodes[0].sourceIndex, 0);
|
---|
46 | });
|
---|
47 | (0, _helpers.test)('tag selector followed by id selector', 'h1, #id', function (t, tree) {
|
---|
48 | t.deepEqual(tree.nodes[0].nodes[0].source.start.column, 1);
|
---|
49 | t.deepEqual(tree.nodes[0].nodes[0].source.end.column, 2);
|
---|
50 | t.deepEqual(tree.nodes[0].nodes[0].sourceIndex, 0);
|
---|
51 | t.deepEqual(tree.nodes[1].nodes[0].source.start.column, 5);
|
---|
52 | t.deepEqual(tree.nodes[1].nodes[0].source.end.column, 7);
|
---|
53 | t.deepEqual(tree.nodes[1].nodes[0].sourceIndex, 4);
|
---|
54 | });
|
---|
55 | (0, _helpers.test)('multiple id selectors', '#one#two', function (t, tree) {
|
---|
56 | t.deepEqual(tree.nodes[0].nodes[0].source.start.column, 1);
|
---|
57 | t.deepEqual(tree.nodes[0].nodes[0].source.end.column, 4);
|
---|
58 | t.deepEqual(tree.nodes[0].nodes[0].sourceIndex, 0);
|
---|
59 | t.deepEqual(tree.nodes[0].nodes[1].source.start.column, 5);
|
---|
60 | t.deepEqual(tree.nodes[0].nodes[1].source.end.column, 8);
|
---|
61 | t.deepEqual(tree.nodes[0].nodes[1].sourceIndex, 4);
|
---|
62 | });
|
---|
63 | (0, _helpers.test)('multiple id selectors (2)', '#one#two#three#four', function (t, tree) {
|
---|
64 | t.deepEqual(tree.nodes[0].nodes[2].source.start.column, 9);
|
---|
65 | t.deepEqual(tree.nodes[0].nodes[2].source.end.column, 14);
|
---|
66 | t.deepEqual(tree.nodes[0].nodes[2].sourceIndex, 8);
|
---|
67 | t.deepEqual(tree.nodes[0].nodes[3].source.start.column, 15);
|
---|
68 | t.deepEqual(tree.nodes[0].nodes[3].source.end.column, 19);
|
---|
69 | t.deepEqual(tree.nodes[0].nodes[3].sourceIndex, 14);
|
---|
70 | });
|
---|
71 | (0, _helpers.test)('multiple id selectors (3)', '#one#two,#three#four', function (t, tree) {
|
---|
72 | t.deepEqual(tree.nodes[0].nodes[1].source.start.column, 5);
|
---|
73 | t.deepEqual(tree.nodes[0].nodes[1].source.end.column, 8);
|
---|
74 | t.deepEqual(tree.nodes[0].nodes[1].sourceIndex, 4);
|
---|
75 | t.deepEqual(tree.nodes[1].nodes[1].source.start.column, 16);
|
---|
76 | t.deepEqual(tree.nodes[1].nodes[1].source.end.column, 20);
|
---|
77 | t.deepEqual(tree.nodes[1].nodes[1].sourceIndex, 15);
|
---|
78 | });
|
---|
79 | (0, _helpers.test)('multiple class selectors', '.one.two,.three.four', function (t, tree) {
|
---|
80 | t.deepEqual(tree.nodes[0].nodes[1].source.start.column, 5);
|
---|
81 | t.deepEqual(tree.nodes[0].nodes[1].source.end.column, 8);
|
---|
82 | t.deepEqual(tree.nodes[0].nodes[1].sourceIndex, 4);
|
---|
83 | t.deepEqual(tree.nodes[1].nodes[1].source.start.column, 16);
|
---|
84 | t.deepEqual(tree.nodes[1].nodes[1].source.end.column, 20);
|
---|
85 | t.deepEqual(tree.nodes[1].nodes[1].sourceIndex, 15);
|
---|
86 | });
|
---|
87 | (0, _helpers.test)('attribute selector', '[name="james"]', function (t, tree) {
|
---|
88 | t.deepEqual(tree.nodes[0].nodes[0].source.start.line, 1);
|
---|
89 | t.deepEqual(tree.nodes[0].nodes[0].source.start.column, 1);
|
---|
90 | t.deepEqual(tree.nodes[0].nodes[0].source.end.column, 14);
|
---|
91 | t.deepEqual(tree.nodes[0].nodes[0].sourceIndex, 0);
|
---|
92 | });
|
---|
93 | (0, _helpers.test)('multiple attribute selectors', '[name="james"][name="ed"],[name="snakeman"][name="a"]', function (t, tree) {
|
---|
94 | t.deepEqual(tree.nodes[0].nodes[0].source.start.line, 1);
|
---|
95 | t.deepEqual(tree.nodes[0].nodes[0].source.start.column, 1);
|
---|
96 | t.deepEqual(tree.nodes[0].nodes[0].source.end.line, 1);
|
---|
97 | t.deepEqual(tree.nodes[0].nodes[0].source.end.column, 14);
|
---|
98 | t.deepEqual(tree.nodes[0].nodes[0].sourceIndex, 0);
|
---|
99 | t.deepEqual(tree.nodes[0].nodes[1].source.start.line, 1);
|
---|
100 | t.deepEqual(tree.nodes[0].nodes[1].source.start.column, 15);
|
---|
101 | t.deepEqual(tree.nodes[0].nodes[1].source.end.line, 1);
|
---|
102 | t.deepEqual(tree.nodes[0].nodes[1].source.end.column, 25);
|
---|
103 | t.deepEqual(tree.nodes[0].nodes[1].sourceIndex, 14);
|
---|
104 | t.deepEqual(tree.nodes[1].nodes[0].source.start.line, 1);
|
---|
105 | t.deepEqual(tree.nodes[1].nodes[0].source.start.column, 27);
|
---|
106 | t.deepEqual(tree.nodes[1].nodes[0].source.end.line, 1);
|
---|
107 | t.deepEqual(tree.nodes[1].nodes[0].source.end.column, 43);
|
---|
108 | t.deepEqual(tree.nodes[1].nodes[0].sourceIndex, 26);
|
---|
109 | t.deepEqual(tree.nodes[1].nodes[1].source.start.line, 1);
|
---|
110 | t.deepEqual(tree.nodes[1].nodes[1].source.start.column, 44);
|
---|
111 | t.deepEqual(tree.nodes[1].nodes[1].source.end.line, 1);
|
---|
112 | t.deepEqual(tree.nodes[1].nodes[1].source.end.column, 53);
|
---|
113 | t.deepEqual(tree.nodes[1].nodes[1].sourceIndex, 43);
|
---|
114 | });
|
---|
115 | (0, _helpers.test)('pseudo-class', 'h1:first-child', function (t, tree) {
|
---|
116 | t.deepEqual(tree.nodes[0].nodes[1].source.start.line, 1);
|
---|
117 | t.deepEqual(tree.nodes[0].nodes[1].source.start.column, 3);
|
---|
118 | t.deepEqual(tree.nodes[0].nodes[1].source.end.column, 14);
|
---|
119 | t.deepEqual(tree.nodes[0].nodes[1].sourceIndex, 2);
|
---|
120 | });
|
---|
121 | (0, _helpers.test)('pseudo-class with argument', 'h1:not(.strudel, .food)', function (t, tree) {
|
---|
122 | t.deepEqual(tree.nodes[0].nodes[1].source.start.line, 1);
|
---|
123 | t.deepEqual(tree.nodes[0].nodes[1].source.start.column, 3);
|
---|
124 | t.deepEqual(tree.nodes[0].nodes[1].source.end.column, 23);
|
---|
125 | t.deepEqual(tree.nodes[0].nodes[1].sourceIndex, 2);
|
---|
126 | });
|
---|
127 | (0, _helpers.test)('pseudo-element', 'h1::before', function (t, tree) {
|
---|
128 | t.deepEqual(tree.nodes[0].nodes[1].source.start.line, 1);
|
---|
129 | t.deepEqual(tree.nodes[0].nodes[1].source.start.column, 3);
|
---|
130 | t.deepEqual(tree.nodes[0].nodes[1].source.end.column, 10);
|
---|
131 | t.deepEqual(tree.nodes[0].nodes[1].sourceIndex, 2);
|
---|
132 | });
|
---|
133 | (0, _helpers.test)('multiple pseudos', 'h1:not(.food)::before, a:first-child', function (t, tree) {
|
---|
134 | t.deepEqual(tree.nodes[0].nodes[1].source.start.line, 1);
|
---|
135 | t.deepEqual(tree.nodes[0].nodes[1].source.start.column, 3);
|
---|
136 | t.deepEqual(tree.nodes[0].nodes[1].source.end.column, 13);
|
---|
137 | t.deepEqual(tree.nodes[0].nodes[1].sourceIndex, 2);
|
---|
138 | t.deepEqual(tree.nodes[0].nodes[2].source.start.line, 1);
|
---|
139 | t.deepEqual(tree.nodes[0].nodes[2].source.start.column, 14);
|
---|
140 | t.deepEqual(tree.nodes[0].nodes[2].source.end.column, 21);
|
---|
141 | t.deepEqual(tree.nodes[0].nodes[2].sourceIndex, 13);
|
---|
142 | t.deepEqual(tree.nodes[1].nodes[1].source.start.line, 1);
|
---|
143 | t.deepEqual(tree.nodes[1].nodes[1].source.start.column, 25);
|
---|
144 | t.deepEqual(tree.nodes[1].nodes[1].source.end.column, 36);
|
---|
145 | t.deepEqual(tree.nodes[1].nodes[1].sourceIndex, 24);
|
---|
146 | });
|
---|
147 | (0, _helpers.test)('combinators', 'div > h1 span', function (t, tree) {
|
---|
148 | t.deepEqual(tree.nodes[0].nodes[1].source.start.line, 1, "> start line");
|
---|
149 | t.deepEqual(tree.nodes[0].nodes[1].source.start.column, 5, "> start column");
|
---|
150 | t.deepEqual(tree.nodes[0].nodes[1].source.end.column, 5, "> end column");
|
---|
151 | t.deepEqual(tree.nodes[0].nodes[1].sourceIndex, 4, "> sourceIndex");
|
---|
152 | t.deepEqual(tree.nodes[0].nodes[3].source.start.line, 1, "' ' start line");
|
---|
153 | t.deepEqual(tree.nodes[0].nodes[3].source.start.column, 9, "' ' start column");
|
---|
154 | t.deepEqual(tree.nodes[0].nodes[3].source.end.column, 9, "' ' end column");
|
---|
155 | t.deepEqual(tree.nodes[0].nodes[3].sourceIndex, 8, "' ' sourceIndex");
|
---|
156 | });
|
---|
157 | (0, _helpers.test)('combinators surrounded by superfluous spaces', 'div > h1 ~ span a', function (t, tree) {
|
---|
158 | t.deepEqual(tree.nodes[0].nodes[1].source.start.line, 1, "> start line");
|
---|
159 | t.deepEqual(tree.nodes[0].nodes[1].source.start.column, 7, "> start column");
|
---|
160 | t.deepEqual(tree.nodes[0].nodes[1].source.end.column, 7, "> end column");
|
---|
161 | t.deepEqual(tree.nodes[0].nodes[1].sourceIndex, 6, "> sourceIndex");
|
---|
162 | t.deepEqual(tree.nodes[0].nodes[3].source.start.line, 1, "~ start line");
|
---|
163 | t.deepEqual(tree.nodes[0].nodes[3].source.start.column, 13, "~ start column");
|
---|
164 | t.deepEqual(tree.nodes[0].nodes[3].source.end.column, 13, "~ end column");
|
---|
165 | t.deepEqual(tree.nodes[0].nodes[3].sourceIndex, 12, "~ sourceIndex");
|
---|
166 | t.deepEqual(tree.nodes[0].nodes[5].source.start.line, 1, "' ' start line");
|
---|
167 | t.deepEqual(tree.nodes[0].nodes[5].source.start.column, 21, "' ' start column");
|
---|
168 | t.deepEqual(tree.nodes[0].nodes[5].source.end.column, 23, "' ' end column");
|
---|
169 | t.deepEqual(tree.nodes[0].nodes[5].sourceIndex, 20, "' ' sourceIndex");
|
---|
170 | });
|
---|
171 | (0, _helpers.test)('multiple id selectors on different lines', '#one,\n#two', function (t, tree) {
|
---|
172 | t.deepEqual(tree.nodes[0].nodes[0].source.start.line, 1);
|
---|
173 | t.deepEqual(tree.nodes[0].nodes[0].source.start.column, 1);
|
---|
174 | t.deepEqual(tree.nodes[0].nodes[0].source.end.column, 4);
|
---|
175 | t.deepEqual(tree.nodes[0].nodes[0].sourceIndex, 0);
|
---|
176 | t.deepEqual(tree.nodes[1].nodes[0].source.start.line, 2);
|
---|
177 | t.deepEqual(tree.nodes[1].nodes[0].source.start.column, 1);
|
---|
178 | t.deepEqual(tree.nodes[1].nodes[0].source.end.column, 4);
|
---|
179 | t.deepEqual(tree.nodes[1].nodes[0].sourceIndex, 6);
|
---|
180 | });
|
---|
181 | (0, _helpers.test)('multiple id selectors on different CRLF lines', '#one,\r\n#two,\r\n#three', function (t, tree) {
|
---|
182 | t.deepEqual(tree.nodes[0].nodes[0].source.start.line, 1, '#one start line');
|
---|
183 | t.deepEqual(tree.nodes[0].nodes[0].source.start.column, 1, '#one start column');
|
---|
184 | t.deepEqual(tree.nodes[0].nodes[0].source.end.column, 4, '#one end column');
|
---|
185 | t.deepEqual(tree.nodes[0].nodes[0].sourceIndex, 0, '#one sourceIndex');
|
---|
186 | t.deepEqual(tree.nodes[1].nodes[0].source.start.line, 2, '#two start line');
|
---|
187 | t.deepEqual(tree.nodes[1].nodes[0].source.start.column, 1, '#two start column');
|
---|
188 | t.deepEqual(tree.nodes[1].nodes[0].source.end.column, 4, '#two end column');
|
---|
189 | t.deepEqual(tree.nodes[1].nodes[0].sourceIndex, 7, '#two sourceIndex');
|
---|
190 | t.deepEqual(tree.nodes[2].nodes[0].source.start.line, 3, '#three start line');
|
---|
191 | t.deepEqual(tree.nodes[2].nodes[0].source.start.column, 1, '#three start column');
|
---|
192 | t.deepEqual(tree.nodes[2].nodes[0].source.end.column, 6, '#three end column');
|
---|
193 | t.deepEqual(tree.nodes[2].nodes[0].sourceIndex, 14, '#three sourceIndex');
|
---|
194 | });
|
---|
195 | (0, _helpers.test)('id, tag, pseudo, and class selectors on different lines with indentation', '\t#one,\n\th1:after,\n\t\t.two', function (t, tree) {
|
---|
196 | t.deepEqual(tree.nodes[0].nodes[0].source.start.line, 1, '#one start line');
|
---|
197 | t.deepEqual(tree.nodes[0].nodes[0].source.start.column, 2, '#one start column');
|
---|
198 | t.deepEqual(tree.nodes[0].nodes[0].source.end.column, 5, '#one end column');
|
---|
199 | t.deepEqual(tree.nodes[0].nodes[0].sourceIndex, 1, '#one sourceIndex');
|
---|
200 | t.deepEqual(tree.nodes[1].nodes[0].source.start.line, 2, 'h1 start line');
|
---|
201 | t.deepEqual(tree.nodes[1].nodes[0].source.start.column, 2, 'h1 start column');
|
---|
202 | t.deepEqual(tree.nodes[1].nodes[0].source.end.column, 3, 'h1 end column');
|
---|
203 | t.deepEqual(tree.nodes[1].nodes[0].sourceIndex, 8, 'h1 sourceIndex');
|
---|
204 | t.deepEqual(tree.nodes[1].nodes[1].source.start.line, 2, ':after start line');
|
---|
205 | t.deepEqual(tree.nodes[1].nodes[1].source.start.column, 4, ':after start column');
|
---|
206 | t.deepEqual(tree.nodes[1].nodes[1].source.end.column, 9, ':after end column');
|
---|
207 | t.deepEqual(tree.nodes[1].nodes[1].sourceIndex, 10, ':after sourceIndex');
|
---|
208 | t.deepEqual(tree.nodes[2].nodes[0].source.start.line, 3, '.two start line');
|
---|
209 | t.deepEqual(tree.nodes[2].nodes[0].source.start.column, 3, '.two start column');
|
---|
210 | t.deepEqual(tree.nodes[2].nodes[0].source.end.column, 6, '.two end column');
|
---|
211 | t.deepEqual(tree.nodes[2].nodes[0].sourceIndex, 20, '.two sourceIndex');
|
---|
212 | });
|
---|
213 | (0, _helpers.test)('pseudo with arguments spanning multiple lines', 'h1:not(\n\t.one,\n\t.two\n)', function (t, tree) {
|
---|
214 | t.deepEqual(tree.nodes[0].nodes[1].source.start.line, 1, ':not start line');
|
---|
215 | t.deepEqual(tree.nodes[0].nodes[1].source.start.column, 3, ':not start column');
|
---|
216 | t.deepEqual(tree.nodes[0].nodes[1].source.end.line, 4, ':not end line');
|
---|
217 | t.deepEqual(tree.nodes[0].nodes[1].source.end.column, 1, ':not end column');
|
---|
218 | t.deepEqual(tree.nodes[0].nodes[1].sourceIndex, 2, ':not sourceIndex');
|
---|
219 | t.deepEqual(tree.nodes[0].nodes[1].nodes[0].nodes[0].source.start.line, 2, '.one start line');
|
---|
220 | t.deepEqual(tree.nodes[0].nodes[1].nodes[0].nodes[0].source.start.column, 2, '.one start column');
|
---|
221 | t.deepEqual(tree.nodes[0].nodes[1].nodes[0].nodes[0].source.end.line, 2, '.one end line');
|
---|
222 | t.deepEqual(tree.nodes[0].nodes[1].nodes[0].nodes[0].source.end.column, 5, '.one end column');
|
---|
223 | t.deepEqual(tree.nodes[0].nodes[1].nodes[0].nodes[0].sourceIndex, 9, '.one sourceIndex');
|
---|
224 | t.deepEqual(tree.nodes[0].nodes[1].nodes[1].nodes[0].source.start.line, 3, '.two start line');
|
---|
225 | t.deepEqual(tree.nodes[0].nodes[1].nodes[1].nodes[0].source.start.column, 2, '.two start column');
|
---|
226 | t.deepEqual(tree.nodes[0].nodes[1].nodes[1].nodes[0].source.end.line, 3, '.two end line');
|
---|
227 | t.deepEqual(tree.nodes[0].nodes[1].nodes[1].nodes[0].source.end.column, 5, '.two end column');
|
---|
228 | t.deepEqual(tree.nodes[0].nodes[1].nodes[1].nodes[0].sourceIndex, 16, '.two sourceIndex');
|
---|
229 | }); |
---|