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
|
/*
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;
}
|
