You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
46 lines
1.4 KiB
46 lines
1.4 KiB
/* This file is part of TDevelop
|
|
Copyright (C) 2005 Tobias Erbsland <te@profzone.ch>
|
|
Copyright (C) 2002,2003 Roberto Raggi <roberto@tdevelop.org>
|
|
|
|
This library is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU Library General Public
|
|
License as published by the Free Software Foundation; either
|
|
version 2 of the License, or (at your option) any later version.
|
|
|
|
This library 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
|
|
Library General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Library General Public License
|
|
along with this library; see the file COPYING.LIB. If not, write to
|
|
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
|
|
Boston, MA 02110-1301, USA.
|
|
*/
|
|
|
|
#ifndef _LOOKUP_H_
|
|
#define _LOOKUP_H_
|
|
|
|
#include <tqstring.h>
|
|
#include <tqmap.h>
|
|
|
|
#include "lexer.h"
|
|
#include <ext/hash_map>
|
|
#include <hashedstring.h>
|
|
|
|
/**
|
|
* @short Fast keyword lookup.
|
|
*/
|
|
class Lookup {
|
|
public:
|
|
typedef __gnu_cxx::hash_map<HashedString,Type> KeywordMap;
|
|
/**
|
|
* Find an entry in the table, and return its value
|
|
*/
|
|
static int find( const HashedString& s );
|
|
|
|
static const KeywordMap& keywords();
|
|
};
|
|
|
|
#endif
|