65 lines
2.1 KiB
C++
65 lines
2.1 KiB
C++
/*
|
|
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
|
|
Released under Apache 2.0 license as described in the file LICENSE.
|
|
|
|
Author: Leonardo de Moura
|
|
*/
|
|
#pragma once
|
|
#include <utility>
|
|
#include "util/rb_map.h"
|
|
#include "util/name.h"
|
|
#include "util/list.h"
|
|
#include "util/pair.h"
|
|
|
|
namespace lean {
|
|
/**
|
|
\brief A map from name to values.
|
|
|
|
It also supports the operation \c find_idx that returns "when a declaration was inserted into the map".
|
|
*/
|
|
template<typename V>
|
|
class local_decls {
|
|
typedef name_map<pair<V, unsigned>> map;
|
|
typedef list<pair<name, V>> entries;
|
|
map m_map;
|
|
entries m_entries;
|
|
unsigned m_counter;
|
|
public:
|
|
local_decls():m_counter(1) {}
|
|
local_decls(local_decls const & d):
|
|
m_map(d.m_map), m_entries(d.m_entries), m_counter(d.m_counter) {}
|
|
void insert(name const & k, V const & v) {
|
|
m_map.insert(k, mk_pair(v, m_counter));
|
|
m_entries = cons(mk_pair(k, v), m_entries);
|
|
m_counter++;
|
|
lean_assert(m_counter == length(m_entries)+1);
|
|
}
|
|
unsigned size() const {
|
|
lean_assert(m_counter > 0);
|
|
return m_counter - 1;
|
|
}
|
|
void update_entries(entries const & new_entries) {
|
|
lean_assert(length(new_entries) == length(m_entries));
|
|
auto it1 = m_entries;
|
|
auto it2 = new_entries;
|
|
unsigned i = length(new_entries);
|
|
while (it1.raw() != it2.raw()) {
|
|
name const & k = head(it2).first;
|
|
V const & v = head(it2).second;
|
|
lean_assert(m_map.find(k));
|
|
lean_assert_eq(m_map.find(k)->second, i);
|
|
m_map.insert(k, mk_pair(v, i));
|
|
it1 = tail(it1);
|
|
it2 = tail(it2);
|
|
--i;
|
|
}
|
|
m_entries = new_entries;
|
|
}
|
|
|
|
V const * find(name const & k) const { auto it = m_map.find(k); return it ? &(it->first) : nullptr; }
|
|
unsigned find_idx(name const & k) const { auto it = m_map.find(k); return it ? it->second : 0; }
|
|
bool contains(name const & k) const { return m_map.contains(k); }
|
|
entries const & get_entries() const { return m_entries; }
|
|
bool empty() const { return m_map.empty(); }
|
|
};
|
|
}
|