summaryrefslogtreecommitdiffstats
path: root/libglusterfs/src/trie.c
blob: 2501e71a5401a7cf47d4a870926c585433ea1c2d (plain)
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
/*
  Copyright (c) 2010 Gluster, Inc. <http://www.gluster.com>
  This file is part of GlusterFS.

  GlusterFS is free software; you can redistribute it and/or modify
  it under the terms of the GNU Affero General Public License as published
  by the Free Software Foundation; either version 3 of the License,
  or (at your option) any later version.

  GlusterFS 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
  Affero General Public License for more details.

  You should have received a copy of the GNU Affero General Public License
  along with this program.  If not, see
  <http://www.gnu.org/licenses/>.
*/

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <ctype.h>

#include "common-utils.h"
#include "trie-mem-types.h"
#include "trie.h"

#define DISTANCE_EDIT 1
#define DISTANCE_INS  1
#define DISTANCE_DEL  1


struct trienode {
        char             id;
        char             eow;
        int              depth;
        void            *data;
        struct trie     *trie;
        struct trienode *parent;
        struct trienode *subnodes[255];
};

struct trie {
        struct trienode   root;
        int               nodecnt;
        size_t            len;
};


trie_t *
trie_new ()
{
        trie_t *trie = NULL;

        trie = GF_CALLOC (1, sizeof (*trie),  gf_trie_mt_trie);
        if (!trie)
                return NULL;

        trie->root.trie = trie;

        return trie;
}


static trienode_t *
trie_subnode (trienode_t *node, int id)
{
        trienode_t *subnode = NULL;

        subnode = node->subnodes[id];
        if (!subnode) {
                subnode = GF_CALLOC (1, sizeof (*subnode), gf_trie_mt_node);
                if (!subnode)
                        return NULL;

                subnode->id        = id;
                subnode->depth     = node->depth + 1;
                node->subnodes[id] = subnode;
                subnode->parent    = node;
                subnode->trie      = node->trie;
                node->trie->nodecnt++;
        }

        return subnode;
}


int
trie_add (trie_t *trie, const char *dword)
{
        trienode_t *node = NULL;
        int              i = 0;
        char             id = 0;
        trienode_t *subnode = NULL;

        node = &trie->root;

        for (i = 0; i < strlen (dword); i++) {
                id = dword[i];

                subnode = trie_subnode (node, id);
                if (!subnode)
                        return -1;
                node = subnode;
        }

        node->eow = 1;

        return 0;
}

static void
trienode_free (trienode_t *node)
{
        trienode_t *trav = NULL;
        int              i = 0;

        for (i = 0; i < 255; i++) {
                trav = node->subnodes[i];

                if (trav)
                        trienode_free (trav);
        }

        if (node->data)
                GF_FREE (node->data);
        GF_FREE (node);
}


void
trie_destroy (trie_t *trie)
{
        trienode_free ((trienode_t *)trie);
}


void
trie_destroy_bynode (trienode_t *node)
{
        trie_destroy (node->trie);
}


static int
trienode_walk (trienode_t *node, int (*fn)(trienode_t *node, void *data),
               void *data, int eowonly)
{
        trienode_t *trav = NULL;
        int              i = 0;
        int              cret = 0;
        int              ret = 0;

        if (!eowonly || node->eow)
                ret = fn (node, data);

        if (ret)
                goto out;

        for (i = 0; i < 255; i++) {
                trav = node->subnodes[i];
                if (!trav)
                        continue;

                cret = trienode_walk (trav, fn, data, eowonly);
                if (cret < 0) {
                        ret = cret;
                        goto out;
                }
                ret += cret;
        }

out:
        return ret;
}


static int
trie_walk (trie_t *trie, int (*fn)(trienode_t *node, void *data),
           void *data, int eowonly)
{
        return trienode_walk (&trie->root, fn, data, eowonly);
}


static void
print_node (trienode_t *node, char **buf)
{
        if (!node->parent)
                return;

        if (node->parent) {
                print_node (node->parent, buf);
                *(*buf)++ = node->id;
        }
}


int
trienode_get_word (trienode_t *node, char **bufp)
{
        char *buf = NULL;

        buf = GF_CALLOC (1, node->depth + 1, gf_trie_mt_buf);
        if (!buf)
                return -1;
        *bufp = buf;

        print_node (node, &buf);

        return 0;
}


