-
Notifications
You must be signed in to change notification settings - Fork 3
/
dzl-fuzzy-index-cursor.c
632 lines (522 loc) · 18.6 KB
/
dzl-fuzzy-index-cursor.c
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
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
/* dzl-fuzzy-index-cursor.c
*
* Copyright (C) 2016 Christian Hergert <christian@hergert.me>
*
* 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, see <http://www.gnu.org/licenses/>.
*/
#define G_LOG_DOMAIN "dzl-fuzzy-index-cursor"
#include "config.h"
#include <string.h>
#include "search/dzl-fuzzy-index-cursor.h"
#include "search/dzl-fuzzy-index-match.h"
#include "search/dzl-fuzzy-index-private.h"
#include "util/dzl-macros.h"
#include "util/dzl-int-pair.h"
struct _DzlFuzzyIndexCursor
{
GObject object;
DzlFuzzyIndex *index;
gchar *query;
GVariantDict *tables;
GArray *matches;
guint max_matches;
guint case_sensitive : 1;
};
typedef struct
{
guint position;
guint lookaside_id;
} DzlFuzzyIndexItem;
typedef struct
{
const gchar *key;
guint document_id;
gfloat score;
guint priority;
} DzlFuzzyMatch;
typedef struct
{
DzlFuzzyIndex *index;
const DzlFuzzyIndexItem * const *tables;
const gsize *tables_n_elements;
gint *tables_state;
guint n_tables;
guint max_matches;
const gchar *needle;
GHashTable *matches;
} DzlFuzzyLookup;
enum {
PROP_0,
PROP_CASE_SENSITIVE,
PROP_INDEX,
PROP_TABLES,
PROP_MAX_MATCHES,
PROP_QUERY,
N_PROPS
};
static void async_initable_iface_init (GAsyncInitableIface *iface);
static void list_model_iface_init (GListModelInterface *iface);
static GParamSpec *properties [N_PROPS];
G_DEFINE_TYPE_WITH_CODE (DzlFuzzyIndexCursor, dzl_fuzzy_index_cursor, G_TYPE_OBJECT,
G_IMPLEMENT_INTERFACE (G_TYPE_ASYNC_INITABLE, async_initable_iface_init)
G_IMPLEMENT_INTERFACE (G_TYPE_LIST_MODEL, list_model_iface_init))
static inline gfloat
pointer_to_float (gpointer ptr)
{
union {
gpointer ptr;
#if GLIB_SIZEOF_VOID_P == 8
gdouble fval;
#else
gfloat fval;
#endif
} convert;
convert.ptr = ptr;
return (gfloat)convert.fval;
}
static inline gpointer
float_to_pointer (gfloat fval)
{
union {
gpointer ptr;
#if GLIB_SIZEOF_VOID_P == 8
gdouble fval;
#else
gfloat fval;
#endif
} convert;
convert.fval = fval;
return convert.ptr;
}
/* Not guaranteed, so assert to be sure */
G_STATIC_ASSERT (sizeof(gdouble) == 8);
G_STATIC_ASSERT (sizeof(gfloat) == 4);
static void
dzl_fuzzy_index_cursor_finalize (GObject *object)
{
DzlFuzzyIndexCursor *self = (DzlFuzzyIndexCursor *)object;
g_clear_object (&self->index);
g_clear_pointer (&self->query, g_free);
g_clear_pointer (&self->matches, g_array_unref);
g_clear_pointer (&self->tables, g_variant_dict_unref);
G_OBJECT_CLASS (dzl_fuzzy_index_cursor_parent_class)->finalize (object);
}
static void
dzl_fuzzy_index_cursor_get_property (GObject *object,
guint prop_id,
GValue *value,
GParamSpec *pspec)
{
DzlFuzzyIndexCursor *self = DZL_FUZZY_INDEX_CURSOR(object);
switch (prop_id)
{
case PROP_CASE_SENSITIVE:
g_value_set_boolean (value, self->case_sensitive);
break;
case PROP_INDEX:
g_value_set_object (value, self->index);
break;
case PROP_MAX_MATCHES:
g_value_set_uint (value, self->max_matches);
break;
case PROP_QUERY:
g_value_set_string (value, self->query);
break;
default:
G_OBJECT_WARN_INVALID_PROPERTY_ID (object, prop_id, pspec);
}
}
static void
dzl_fuzzy_index_cursor_set_property (GObject *object,
guint prop_id,
const GValue *value,
GParamSpec *pspec)
{
DzlFuzzyIndexCursor *self = DZL_FUZZY_INDEX_CURSOR(object);
switch (prop_id)
{
case PROP_CASE_SENSITIVE:
self->case_sensitive = g_value_get_boolean (value);
break;
case PROP_INDEX:
self->index = g_value_dup_object (value);
break;
case PROP_TABLES:
self->tables = g_value_dup_boxed (value);
break;
case PROP_MAX_MATCHES:
self->max_matches = g_value_get_uint (value);
break;
case PROP_QUERY:
self->query = g_value_dup_string (value);
break;
default:
G_OBJECT_WARN_INVALID_PROPERTY_ID (object, prop_id, pspec);
}
}
static void
dzl_fuzzy_index_cursor_class_init (DzlFuzzyIndexCursorClass *klass)
{
GObjectClass *object_class = G_OBJECT_CLASS (klass);
object_class->finalize = dzl_fuzzy_index_cursor_finalize;
object_class->get_property = dzl_fuzzy_index_cursor_get_property;
object_class->set_property = dzl_fuzzy_index_cursor_set_property;
properties [PROP_CASE_SENSITIVE] =
g_param_spec_boolean ("case-sensitive",
"Case Sensitive",
"Case Sensitive",
FALSE,
(G_PARAM_READWRITE | G_PARAM_CONSTRUCT_ONLY | G_PARAM_STATIC_STRINGS));
properties [PROP_INDEX] =
g_param_spec_object ("index",
"Index",
"The index this cursor is iterating",
DZL_TYPE_FUZZY_INDEX,
(G_PARAM_WRITABLE | G_PARAM_CONSTRUCT_ONLY | G_PARAM_STATIC_STRINGS));
properties [PROP_TABLES] =
g_param_spec_boxed ("tables",
"Tables",
"The dictionary of character indexes",
G_TYPE_VARIANT_DICT,
(G_PARAM_WRITABLE | G_PARAM_CONSTRUCT_ONLY | G_PARAM_STATIC_STRINGS));
properties [PROP_QUERY] =
g_param_spec_string ("query",
"Query",
"The query for the index",
NULL,
(G_PARAM_READWRITE | G_PARAM_CONSTRUCT_ONLY | G_PARAM_STATIC_STRINGS));
properties [PROP_MAX_MATCHES] =
g_param_spec_uint ("max-matches",
"Max Matches",
"The max number of matches to display",
0,
G_MAXUINT,
0,
(G_PARAM_READWRITE | G_PARAM_CONSTRUCT_ONLY | G_PARAM_STATIC_STRINGS));
g_object_class_install_properties (object_class, N_PROPS, properties);
}
static void
dzl_fuzzy_index_cursor_init (DzlFuzzyIndexCursor *self)
{
self->matches = g_array_new (FALSE, FALSE, sizeof (DzlFuzzyMatch));
}
static gint
fuzzy_match_compare (gconstpointer a,
gconstpointer b)
{
const DzlFuzzyMatch *ma = a;
const DzlFuzzyMatch *mb = b;
if (ma->score < mb->score)
return 1;
else if (ma->score > mb->score)
return -1;
return strcmp (ma->key, mb->key);
}
static gboolean
fuzzy_do_match (const DzlFuzzyLookup *lookup,
const DzlFuzzyIndexItem *item,
guint table_index,
gint score)
{
const DzlFuzzyIndexItem *table;
const DzlFuzzyIndexItem *iter;
gssize n_elements;
gint *state;
gint iter_score;
g_assert (lookup != NULL);
g_assert (item != NULL);
g_assert (score >= 0);
table = lookup->tables [table_index];
n_elements = (gssize)lookup->tables_n_elements [table_index];
state = &lookup->tables_state [table_index];
for (; state [0] < n_elements; state [0]++)
{
DzlIntPair *lookup_pair;
gboolean contains_document;
iter = &table [state [0]];
if ((iter->lookaside_id < item->lookaside_id) ||
((iter->lookaside_id == item->lookaside_id) &&
(iter->position <= item->position)))
continue;
else if (iter->lookaside_id > item->lookaside_id)
break;
iter_score = score + (iter->position - item->position);
if (table_index + 1 < lookup->n_tables)
{
if (fuzzy_do_match (lookup, iter, table_index + 1, iter_score))
return TRUE;
continue;
}
contains_document = g_hash_table_lookup_extended (lookup->matches,
GUINT_TO_POINTER (item->lookaside_id),
NULL,
(gpointer *)&lookup_pair);
if (!contains_document || iter_score < dzl_int_pair_first (lookup_pair))
g_hash_table_insert (lookup->matches,
GUINT_TO_POINTER (item->lookaside_id),
dzl_int_pair_new (iter_score, iter->position));
return TRUE;
}
return FALSE;
}
static void
dzl_fuzzy_index_cursor_worker (GTask *task,
gpointer source_object,
gpointer task_data,
GCancellable *cancellable)
{
DzlFuzzyIndexCursor *self = source_object;
g_autoptr(GHashTable) matches = NULL;
g_autoptr(GHashTable) by_document = NULL;
g_autoptr(GPtrArray) tables = NULL;
g_autoptr(GArray) tables_n_elements = NULL;
g_autofree gint *tables_state = NULL;
g_autofree gchar *freeme = NULL;
const gchar *query;
DzlFuzzyLookup lookup = { 0 };
GHashTableIter iter;
const gchar *str;
gpointer key, value;
guint i;
g_assert (DZL_IS_FUZZY_INDEX_CURSOR (self));
g_assert (G_IS_TASK (task));
if (g_task_return_error_if_cancelled (task))
return;
/* No matches with empty query */
if (self->query == NULL || *self->query == '\0')
goto cleanup;
/* If we are not case-sensitive, we need to downcase the query string */
query = self->query;
if (!self->case_sensitive)
query = freeme = g_utf8_casefold (query, -1);
tables = g_ptr_array_new ();
tables_n_elements = g_array_new (FALSE, FALSE, sizeof (gsize));
matches = g_hash_table_new_full (NULL, NULL, NULL, (GDestroyNotify)dzl_int_pair_free);
for (str = query; *str; str = g_utf8_next_char (str))
{
gunichar ch = g_utf8_get_char (str);
g_autoptr(GVariant) table = NULL;
gconstpointer fixed;
gsize n_elements;
gchar char_key[8];
if (g_unichar_isspace (ch))
continue;
char_key [g_unichar_to_utf8 (ch, char_key)] = '\0';
table = g_variant_dict_lookup_value (self->tables,
char_key,
(const GVariantType *)"a(uu)");
/* No possible matches, missing table for character */
if (table == NULL)
goto cleanup;
fixed = g_variant_get_fixed_array (table, &n_elements, sizeof (DzlFuzzyIndexItem));
g_array_append_val (tables_n_elements, n_elements);
g_ptr_array_add (tables, (gpointer)fixed);
}
if (tables->len == 0)
goto cleanup;
g_assert (tables->len > 0);
g_assert (tables->len == tables_n_elements->len);
tables_state = g_new0 (gint, tables->len);
lookup.index = self->index;
lookup.matches = matches;
lookup.tables = (const DzlFuzzyIndexItem * const *)tables->pdata;
lookup.tables_n_elements = (const gsize *)(gpointer)tables_n_elements->data;
lookup.tables_state = tables_state;
lookup.n_tables = tables->len;
lookup.needle = query;
lookup.max_matches = self->max_matches;
if G_LIKELY (lookup.n_tables > 1)
{
for (i = 0; i < lookup.tables_n_elements[0]; i++)
{
const DzlFuzzyIndexItem *item = &lookup.tables[0][i];
fuzzy_do_match (&lookup, item, 1, MIN (16, item->position * 2));
}
}
else
{
guint last_id = G_MAXUINT;
for (i = 0; i < lookup.tables_n_elements[0]; i++)
{
const DzlFuzzyIndexItem *item = &lookup.tables[0][i];
DzlFuzzyMatch match;
if (item->lookaside_id != last_id)
{
last_id = item->lookaside_id;
if G_UNLIKELY (!_dzl_fuzzy_index_resolve (self->index,
item->lookaside_id,
&match.document_id,
&match.key,
&match.priority,
item->position,
item->position,
&match.score))
continue;
g_array_append_val (self->matches, match);
}
}
goto cleanup;
}
if (g_task_return_error_if_cancelled (task))
return;
by_document = g_hash_table_new (NULL, NULL);
g_hash_table_iter_init (&iter, matches);
while (g_hash_table_iter_next (&iter, &key, &value))
{
DzlIntPair *pair = value;
guint score = dzl_int_pair_first (pair);
guint last_offset = dzl_int_pair_second (pair);
gpointer other_score;
DzlFuzzyMatch match = {0};
guint lookaside_id = GPOINTER_TO_UINT (key);
if G_UNLIKELY (!_dzl_fuzzy_index_resolve (self->index,
lookaside_id,
&match.document_id,
&match.key,
&match.priority,
score,
last_offset,
&match.score))
continue;
if (g_hash_table_lookup_extended (by_document,
GUINT_TO_POINTER (match.document_id),
NULL,
&other_score) &&
match.score <= pointer_to_float (other_score))
continue;
g_hash_table_insert (by_document,
GUINT_TO_POINTER (match.document_id),
float_to_pointer (match.score));
g_array_append_val (self->matches, match);
}
/*
* Because we have to do the deduplication of documents after
* searching all the potential matches, we could have duplicates
* in the array. So we need to filter them out. Not that big
* of a deal, since we can do remove_fast on the index and
* we have to sort them afterwards anyway. Potentially, we could
* do both at once if we felt like doing our own sort.
*/
for (i = 0; i < self->matches->len; i++)
{
DzlFuzzyMatch *match;
gpointer other_score;
next:
match = &g_array_index (self->matches, DzlFuzzyMatch, i);
other_score = g_hash_table_lookup (by_document, GUINT_TO_POINTER (match->document_id));
/*
* This item should have been discarded, but we didn't have enough
* information at the time we built the array.
*/
if (pointer_to_float (other_score) < match->score)
{
g_array_remove_index_fast (self->matches, i);
if (i < self->matches->len - 1)
goto next;
}
}
if (g_task_return_error_if_cancelled (task))
return;
cleanup:
if (self->matches != NULL)
{
g_array_sort (self->matches, fuzzy_match_compare);
if (lookup.max_matches > 0 && lookup.max_matches < self->matches->len)
g_array_set_size (self->matches, lookup.max_matches);
}
g_task_return_boolean (task, TRUE);
}
static void
dzl_fuzzy_index_cursor_init_async (GAsyncInitable *initable,
gint io_priority,
GCancellable *cancellable,
GAsyncReadyCallback callback,
gpointer user_data)
{
DzlFuzzyIndexCursor *self = (DzlFuzzyIndexCursor *)initable;
g_autoptr(GTask) task = NULL;
g_assert (DZL_IS_FUZZY_INDEX_CURSOR (self));
g_assert (!cancellable || G_IS_CANCELLABLE (cancellable));
task = g_task_new (self, cancellable, callback, user_data);
g_task_set_source_tag (task, dzl_fuzzy_index_cursor_init_async);
g_task_set_priority (task, io_priority);
g_task_set_check_cancellable (task, FALSE);
g_task_run_in_thread (task, dzl_fuzzy_index_cursor_worker);
}
static gboolean
dzl_fuzzy_index_cursor_init_finish (GAsyncInitable *initiable,
GAsyncResult *result,
GError **error)
{
g_assert (DZL_IS_FUZZY_INDEX_CURSOR (initiable));
g_assert (G_IS_TASK (result));
return g_task_propagate_boolean (G_TASK (result), error);
}
static void
async_initable_iface_init (GAsyncInitableIface *iface)
{
iface->init_async = dzl_fuzzy_index_cursor_init_async;
iface->init_finish = dzl_fuzzy_index_cursor_init_finish;
}
static GType
dzl_fuzzy_index_cursor_get_item_type (GListModel *model)
{
return DZL_TYPE_FUZZY_INDEX_MATCH;
}
static guint
dzl_fuzzy_index_cursor_get_n_items (GListModel *model)
{
DzlFuzzyIndexCursor *self = (DzlFuzzyIndexCursor *)model;
g_assert (DZL_IS_FUZZY_INDEX_CURSOR (self));
return self->matches->len;
}
static gpointer
dzl_fuzzy_index_cursor_get_item (GListModel *model,
guint position)
{
DzlFuzzyIndexCursor *self = (DzlFuzzyIndexCursor *)model;
g_autoptr(GVariant) document = NULL;
DzlFuzzyMatch *match;
g_assert (DZL_IS_FUZZY_INDEX_CURSOR (self));
g_assert (position < self->matches->len);
match = &g_array_index (self->matches, DzlFuzzyMatch, position);
document = _dzl_fuzzy_index_lookup_document (self->index, match->document_id);
return g_object_new (DZL_TYPE_FUZZY_INDEX_MATCH,
"document", document,
"key", match->key,
"score", match->score,
"priority", match->priority,
NULL);
}
static void
list_model_iface_init (GListModelInterface *iface)
{
iface->get_item_type = dzl_fuzzy_index_cursor_get_item_type;
iface->get_n_items = dzl_fuzzy_index_cursor_get_n_items;
iface->get_item = dzl_fuzzy_index_cursor_get_item;
}
/**
* dzl_fuzzy_index_cursor_get_index:
* @self: A #DzlFuzzyIndexCursor
*
* Gets the index the cursor is iterating.
*
* Returns: (transfer none): A #DzlFuzzyIndex.
*/
DzlFuzzyIndex *
dzl_fuzzy_index_cursor_get_index (DzlFuzzyIndexCursor *self)
{
g_return_val_if_fail (DZL_IS_FUZZY_INDEX_CURSOR (self), NULL);
return self->index;
}