aboutsummaryrefslogtreecommitdiffstats
path: root/libibex/find.c
diff options
context:
space:
mode:
authorMichael Zucci <zucchi@src.gnome.org>2000-02-14 10:00:22 +0800
committerMichael Zucci <zucchi@src.gnome.org>2000-02-14 10:00:22 +0800
commitadd8821e99b4ea1b574ed469018ae224a542e6ae (patch)
tree3e9e02c153fb7300707a26a132ee66c9177d2369 /libibex/find.c
parente4bbdf696cc2f23e9b1fc288d37a44eb27d9426d (diff)
downloadgsoc2013-evolution-add8821e99b4ea1b574ed469018ae224a542e6ae.tar
gsoc2013-evolution-add8821e99b4ea1b574ed469018ae224a542e6ae.tar.gz
gsoc2013-evolution-add8821e99b4ea1b574ed469018ae224a542e6ae.tar.bz2
gsoc2013-evolution-add8821e99b4ea1b574ed469018ae224a542e6ae.tar.lz
gsoc2013-evolution-add8821e99b4ea1b574ed469018ae224a542e6ae.tar.xz
gsoc2013-evolution-add8821e99b4ea1b574ed469018ae224a542e6ae.tar.zst
gsoc2013-evolution-add8821e99b4ea1b574ed469018ae224a542e6ae.zip
Initial revision
svn path=/trunk/; revision=1768
Diffstat (limited to 'libibex/find.c')
-rw-r--r--libibex/find.c100
1 files changed, 100 insertions, 0 deletions
diff --git a/libibex/find.c b/libibex/find.c
new file mode 100644
index 0000000000..0937331a83
--- /dev/null
+++ b/libibex/find.c
@@ -0,0 +1,100 @@
+/*
+ Copyright 2000 Helix Code Inc.
+*/
+
+/* find.c: index file searching ops */
+
+#include <string.h>
+
+#include "ibex_internal.h"
+
+GPtrArray *
+ibex_find(ibex *ib, char *word)
+{
+ GPtrArray *refs, *ret;
+ ibex_file *ibf;
+ int i;
+
+ ret = g_ptr_array_new();
+ refs = g_hash_table_lookup(ib->words, word);
+ if (refs)
+ {
+ for (i = 0; i < refs->len; i++)
+ {
+ ibf = g_ptr_array_index(refs, i);
+ g_ptr_array_add(ret, ibf->name);
+ }
+ }
+ return ret;
+}
+
+static gint
+build_array(gpointer key, gpointer value, gpointer data)
+{
+ char *name = key;
+ unsigned int count = GPOINTER_TO_UINT(value);
+ GPtrArray *ret = data;
+
+ if (count == 1)
+ g_ptr_array_add(ret, name);
+ return FALSE;
+}
+
+GPtrArray *
+ibex_find_all(ibex *ib, GPtrArray *words)
+{
+ GTree *work;
+ GPtrArray *wrefs, *ret;
+ int i, j, count;
+ char *word;
+ ibex_file *ibf;
+
+ if (words->len == 0)
+ return g_ptr_array_new();
+ else if (words->len == 1)
+ return ibex_find(ib, g_ptr_array_index(words, 0));
+
+ work = g_tree_new(strcmp);
+ for (i = 0; i < words->len; i++)
+ {
+ word = g_ptr_array_index(words, i);
+ wrefs = g_hash_table_lookup(ib->words, word);
+ if (!wrefs)
+ {
+ /* One of the words isn't even in the index. */
+ g_tree_destroy(work);
+ return g_ptr_array_new();
+ }
+
+ if (i == 0)
+ {
+ /* Copy the references into a tree, using the filenames as
+ * keys and the size of words as the value.
+ */
+ for (j = 0; j < wrefs->len; j++)
+ {
+ ibf = g_ptr_array_index(wrefs, j);
+ g_tree_insert(work, ibf->name, GUINT_TO_POINTER(words->len));
+ }
+ }
+ else
+ {
+ /* Increment the counts in the working tree for the references
+ * for this word.
+ */
+ for (j = 0; j < wrefs->len; j++)
+ {
+ ibf = g_ptr_array_index(wrefs, j);
+ count = GPOINTER_TO_UINT(g_tree_lookup(work, ibf->name));
+ if (count)
+ g_tree_insert(work, ibf->name, GUINT_TO_POINTER(count - 1));
+ }
+ }
+ }
+
+ /* Build an array with the refs that contain all the words. */
+ ret = g_ptr_array_new();
+ g_tree_traverse(work, build_array, G_IN_ORDER, ret);
+ g_tree_destroy(work);
+ return ret;
+}