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
|
/* date.cc: date range parsing routines for omega
*
* Copyright 1999,2000,2001 BrightStation PLC
* Copyright 2001 James Aylett
* Copyright 2001,2002 Ananova Ltd
* Copyright 2002 Intercede 1749 Ltd
* Copyright 2002,2003,2006,2014,2016 Olly Betts
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License as
* published by the Free Software Foundation; either version 2 of the
* License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301
* USA
*/
#include <config.h>
#include "date.h"
#include <vector>
#include <cstdlib>
#include <ctime>
using namespace std;
static int
last_day(int y, int m)
{
static const int l[13] = {
0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31
};
if (m != 2) return l[m];
return 28 + (y % 4 == 0); // good until 2100
}
// Write exactly w chars to buffer p representing integer v.
//
// The result is left padded with zeros if v < pow(10, w - 1).
//
// If v >= pow(10, w), then the output will show v % pow(10, w) (i.e. the
// most significant digits are lost).
static void
format_int_fixed_width(char * p, int v, int w)
{
while (--w >= 0) {
p[w] = '0' + (v % 10);
v /= 10;
}
}
static Xapian::Query
date_range_filter(int y1, int m1, int d1, int y2, int m2, int d2)
{
char buf[10];
format_int_fixed_width(buf + 1, y1, 4);
format_int_fixed_width(buf + 5, m1, 2);
vector<Xapian::Query> v;
int d_last = last_day(y1, m1);
int d_end = d_last;
if (y1 == y2 && m1 == m2 && d2 < d_last) {
d_end = d2;
}
// Deal with any initial partial month
if (d1 > 1 || d_end < d_last) {
buf[0] = 'D';
for ( ; d1 <= d_end; ++d1) {
format_int_fixed_width(buf + 7, d1, 2);
v.push_back(Xapian::Query(string(buf, 9)));
}
} else {
buf[0] = 'M';
v.push_back(Xapian::Query(string(buf, 7)));
}
if (y1 == y2 && m1 == m2) {
return Xapian::Query(Xapian::Query::OP_OR, v.begin(), v.end());
}
int m_last = (y1 < y2) ? 12 : m2 - 1;
while (++m1 <= m_last) {
format_int_fixed_width(buf + 5, m1, 2);
buf[0] = 'M';
v.push_back(Xapian::Query(string(buf, 7)));
}
if (y1 < y2) {
while (++y1 < y2) {
format_int_fixed_width(buf + 1, y1, 4);
buf[0] = 'Y';
v.push_back(Xapian::Query(string(buf, 5)));
}
format_int_fixed_width(buf + 1, y2, 4);
buf[0] = 'M';
for (m1 = 1; m1 < m2; ++m1) {
format_int_fixed_width(buf + 5, m1, 2);
v.push_back(Xapian::Query(string(buf, 7)));
}
}
format_int_fixed_width(buf + 5, m2, 2);
// Deal with any final partial month
if (d2 < last_day(y2, m2)) {
buf[0] = 'D';
for (d1 = 1; d1 <= d2; ++d1) {
format_int_fixed_width(buf + 7, d1, 2);
v.push_back(Xapian::Query(string(buf, 9)));
}
} else {
buf[0] = 'M';
v.push_back(Xapian::Query(string(buf, 7)));
}
return Xapian::Query(Xapian::Query::OP_OR, v.begin(), v.end());
}
static void
parse_date(const string & date, int *y, int *m, int *d)
{
// FIXME: for now only support YYYYMMDD (e.g. 20011119)
// and don't error check
*y = atoi(date.substr(0, 4).c_str());
*m = atoi(date.substr(4, 2).c_str());
*d = atoi(date.substr(6, 2).c_str());
}
Xapian::Query
date_range_filter(const string & date_start, const string & date_end,
const string & date_span)
{
int y1, m1, d1, y2, m2, d2;
if (!date_span.empty()) {
time_t secs = atoi(date_span.c_str()) * (24 * 60 * 60);
if (!date_end.empty()) {
parse_date(date_end, &y2, &m2, &d2);
struct tm t;
t.tm_year = y2 - 1900;
t.tm_mon = m2 - 1;
t.tm_mday = d2;
t.tm_hour = 12;
t.tm_min = t.tm_sec = 0;
t.tm_isdst = -1;
time_t then = mktime(&t) - secs;
struct tm *t2 = localtime(&then);
y1 = t2->tm_year + 1900;
m1 = t2->tm_mon + 1;
d1 = t2->tm_mday;
} else if (!date_start.empty()) {
parse_date(date_start, &y1, &m1, &d1);
struct tm t;
t.tm_year = y1 - 1900;
t.tm_mon = m1 - 1;
t.tm_mday = d1;
t.tm_hour = 12;
t.tm_min = t.tm_sec = 0;
t.tm_isdst = -1;
time_t end = mktime(&t) + secs;
struct tm *t2 = localtime(&end);
y2 = t2->tm_year + 1900;
m2 = t2->tm_mon + 1;
d2 = t2->tm_mday;
} else {
time_t end = time(NULL);
struct tm *t = localtime(&end);
y2 = t->tm_year + 1900;
m2 = t->tm_mon + 1;
d2 = t->tm_mday;
time_t then = end - secs;
struct tm *t2 = localtime(&then);
y1 = t2->tm_year + 1900;
m1 = t2->tm_mon + 1;
d1 = t2->tm_mday;
}
} else {
if (date_start.empty()) {
y1 = 1970;
m1 = 1;
d1 = 1;
} else {
parse_date(date_start, &y1, &m1, &d1);
}
if (date_end.empty()) {
time_t now = time(NULL);
struct tm *t = localtime(&now);
y2 = t->tm_year + 1900;
m2 = t->tm_mon + 1;
d2 = t->tm_mday;
} else {
parse_date(date_end, &y2, &m2, &d2);
}
}
return date_range_filter(y1, m1, d1, y2, m2, d2);
}
|
