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
|
{
This file is part of the Free Component Library
A perfect hash for XPath keywords
See the file COPYING.FPC, included in this distribution,
for details about the copyright.
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.
**********************************************************************}
const
XPathKeywords: array [TXPathKeyword] of PWideChar = (
'',
#08'ancestor',
#16'ancestor-or-self',
#09'attribute',
#05'child',
#10'descendant',
#18'descendant-or-self',
#09'following',
#17'following-sibling',
#09'namespace',
#06'parent',
#09'preceding',
#17'preceding-sibling',
#04'self',
#07'comment',
#04'text',
#22'processing-instruction',
#04'node',
#03'and',
#02'or',
#03'div',
#03'mod',
#04'last',
#08'position',
#05'count',
#02'id',
#10'local-name',
#13'namespace-uri',
#04'name',
#06'string',
#06'concat',
#11'starts-with',
#08'contains',
#16'substring-before',
#15'substring-after',
#09'substring',
#13'string-length',
#15'normalize-space',
#09'translate',
#07'boolean',
#03'not',
#04'true',
#05'false',
#04'lang',
#06'number',
#03'sum',
#05'floor',
#07'ceiling',
#05'round'
);
{ The following code is not very maintainable because it was hand-ported from
C code generated by gperf. Unless a tool like gperf is ported or modified to
generate Pascal, modifying it will be painful.
The good side is that one shouldn't ever need to modify it. }
MaxHash = 55;
KeywordIndex: array[0..MaxHash-1] of TXPathKeyword = (
xkNone, xkNone,
xkId,
xkNone, xkNone, xkNone,
xkString,
xkSum,
xkParent,
xkSubstring,
xkNone,
xkComment,
xkName,
xkStringLength,
xkNumber,
xkSubstringAfter,
xkSubstringBefore,
xkNamespace,
xkFloor,
xkNormalizeSpace,
xkSelf,
xkNamespaceUri,
xkPreceding,
xkOr,
xkPosition,
xkText,
xkProcessingInstruction,
xkConcat,
xkLast,
xkContains,
xkPrecedingSibling,
xkAncestor,
xkFalse,
xkLocalName,
xkCount,
xkLang,
xkFollowing,
xkDescendant,
xkNode,
xkAncestorOrSelf,
xkBoolean,
xkNot,
xkStartsWith,
xkAnd,
xkFollowingSibling,
xkDescendantOrSelf,
xkChild,
xkTrue,
xkCeiling,
xkMod,
xkDiv,
xkRound,
xkNone,
xkAttribute,
xkTranslate
);
AssoValues: array[97..122] of Byte = (
10, 31, 0, 13, 30, 11, 55, 55, 0, 41,
55, 10, 16, 4, 21, 2, 55, 17, 0, 14,
34, 29, 34, 55, 7, 55
);
function LookupXPathKeyword(p: PWideChar; Len: Integer): TXPathKeyword;
var
hash: Integer;
p1: PWideChar;
begin
result := xkNone;
hash := Len;
if Len >= 1 then
begin
if (p^ >= 'a') and (p^ <= 'y') then
Inc(hash, AssoValues[ord(p^)])
else
Exit;
if Len > 2 then
if (p[2] >= 'a') and (p[2] <= 'y') then
Inc(hash, AssoValues[ord(p[2])+1])
else
Exit;
end;
if (hash >= 0) and (hash <= MaxHash) then
begin
p1 := XPathKeywords[KeywordIndex[hash]];
if (ord(p1^) = Len) and
CompareMem(p, p1+1, Len*sizeof(WideChar)) then
Result := KeywordIndex[hash];
end;
end;
|
