-
Notifications
You must be signed in to change notification settings - Fork 534
/
empty-line-between-blocks.js
200 lines (167 loc) · 5.26 KB
/
empty-line-between-blocks.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
'use strict';
var helpers = require('../helpers');
var counter,
syntax;
var findNearestReturnSCSS = function (parent, i) {
var previous,
doublePrevious,
space;
if (parent.content[i - 1]) {
previous = parent.content[i - 1];
if (i >= 2) {
doublePrevious = parent.content[i - 2];
// First check to see that the previous line is not a new line as if it is
// we don't want to recursively run the function again
if (!helpers.isEmptyLine(previous.content)) {
if (doublePrevious.type.indexOf('Comment') !== -1) {
return findNearestReturnSCSS(parent, i - 1);
}
}
}
if (i >= 1) {
if (previous.type.indexOf('Comment') !== -1) {
return findNearestReturnSCSS(parent, i - 1);
}
if (previous.type === 'space') {
space = helpers.isEmptyLine(previous.content);
// If there's not a new line and it's the first within the block, ignore
if (!space && (i - 1 === 0)) {
return false;
}
return {
'space': space,
'previous': previous
};
}
}
}
return false;
};
var findNearestReturnSass = function (parent, i) {
var previous;
if (!parent.is('ident') && parent.content[i - 1]) {
previous = parent.content[i - 1];
if (counter === 2) {
return {
space: true,
previous: previous
};
}
if (previous.is('space') || previous.is('declarationDelimiter')) {
if (helpers.hasEOL(previous.content)) {
counter++;
}
return findNearestReturnSass(parent, i - 1);
}
// If ruleset, we must reset the parent to be the previous node and
// loop through that
else if (previous.is('ruleset') || previous.is('include')) {
var previousNode = previous.content[previous.content.length - 1];
// Set the i parameter for findNearestReturn to be the length of the
// content array in order to get the last one
return findNearestReturnSass(previousNode, previousNode.content.length);
}
else {
counter = 0;
if (previous.type.indexOf('Comment') !== -1) {
// If it's the first line
if (previous.start.line === 1) {
return {
space: true,
previous: previous
};
}
return findNearestReturnSass(parent, i - 1);
}
}
}
return {
space: false,
previous: previous
};
};
module.exports = {
'name': 'empty-line-between-blocks',
'defaults': {
'include': true,
'allow-single-line-rulesets': true
},
'detect': function (ast, parser) {
var result = [];
syntax = ast.syntax;
ast.traverseByType('ruleset', function (node, j, p) {
var space;
if ((node.start.line === node.end.line) && parser.options['allow-single-line-rulesets']) {
return false;
}
if (syntax === 'scss') {
space = findNearestReturnSCSS(p, j);
if (space) {
if (parser.options.include && !space.space && j !== 1) {
result = helpers.addUnique(result, {
'ruleId': parser.rule.name,
'line': space.previous.end.line,
'column': 1,
'message': 'Space expected between blocks',
'severity': parser.severity
});
}
else if (!parser.options.include && space.space) {
result = helpers.addUnique(result, {
'ruleId': parser.rule.name,
'line': space.previous.end.line,
'column': 1,
'message': 'Space not allowed between blocks',
'severity': parser.severity
});
}
}
}
else if (syntax === 'sass') {
// Reset the counter for each ruleset
counter = 0;
if (node.is('ruleset')) {
node.forEach('block', function (block, i, parent) {
var previous;
// Capture the previous node
if (parent.content[i - 1]) {
previous = parent.content[i - 1];
}
else {
// Else set the block to act as the previous node
previous = block;
}
// If it's a new line, lets go back up to the selector
if (previous.is('space') && helpers.hasEOL(previous.content)) {
space = findNearestReturnSass(p, j);
}
});
}
if (space && space.previous) {
if (space.previous.start.line !== 1) {
if (parser.options.include && !space.space) {
result = helpers.addUnique(result, {
'ruleId': parser.rule.name,
'line': space.previous.end.line + 1,
'column': 1,
'message': 'Space expected between blocks',
'severity': parser.severity
});
}
else if (!parser.options.include && space.space) {
result = helpers.addUnique(result, {
'ruleId': parser.rule.name,
'line': space.previous.end.line + 1,
'column': 1,
'message': 'Space not allowed between blocks',
'severity': parser.severity
});
}
}
}
}
return true;
});
return result;
}
};