static int
calc_dist (trienode_t *node, void *data)
{
        const char *word = NULL;
        int         i = 0;
        int        *row = NULL;
        int        *uprow = NULL;
        int         distu = 0;
        int         distl = 0;
        int         distul = 0;

        word = data;

        node->data = GF_CALLOC (node->trie->len, sizeof (int), gf_trie_mt_data);
        if (!node->data)
                return -1;
        row = node->data;

        if (!node->parent) {
                for (i = 0; i < node->trie->len; i++)
                        row[i] = i+1;

                return 0;
        }

        uprow = node->parent->data;

        distu = node->depth;          /* up node */
        distul = node->parent->depth; /* up-left node */

        for (i = 0; i < node->trie->len; i++) {
                distl = uprow[i];     /* left node */

                if (word[i] == node->id)
                        row[i] = distul;
                else
                        row[i] = min ((distul + DISTANCE_EDIT),
                                      min ((distu + DISTANCE_DEL),
                                           (distl + DISTANCE_INS)));

                distu  = row[i];
                distul = distl;
        }

        return 0;
}


int
trienode_get_dist (trienode_t *node)
{
        int *row = NULL;

        row = node->data;

        return row[node->trie->len - 1];
}


struct trienodevec_w {
        struct trienodevec *vec;
        const char *word;
};


static void
trienodevec_clear (struct trienodevec *nodevec)
{
        memset(nodevec->nodes, 0, sizeof (*nodevec->nodes) * nodevec->cnt);
}


static int
collect_closest (trienode_t *node, void *data)
{
        struct trienodevec_w *nodevec_w = NULL;
        struct trienodevec *nodevec = NULL;
        int dist = 0;
        int i = 0;

        nodevec_w = data;
        nodevec = nodevec_w->vec;

        if (calc_dist (node, (void *)nodevec_w->word))
                return -1;

        if (!node->eow || !nodevec->cnt)
                return 0;

        dist = trienode_get_dist (node);

        /*
         * I thought that when descending further after some dictionary word dw,
         * if we see that child's distance is bigger than it was for dw, then we
         * can prune this branch, as it can contain only worse nodes.
         *
         * This conjecture fails, see eg:
         *
         * d("AB", "B") = 1;
         * d("AB", "BA") = 2;
         * d("AB", "BAB") = 1;
         *
         * -- if both "B" and "BAB" are in dict., then pruning at "BA" * would
         * miss "BAB".
         *
         * (example courtesy of Richard Bann <richardbann at gmail.com>)

        if (node->parent->eow && dist > trienode_get_dist (node->parent))
                return 1;

         */

        if (nodevec->nodes[0] &&
            dist < trienode_get_dist (nodevec->nodes[0])) {
                /* improving over the findings so far */
                trienodevec_clear (nodevec);
                nodevec->nodes[0] = node;
        } else if (!nodevec->nodes[0] ||
                   dist == trienode_get_dist (nodevec->nodes[0])) {
                /* as good as the best so far, add if there is free space */
                for (i = 0; i < nodevec->cnt; i++) {
                        if (!nodevec->nodes[i]) {
                                nodevec->nodes[i] = node;
                                break;
                        }
                }
        }

        return 0;
}


int
trie_measure (trie_t *trie, const char *word, trienode_t **nodes,
              int nodecnt)
{
        struct trienodevec nodevec = {0,};

        nodevec.nodes = nodes;
        nodevec.cnt = nodecnt;

        return trie_measure_vec (trie, word, &nodevec);
}


int
trie_measure_vec (trie_t *trie, const char *word, struct trienodevec *nodevec)
{
        struct trienodevec_w nodevec_w = {0,};
        int ret = 0;

        trie->len = strlen (word);

        trienodevec_clear (nodevec);
        nodevec_w.vec = nodevec;
        nodevec_w.word = word;

        ret = trie_walk (trie, collect_closest, &nodevec_w, 0);
        if (ret > 0)
                ret = 0;

        return ret;
}


static int
trienode_reset (trienode_t *node, void *data)
{
        if (node->data)
                GF_FREE (node->data);

        return 0;
}


void
trie_reset_search (trie_t *trie)
{
        trie->len = 0;

        trie_walk (trie, trienode_reset, NULL, 0);
}