/********************* */
/*! \file symbol_table.cpp
** \verbatim
- ** Original author: Morgan Deters
- ** Major contributors: Christopher L. Conway
- ** Minor contributors (to current version): Andrew Reynolds, Dejan Jovanovic, Francois Bobot
+ ** Top contributors (to current version):
+ ** Andrew Reynolds, Tim King, Morgan Deters
** This file is part of the CVC4 project.
- ** Copyright (c) 2009-2014 New York University and The University of Iowa
- ** See the file COPYING in the top-level source directory for licensing
- ** information.\endverbatim
+ ** Copyright (c) 2009-2021 by the authors listed in the file AUTHORS
+ ** in the top-level source directory and their institutional affiliations.
+ ** All rights reserved. See the file COPYING in the top-level source
+ ** directory for licensing information.\endverbatim
**
** \brief Convenience class for scoping variable and type
** declarations (implementation)
**/
#include "expr/symbol_table.h"
-#include "expr/expr.h"
-#include "expr/type.h"
-#include "expr/expr_manager_scope.h"
+
+#include <ostream>
+#include <string>
+#include <unordered_map>
+#include <utility>
+
+#include "api/cvc4cpp.h"
#include "context/cdhashmap.h"
#include "context/cdhashset.h"
#include "context/context.h"
-#include <string>
-#include <utility>
+namespace cvc5 {
+
+using ::cvc5::context::CDHashMap;
+using ::cvc5::context::CDHashSet;
+using ::cvc5::context::Context;
+using ::std::copy;
+using ::std::endl;
+using ::std::ostream_iterator;
+using ::std::pair;
+using ::std::string;
+using ::std::vector;
+
+/** Overloaded type trie.
+ *
+ * This data structure stores a trie of expressions with
+ * the same name, and must be distinguished by their argument types.
+ * It is context-dependent.
+ *
+ * Using the argument allowFunVariants,
+ * it may either be configured to allow function variants or not,
+ * where a function variant is function that expects the same
+ * argument types as another.
+ *
+ * For example, the following definitions introduce function
+ * variants for the symbol f:
+ *
+ * 1. (declare-fun f (Int) Int) and
+ * (declare-fun f (Int) Bool)
+ *
+ * 2. (declare-fun f (Int) Int) and
+ * (declare-fun f (Int) Int)
+ *
+ * 3. (declare-datatypes ((Tup 0)) ((f (data Int)))) and
+ * (declare-fun f (Int) Tup)
+ *
+ * 4. (declare-datatypes ((Tup 0)) ((mkTup (f Int)))) and
+ * (declare-fun f (Tup) Bool)
+ *
+ * If function variants is set to true, we allow function variants
+ * but not function redefinition. In examples 2 and 3, f is
+ * declared twice as a symbol of identical argument and range
+ * types. We never accept these definitions. However, we do
+ * allow examples 1 and 4 above when allowFunVariants is true.
+ *
+ * For 0-argument functions (constants), we always allow
+ * function variants. That is, we always accept these examples:
+ *
+ * 5. (declare-fun c () Int)
+ * (declare-fun c () Bool)
+ *
+ * 6. (declare-datatypes ((Enum 0)) ((c)))
+ * (declare-fun c () Int)
+ *
+ * and always reject constant redefinition such as:
+ *
+ * 7. (declare-fun c () Int)
+ * (declare-fun c () Int)
+ *
+ * 8. (declare-datatypes ((Enum 0)) ((c))) and
+ * (declare-fun c () Enum)
+ */
+class OverloadedTypeTrie {
+ public:
+ OverloadedTypeTrie(Context* c, bool allowFunVariants = false)
+ : d_overloaded_symbols(
+ new (true) CDHashSet<api::Term, api::TermHashFunction>(c)),
+ d_allowFunctionVariants(allowFunVariants)
+ {
+ }
+ ~OverloadedTypeTrie() { d_overloaded_symbols->deleteSelf(); }
+
+ /** is this function overloaded? */
+ bool isOverloadedFunction(api::Term fun) const;
+
+ /** Get overloaded constant for type.
+ * If possible, it returns a defined symbol with name
+ * that has type t. Otherwise returns null expression.
+ */
+ api::Term getOverloadedConstantForType(const std::string& name,
+ api::Sort t) const;
-using namespace CVC4;
-using namespace CVC4::context;
-using namespace std;
+ /**
+ * If possible, returns a defined function for a name
+ * and a vector of expected argument types. Otherwise returns
+ * null expression.
+ */
+ api::Term getOverloadedFunctionForTypes(
+ const std::string& name, const std::vector<api::Sort>& argTypes) const;
+ /** called when obj is bound to name, and prev_bound_obj was already bound to
+ * name Returns false if the binding is invalid.
+ */
+ bool bind(const string& name, api::Term prev_bound_obj, api::Term obj);
-namespace CVC4 {
+ private:
+ /** Marks expression obj with name as overloaded.
+ * Adds relevant information to the type arg trie data structure.
+ * It returns false if there is already an expression bound to that name
+ * whose type expects the same arguments as the type of obj but is not
+ * identical to the type of obj. For example, if we declare :
+ *
+ * (declare-datatypes () ((List (cons (hd Int) (tl List)) (nil))))
+ * (declare-fun cons (Int List) List)
+ *
+ * cons : constructor_type( Int, List, List )
+ * cons : function_type( Int, List, List )
+ *
+ * These are put in the same place in the trie but do not have identical type,
+ * hence we return false.
+ */
+ bool markOverloaded(const string& name, api::Term obj);
+ /** the null expression */
+ api::Term d_nullTerm;
+ // The (context-independent) trie storing that maps expected argument
+ // vectors to symbols. All expressions stored in d_symbols are only
+ // interpreted as active if they also appear in the context-dependent
+ // set d_overloaded_symbols.
+ class TypeArgTrie {
+ public:
+ // children of this node
+ std::map<api::Sort, TypeArgTrie> d_children;
+ // symbols at this node
+ std::map<api::Sort, api::Term> d_symbols;
+ };
+ /** for each string with operator overloading, this stores the data structure
+ * above. */
+ std::unordered_map<std::string, TypeArgTrie> d_overload_type_arg_trie;
+ /** The set of overloaded symbols. */
+ CDHashSet<api::Term, api::TermHashFunction>* d_overloaded_symbols;
+ /** allow function variants
+ * This is true if we allow overloading (non-constant) functions that expect
+ * the same argument types.
+ */
+ bool d_allowFunctionVariants;
+ /** get unique overloaded function
+ * If tat->d_symbols contains an active overloaded function, it
+ * returns that function, where that function must be unique
+ * if reqUnique=true.
+ * Otherwise, it returns the null expression.
+ */
+ api::Term getOverloadedFunctionAt(const TypeArgTrie* tat,
+ bool reqUnique = true) const;
+};
-SymbolTable::SymbolTable() :
- d_context(new Context()),
- d_exprMap(new(true) CDHashMap<std::string, Expr, StringHashFunction>(d_context)),
- d_typeMap(new(true) CDHashMap<std::string, pair<vector<Type>, Type>, StringHashFunction>(d_context)),
- d_functions(new(true) CDHashSet<Expr, ExprHashFunction>(d_context)) {
+bool OverloadedTypeTrie::isOverloadedFunction(api::Term fun) const
+{
+ return d_overloaded_symbols->find(fun) != d_overloaded_symbols->end();
}
-SymbolTable::~SymbolTable() {
- d_exprMap->deleteSelf();
- d_typeMap->deleteSelf();
- d_functions->deleteSelf();
- delete d_context;
+api::Term OverloadedTypeTrie::getOverloadedConstantForType(
+ const std::string& name, api::Sort t) const
+{
+ std::unordered_map<std::string, TypeArgTrie>::const_iterator it =
+ d_overload_type_arg_trie.find(name);
+ if (it != d_overload_type_arg_trie.end()) {
+ std::map<api::Sort, api::Term>::const_iterator its =
+ it->second.d_symbols.find(t);
+ if (its != it->second.d_symbols.end()) {
+ api::Term expr = its->second;
+ // must be an active symbol
+ if (isOverloadedFunction(expr)) {
+ return expr;
+ }
+ }
+ }
+ return d_nullTerm;
}
-void SymbolTable::bind(const std::string& name, Expr obj,
- bool levelZero) throw() {
- CheckArgument(!obj.isNull(), obj, "cannot bind to a null Expr");
- ExprManagerScope ems(obj);
- if(levelZero) d_exprMap->insertAtContextLevelZero(name, obj);
- else d_exprMap->insert(name, obj);
+api::Term OverloadedTypeTrie::getOverloadedFunctionForTypes(
+ const std::string& name, const std::vector<api::Sort>& argTypes) const
+{
+ std::unordered_map<std::string, TypeArgTrie>::const_iterator it =
+ d_overload_type_arg_trie.find(name);
+ if (it != d_overload_type_arg_trie.end()) {
+ const TypeArgTrie* tat = &it->second;
+ for (unsigned i = 0; i < argTypes.size(); i++) {
+ std::map<api::Sort, TypeArgTrie>::const_iterator itc =
+ tat->d_children.find(argTypes[i]);
+ if (itc != tat->d_children.end()) {
+ tat = &itc->second;
+ } else {
+ Trace("parser-overloading")
+ << "Could not find overloaded function " << name << std::endl;
+
+ // no functions match
+ return d_nullTerm;
+ }
+ }
+ // we ensure that there is *only* one active symbol at this node
+ return getOverloadedFunctionAt(tat);
+ }
+ return d_nullTerm;
}
-void SymbolTable::bindDefinedFunction(const std::string& name, Expr obj,
- bool levelZero) throw() {
- CheckArgument(!obj.isNull(), obj, "cannot bind to a null Expr");
- ExprManagerScope ems(obj);
- if(levelZero){
- d_exprMap->insertAtContextLevelZero(name, obj);
- d_functions->insertAtContextLevelZero(obj);
- } else {
- d_exprMap->insert(name, obj);
- d_functions->insert(obj);
+bool OverloadedTypeTrie::bind(const string& name,
+ api::Term prev_bound_obj,
+ api::Term obj)
+{
+ bool retprev = true;
+ if (!isOverloadedFunction(prev_bound_obj)) {
+ // mark previous as overloaded
+ retprev = markOverloaded(name, prev_bound_obj);
}
+ // mark this as overloaded
+ bool retobj = markOverloaded(name, obj);
+ return retprev && retobj;
}
-bool SymbolTable::isBound(const std::string& name) const throw() {
- return d_exprMap->find(name) != d_exprMap->end();
+bool OverloadedTypeTrie::markOverloaded(const string& name, api::Term obj)
+{
+ Trace("parser-overloading") << "Overloaded function : " << name;
+ Trace("parser-overloading") << " with type " << obj.getSort() << std::endl;
+ // get the argument types
+ api::Sort t = obj.getSort();
+ api::Sort rangeType = t;
+ std::vector<api::Sort> argTypes;
+ if (t.isFunction())
+ {
+ argTypes = t.getFunctionDomainSorts();
+ rangeType = t.getFunctionCodomainSort();
+ }
+ else if (t.isConstructor())
+ {
+ argTypes = t.getConstructorDomainSorts();
+ rangeType = t.getConstructorCodomainSort();
+ }
+ else if (t.isTester())
+ {
+ argTypes.push_back(t.getTesterDomainSort());
+ rangeType = t.getTesterCodomainSort();
+ }
+ else if (t.isSelector())
+ {
+ argTypes.push_back(t.getSelectorDomainSort());
+ rangeType = t.getSelectorCodomainSort();
+ }
+ // add to the trie
+ TypeArgTrie* tat = &d_overload_type_arg_trie[name];
+ for (unsigned i = 0; i < argTypes.size(); i++) {
+ tat = &(tat->d_children[argTypes[i]]);
+ }
+
+ // check if function variants are allowed here
+ if (d_allowFunctionVariants || argTypes.empty())
+ {
+ // they are allowed, check for redefinition
+ std::map<api::Sort, api::Term>::iterator it =
+ tat->d_symbols.find(rangeType);
+ if (it != tat->d_symbols.end())
+ {
+ api::Term prev_obj = it->second;
+ // if there is already an active function with the same name and expects
+ // the same argument types and has the same return type, we reject the
+ // re-declaration here.
+ if (isOverloadedFunction(prev_obj))
+ {
+ return false;
+ }
+ }
+ }
+ else
+ {
+ // they are not allowed, we cannot have any function defined here.
+ api::Term existingFun = getOverloadedFunctionAt(tat, false);
+ if (!existingFun.isNull())
+ {
+ return false;
+ }
+ }
+
+ // otherwise, update the symbols
+ d_overloaded_symbols->insert(obj);
+ tat->d_symbols[rangeType] = obj;
+ return true;
}
-bool SymbolTable::isBoundDefinedFunction(const std::string& name) const throw() {
- CDHashMap<std::string, Expr, StringHashFunction>::iterator found =
- d_exprMap->find(name);
- return found != d_exprMap->end() && d_functions->contains((*found).second);
+api::Term OverloadedTypeTrie::getOverloadedFunctionAt(
+ const OverloadedTypeTrie::TypeArgTrie* tat, bool reqUnique) const
+{
+ api::Term retExpr;
+ for (std::map<api::Sort, api::Term>::const_iterator its =
+ tat->d_symbols.begin();
+ its != tat->d_symbols.end();
+ ++its)
+ {
+ api::Term expr = its->second;
+ if (isOverloadedFunction(expr))
+ {
+ if (retExpr.isNull())
+ {
+ if (!reqUnique)
+ {
+ return expr;
+ }
+ else
+ {
+ retExpr = expr;
+ }
+ }
+ else
+ {
+ // multiple functions match
+ return d_nullTerm;
+ }
+ }
+ }
+ return retExpr;
}
-bool SymbolTable::isBoundDefinedFunction(Expr func) const throw() {
- return d_functions->contains(func);
+class SymbolTable::Implementation {
+ public:
+ Implementation()
+ : d_context(),
+ d_exprMap(&d_context),
+ d_typeMap(&d_context),
+ d_overload_trie(&d_context)
+ {
+ // use an outermost push, to be able to clear definitions not at level zero
+ d_context.push();
+ }
+
+ ~Implementation() { d_context.pop(); }
+
+ bool bind(const string& name, api::Term obj, bool levelZero, bool doOverload);
+ void bindType(const string& name, api::Sort t, bool levelZero = false);
+ void bindType(const string& name,
+ const vector<api::Sort>& params,
+ api::Sort t,
+ bool levelZero = false);
+ bool isBound(const string& name) const;
+ bool isBoundType(const string& name) const;
+ api::Term lookup(const string& name) const;
+ api::Sort lookupType(const string& name) const;
+ api::Sort lookupType(const string& name,
+ const vector<api::Sort>& params) const;
+ size_t lookupArity(const string& name);
+ void popScope();
+ void pushScope();
+ size_t getLevel() const;
+ void reset();
+ void resetAssertions();
+ //------------------------ operator overloading
+ /** implementation of function from header */
+ bool isOverloadedFunction(api::Term fun) const;
+
+ /** implementation of function from header */
+ api::Term getOverloadedConstantForType(const std::string& name,
+ api::Sort t) const;
+
+ /** implementation of function from header */
+ api::Term getOverloadedFunctionForTypes(
+ const std::string& name, const std::vector<api::Sort>& argTypes) const;
+ //------------------------ end operator overloading
+ private:
+ /** The context manager for the scope maps. */
+ Context d_context;
+
+ /** A map for expressions. */
+ CDHashMap<string, api::Term> d_exprMap;
+
+ /** A map for types. */
+ using TypeMap = CDHashMap<string, std::pair<vector<api::Sort>, api::Sort>>;
+ TypeMap d_typeMap;
+
+ //------------------------ operator overloading
+ // the null expression
+ api::Term d_nullTerm;
+ // overloaded type trie, stores all information regarding overloading
+ OverloadedTypeTrie d_overload_trie;
+ /** bind with overloading
+ * This is called whenever obj is bound to name where overloading symbols is
+ * allowed. If a symbol is previously bound to that name, it marks both as
+ * overloaded. Returns false if the binding was invalid.
+ */
+ bool bindWithOverloading(const string& name, api::Term obj);
+ //------------------------ end operator overloading
+}; /* SymbolTable::Implementation */
+
+bool SymbolTable::Implementation::bind(const string& name,
+ api::Term obj,
+ bool levelZero,
+ bool doOverload)
+{
+ PrettyCheckArgument(!obj.isNull(), obj, "cannot bind to a null api::Term");
+ Trace("sym-table") << "SymbolTable: bind " << name
+ << ", levelZero=" << levelZero
+ << ", doOverload=" << doOverload << std::endl;
+ if (doOverload) {
+ if (!bindWithOverloading(name, obj)) {
+ return false;
+ }
+ }
+ if (levelZero) {
+ d_exprMap.insertAtContextLevelZero(name, obj);
+ } else {
+ d_exprMap.insert(name, obj);
+ }
+ return true;
}
-Expr SymbolTable::lookup(const std::string& name) const throw() {
- return (*d_exprMap->find(name)).second;
+bool SymbolTable::Implementation::isBound(const string& name) const {
+ return d_exprMap.find(name) != d_exprMap.end();
}
-void SymbolTable::bindType(const std::string& name, Type t,
- bool levelZero) throw() {
- if(levelZero) {
- d_typeMap->insertAtContextLevelZero(name, make_pair(vector<Type>(), t));
+api::Term SymbolTable::Implementation::lookup(const string& name) const
+{
+ Assert(isBound(name));
+ api::Term expr = (*d_exprMap.find(name)).second;
+ if (isOverloadedFunction(expr)) {
+ return d_nullTerm;
} else {
- d_typeMap->insert(name, make_pair(vector<Type>(), t));
+ return expr;
}
}
-void SymbolTable::bindType(const std::string& name,
- const std::vector<Type>& params,
- Type t,
- bool levelZero) throw() {
- if(Debug.isOn("sort")) {
+void SymbolTable::Implementation::bindType(const string& name,
+ api::Sort t,
+ bool levelZero)
+{
+ if (levelZero) {
+ d_typeMap.insertAtContextLevelZero(name, make_pair(vector<api::Sort>(), t));
+ } else {
+ d_typeMap.insert(name, make_pair(vector<api::Sort>(), t));
+ }
+}
+
+void SymbolTable::Implementation::bindType(const string& name,
+ const vector<api::Sort>& params,
+ api::Sort t,
+ bool levelZero)
+{
+ if (Debug.isOn("sort")) {
Debug("sort") << "bindType(" << name << ", [";
- if(params.size() > 0) {
- copy( params.begin(), params.end() - 1,
- ostream_iterator<Type>(Debug("sort"), ", ") );
+ if (params.size() > 0) {
+ copy(params.begin(),
+ params.end() - 1,
+ ostream_iterator<api::Sort>(Debug("sort"), ", "));
Debug("sort") << params.back();
}
Debug("sort") << "], " << t << ")" << endl;
}
- if(levelZero) {
- d_typeMap->insertAtContextLevelZero(name, make_pair(params, t));
+ if (levelZero) {
+ d_typeMap.insertAtContextLevelZero(name, make_pair(params, t));
} else {
- d_typeMap->insert(name, make_pair(params, t));
+ d_typeMap.insert(name, make_pair(params, t));
}
}
-bool SymbolTable::isBoundType(const std::string& name) const throw() {
- return d_typeMap->find(name) != d_typeMap->end();
+bool SymbolTable::Implementation::isBoundType(const string& name) const {
+ return d_typeMap.find(name) != d_typeMap.end();
}
-Type SymbolTable::lookupType(const std::string& name) const throw() {
- pair<vector<Type>, Type> p = (*d_typeMap->find(name)).second;
- CheckArgument(p.first.size() == 0, name,
- "type constructor arity is wrong: "
- "`%s' requires %u parameters but was provided 0",
- name.c_str(), p.first.size());
+api::Sort SymbolTable::Implementation::lookupType(const string& name) const
+{
+ std::pair<std::vector<api::Sort>, api::Sort> p =
+ (*d_typeMap.find(name)).second;
+ PrettyCheckArgument(p.first.size() == 0, name,
+ "type constructor arity is wrong: "
+ "`%s' requires %u parameters but was provided 0",
+ name.c_str(), p.first.size());
return p.second;
}
-Type SymbolTable::lookupType(const std::string& name,
- const std::vector<Type>& params) const throw() {
- pair<vector<Type>, Type> p = (*d_typeMap->find(name)).second;
- CheckArgument(p.first.size() == params.size(), params,
- "type constructor arity is wrong: "
- "`%s' requires %u parameters but was provided %u",
- name.c_str(), p.first.size(), params.size());
- if(p.first.size() == 0) {
- CheckArgument(p.second.isSort(), name);
+api::Sort SymbolTable::Implementation::lookupType(
+ const string& name, const vector<api::Sort>& params) const
+{
+ std::pair<std::vector<api::Sort>, api::Sort> p =
+ (*d_typeMap.find(name)).second;
+ PrettyCheckArgument(p.first.size() == params.size(), params,
+ "type constructor arity is wrong: "
+ "`%s' requires %u parameters but was provided %u",
+ name.c_str(), p.first.size(), params.size());
+ if (p.first.size() == 0) {
+ PrettyCheckArgument(p.second.isUninterpretedSort(), name.c_str());
return p.second;
}
- if(p.second.isSortConstructor()) {
- if(Debug.isOn("sort")) {
- Debug("sort") << "instantiating using a sort constructor" << endl;
- Debug("sort") << "have formals [";
- copy( p.first.begin(), p.first.end() - 1,
- ostream_iterator<Type>(Debug("sort"), ", ") );
- Debug("sort") << p.first.back() << "]" << endl
- << "parameters [";
- copy( params.begin(), params.end() - 1,
- ostream_iterator<Type>(Debug("sort"), ", ") );
- Debug("sort") << params.back() << "]" << endl
- << "type ctor " << name << endl
- << "type is " << p.second << endl;
- }
+ if (p.second.isDatatype())
+ {
+ PrettyCheckArgument(
+ p.second.isParametricDatatype(), name, "expected parametric datatype");
+ return p.second.instantiate(params);
+ }
+ bool isSortConstructor = p.second.isSortConstructor();
+ if (Debug.isOn("sort"))
+ {
+ Debug("sort") << "instantiating using a sort "
+ << (isSortConstructor ? "constructor" : "substitution")
+ << std::endl;
+ Debug("sort") << "have formals [";
+ copy(p.first.begin(),
+ p.first.end() - 1,
+ ostream_iterator<api::Sort>(Debug("sort"), ", "));
+ Debug("sort") << p.first.back() << "]" << std::endl << "parameters [";
+ copy(params.begin(),
+ params.end() - 1,
+ ostream_iterator<api::Sort>(Debug("sort"), ", "));
+ Debug("sort") << params.back() << "]" << endl
+ << "type ctor " << name << std::endl
+ << "type is " << p.second << std::endl;
+ }
+ api::Sort instantiation = isSortConstructor
+ ? p.second.instantiate(params)
+ : p.second.substitute(p.first, params);
- Type instantiation =
- SortConstructorType(p.second).instantiate(params);
+ Debug("sort") << "instance is " << instantiation << std::endl;
- Debug("sort") << "instance is " << instantiation << endl;
+ return instantiation;
+}
- return instantiation;
- } else if(p.second.isDatatype()) {
- CheckArgument(DatatypeType(p.second).isParametric(), name, "expected parametric datatype");
- return DatatypeType(p.second).instantiate(params);
- } else {
- if(Debug.isOn("sort")) {
- Debug("sort") << "instantiating using a sort substitution" << endl;
- Debug("sort") << "have formals [";
- copy( p.first.begin(), p.first.end() - 1,
- ostream_iterator<Type>(Debug("sort"), ", ") );
- Debug("sort") << p.first.back() << "]" << endl
- << "parameters [";
- copy( params.begin(), params.end() - 1,
- ostream_iterator<Type>(Debug("sort"), ", ") );
- Debug("sort") << params.back() << "]" << endl
- << "type ctor " << name << endl
- << "type is " << p.second << endl;
- }
+size_t SymbolTable::Implementation::lookupArity(const string& name) {
+ std::pair<std::vector<api::Sort>, api::Sort> p =
+ (*d_typeMap.find(name)).second;
+ return p.first.size();
+}
+
+void SymbolTable::Implementation::popScope() {
+ // should not pop beyond level one
+ if (d_context.getLevel() == 1)
+ {
+ throw ScopeException();
+ }
+ d_context.pop();
+}
- Type instantiation = p.second.substitute(p.first, params);
+void SymbolTable::Implementation::pushScope() { d_context.push(); }
- Debug("sort") << "instance is " << instantiation << endl;
+size_t SymbolTable::Implementation::getLevel() const {
+ return d_context.getLevel();
+}
+
+void SymbolTable::Implementation::reset() {
+ Trace("sym-table") << "SymbolTable: reset" << std::endl;
+ this->SymbolTable::Implementation::~Implementation();
+ new (this) SymbolTable::Implementation();
+}
- return instantiation;
+void SymbolTable::Implementation::resetAssertions()
+{
+ Trace("sym-table") << "SymbolTable: resetAssertions" << std::endl;
+ // pop all contexts
+ while (d_context.getLevel() > 0)
+ {
+ d_context.pop();
}
+ d_context.push();
}
-size_t SymbolTable::lookupArity(const std::string& name) {
- pair<vector<Type>, Type> p = (*d_typeMap->find(name)).second;
- return p.first.size();
+bool SymbolTable::Implementation::isOverloadedFunction(api::Term fun) const
+{
+ return d_overload_trie.isOverloadedFunction(fun);
}
-void SymbolTable::popScope() throw(ScopeException) {
- if( d_context->getLevel() == 0 ) {
- throw ScopeException();
+api::Term SymbolTable::Implementation::getOverloadedConstantForType(
+ const std::string& name, api::Sort t) const
+{
+ return d_overload_trie.getOverloadedConstantForType(name, t);
+}
+
+api::Term SymbolTable::Implementation::getOverloadedFunctionForTypes(
+ const std::string& name, const std::vector<api::Sort>& argTypes) const
+{
+ return d_overload_trie.getOverloadedFunctionForTypes(name, argTypes);
+}
+
+bool SymbolTable::Implementation::bindWithOverloading(const string& name,
+ api::Term obj)
+{
+ CDHashMap<string, api::Term>::const_iterator it = d_exprMap.find(name);
+ if (it != d_exprMap.end())
+ {
+ const api::Term& prev_bound_obj = (*it).second;
+ if (prev_bound_obj != obj) {
+ return d_overload_trie.bind(name, prev_bound_obj, obj);
+ }
}
- d_context->pop();
+ return true;
+}
+
+bool SymbolTable::isOverloadedFunction(api::Term fun) const
+{
+ return d_implementation->isOverloadedFunction(fun);
+}
+
+api::Term SymbolTable::getOverloadedConstantForType(const std::string& name,
+ api::Sort t) const
+{
+ return d_implementation->getOverloadedConstantForType(name, t);
+}
+
+api::Term SymbolTable::getOverloadedFunctionForTypes(
+ const std::string& name, const std::vector<api::Sort>& argTypes) const
+{
+ return d_implementation->getOverloadedFunctionForTypes(name, argTypes);
}
-void SymbolTable::pushScope() throw() {
- d_context->push();
+SymbolTable::SymbolTable() : d_implementation(new SymbolTable::Implementation())
+{
}
-size_t SymbolTable::getLevel() const throw() {
- return d_context->getLevel();
+SymbolTable::~SymbolTable() {}
+bool SymbolTable::bind(const string& name,
+ api::Term obj,
+ bool levelZero,
+ bool doOverload)
+{
+ return d_implementation->bind(name, obj, levelZero, doOverload);
}
-void SymbolTable::reset() {
- this->SymbolTable::~SymbolTable();
- new(this) SymbolTable();
+void SymbolTable::bindType(const string& name, api::Sort t, bool levelZero)
+{
+ d_implementation->bindType(name, t, levelZero);
+}
+
+void SymbolTable::bindType(const string& name,
+ const vector<api::Sort>& params,
+ api::Sort t,
+ bool levelZero)
+{
+ d_implementation->bindType(name, params, t, levelZero);
+}
+
+bool SymbolTable::isBound(const string& name) const
+{
+ return d_implementation->isBound(name);
+}
+bool SymbolTable::isBoundType(const string& name) const
+{
+ return d_implementation->isBoundType(name);
+}
+api::Term SymbolTable::lookup(const string& name) const
+{
+ return d_implementation->lookup(name);
+}
+api::Sort SymbolTable::lookupType(const string& name) const
+{
+ return d_implementation->lookupType(name);
+}
+
+api::Sort SymbolTable::lookupType(const string& name,
+ const vector<api::Sort>& params) const
+{
+ return d_implementation->lookupType(name, params);
+}
+size_t SymbolTable::lookupArity(const string& name) {
+ return d_implementation->lookupArity(name);
}
+void SymbolTable::popScope() { d_implementation->popScope(); }
+void SymbolTable::pushScope() { d_implementation->pushScope(); }
+size_t SymbolTable::getLevel() const { return d_implementation->getLevel(); }
+void SymbolTable::reset() { d_implementation->reset(); }
+void SymbolTable::resetAssertions() { d_implementation->resetAssertions(); }
-}/* CVC4 namespace */
+} // namespace cvc5
projects / cvc5.git / blobdiff