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
|
#include "pms_match.h"
#include "pms_data.h"
#include "pms_util.h"
#include <limits.h>
#include <stdbool.h>
#include <stddef.h>
static bool verse_matches(const pms_ref *ref, const pms_verse *v) {
switch (ref->type) {
case PMS_REF_SEARCH: {
if (ref->book != 0 && (unsigned int)v->book != ref->book) {
return false;
}
if (ref->chapter != 0 && (unsigned int)v->chapter != ref->chapter) {
return false;
}
char folded[4096];
pms_fold_utf8(v->text, folded, sizeof(folded), NULL);
return regexec(&ref->search, folded, 0, NULL, 0) == 0;
}
case PMS_REF_EXACT:
return (unsigned int)v->book == ref->book &&
(ref->chapter == 0 || (unsigned int)v->chapter == ref->chapter) &&
(ref->verse == 0 || (unsigned int)v->verse == ref->verse);
case PMS_REF_EXACT_SET:
if ((unsigned int)v->book != ref->book || (unsigned int)v->chapter != ref->chapter) {
return false;
}
for (int i = 0; i < ref->verse_set_count; i++) {
if ((unsigned int)v->verse == ref->verse_set[i]) {
return true;
}
}
return false;
case PMS_REF_RANGE:
return (unsigned int)v->book == ref->book &&
((ref->chapter_end == 0 && (unsigned int)v->chapter == ref->chapter) ||
((unsigned int)v->chapter >= ref->chapter && (unsigned int)v->chapter <= ref->chapter_end)) &&
(ref->verse == 0 || (unsigned int)v->verse >= ref->verse) &&
(ref->verse_end == 0 || (unsigned int)v->verse <= ref->verse_end);
case PMS_REF_RANGE_EXT:
return (unsigned int)v->book == ref->book &&
(((unsigned int)v->chapter == ref->chapter && (unsigned int)v->verse >= ref->verse && ref->chapter != ref->chapter_end) ||
((unsigned int)v->chapter > ref->chapter && (unsigned int)v->chapter < ref->chapter_end) ||
((unsigned int)v->chapter == ref->chapter_end && (unsigned int)v->verse <= ref->verse_end && ref->chapter != ref->chapter_end) ||
(ref->chapter == ref->chapter_end && (unsigned int)v->chapter == ref->chapter &&
(unsigned int)v->verse >= ref->verse && (unsigned int)v->verse <= ref->verse_end));
default:
return false;
}
}
static pms_range chapter_bounds(int i, const pms_config *config) {
pms_range bounds = {.start = i, .end = i + 1};
int book = pms_verses[i].book;
int chapter = pms_verses[i].chapter;
int max_before = config->chapter_context ? INT_MAX : config->before_context;
for (int n = 0; n < max_before && bounds.start > 0; n++) {
if (pms_verses[bounds.start - 1].book == book &&
(!config->chapter_context || pms_verses[bounds.start - 1].chapter == chapter)) {
bounds.start--;
} else {
break;
}
}
int max_after = config->chapter_context ? INT_MAX : config->after_context;
for (int n = 0; n < max_after && bounds.end < pms_verses_length; n++) {
if (pms_verses[bounds.end].book == book &&
(!config->chapter_context || pms_verses[bounds.end].chapter == chapter)) {
bounds.end++;
} else {
break;
}
}
return bounds;
}
static int find_next_match(const pms_ref *ref, const pms_config *config, int i, pms_range *range) {
for (; i < pms_verses_length; i++) {
if (verse_matches(ref, &pms_verses[i])) {
*range = chapter_bounds(i, config);
return i;
}
}
return -1;
}
int pms_next_verse(const pms_ref *ref, const pms_config *config, pms_match_data *data) {
if (data->current >= pms_verses_length) {
return -1;
}
if (data->current == 0 && data->next_match == 0) {
data->matches[0] = (pms_range){-1, -1};
data->matches[1] = (pms_range){-1, -1};
data->next_match = find_next_match(ref, config, 0, &data->matches[0]);
if (data->next_match < 0) {
data->current = pms_verses_length;
return -1;
}
data->next_match = find_next_match(ref, config, data->next_match + 1, &data->matches[1]);
}
while (data->matches[1].start != -1 && data->matches[1].start <= data->matches[0].end) {
if (data->matches[1].end > data->matches[0].end) {
data->matches[0].end = data->matches[1].end;
}
data->matches[1] = (pms_range){-1, -1};
if (data->next_match >= 0) {
data->next_match = find_next_match(ref, config, data->next_match + 1, &data->matches[1]);
}
}
if (data->current < data->matches[0].start) {
data->current = data->matches[0].start;
}
if (data->current < data->matches[0].end) {
return data->current++;
}
if (data->matches[1].start != -1) {
data->matches[0] = data->matches[1];
data->matches[1] = (pms_range){-1, -1};
if (data->next_match >= 0) {
data->next_match = find_next_match(ref, config, data->next_match + 1, &data->matches[1]);
}
return pms_next_verse(ref, config, data);
}
data->current = pms_verses_length;
return -1;
}
|
