blob: ca15a63afeaf766e68fa59a78092257062e7e243 (
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
|
/*
* Quackle -- Crossword game artificial intelligence and analysis tool
* Copyright (C) 2005-2014 Jason Katz-Brown and John O'Laughlin.
*
* 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/>.
*/
#ifndef QUACKLE_GADDAG_H
#define QUACKLE_GADDAG_H
#include "alphabetparameters.h"
#define QUACKLE_GADDAG_SEPARATOR QUACKLE_NULL_MARK
namespace Quackle
{
class GaddagNode
{
public:
Letter letter() const;
bool isTerminal() const;
const GaddagNode *firstChild() const;
const GaddagNode *nextSibling() const;
const GaddagNode *child(Letter l) const;
private:
unsigned char data[4];
};
inline Letter
GaddagNode::letter() const
{
return (data[3] & 0x3F /*0b00111111*/);
}
inline bool
GaddagNode::isTerminal() const
{
return data[3] & 0x40 /*0b01000000*/;
}
inline const GaddagNode *
GaddagNode::firstChild() const
{
unsigned int p = (data[0] << 16) + (data[1] << 8) + (data[2]);
if (p == 0) {
return 0;
} else {
return this + p;
}
}
/*
inline const GaddagNode *
GaddagNode::firstChild() const
{
int p = (data[0] << 16) + (data[1] << 8) + (data[2]);
if (p == 0)
{
return 0;
}
else
{
if(p & 0x00800000)
p |= 0xff000000;
return this + p;
}
}
*/
inline const GaddagNode *
GaddagNode::nextSibling() const
{
if (data[3] & 0x80 /*0b10000000*/) {
return 0;
} else {
return this + 1; // assumes packed array of siblings
}
}
inline const GaddagNode *
GaddagNode::child(Letter l) const
{
for (const GaddagNode *child = firstChild(); child; child = child->nextSibling()) {
if (child->letter() == l) {
return child;
} else if (l != QUACKLE_GADDAG_SEPARATOR && child->letter() > l) {
return 0;
}
}
return 0;
}
}
#endif
|
