126 lines
3.2 KiB
C++
126 lines
3.2 KiB
C++
/* The dates-to-query routine is is lifted quasi-verbatim but
|
|
* modified from xapian-omega:date.cc. Copyright info:
|
|
*
|
|
* Copyright 1999,2000,2001 BrightStation PLC
|
|
* Copyright 2001 James Aylett
|
|
* Copyright 2001,2002 Ananova Ltd
|
|
* Copyright 2002 Intercede 1749 Ltd
|
|
* Copyright 2002,2003,2006 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 "autoconfig.h"
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <vector>
|
|
using namespace std;
|
|
|
|
#include <xapian.h>
|
|
|
|
#include "debuglog.h"
|
|
#include "rclconfig.h"
|
|
|
|
namespace Rcl {
|
|
|
|
static inline void bufprefix(char *buf, char c)
|
|
{
|
|
if (o_index_stripchars) {
|
|
buf[0] = c;
|
|
} else {
|
|
buf[0] = ':';
|
|
buf[1] = c;
|
|
buf[2] = ':';
|
|
}
|
|
}
|
|
static inline int bpoffs()
|
|
{
|
|
return o_index_stripchars ? 1 : 3;
|
|
}
|
|
|
|
Xapian::Query date_range_filter(int y1, int m1, int d1, int y2, int m2, int d2)
|
|
{
|
|
// Xapian uses a smallbuf and snprintf. Can't be bothered, we're
|
|
// doing at most 3 %d's !
|
|
char buf[200];
|
|
vector<Xapian::Query> v;
|
|
|
|
// Deal with days till the end of the first month if any
|
|
bufprefix(buf, 'D');
|
|
sprintf(buf + bpoffs(), "%04d%02d", y1, m1);
|
|
int d_last = monthdays(m1, y1);
|
|
int d_end = d_last;
|
|
if (y1 == y2 && m1 == m2 && d2 < d_last) {
|
|
d_end = d2;
|
|
}
|
|
if (d1 > 1 || d_end < d_last) {
|
|
for ( ; d1 <= d_end ; d1++) {
|
|
sprintf(buf + 6 + bpoffs(), "%02d", d1);
|
|
v.push_back(Xapian::Query(buf));
|
|
}
|
|
} else {
|
|
bufprefix(buf, 'M');
|
|
v.push_back(Xapian::Query(buf));
|
|
}
|
|
|
|
if (y1 == y2 && m1 == m2) {
|
|
return Xapian::Query(Xapian::Query::OP_OR, v.begin(), v.end());
|
|
}
|
|
|
|
// Months till the end of first year
|
|
int m_last = (y1 < y2) ? 12 : m2 - 1;
|
|
bufprefix(buf, 'M');
|
|
while (++m1 <= m_last) {
|
|
sprintf(buf + 4 + bpoffs(), "%02d", m1);
|
|
v.push_back(Xapian::Query(buf));
|
|
}
|
|
|
|
// Years inbetween and first months of the last year
|
|
if (y1 < y2) {
|
|
bufprefix(buf, 'Y');
|
|
while (++y1 < y2) {
|
|
sprintf(buf + bpoffs(), "%04d", y1);
|
|
v.push_back(Xapian::Query(buf));
|
|
}
|
|
bufprefix(buf, 'M');
|
|
sprintf(buf + bpoffs(), "%04d", y2);
|
|
for (m1 = 1; m1 < m2; m1++) {
|
|
sprintf(buf + 4 + bpoffs(), "%02d", m1);
|
|
v.push_back(Xapian::Query(buf));
|
|
}
|
|
}
|
|
|
|
// Last month
|
|
sprintf(buf + 4 + bpoffs(), "%02d", m2);
|
|
|
|
// Deal with any final partial month
|
|
if (d2 < monthdays(m2, y2)) {
|
|
bufprefix(buf, 'D');
|
|
for (d1 = 1 ; d1 <= d2; d1++) {
|
|
sprintf(buf + 6 + bpoffs(), "%02d", d1);
|
|
v.push_back(Xapian::Query(buf));
|
|
}
|
|
} else {
|
|
bufprefix(buf, 'M');
|
|
v.push_back(Xapian::Query(buf));
|
|
}
|
|
|
|
return Xapian::Query(Xapian::Query::OP_OR, v.begin(), v.end());
|
|
}
|
|
|
|
|
|
}
|
|
|