/usr/include/gtkmathview/MathView/FastScopedHashMap.hh is in libgtkmathview-dev 0.8.0-10+nmu2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | // Copyright (C) 2000-2007, Luca Padovani <padovani@sti.uniurb.it>.
//
// This file is part of GtkMathView, a flexible, high-quality rendering
// engine for MathML documents.
//
// GtkMathView is free software; you can redistribute it and/or modify it
// under the terms of the GNU Lesser General Public License as published
// by the Free Software Foundation; either version 3 of the License, or
// (at your option) any later version.
//
// GtkMathView 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
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.
#ifndef __FastScopedHashMap_hh__
#define __FastScopedHashMap_hh__
#include "gmv_defines.h"
template <int MAX, class T>
class GMV_MathView_EXPORT FastScopedHashMap
{
public:
FastScopedHashMap(void) : env(0)
{
push();
for (int i = 0; i < MAX; i++)
map[i].key = i;
}
~FastScopedHashMap()
{
while (env) pop();
for (int i = 0; i < MAX; i++)
delete map[i].current_binding;
}
void push(void)
{ env = new Env(env); }
void pop()
{
Entry* p = env->first;
Env* old_env = env->prev;
delete env;
env = old_env;
while (p)
{
Entry* next = p->next_env;
p->bucket->current_binding = p->prev;
delete p;
p = next;
}
}
void set(int key, T value)
{
assert(key >= 0 && key < MAX);
Bucket* bucket = &map[key];
if (bucket->current_binding && bucket->current_binding->env == env)
bucket->current_binding->value = value;
else
{
bucket->current_binding = new Entry(env, bucket, bucket->current_binding, env->first, value);
env->first = bucket->current_binding;
}
}
T get(int key) const
{
assert(key >= 0 && key < MAX);
const Bucket* bucket = &map[key];
if (bucket->current_binding)
return bucket->current_binding->value;
else
throw NotFound();
}
bool defined(int key) const
{
assert(key >= 0 && key < MAX);
return map[key].current_binding;
}
bool definedInScope(int key) const
{
assert(key >= 0 && key < MAX);
return map[key].current_binding && map[key].current_binding->env == env;
}
class NotFound { };
private:
struct Entry;
struct Env;
struct Bucket
{
Bucket(void) : key(-1), current_binding(0) { }
int key;
Entry* current_binding;
};
struct Entry
{
Entry(Env* e, Bucket* b, Entry* p, Entry* p_env, const T& v) : env(e), bucket(b), next_env(p_env), prev(p), value(v) { }
Env* env;
Bucket* bucket;
Entry* next_env;
Entry* prev;
T value;
};
struct Env
{
Env(Env* p) : prev(p), first(0) { }
Env* prev;
Entry* first;
};
Env* env;
Bucket map[MAX];
};
#endif // __FastScopedHashMap_hh__
|