-// $Id$
+// SuperTux
+// Copyright (C) 2006 Matthias Braun <matze@braunis.de>
//
-// 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 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
// 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__
+// along with this program. If not, see <http://www.gnu.org/licenses/>.
+
+#ifndef HEADER_SUPERTUX_LISP_LISP_HPP
+#define HEADER_SUPERTUX_LISP_LISP_HPP
+#include <assert.h>
#include <string>
#include <vector>
-#include <assert.h>
-namespace lisp
-{
+namespace lisp {
class Lisp
{
public:
~Lisp();
-
+
enum LispType {
TYPE_CONS,
TYPE_SYMBOL,
};
LispType get_type() const
- { return type; }
+ { return type; }
- Lisp* get_car() const
+ const Lisp* get_car() const
{ return v.cons.car; }
- Lisp* get_cdr() const
+ const Lisp* get_cdr() const
{ return v.cons.cdr; }
-
+
bool get(std::string& val) const
- {
+ {
if(type != TYPE_STRING && type != TYPE_SYMBOL)
return false;
val = v.string;
return true;
}
-
+
+ std::string get_symbol() const
+ {
+ assert(type == TYPE_SYMBOL);
+ return v.string;
+ }
+
std::string get_string() const
{
assert(type == TYPE_STRING);
return v.string;
}
-
+
bool get(unsigned int& val) const
{
if(type != TYPE_INTEGER)
val = v.integer;
return true;
}
-
+
bool get(int& val) const
{
if(type != TYPE_INTEGER)
assert(type == TYPE_INTEGER);
return v.integer;
}
-
+
bool get(float& val) const
{
if(type != TYPE_REAL) {
if(type == TYPE_INTEGER) {
- val = v.integer;
+ val = (float) v.integer;
return true;
}
return false;
return v.boolean;
}
- /** conveniance functions which traverse the list until a child with a
+ /** convenience 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)
+ * are not a good idea for performance critical areas)
*/
template<class T>
bool get(const char* name, T& val) const
}
template<class T>
- bool get_vector(const char* name, std::vector<T>& vec) const
+ bool get(const char* name, std::vector<T>& vec) const
{
vec.clear();
-
+
const Lisp* child = get_lisp(name);
if(!child)
return false;
-
+
for( ; child != 0; child = child->get_cdr()) {
T val;
if(!child->get_car())
vec.push_back(val);
}
}
-
+
return true;
}
-
- Lisp* get_lisp(const char* name) const;
- Lisp* get_lisp(const std::string& name) const
+
+ const Lisp* get_lisp(const char* name) const;
+ const Lisp* get_lisp(const std::string& name) const
{ return get_lisp(name.c_str()); }
// for debugging
{
struct
{
- Lisp* car;
- Lisp* cdr;
+ const Lisp* car;
+ const Lisp* cdr;
} cons;
char* string;
#endif
+/* EOF */