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 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244
|
package jid
import (
"regexp"
"strings"
"github.com/mattn/go-runewidth"
)
type QueryInterface interface {
Get() []rune
Set(query []rune) []rune
Insert(query []rune, idx int) []rune
Add(query []rune) []rune
Delete(i int) []rune
Clear() []rune
Length() int
IndexOffset(int) int
GetChar(int) rune
GetKeywords() [][]rune
GetLastKeyword() []rune
PopKeyword() ([]rune, []rune)
StringGet() string
StringSet(query string) string
StringInsert(query string, idx int) string
StringAdd(query string) string
StringGetKeywords() []string
StringGetLastKeyword() string
StringPopKeyword() (string, []rune)
}
type Query struct {
query *[]rune
complete *[]rune
}
func NewQuery(query []rune) *Query {
q := &Query{
query: &[]rune{},
complete: &[]rune{},
}
_ = q.Set(query)
return q
}
func NewQueryWithString(query string) *Query {
return NewQuery([]rune(query))
}
func (q *Query) Get() []rune {
return *q.query
}
func (q *Query) GetChar(idx int) rune {
var r rune = 0
qq := q.Get()
if l := len(qq); l > idx && idx >= 0 {
r = qq[idx]
}
return r
}
func (q *Query) Length() int {
return len(q.Get())
}
func (q *Query) IndexOffset(i int) int {
o := 0
if l := q.Length(); i >= l {
o = runewidth.StringWidth(q.StringGet())
} else if i >= 0 && i < l {
o = runewidth.StringWidth(string(q.Get()[:i]))
}
return o
}
func (q *Query) Set(query []rune) []rune {
if validate(query) {
q.query = &query
}
return q.Get()
}
func (q *Query) Insert(query []rune, idx int) []rune {
qq := q.Get()
if idx == 0 {
qq = append(query, qq...)
} else if idx > 0 && len(qq) >= idx {
_q := make([]rune, idx+len(query)-1)
copy(_q, qq[:idx])
qq = append(append(_q, query...), qq[idx:]...)
}
return q.Set(qq)
}
func (q *Query) StringInsert(query string, idx int) string {
return string(q.Insert([]rune(query), idx))
}
func (q *Query) Add(query []rune) []rune {
return q.Set(append(q.Get(), query...))
}
func (q *Query) Delete(i int) []rune {
var d []rune
qq := q.Get()
lastIdx := len(qq)
if i < 0 {
if lastIdx+i >= 0 {
d = qq[lastIdx+i:]
qq = qq[0 : lastIdx+i]
} else {
d = qq
qq = qq[0:0]
}
} else if i == 0 {
d = []rune{}
qq = qq[1:]
} else if i > 0 && i < lastIdx {
d = []rune{qq[i]}
qq = append(qq[:i], qq[i+1:]...)
}
_ = q.Set(qq)
return d
}
func (q *Query) Clear() []rune {
return q.Set([]rune(""))
}
func (q *Query) GetKeywords() [][]rune {
query := string(*q.query)
if query == "" {
return [][]rune{}
}
splitQuery := strings.Split(query, ".")
lastIdx := len(splitQuery) - 1
keywords := [][]rune{}
for i, keyword := range splitQuery {
if keyword != "" || i == lastIdx {
re := regexp.MustCompile(`\[[0-9]*\]?`)
matchIndexes := re.FindAllStringIndex(keyword, -1)
if len(matchIndexes) < 1 {
keywords = append(keywords, []rune(keyword))
} else {
if matchIndexes[0][0] > 0 {
keywords = append(keywords, []rune(keyword[0:matchIndexes[0][0]]))
}
for _, matchIndex := range matchIndexes {
k := keyword[matchIndex[0]:matchIndex[1]]
keywords = append(keywords, []rune(k))
}
}
}
}
return keywords
}
func (q *Query) GetLastKeyword() []rune {
keywords := q.GetKeywords()
if l := len(keywords); l > 0 {
return keywords[l-1]
}
return []rune("")
}
func (q *Query) StringGetLastKeyword() string {
return string(q.GetLastKeyword())
}
func (q *Query) PopKeyword() ([]rune, []rune) {
var keyword []rune
var lastSepIdx int
var lastBracketIdx int
qq := q.Get()
for i, e := range qq {
if e == '.' {
lastSepIdx = i
} else if e == '[' {
lastBracketIdx = i
}
}
if lastBracketIdx > lastSepIdx {
lastSepIdx = lastBracketIdx
}
keywords := q.GetKeywords()
if l := len(keywords); l > 0 {
keyword = keywords[l-1]
}
query := q.Set(qq[0:lastSepIdx])
return keyword, query
}
func (q *Query) StringGet() string {
return string(q.Get())
}
func (q *Query) StringSet(query string) string {
return string(q.Set([]rune(query)))
}
func (q *Query) StringAdd(query string) string {
return string(q.Add([]rune(query)))
}
func (q *Query) StringGetKeywords() []string {
var keywords []string
for _, keyword := range q.GetKeywords() {
keywords = append(keywords, string(keyword))
}
return keywords
}
func (q *Query) StringPopKeyword() (string, []rune) {
keyword, query := q.PopKeyword()
return string(keyword), query
}
func validate(r []rune) bool {
s := string(r)
if s == "" {
return true
}
if regexp.MustCompile(`^[^.]`).MatchString(s) {
return false
}
if regexp.MustCompile(`\.{2,}`).MatchString(s) {
return false
}
if regexp.MustCompile(`\[[0-9]*\][^\.\[]`).MatchString(s) {
return false
}
if regexp.MustCompile(`\[{2,}|\]{2,}`).MatchString(s) {
return false
}
if regexp.MustCompile(`.\.\[`).MatchString(s) {
return false
}
return true
}
|