/
utils.go
298 lines (272 loc) · 6.61 KB
/
utils.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
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
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
package nvimboat
import (
"errors"
"fmt"
"os"
"reflect"
"regexp"
"slices"
"sort"
"strings"
"time"
md "github.com/JohannesKaufmann/html-to-markdown"
"github.com/neovim/go-client/nvim"
)
func articlesUneadQuery(n int) string {
if n == 0 {
return ""
}
const (
prefix = `SELECT COUNT(unread) FROM rss_item WHERE unread = 1 AND url IN (?`
suffix = `)`
)
if n < 2 {
return prefix + suffix
}
articleCount := strings.Repeat(", ?", n-1)
return prefix + articleCount + suffix
}
func addColumn(nv *nvim.Nvim, buffer nvim.Buffer, col []string, separator string) (err error) {
currentLines, err := nv.BufferLines(buffer, 0, -1, false)
if err != nil {
return
}
var (
diff int
lines = []string{}
)
diff = (len(col) - len(currentLines))
for i := 0; i < diff; i++ {
currentLines = append(currentLines, []byte{})
}
for i, c := range col {
lines = append(lines, string(currentLines[i])+separator+c)
}
err = setLines(nv, buffer, lines)
if err != nil {
return
}
vcl, err := virtColLens(nv)
if err != nil {
return
}
maxLineLen := slices.Max(vcl)
for i, l := range lines {
diff = maxLineLen - vcl[i]
lines[i] = l + strings.Repeat(" ", diff)
}
err = setLines(nv, buffer, lines)
return err
}
func virtColLens(nv *nvim.Nvim) (evalResult []int, err error) {
virtCols := "map(range(1, line('$')), \"virtcol([v:val, '$'])\")"
err = nv.Eval(virtCols, &evalResult)
return
}
func trimTrail(nv *nvim.Nvim, buffer nvim.Buffer) (err error) {
currentLines, err := nv.BufferLines(buffer, 0, -1, false)
if err != nil {
return
}
var lines []string
for _, l := range currentLines {
lines = append(lines, strings.TrimRight(string(l), " "))
}
err = setLines(nv, buffer, lines)
return
}
func parseFilters(configFilters []map[string]any) (filters []*Filter, err error) {
for _, filter := range configFilters {
f := new(Filter)
if name, ok := filter["name"]; ok {
f.Name = name.(string)
} else {
err = fmt.Errorf("Failed to parse: %v", filter)
return
}
if query, ok := filter["query"]; ok {
f.Query = query.(string)
f.FilterID = "query: " + query.(string) + ", tags: "
} else {
err = fmt.Errorf("Failed to parse: %v", filter)
return
}
if tags, ok := filter["tags"]; ok {
for _, tag := range tags.([]any) {
if len(tag.(string)) == 0 {
continue
}
if tag.(string)[0] != '!' {
f.IncludeTags = append(f.IncludeTags, tag.(string))
} else {
f.ExcludeTags = append(f.ExcludeTags, tag.(string)[1:])
}
f.FilterID += tag.(string) + ", "
}
}
if f.FilterID[len(f.FilterID)-2:] == ", " {
f.FilterID = f.FilterID[:len(f.FilterID)-2]
}
filters = append(filters, f)
}
return
}
func parseFilterID(id string) (query string, includeTags []string, excludeTags []string) {
query, rawTags, _ := strings.Cut(id, ", ")
_, query, _ = strings.Cut(query, "query: ")
_, rawTags, _ = strings.Cut(rawTags, "tags: ")
tags := strings.Split(rawTags, ", ")
for _, t := range tags {
if string(t[0]) == "!" {
excludeTags = append(excludeTags, t[1:])
} else {
includeTags = append(includeTags, t)
}
}
return
}
func strings2bytes(stringSlice []string) (byteSlices [][]byte) {
for _, s := range stringSlice {
byteSlices = append(byteSlices, []byte(s))
}
return
}
func unixToDate(unixTime int) (string, error) {
tz, err := time.LoadLocation("Local")
if err != nil {
return "", err
}
ut := time.Unix(int64(unixTime), 0)
dateString := ut.In(tz).Format("02 Jan 06")
return dateString, nil
}
func extracUrls(content string) (links []string) {
re := regexp.MustCompile(`\b((?:https?|ftp|file):\/\/[-a-zA-Z0-9+&@#\/%?=~_|!:,.;]*[-a-zA-Z0-9+&@#\/%=~_|])`)
matches := re.FindAll([]byte(content), -1)
for _, l := range matches {
links = append(links, string(l))
}
return links
}
func renderHTML(content string) ([]string, error) {
converter := md.NewConverter("", true, nil)
markdown, err := converter.ConvertString(content)
if err != nil {
return nil, err
}
return strings.Split(markdown, "\n"), nil
}
func pageTypeString(p Page) (name string) {
fullName := fmt.Sprintf("%T", p)
_, name, _ = strings.Cut(fullName, "nvimboat.")
return
}
func articlesFilterQuery(query string, n int) string {
const (
prefix = `
SELECT guid, title, author, url, feedurl, pubDate, content, unread
FROM rss_item WHERE deleted = 0 AND feedurl in (?
`
suffix = ` ORDER BY pubDate DESC`
)
var glue string
if query != "" {
glue = `) AND `
} else {
glue = `) `
}
if n < 2 {
return prefix + glue + query + suffix
}
articleCount := strings.Repeat(", ?", n-1)
return prefix + articleCount + glue + query + suffix
}
func filterTags(configFeeds []map[string]any, inTags, exTags []string) (urls []any) {
feedurls := make(map[string]bool)
for _, feed := range configFeeds {
if subset(inTags, anyToString(feed["tags"].([]any))) {
feedurls[feed["rssurl"].(string)] = true
}
}
for _, feed := range configFeeds {
for _, tag := range anyToString(feed["tags"].([]any)) {
if slices.Contains(exTags, tag) {
delete(feedurls, feed["rssurl"].(string))
continue
}
}
}
for url := range feedurls {
urls = append(urls, url)
}
return
}
func setLines(nv *nvim.Nvim, buffer nvim.Buffer, lines []string) (err error) {
err = nv.SetBufferLines(buffer, 0, -1, false, strings2bytes(lines))
return
}
func tagFeedsQuery(feedurls []any) string {
n := len(feedurls)
if n == 0 {
return ""
}
p1 := `
SELECT rss_feed.title, c.* FROM rss_feed
LEFT JOIN (
SELECT a.feedurl, b.unreadCount, a.articleCount
FROM (
SELECT feedurl, COUNT(*) AS articleCount
FROM rss_item WHERE feedurl in (?`
p2 := `)
GROUP BY feedurl
) a
LEFT JOIN (
SELECT feedurl, sum(unread) AS unreadCount
FROM rss_item WHERE feedurl in (?`
p3 := `)
GROUP BY feedurl
) b
ON a.feedurl = b.feedurl
) c
ON rss_feed.rssurl = c.feedurl
WHERE rssurl in (?`
p4 := `)
ORDER BY rss_feed.title`
if n < 2 {
return p1 + p2 + p3 + p4
}
reps := strings.Repeat(", ?", n-1)
return p1 + reps + p2 + reps + p3 + reps + p4
}
func subset(first, second []string) bool {
set := make(map[string]bool)
for _, value := range second {
set[value] = true
}
for _, value := range first {
if item, found := set[value]; !found {
return false
} else if !item {
return false
}
}
return true
}
func anyToString(base []any) (conv []string) {
for _, a := range base {
conv = append(conv, a.(string))
}
return
}
func fileExists(f string) bool {
_, err := os.Stat(f)
return !errors.Is(err, os.ErrNotExist)
}
func sortedMapKeys(m interface{}) (keyList []string) {
keys := reflect.ValueOf(m).MapKeys()
for _, key := range keys {
keyList = append(keyList, key.Interface().(string))
}
sort.Strings(keyList)
return
}