2011-06-02 16:36:15 +02:00
|
|
|
/* -*- mode: c++; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*-
|
2011-08-30 21:01:30 +02:00
|
|
|
**
|
2011-03-22 22:37:01 +01:00
|
|
|
** Copyright (C) 2008-2011 Dirk-Jan C. Binnema <djcb@djcbsoftware.nl>
|
2010-08-25 20:40:07 +02:00
|
|
|
**
|
|
|
|
** 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 3 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 Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
|
|
**
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <iostream>
|
|
|
|
#include <string.h>
|
|
|
|
#include <errno.h>
|
2011-06-18 17:47:46 +02:00
|
|
|
#include <algorithm>
|
2010-09-05 11:37:12 +02:00
|
|
|
#include <xapian.h>
|
2011-06-18 17:47:46 +02:00
|
|
|
#include <string>
|
2010-08-25 20:40:07 +02:00
|
|
|
|
|
|
|
#include "mu-util.h"
|
2011-05-19 06:32:09 +02:00
|
|
|
#include "mu-msg.h"
|
2010-08-25 20:40:07 +02:00
|
|
|
#include "mu-msg-iter.h"
|
2011-06-30 22:45:53 +02:00
|
|
|
#include "mu-threader.h"
|
2011-05-18 22:33:56 +02:00
|
|
|
|
2011-06-03 07:22:56 +02:00
|
|
|
/* just a guess... */
|
|
|
|
#define MAX_FETCH_SIZE 10000
|
|
|
|
|
2011-06-18 17:47:46 +02:00
|
|
|
class ThreadKeyMaker: public Xapian::KeyMaker {
|
|
|
|
public:
|
|
|
|
ThreadKeyMaker (GHashTable *threadinfo): _threadinfo(threadinfo) {}
|
|
|
|
virtual std::string operator()(const Xapian::Document &doc) const {
|
2011-06-23 23:21:54 +02:00
|
|
|
MuMsgIterThreadInfo *ti;
|
|
|
|
ti = (MuMsgIterThreadInfo*)g_hash_table_lookup
|
2011-06-18 17:47:46 +02:00
|
|
|
(_threadinfo,
|
2011-08-30 21:01:30 +02:00
|
|
|
GUINT_TO_POINTER(doc.get_docid()));
|
2011-06-23 23:21:54 +02:00
|
|
|
return std::string (ti && ti->threadpath ? ti->threadpath : "");
|
2011-06-18 17:47:46 +02:00
|
|
|
}
|
|
|
|
private:
|
2011-08-30 21:01:30 +02:00
|
|
|
GHashTable *_threadinfo;
|
2011-06-18 17:47:46 +02:00
|
|
|
};
|
2011-06-03 07:22:56 +02:00
|
|
|
|
2011-05-18 22:33:56 +02:00
|
|
|
|
2010-08-25 20:40:07 +02:00
|
|
|
struct _MuMsgIter {
|
2011-08-30 21:01:30 +02:00
|
|
|
public:
|
2011-07-02 10:27:08 +02:00
|
|
|
_MuMsgIter (Xapian::Enquire &enq, size_t maxnum,
|
|
|
|
gboolean threads, MuMsgFieldId sortfield):
|
2011-08-30 21:01:30 +02:00
|
|
|
_enq(enq), _thread_hash (0), _msg(0) {
|
|
|
|
|
2011-06-02 16:59:49 +02:00
|
|
|
_matches = _enq.get_mset (0, maxnum);
|
2011-06-18 17:47:46 +02:00
|
|
|
|
2011-08-30 21:01:30 +02:00
|
|
|
if (threads && !_matches.empty()) {
|
2011-07-02 10:27:08 +02:00
|
|
|
|
2011-06-18 17:47:46 +02:00
|
|
|
_matches.fetch();
|
2011-08-30 21:01:30 +02:00
|
|
|
_thread_hash = mu_threader_calculate
|
2011-07-02 10:27:08 +02:00
|
|
|
(this, _matches.size(), sortfield);
|
|
|
|
|
2011-08-30 21:01:30 +02:00
|
|
|
ThreadKeyMaker keymaker(_thread_hash);
|
2011-07-02 10:27:08 +02:00
|
|
|
|
2011-06-18 17:47:46 +02:00
|
|
|
enq.set_sort_by_key (&keymaker, false);
|
|
|
|
_matches = _enq.get_mset (0, maxnum);
|
|
|
|
}
|
|
|
|
|
2011-06-02 16:59:49 +02:00
|
|
|
_cursor = _matches.begin();
|
2011-06-03 07:22:56 +02:00
|
|
|
|
|
|
|
/* this seems to make search slightly faster, some
|
2011-08-30 21:01:30 +02:00
|
|
|
* non-scientific testing suggests. 5-10% or so */
|
2011-06-03 07:22:56 +02:00
|
|
|
if (_matches.size() <= MAX_FETCH_SIZE)
|
|
|
|
_matches.fetch ();
|
2011-06-02 16:59:49 +02:00
|
|
|
}
|
2011-08-30 21:01:30 +02:00
|
|
|
|
2011-06-02 16:59:49 +02:00
|
|
|
~_MuMsgIter () {
|
2011-08-30 21:01:30 +02:00
|
|
|
if (_thread_hash)
|
|
|
|
g_hash_table_destroy (_thread_hash);
|
|
|
|
set_msg (NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
const Xapian::Enquire& enquire() { return _enq; }
|
|
|
|
Xapian::MSet& matches() { return _matches; }
|
|
|
|
|
|
|
|
Xapian::MSet::const_iterator cursor () const { return _cursor; }
|
|
|
|
void set_cursor (Xapian::MSetIterator cur) { _cursor = cur; }
|
|
|
|
void cursor_next () { ++_cursor; }
|
|
|
|
|
|
|
|
GHashTable *thread_hash () { return _thread_hash; }
|
|
|
|
|
|
|
|
MuMsg *msg() { return _msg; }
|
|
|
|
MuMsg *set_msg (MuMsg *msg) {
|
2011-06-02 16:59:49 +02:00
|
|
|
if (_msg)
|
|
|
|
mu_msg_unref (_msg);
|
2011-08-30 21:01:30 +02:00
|
|
|
return _msg = msg;
|
2011-06-02 16:59:49 +02:00
|
|
|
}
|
2011-08-30 21:01:30 +02:00
|
|
|
private:
|
2011-06-13 22:04:20 +02:00
|
|
|
const Xapian::Enquire _enq;
|
|
|
|
Xapian::MSet _matches;
|
|
|
|
Xapian::MSet::const_iterator _cursor;
|
2011-08-30 21:01:30 +02:00
|
|
|
|
|
|
|
GHashTable *_thread_hash;
|
2011-06-13 22:04:20 +02:00
|
|
|
MuMsg *_msg;
|
2010-08-25 20:40:07 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
MuMsgIter*
|
2011-08-03 22:06:51 +02:00
|
|
|
mu_msg_iter_new (XapianEnquire *enq, size_t maxnum,
|
|
|
|
gboolean threads, MuMsgFieldId sortfield)
|
2010-08-25 20:40:07 +02:00
|
|
|
{
|
2011-05-18 22:51:52 +02:00
|
|
|
g_return_val_if_fail (enq, NULL);
|
2011-07-02 10:27:08 +02:00
|
|
|
/* sortfield should be set to .._NONE when we're not threading */
|
|
|
|
g_return_val_if_fail (threads || sortfield == MU_MSG_FIELD_ID_NONE,
|
|
|
|
NULL);
|
|
|
|
g_return_val_if_fail (mu_msg_field_id_is_valid (sortfield) ||
|
|
|
|
sortfield == MU_MSG_FIELD_ID_NONE,
|
|
|
|
FALSE);
|
2010-08-25 20:40:07 +02:00
|
|
|
try {
|
2011-07-02 10:27:08 +02:00
|
|
|
return new MuMsgIter ((Xapian::Enquire&)*enq, maxnum, threads,
|
|
|
|
sortfield);
|
2011-08-30 21:01:30 +02:00
|
|
|
|
2010-08-25 20:40:07 +02:00
|
|
|
} MU_XAPIAN_CATCH_BLOCK_RETURN(NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
mu_msg_iter_destroy (MuMsgIter *iter)
|
|
|
|
{
|
2011-08-30 21:01:30 +02:00
|
|
|
try { delete iter; } MU_XAPIAN_CATCH_BLOCK;
|
2010-08-25 20:40:07 +02:00
|
|
|
}
|
2011-08-30 21:01:30 +02:00
|
|
|
|
2010-08-25 20:40:07 +02:00
|
|
|
MuMsg*
|
2011-08-30 21:01:30 +02:00
|
|
|
mu_msg_iter_get_msg_floating (MuMsgIter *iter)
|
2010-11-25 20:49:25 +01:00
|
|
|
{
|
2011-08-30 21:01:30 +02:00
|
|
|
g_return_val_if_fail (iter, NULL);
|
|
|
|
g_return_val_if_fail (!mu_msg_iter_is_done(iter), NULL);
|
|
|
|
|
|
|
|
try {
|
|
|
|
MuMsg *msg;
|
|
|
|
GError *err;
|
|
|
|
Xapian::Document *docp;
|
|
|
|
|
|
|
|
docp = new Xapian::Document(iter->cursor().get_document());
|
|
|
|
|
|
|
|
err = NULL;
|
|
|
|
msg = iter->set_msg (mu_msg_new_from_doc ((XapianDocument*)docp, &err));
|
|
|
|
if (!msg)
|
|
|
|
MU_HANDLE_G_ERROR(err);
|
|
|
|
|
|
|
|
return msg;
|
|
|
|
|
|
|
|
} MU_XAPIAN_CATCH_BLOCK_RETURN (NULL);
|
2011-05-18 22:33:56 +02:00
|
|
|
}
|
|
|
|
|
2011-06-02 17:13:17 +02:00
|
|
|
gboolean
|
|
|
|
mu_msg_iter_reset (MuMsgIter *iter)
|
|
|
|
{
|
2011-08-30 21:01:30 +02:00
|
|
|
g_return_val_if_fail (iter, FALSE);
|
|
|
|
|
|
|
|
iter->set_msg (NULL);
|
2011-06-02 17:13:17 +02:00
|
|
|
|
2011-08-30 21:01:30 +02:00
|
|
|
try {
|
|
|
|
iter->set_cursor(iter->matches().begin());
|
2011-06-02 17:13:17 +02:00
|
|
|
|
2011-08-30 21:01:30 +02:00
|
|
|
} MU_XAPIAN_CATCH_BLOCK_RETURN (FALSE);
|
|
|
|
|
|
|
|
return TRUE;
|
2011-06-02 17:13:17 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-08-25 20:40:07 +02:00
|
|
|
gboolean
|
|
|
|
mu_msg_iter_next (MuMsgIter *iter)
|
|
|
|
{
|
2011-08-30 21:01:30 +02:00
|
|
|
g_return_val_if_fail (iter, FALSE);
|
|
|
|
|
|
|
|
iter->set_msg (NULL);
|
2010-08-25 20:40:07 +02:00
|
|
|
|
2011-08-30 21:01:30 +02:00
|
|
|
if (mu_msg_iter_is_done(iter))
|
|
|
|
return FALSE;
|
2010-08-25 20:40:07 +02:00
|
|
|
|
2011-08-30 21:01:30 +02:00
|
|
|
try {
|
|
|
|
iter->cursor_next();
|
|
|
|
return iter->cursor() == iter->matches().end() ? FALSE:TRUE;
|
|
|
|
|
|
|
|
} MU_XAPIAN_CATCH_BLOCK_RETURN(FALSE);
|
|
|
|
}
|
2011-08-03 22:06:51 +02:00
|
|
|
|
|
|
|
|
2010-08-25 20:40:07 +02:00
|
|
|
gboolean
|
2010-09-08 23:09:00 +02:00
|
|
|
mu_msg_iter_is_done (MuMsgIter *iter)
|
2010-08-25 20:40:07 +02:00
|
|
|
{
|
2011-06-02 16:36:15 +02:00
|
|
|
g_return_val_if_fail (iter, TRUE);
|
|
|
|
|
|
|
|
try {
|
2011-08-30 21:01:30 +02:00
|
|
|
return iter->cursor() == iter->matches().end() ? TRUE : FALSE;
|
2011-06-02 16:36:15 +02:00
|
|
|
|
|
|
|
} MU_XAPIAN_CATCH_BLOCK_RETURN (TRUE);
|
2010-08-25 20:40:07 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* hmmm.... is it impossible to get a 0 docid, or just very improbable? */
|
|
|
|
unsigned int
|
|
|
|
mu_msg_iter_get_docid (MuMsgIter *iter)
|
|
|
|
{
|
2010-12-18 09:44:27 +01:00
|
|
|
g_return_val_if_fail (!mu_msg_iter_is_done(iter),
|
2011-08-30 21:01:30 +02:00
|
|
|
(unsigned int)-1);
|
2010-08-25 20:40:07 +02:00
|
|
|
try {
|
2011-08-30 21:01:30 +02:00
|
|
|
return iter->cursor().get_document().get_docid();
|
2010-08-25 20:40:07 +02:00
|
|
|
|
|
|
|
} MU_XAPIAN_CATCH_BLOCK_RETURN (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-08-30 21:01:30 +02:00
|
|
|
|
2011-06-23 23:21:54 +02:00
|
|
|
const MuMsgIterThreadInfo*
|
|
|
|
mu_msg_iter_get_thread_info (MuMsgIter *iter)
|
2011-06-18 17:47:46 +02:00
|
|
|
{
|
|
|
|
g_return_val_if_fail (!mu_msg_iter_is_done(iter), NULL);
|
2011-08-30 21:01:30 +02:00
|
|
|
g_return_val_if_fail (iter->thread_hash(), NULL);
|
2011-06-18 17:47:46 +02:00
|
|
|
|
|
|
|
try {
|
2011-06-23 23:21:54 +02:00
|
|
|
const MuMsgIterThreadInfo *ti;
|
2011-06-18 17:47:46 +02:00
|
|
|
unsigned int docid;
|
2011-08-30 21:01:30 +02:00
|
|
|
|
2011-06-23 23:21:54 +02:00
|
|
|
docid = mu_msg_iter_get_docid (iter);
|
|
|
|
ti = (const MuMsgIterThreadInfo*)g_hash_table_lookup
|
2011-08-30 21:01:30 +02:00
|
|
|
(iter->thread_hash(), GUINT_TO_POINTER(docid));
|
2011-06-23 23:21:54 +02:00
|
|
|
|
|
|
|
if (!ti)
|
|
|
|
g_printerr ("no ti for %u\n", docid);
|
2011-08-30 21:01:30 +02:00
|
|
|
|
2011-06-23 23:21:54 +02:00
|
|
|
return ti;
|
2011-08-30 21:01:30 +02:00
|
|
|
|
2011-06-18 17:47:46 +02:00
|
|
|
} MU_XAPIAN_CATCH_BLOCK_RETURN (NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
|