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
|
// $Id: lisp.hpp 848 2006-10-29 02:14:04Z coz $
//
// TuxKart - a fun racing game with go-kart
// Copyright (C) 2004 Matthias Braun <matze@braunis.de>
// code in this file based on lispreader from Mark Probst
//
// 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 2
// 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, write to the Free Software
// Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
#ifndef __LISPREADER_H__
#define __LISPREADER_H__
#include <string>
#include <vector>
namespace lisp
{
class Lisp
{
public:
~Lisp();
enum LispType
{
TYPE_CONS,
TYPE_SYMBOL,
TYPE_INTEGER,
TYPE_STRING,
TYPE_REAL,
TYPE_BOOLEAN
};
LispType getType() const
{ return m_type; }
const Lisp* getCar() const
{ return m_v.m_cons.m_car; }
const Lisp* getCdr() const
{ return m_v.m_cons.m_cdr; }
bool get(std::string& val) const
{
if(m_type != TYPE_STRING && m_type != TYPE_SYMBOL)
return false;
val = m_v.m_string;
return true;
}
bool get(int& val) const
{
if(m_type != TYPE_INTEGER)
return false;
val = m_v.m_integer;
return true;
}
bool get(float& val) const
{
if(m_type != TYPE_REAL && m_type != TYPE_INTEGER)
return false;
val = m_type==TYPE_REAL ? m_v.m_real : m_v.m_integer;
return true;
}
bool get(bool& val) const
{
if(m_type != TYPE_BOOLEAN)
return false;
val = m_v.m_boolean;
return true;
}
/* conveniance functions which traverse the list until a child with a
* specified name is found. The value part is then interpreted in a specific
* way. The functions return true, if a child was found and could be
* interpreted correctly, otherwise false is returned and the variable value
* is not changed.
* (Please note that searching the lisp structure is O(n) so these functions
* are no good idea for performance critical areas)
*/
template<class T>
bool get(const char* name, T& val) const
{
const Lisp* lisp = getLisp(name);
if(!lisp)
return false;
lisp = lisp->getCdr();
if(!lisp)
return false;
lisp = lisp->getCar();
if(!lisp)
return false;
return lisp->get(val);
}
template<class T>
bool getVector(const char* name, std::vector<T>& vec) const
{
const Lisp* child = getLisp(name);
if(!child)
return false;
for(child = child->getCdr(); child != 0; child = child->getCdr())
{
T val;
if(!child->getCar())
continue;
if(child->getCar()->get(val))
{
vec.insert(vec.begin(),val);
}
}
return true;
}
const Lisp* getLisp(const char* name) const;
const Lisp* getLisp(const std::string& name) const
{ return getLisp(name.c_str()); }
// for debugging
void print(int indent = 0) const;
private:
friend class Parser;
Lisp(LispType newtype);
LispType m_type;
union
{
struct
{
Lisp* m_car;
Lisp* m_cdr;
}
m_cons;
char* m_string;
int m_integer;
bool m_boolean;
float m_real;
}
m_v;
};
} // end of namespace lisp
#endif
|