-
Notifications
You must be signed in to change notification settings - Fork 0
/
core.go
71 lines (63 loc) · 1.65 KB
/
core.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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
package main
import (
"encoding/base64"
"regexp"
"strings"
)
func junkEncode(input string) string {
b64Str := base64.StdEncoding.EncodeToString([]byte(input))
var junk strings.Builder
iLast := len(b64Str) - 1
for i, c := range b64Str {
isLastOne := i == iLast
switch i % 3 {
case 0:
if val, matched := nouns[c]; matched {
junk.WriteString(val)
} else {
junk.WriteRune('$')
}
case 1:
if val, matched := verbs[c]; matched {
junk.WriteString(val)
} else {
junk.WriteRune('$')
}
default:
if val, matched := nouns[c]; matched {
junk.WriteString(val)
} else {
junk.WriteRune('$')
}
if !isLastOne {
junk.WriteString(",")
}
}
if isLastOne {
junk.WriteString("。")
}
}
return junk.String()
}
var sepPattern *regexp.Regexp
func init() {
sepPattern = regexp.MustCompile(`[,。]`)
}
func junkDecode(input string) string {
filtered := sepPattern.ReplaceAllString(input, "")
runes := []rune(filtered)
var head []rune
var result strings.Builder
for i := 0; len(runes) >= 2; i++ {
head, runes = runes[:2], runes[2:]
dict := revNouns
if i%3 == 1 {
dict = revVerbs
}
if val, matched := dict[string(head)]; matched {
result.WriteRune(val)
}
}
resultStr, _ := base64.StdEncoding.DecodeString(result.String())
return string(resultStr)
}