Jip J. Dekker
3e72b0e857
git-subtree-dir: software/gecode_on_record git-subtree-split: 37ed9bda495ea87e63217c19a374b5a93bb0078e
97 lines
2.9 KiB
C++
97 lines
2.9 KiB
C++
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
|
|
/*
|
|
* Main authors:
|
|
* Guido Tack <tack@gecode.org>
|
|
*
|
|
* Copyright:
|
|
* Guido Tack, 2007
|
|
*
|
|
* This file is part of Gecode, the generic constraint
|
|
* development environment:
|
|
* http://www.gecode.org
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining
|
|
* a copy of this software and associated documentation files (the
|
|
* "Software"), to deal in the Software without restriction, including
|
|
* without limitation the rights to use, copy, modify, merge, publish,
|
|
* distribute, sublicense, and/or sell copies of the Software, and to
|
|
* permit persons to whom the Software is furnished to do so, subject to
|
|
* the following conditions:
|
|
*
|
|
* The above copyright notice and this permission notice shall be
|
|
* included in all copies or substantial portions of the Software.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
|
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
|
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
|
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
*
|
|
*/
|
|
|
|
#ifndef GECODE_FLATZINC_SYMBOLTABLE_HH
|
|
#define GECODE_FLATZINC_SYMBOLTABLE_HH
|
|
|
|
#include <vector>
|
|
|
|
#ifdef GECODE_HAS_UNORDERED_MAP
|
|
#include <unordered_map>
|
|
#elif defined(GECODE_HAS_GNU_HASH_MAP)
|
|
#include <ext/hash_map>
|
|
#else
|
|
#include <map>
|
|
#endif
|
|
|
|
namespace Gecode { namespace FlatZinc {
|
|
|
|
/// Symbol table mapping identifiers (strings) to values
|
|
template<class Val>
|
|
class SymbolTable {
|
|
private:
|
|
#ifdef GECODE_HAS_UNORDERED_MAP
|
|
typedef std::unordered_map<std::string,Val> mymap;
|
|
#elif defined(GECODE_HAS_GNU_HASH_MAP)
|
|
class hashString {
|
|
public:
|
|
size_t operator ()(const std::string& x) const {
|
|
return __gnu_cxx::hash<const char*>()(x.c_str());
|
|
}
|
|
};
|
|
typedef __gnu_cxx::hash_map<std::string,Val,hashString> mymap;
|
|
#else
|
|
typedef std::map<std::string,Val> mymap;
|
|
#endif
|
|
mymap m;
|
|
public:
|
|
/// Insert \a val with \a key
|
|
bool put(const std::string& key, const Val& val);
|
|
/// Return whether \a key exists, and set \a val if it does exist
|
|
bool get(const std::string& key, Val& val) const;
|
|
};
|
|
|
|
template<class Val>
|
|
bool
|
|
SymbolTable<Val>::put(const std::string& key, const Val& val) {
|
|
typename mymap::const_iterator i = m.find(key);
|
|
bool fresh = (i == m.end());
|
|
m[key] = val;
|
|
return fresh;
|
|
}
|
|
|
|
template<class Val>
|
|
bool
|
|
SymbolTable<Val>::get(const std::string& key, Val& val) const {
|
|
typename mymap::const_iterator i = m.find(key);
|
|
if (i == m.end())
|
|
return false;
|
|
val = i->second;
|
|
return true;
|
|
}
|
|
|
|
}}
|
|
#endif
|
|
|
|
// STATISTICS: flatzinc-any
|