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
|
/* -*- Mode: C; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* libdatrie - Double-Array Trie Library
* Copyright (C) 2006 Theppitak Karoonboonyanan <theppitak@gmail.com>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
/*
* tail.h - trie tail for keeping suffixes
* Created: 2006-08-12
* Author: Theppitak Karoonboonyanan <theppitak@gmail.com>
*/
#ifndef __TAIL_H
#define __TAIL_H
#include "triedefs.h"
/**
* @file tail.h
* @brief trie tail for keeping suffixes
*/
/**
* @brief Double-array structure type
*/
typedef struct _Tail Tail;
Tail * tail_new ();
Tail * tail_fread (FILE *file);
void tail_free (Tail *t);
int tail_fwrite (const Tail *t, FILE *file);
const TrieChar * tail_get_suffix (const Tail *t, TrieIndex index);
Bool tail_set_suffix (Tail *t, TrieIndex index, const TrieChar *suffix);
TrieIndex tail_add_suffix (Tail *t, const TrieChar *suffix);
TrieData tail_get_data (const Tail *t, TrieIndex index);
Bool tail_set_data (Tail *t, TrieIndex index, TrieData data);
void tail_delete (Tail *t, TrieIndex index);
int tail_walk_str (const Tail *t,
TrieIndex s,
short *suffix_idx,
const TrieChar *str,
int len);
Bool tail_walk_char (const Tail *t,
TrieIndex s,
short *suffix_idx,
TrieChar c);
/**
* @brief Test walkability in tail with a character
*
* @param t : the tail data
* @param s : the tail data index
* @param suffix_idx : current character index in suffix
* @param c : the character to test walkability
*
* @return boolean indicating walkability
*
* Test if the character @a c can be used to walk from given character
* position @a suffix_idx of entry @a s of the tail data @a t.
*/
/*
Bool tail_is_walkable_char (Tail *t,
TrieIndex s,
short suffix_idx,
const TrieChar c);
*/
#define tail_is_walkable_char(t,s,suffix_idx,c) \
(tail_get_suffix ((t), (s)) [suffix_idx] == (c))
#endif /* __TAIL_H */
/*
vi:ts=4:ai:expandtab
*/
|
