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
|
package bible
import (
"regexp"
"strconv"
"strings"
)
var refRe = regexp.MustCompile(`^(.*?)\s+(\d+):(.+)$`)
// SplitRef splits a ref whose verse list mixes single verses and ranges into
// one ref per group (the kjv tools reject a mixed list in a single query).
func SplitRef(ref string) []string {
m := refRe.FindStringSubmatch(ref)
if m == nil {
return []string{ref}
}
book, chap, verses := m[1], m[2], m[3]
if !strings.Contains(verses, ",") {
return []string{ref}
}
var out []string
for _, g := range strings.Split(verses, ",") {
g = strings.TrimSpace(g)
if g == "" {
continue
}
if strings.Contains(g, ":") {
out = append(out, book+" "+g)
} else {
out = append(out, book+" "+chap+":"+g)
}
}
return out
}
// Lookup resolves an English-style reference against a version, returning the
// matched verses (in order) and the sub-refs the corpus had no entry for.
func Lookup(version, ref string) ([]Verse, []string) {
var verses []Verse
var missing []string
for _, part := range SplitRef(ref) {
m := refRe.FindStringSubmatch(part)
if m == nil {
missing = append(missing, part)
continue
}
book, ok := ResolveBook(m[1])
if !ok {
missing = append(missing, part)
continue
}
chap, _ := strconv.Atoi(m[2])
from, to := verseRange(m[3])
found := false
for _, v := range Verses(version, book, chap) {
if v.Verse >= from && v.Verse <= to {
verses = append(verses, v)
found = true
}
}
if !found {
missing = append(missing, part)
}
}
return verses, missing
}
func verseRange(s string) (int, int) {
s = strings.TrimSpace(s)
if i := strings.IndexAny(s, "-–—"); i >= 0 {
from, _ := strconv.Atoi(strings.TrimSpace(s[:i]))
to, _ := strconv.Atoi(strings.TrimSpace(s[i+1:]))
return from, to
}
n, _ := strconv.Atoi(s)
return n, n
}
|
