-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathfilter.go
56 lines (49 loc) · 1.38 KB
/
filter.go
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
// Copyright 2015 Seth Bunce. All rights reserved. Use of this source code is
// governed by a BSD-style license that can be found in the LICENSE file.
package stem
import (
"regexp"
)
// Filter input before rendering.
// Run before execute for performance.
type Filter int
const (
// Replace consecutive \n with single \n.
// Remove blanks lines that result from having tags on separate lines.
NoBlankLines Filter = 1 << iota
// Remove space at start of line.
TrimLeftSpace Filter = 1 << iota
// Remove space at end of line.
TrimRightSpace Filter = 1 << iota
)
// Regexps for filters.
var (
blankLines = regexp.MustCompile("\n+")
leftSpace = regexp.MustCompile("\n[ \t]+")
rightSpace = regexp.MustCompile("[ \t]+\n")
)
// filter recurses through a parse tree and filters all string nodes.
func filter(tree []node, filters Filter) {
for _, n := range tree {
switch nt := n.(type) {
case *nodeArray:
filter(nt.nodes, filters)
case *nodeIfdef:
filter(nt.nodes, filters)
case *nodeIfndef:
filter(nt.nodes, filters)
case *nodeObject:
filter(nt.nodes, filters)
case *nodeString:
if filters & TrimLeftSpace != 0 {
nt.val = leftSpace.ReplaceAllString(nt.val, "\n")
}
if filters & TrimRightSpace != 0 {
nt.val = rightSpace.ReplaceAllString(nt.val, "\n")
}
if filters & NoBlankLines != 0 {
nt.val = blankLines.ReplaceAllString(nt.val, "\n")
}
}
}
}