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
|
// $Id$
/* Copyright (C) 1989 Free Software Foundation, Inc.
written by Douglas C. Schmidt (schmidt@ics.uci.edu)
This file is part of GNU GPERF.
GNU GPERF 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 1, or (at your option) any
later version.
GNU GPERF 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 GNU GPERF; see the file COPYING. If not, write to the Free
Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111,
USA. */
#include "List_Node.h"
ACE_RCSID(src, List_Node, "$Id$")
#if defined (ACE_HAS_GPERF)
#include "Vectors.h"
// Defined as a macro in string.h on some systems, which causes
// conflicts.
#undef index
// Sorts the key set alphabetically to speed up subsequent operation
// Uses insertion sort since the set is probably quite small.
inline void
List_Node::set_sort (char *base, int len)
{
int i, j;
for (i = 0, j = len - 1; i < j; i++)
{
char curr, tmp;
for (curr = i + 1, tmp = base[curr];
curr > 0 && tmp < base[curr-1];
curr--)
base[curr] = base[curr - 1];
base[curr] = tmp;
}
}
// Initializes a List_Node. This requires obtaining memory for the
// CHAR_SET initializing them using the information stored in the
// KEY_POSITIONS array in Options, and checking for simple errors.
// It's important to note that KEY and REST are both pointers to the
// different offsets into the same block of dynamic memory pointed to
// by parameter K. The data member REST is used to store any
// additional fields of the input file (it is set to the "" string if
// Option[TYPE] is not enabled). This is useful if the user wishes to
// incorporate a lookup structure, rather than just an array of keys.
// Finally, KEY_NUMBER contains a count of the total number of keys
// seen so far. This is used to initialize the INDEX field to some
// useful value.
List_Node::List_Node (char *k, int len)
: link (0),
next (0),
key (k),
rest (option[TYPE] ? k + len + 1 : ""),
length (len),
index (0)
{
char *ptr = new char[(option[ALLCHARS] ? len : option.get_max_keysig_size ()) + 1];
char_set = ptr;
k[len] = '\0'; // Null terminate KEY to separate it from REST.
// Lower case if STRCASECMP option is enabled.
if (option[STRCASECMP])
for (char *p = k; *p; p++)
if (isupper (*p))
*p = tolower (*p);
if (option[ALLCHARS]) // Use all the character position in the KEY.
for (; *k; k++, ptr++)
++Vectors::occurrences[*ptr = *k];
else // Only use those character positions specified by the user.
{
int i;
// Iterate thru the list of key_positions, initializing
// occurrences table and char_set (via char * pointer ptr).
for (option.reset (); (i = option.get ()) != EOS; )
{
if (i == WORD_END) // Special notation for last KEY position, i.e. '$'.
*ptr = key[len - 1];
else if (i <= len) // Within range of KEY length, so we'll keep it.
*ptr = key[i - 1];
else // Out of range of KEY length, so we'll just skip it.
continue;
++Vectors::occurrences[*ptr++];
}
// Didn't get any hits and user doesn't want to consider the
// keylength, so there are essentially no usable hash positions!
if (ptr == char_set && option[NOLENGTH])
ACE_ERROR ((LM_ERROR,
"Can't hash keyword %s with chosen key positions.\n%a",
key,
1));
}
*ptr = '\0'; // Terminate this bastard....
// Sort the KEY_SET items alphabetically.
set_sort (char_set, ptr - char_set);
}
#endif /* ACE_HAS_GPERF */
|
