this repo has no description
dekker.one
1/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2/*
3 * Main authors:
4 * Guido Tack <tack@gecode.org>
5 *
6 * Copyright:
7 * Guido Tack, 2007
8 *
9 * This file is part of Gecode, the generic constraint
10 * development environment:
11 * http://www.gecode.org
12 *
13 * Permission is hereby granted, free of charge, to any person obtaining
14 * a copy of this software and associated documentation files (the
15 * "Software"), to deal in the Software without restriction, including
16 * without limitation the rights to use, copy, modify, merge, publish,
17 * distribute, sublicense, and/or sell copies of the Software, and to
18 * permit persons to whom the Software is furnished to do so, subject to
19 * the following conditions:
20 *
21 * The above copyright notice and this permission notice shall be
22 * included in all copies or substantial portions of the Software.
23 *
24 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
28 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
29 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
30 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
31 *
32 */
33
34#ifndef GECODE_FLATZINC_SYMBOLTABLE_HH
35#define GECODE_FLATZINC_SYMBOLTABLE_HH
36
37#include <vector>
38
39#ifdef GECODE_HAS_UNORDERED_MAP
40#include <unordered_map>
41#elif defined(GECODE_HAS_GNU_HASH_MAP)
42#include <ext/hash_map>
43#else
44#include <map>
45#endif
46
47namespace Gecode { namespace FlatZinc {
48
49 /// Symbol table mapping identifiers (strings) to values
50 template<class Val>
51 class SymbolTable {
52 private:
53#ifdef GECODE_HAS_UNORDERED_MAP
54 typedef std::unordered_map<std::string,Val> mymap;
55#elif defined(GECODE_HAS_GNU_HASH_MAP)
56 class hashString {
57 public:
58 size_t operator ()(const std::string& x) const {
59 return __gnu_cxx::hash<const char*>()(x.c_str());
60 }
61 };
62 typedef __gnu_cxx::hash_map<std::string,Val,hashString> mymap;
63#else
64 typedef std::map<std::string,Val> mymap;
65#endif
66 mymap m;
67 public:
68 /// Insert \a val with \a key
69 bool put(const std::string& key, const Val& val);
70 /// Return whether \a key exists, and set \a val if it does exist
71 bool get(const std::string& key, Val& val) const;
72 };
73
74 template<class Val>
75 bool
76 SymbolTable<Val>::put(const std::string& key, const Val& val) {
77 typename mymap::const_iterator i = m.find(key);
78 bool fresh = (i == m.end());
79 m[key] = val;
80 return fresh;
81 }
82
83 template<class Val>
84 bool
85 SymbolTable<Val>::get(const std::string& key, Val& val) const {
86 typename mymap::const_iterator i = m.find(key);
87 if (i == m.end())
88 return false;
89 val = i->second;
90 return true;
91 }
92
93}}
94#endif
95
96// STATISTICS: flatzinc-any