-
Notifications
You must be signed in to change notification settings - Fork 0
/
delim.go
54 lines (42 loc) · 1.29 KB
/
delim.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
// Copyright 2016 David Lavieri. All rights reserved.
// Use of this source code is governed by a MIT License
// License that can be found in the LICENSE file.
package main
import (
"regexp"
"strings"
)
// ------------ LDELIM
func parseLDelim(line string) (string, bool, bool) {
if !strings.Contains(line, "{ldelim}") {
return line, false, false
}
chars := []string{`"`, `'`, "`"}
for _, c := range chars {
p := `(.*?)([\` + c + `](.*?(\{ldelim\})?.*?)[\` + c + `])(.*)`
matches := regexp.MustCompile(p).FindStringSubmatch(line)
if matches != nil {
l, lm, _ := parseLDelim(matches[1])
r, rm, _ := parseLDelim(matches[5])
return l + matches[2] + r, lm || rm, true
}
}
return strings.Replace(line, "{ldelim}", "{", -1), true, false
}
// ------------ RDELIM
func parseRDelim(line string) (string, bool, bool) {
if !strings.Contains(line, "{rdelim}") {
return line, false, false
}
chars := []string{`"`, `'`, "`"}
for _, c := range chars {
p := `(.*?)([\` + c + `](.*?(\{rdelim\})?.*?)[\` + c + `])(.*)`
matches := regexp.MustCompile(p).FindStringSubmatch(line)
if matches != nil {
l, lm, _ := parseRDelim(matches[1])
r, rm, _ := parseRDelim(matches[5])
return l + matches[2] + r, lm || rm, true
}
}
return strings.Replace(line, "{rdelim}", "}", -1), true, false
}