max/lean4-htt
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions 2

feat(library/compiler,runtime): builtin support for lean.name

Browse source
This commit is contained in:
Leonardo de Moura 2019-02-05 12:57:46 -08:00
parent f17101cfbe
commit 3444a295e7
35 changed files with 147 additions and 62 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
src/kernel/expr.cpp
View file

@ -10,8 +10,8 @@ Author: Leonardo de Moura
#include <string>
#include <algorithm>
#include <limits>
#include "runtime/hash.h"
#include "util/list_fn.h"
#include "util/hash.h"
#include "util/buffer.h"
#include "kernel/expr.h"
#include "kernel/expr_eq_fn.h"

2
src/kernel/expr.h
View file

@ -14,10 +14,10 @@ Author: Leonardo de Moura
#include "runtime/optional.h"
#include "runtime/thread.h"
#include "runtime/serializer.h"
#include "runtime/hash.h"
#include "util/rc.h"
#include "util/name.h"
#include "util/nat.h"
#include "util/hash.h"
#include "util/buffer.h"
#include "util/kvmap.h"
#include "util/list_fn.h"

2
src/kernel/expr_sets.h
View file

@ -8,7 +8,7 @@ Author: Leonardo de Moura
#include <unordered_set>
#include <utility>
#include <functional>
#include "util/hash.h"
#include "runtime/hash.h"
#include "kernel/expr.h"
namespace lean {

2
src/kernel/level.cpp
View file

@ -10,11 +10,11 @@ Author: Leonardo de Moura
#include <unordered_set>
#include "runtime/debug.h"
#include "runtime/interrupt.h"
#include "runtime/hash.h"
#include "util/safe_arith.h"
#include "util/buffer.h"
#include "util/rc.h"
#include "util/list.h"
#include "util/hash.h"
#include "kernel/level.h"
#include "kernel/environment.h"

3
src/library/annotation.cpp
View file

@ -8,6 +8,7 @@ Author: Leonardo de Moura
#include <memory>
#include <string>
#include "runtime/sstream.h"
#include "util/name_hash_map.h"
#include "library/abstract_type_context.h"
#include "library/annotation.h"
#include "library/pos_info_provider.h"
@ -19,7 +20,7 @@ kvmap mk_annotation_kvmap(name const & k) {
return set_name(kvmap(), *g_annotation, k);
}
typedef std::unordered_map<name, kvmap, name_hash, name_eq> annotation_maps;
typedef name_hash_map<kvmap> annotation_maps;
static annotation_maps * g_annotation_maps = nullptr;
void register_annotation(name const & kind) {

7
src/library/compiler/builtin.cpp
View file

@ -24,7 +24,7 @@ struct builtin_decl {
}
};
typedef std::unordered_map<name, builtin_decl, name_hash> builtin_map;
typedef std::unordered_map<name, builtin_decl, name_hash_fn> builtin_map;
static builtin_map * g_builtin_decls = nullptr;
@ -316,6 +316,11 @@ void initialize_builtin() {
register_builtin(name({"thunk", "get"}), o_o_o, "lean::thunk_get", bb, xu);
register_builtin(name({"thunk", "bind"}), o_o_o_o_o, "lean::thunk_get", bb, xu);
register_builtin(name({"thunk", "map"}), o_o_o_o_o, "lean::thunk_bind", bbcc, xxuu);
/* name builtin functions */
register_builtin(name({"lean", "name", "hash"}), o_us, "lean::name_hash_usize", b);
register_builtin(name({"lean", "name", "mk_string"}), o_o_o, "lean::name_mk_string");
register_builtin(name({"lean", "name", "mk_numeral"}), o_o_o, "lean::name_mk_numeral");
}
void finalize_builtin() {

13
src/library/compiler/csimp.cpp
View file

@ -67,7 +67,6 @@ class csimp_fn {
*/
typedef rb_map<pair<expr, unsigned>, expr, pair_cmp<expr_quick_cmp, unsigned_cmp>> proj2var;
proj2var m_proj2var;
typedef std::unordered_set<name, name_hash> name_set;
environment const & env() const { return m_st.env(); }
@ -333,7 +332,7 @@ class csimp_fn {
unsigned m_num_branches{0};
/* The number of branches that return a constructor application. */
unsigned m_num_cnstr_results{0};
name_set m_visited_jps;
name_hash_set m_visited_jps;
};
void collect_cases_info(expr e, cases_info_result & result) {
@ -689,7 +688,7 @@ class csimp_fn {
}
/* Return true iff `e` contains a free variable in `s` */
bool depends_on(expr const & e, name_set const & s) {
bool depends_on(expr const & e, name_hash_set const & s) {
if (!has_fvar(e)) return false;
bool found = false;
for_each(e, [&](expr const & e, unsigned) {
@ -722,7 +721,7 @@ class csimp_fn {
buffer<pair<expr, expr>> & entries_ndep_x) {
if (entries.empty())
return;
name_set deps;
name_hash_set deps;
deps.insert(fvar_name(x));
/* Recall that `entries` are in reverse order. That is, pos 0 is the inner most variable. */
unsigned i = entries.size();
@ -785,7 +784,7 @@ class csimp_fn {
/* Copy `src_entries` and the new joint points that depend on them to `entries`, and update `entries_fvars`.
This method is used after we perform a `float_cases_on`. */
void move_to_entries(buffer<expr_pair> const & src_entries, buffer<expr_pair> & entries, name_set & entries_fvars) {
void move_to_entries(buffer<expr_pair> const & src_entries, buffer<expr_pair> & entries, name_hash_set & entries_fvars) {
buffer<expr_pair> todo;
for (unsigned i = 0; i < src_entries.size(); i++) {
expr_pair const & entry = src_entries[i];
@ -842,8 +841,8 @@ class csimp_fn {
We simplify the value of some let-declarations in this method, but we don't want to create
a new temporary declaration just for this. */
buffer<expr_pair> entries;
name_set e_fvars; /* Set of free variables names used in `e` */
name_set entries_fvars; /* Set of free variable names used in `entries` */
name_hash_set e_fvars; /* Set of free variables names used in `e` */
name_hash_set entries_fvars; /* Set of free variable names used in `entries` */
collect_used(e, e_fvars);
bool e_is_cases = is_cases_on_app(env(), e);
/*

4
src/library/compiler/elim_dead_let.cpp
View file

@ -15,8 +15,8 @@ namespace lean {
static name * g_elim_dead_let_fresh = nullptr;
class elim_dead_let_fn {
std::unordered_set<name, name_hash> m_used;
name_generator m_ngen;
std::unordered_set<name, name_hash_fn> m_used;
name_generator m_ngen;
void mark_fvar(expr const & e) {
m_used.insert(fvar_name(e));

2
src/library/compiler/lambda_lifting.cpp
View file

@ -22,7 +22,7 @@ class lambda_lifting_fn {
name m_base_name;
unsigned m_next_idx{1};
typedef std::unordered_set<name, name_hash> name_set;
typedef std::unordered_set<name, name_hash_fn> name_set;
environment const & env() { return m_env; }

10
src/library/compiler/llnf.cpp
View file

@ -10,6 +10,8 @@ Author: Leonardo de Moura
#include <unordered_set>
#include "runtime/flet.h"
#include "runtime/sstream.h"
#include "util/name_hash_set.h"
#include "util/name_hash_map.h"
#include "kernel/instantiate.h"
#include "kernel/abstract.h"
#include "kernel/for_each_fn.h"
@ -244,9 +246,9 @@ class to_llnf_fn {
TODO(Leo): we must track which variables are marked as borrowed here. Reason: the `reuse` instruction is just
overhead for variables marked as borrowed.
*/
typedef std::unordered_set<name, name_hash> name_set;
typedef std::unordered_map<name, cnstr_info, name_hash> cnstr_info_cache;
typedef std::unordered_map<name, optional<unsigned>, name_hash> enum_cache;
typedef name_hash_set name_set;
typedef name_hash_map<cnstr_info> cnstr_info_cache;
typedef name_hash_map<optional<unsigned>> enum_cache;
type_checker::state m_st;
bool m_unboxed;
local_ctx m_lctx;
@ -401,7 +403,7 @@ class to_llnf_fn {
if (saved_fvars_size == m_fvars.size())
return r;
buffer<expr> used;
name_set used_fvars;
name_hash_set used_fvars;
collect_used(r, used_fvars);
while (m_fvars.size() > saved_fvars_size) {
expr x = m_fvars.back();

8
src/library/compiler/util.cpp
View file

@ -8,6 +8,7 @@ Author: Leonardo de Moura
#include <algorithm>
#include <string>
#include <limits>
#include "util/name_hash_set.h"
#include "kernel/type_checker.h"
#include "kernel/for_each_fn.h"
#include "kernel/replace_fn.h"
@ -394,6 +395,7 @@ bool is_runtime_builtin_type(name const & n) {
n == get_uint64_name() ||
n == get_usize_name() ||
n == get_thunk_name() ||
n == get_lean_name_name() ||
// n == get_task_name() || TODO(Leo): enable
// n == get_array_name() || TODO(Leo): enable
n == get_nat_name() ||
@ -420,7 +422,9 @@ bool is_runtime_builtin_cnstr(name const & n) {
n == get_string_mk_name() ||
n == get_string_iterator_mk_name() ||
n == get_int_of_nat_name() ||
n == get_int_neg_succ_of_nat_name();
n == get_int_neg_succ_of_nat_name() ||
n == get_lean_name_mk_numeral_name() ||
n == get_lean_name_mk_string_name();
}
bool is_irrelevant_type(type_checker::state & st, local_ctx lctx, expr const & type) {
@ -438,7 +442,7 @@ bool is_irrelevant_type(type_checker::state & st, local_ctx lctx, expr const & t
return false;
}
void collect_used(expr const & e, std::unordered_set<name, name_hash> & S) {
void collect_used(expr const & e, name_hash_set & S) {
if (!has_fvar(e)) return;
for_each(e, [&](expr const & e, unsigned) {
if (!has_fvar(e)) return false;

4
src/library/compiler/util.h
View file

@ -5,9 +5,9 @@ Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
*/
#pragma once
#include <unordered_set>
#include "util/pair_ref.h"
#include "util/list_ref.h"
#include "util/name_hash_set.h"
#include "kernel/expr.h"
#include "kernel/type_checker.h"
#include "library/constants.h"
@ -151,7 +151,7 @@ bool is_runtime_builtin_cnstr(name const & n);
bool is_irrelevant_type(type_checker::state & st, local_ctx lctx, expr const & type);
void collect_used(expr const & e, std::unordered_set<name, name_hash> & S);
void collect_used(expr const & e, name_hash_set & S);
environment register_stage1_decl(environment const & env, name const & n, names const & ls, expr const & t, expr const & v);
environment register_stage2_decl(environment const & env, name const & n, expr const & t, expr const & v);

5
src/library/context_cache.h
View file

@ -7,6 +7,7 @@ Author: Leonardo de Moura
#pragma once
#include <unordered_map>
#include <unordered_set>
#include "util/name_hash_map.h"
#include "kernel/expr_maps.h"
#include "kernel/equiv_manager.h"
#include "library/expr_unsigned_map.h"
@ -15,8 +16,8 @@ Author: Leonardo de Moura
namespace lean {
class context_cache : public context_cacheless {
typedef std::unordered_map<name, optional<constant_info>, name_hash> transparency_cache;
typedef std::unordered_map<name, bool, name_hash> name2bool;
typedef name_hash_map<optional<constant_info>> transparency_cache;
typedef name_hash_map<bool> name2bool;
/** We use expr_cond_bi_struct_map because sometimes we want the inferred type to
contain precise binder information (e.g., in the elaborator).

2
src/library/expr_pair.h
View file

@ -6,7 +6,7 @@ Author: Leonardo de Moura
*/
#pragma once
#include <utility>
#include "util/hash.h"
#include "runtime/hash.h"
#include "library/expr_lt.h"
namespace lean {

2
src/library/module.cpp
View file

@ -15,7 +15,7 @@ Authors: Leonardo de Moura, Gabriel Ebner, Sebastian Ullrich
#include "runtime/thread.h"
#include "runtime/interrupt.h"
#include "runtime/sstream.h"
#include "util/hash.h"
#include "runtime/hash.h"
#include "util/lean_path.h"
#include "util/buffer.h"
#include "util/name_map.h"

2
src/library/phash_map.h
View file

@ -119,5 +119,5 @@ public:
};
template<typename T>
using name_hash_map = phash_map<name, T, name_hash, name_eq, true>;
using name_hash_map = phash_map<name, T, name_hash_fn, name_eq, true>;
}

2
src/library/private.cpp
View file

@ -7,7 +7,7 @@ Author: Leonardo de Moura
#include <utility>
#include <string>
#include "runtime/sstream.h"
#include "util/hash.h"
#include "runtime/hash.h"
#include "library/private.h"
#include "library/module.h"

2
src/library/vm/CMakeLists.txt
View file

@ -1,2 +1,2 @@
add_library(vm OBJECT vm.cpp optimize.cpp vm_nat.cpp vm_string.cpp vm_aux.cpp vm_io.cpp
vm_int.cpp vm_uint.cpp vm_thunk.cpp init_module.cpp)
vm_int.cpp vm_uint.cpp vm_thunk.cpp vm_name.cpp init_module.cpp)

3
src/library/vm/init_module.cpp
View file

@ -12,6 +12,7 @@ Author: Leonardo de Moura
#include "library/vm/vm_io.h"
#include "library/vm/vm_string.h"
#include "library/vm/vm_thunk.h"
#include "library/vm/vm_name.h"
namespace lean {
void initialize_vm_core_module() {
@ -23,9 +24,11 @@ void initialize_vm_core_module() {
initialize_vm_string();
initialize_vm_uint();
initialize_vm_thunk();
initialize_vm_name();
}
void finalize_vm_core_module() {
finalize_vm_name();
finalize_vm_thunk();
finalize_vm_uint();
finalize_vm_string();

13
src/library/vm/vm.cpp
View file

@ -15,7 +15,10 @@ Author: Leonardo de Moura
#include "runtime/sstream.h"
#include "runtime/memory.h"
#include "runtime/flet.h"
#include "util/name_hash_map.h"
#include "util/name_hash_set.h"
#include "util/timeit.h"
#include "util/name_hash_map.h"
#include "util/sexpr/option_declarations.h"
#include "util/shared_mutex.h"
#include "library/constants.h"
@ -3442,14 +3445,14 @@ auto vm_state::profiler::get_snapshots() -> snapshots {
stop();
snapshots r;
r.m_total_time = chrono::milliseconds(0);
std::unordered_map<name, pair<chrono::milliseconds, chrono::milliseconds>, name_hash> timings;
name_hash_map<pair<chrono::milliseconds, chrono::milliseconds>> timings;
for (snapshot_core const & s : m_snapshots) {
snapshot new_s;
new_s.m_duration = s.m_duration;
new_s.m_perf_counters = s.m_perf_counters;
r.m_total_time += s.m_duration;
auto & new_stack = new_s.m_stack;
std::unordered_set<name, name_hash> decl_already_seen_in_this_stack;
name_hash_set decl_already_seen_in_this_stack;
for (unsigned i = 0; i < s.m_stack.size(); i++) {
auto const & p = s.m_stack[i];
vm_decl const * decl = m_state.m_decl_map.find(p.first);
@ -3575,9 +3578,9 @@ unsigned get_vm_builtin_arity(name const & fn) {
}
class vm_index_manager {
shared_mutex m_mutex;
std::unordered_map<name, unsigned, name_hash> m_name2idx;
std::vector<name> m_idx2name;
shared_mutex m_mutex;
name_hash_map<unsigned> m_name2idx;
std::vector<name> m_idx2name;
public:
unsigned get_index(name const & n) {

25
src/library/vm/vm_name.cpp Normal file
View file

@ -0,0 +1,25 @@
/*
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
*/
#include "library/vm/vm.h"
namespace lean {
static vm_obj dummy_unary_op(vm_obj const &) {
throw exception("name object support has not been implemented in the old VM");
}
static vm_obj dummy_binary_op(vm_obj const &, vm_obj const &) {
throw exception("name object support has not been implemented in the old VM");
}
void initialize_vm_name() {
DECLARE_VM_BUILTIN(name({"lean", "name", "hash"}), dummy_unary_op);
DECLARE_VM_BUILTIN(name({"lean", "name", "mk_string"}), dummy_binary_op);
DECLARE_VM_BUILTIN(name({"lean", "name", "mk_numeral"}), dummy_binary_op);
}
void finalize_vm_name() {
}
}

11
src/library/vm/vm_name.h Normal file
View file

@ -0,0 +1,11 @@
/*
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
*/
#pragma once
namespace lean {
void initialize_vm_name();
void finalize_vm_name();
}

2
src/runtime/CMakeLists.txt
View file

@ -1,6 +1,6 @@
set(RUNTIME_OBJS debug.cpp thread.cpp mpz.cpp mpq.cpp utf8.cpp
object.cpp apply.cpp exception.cpp interrupt.cpp memory.cpp
serializer.cpp stackinfo.cpp compact.cpp init_module.cpp io.cpp)
serializer.cpp stackinfo.cpp compact.cpp init_module.cpp io.cpp hash.cpp)
add_library(runtime OBJECT ${RUNTIME_OBJS})
add_library(leanruntime ${RUNTIME_OBJS})

0
src/util/hash.cpp → src/runtime/hash.cpp
View file

0
src/util/hash.h → src/runtime/hash.h
View file

31
src/runtime/object.cpp
View file

@ -19,6 +19,7 @@ Author: Leonardo de Moura
#include "runtime/apply.h"
#include "runtime/flet.h"
#include "runtime/interrupt.h"
#include "runtime/hash.h"
namespace lean {
size_t obj_byte_size(object * o) {
@ -1521,6 +1522,36 @@ obj_res string_iterator_snd(b_obj_arg it) {
return r;
}
// =======================================
// name
/*
inductive name
| anonymous : name
| mk_string : name → string → name
| mk_numeral : name → nat → name
*/
obj_res name_mk_string(obj_arg p, obj_arg s) {
object * r = alloc_cnstr(1, 2, sizeof(unsigned));
size_t sz = string_size(s);
unsigned h = hash_str(sz, string_cstr(s), name_hash(p));
cnstr_set(r, 0, p);
cnstr_set(r, 1, s);
cnstr_set_scalar<unsigned>(r, 2*sizeof(object*), h);
return r;
}
obj_res name_mk_numeral(obj_arg p, obj_arg n) {
object * r = alloc_cnstr(2, 2, sizeof(unsigned));
unsigned h1 = is_scalar(n) ? unbox(n) : mpz_value(n).hash();
unsigned h2 = name_hash(p);
unsigned h = hash(h1, h2);
cnstr_set(r, 0, p);
cnstr_set(r, 1, n);
cnstr_set_scalar<unsigned>(r, 2*sizeof(object*), h);
return r;
}
// =======================================
// Debugging helper functions

13
src/runtime/object.h
View file

@ -1256,4 +1256,17 @@ inline usize usize_modn(usize a1, b_obj_arg a2) {
inline obj_res usize_dec_eq(usize a1, usize a2) { return box(a1 == a2); }
inline obj_res usize_dec_lt(usize a1, usize a2) { return box(a1 < a2); }
inline obj_res usize_dec_le(usize a1, usize a2) { return box(a1 <= a2); }
// =======================================
// name
inline unsigned name_hash(b_obj_arg n) {
if (lean::is_scalar(n)) return 11;
else return lean::cnstr_get_scalar<unsigned>(n, sizeof(void*)*2);
}
inline size_t name_hash_usize(b_obj_arg n) { return name_hash(n); }
obj_res name_mk_string(obj_arg p, obj_arg s);
obj_res name_mk_numeral(obj_arg p, obj_arg n);
inline obj_res name_mk_string(obj_arg p, char const * s) { return name_mk_string(p, mk_string(s)); }
}

2
src/tests/util/hash.cpp
View file

@ -6,7 +6,7 @@ Author: Leonardo de Moura
*/
#include <iostream>
#include "util/test.h"
#include "util/hash.h"
#include "runtime/hash.h"
using namespace lean;
static void tst1() {

2
src/util/CMakeLists.txt
View file

@ -1,4 +1,4 @@
add_library(util OBJECT object_ref.cpp name.cpp name_set.cpp fresh_name.cpp hash.cpp
add_library(util OBJECT object_ref.cpp name.cpp name_set.cpp fresh_name.cpp
escaped.cpp bit_tricks.cpp safe_arith.cpp ascii.cpp shared_mutex.cpp
path.cpp lean_path.cpp lbool.cpp bitap_fuzzy_search.cpp
init_module.cpp name_map.cpp list_fn.cpp file_lock.cpp

23
src/util/name.cpp
View file

@ -14,9 +14,9 @@ Author: Leonardo de Moura
#include "runtime/debug.h"
#include "runtime/sstream.h"
#include "runtime/utf8.h"
#include "runtime/hash.h"
#include "util/name.h"
#include "util/buffer.h"
#include "util/hash.h"
#include "util/ascii.h"
namespace lean {
@ -94,38 +94,25 @@ static void display_name(std::ostream & out, name const & n, bool escape, char c
}
name::name(name const & prefix, char const * n):
object_ref(mk_cnstr(static_cast<unsigned>(name_kind::STRING),
prefix.raw(), mk_string(n), sizeof(unsigned))) {
object_ref(name_mk_string(prefix.raw(), n)) {
inc(prefix.raw());
size_t sz = strlen(n);
unsigned h = hash_str(static_cast<unsigned>(sz), n, prefix.hash());
cnstr_set_scalar<unsigned>(raw(), 2*sizeof(object*), h); // NOLINT
}
name::name(name const & prefix, unsigned k):
object_ref(mk_cnstr(static_cast<unsigned>(name_kind::NUMERAL),
prefix.raw(), mk_nat_obj(k), sizeof(unsigned))) {
object_ref(name_mk_numeral(prefix.raw(), mk_nat_obj(k))) {
inc(prefix.raw());
unsigned h = ::lean::hash(k, prefix.hash());
cnstr_set_scalar<unsigned>(raw(), 2*sizeof(object*), h); // NOLINT
}
name::name(name const & prefix, string_ref const & s):
object_ref(mk_cnstr(static_cast<unsigned>(name_kind::STRING),
prefix.raw(), s.raw(), sizeof(unsigned))) {
object_ref(name_mk_string(prefix.raw(), s.raw())) {
inc(prefix.raw());
inc(s.raw());
unsigned h = hash_str(static_cast<unsigned>(s.num_bytes()), s.data(), prefix.hash());
cnstr_set_scalar<unsigned>(raw(), 2*sizeof(object*), h); // NOLINT
}
name::name(name const & prefix, nat const & k):
object_ref(mk_cnstr(static_cast<unsigned>(name_kind::NUMERAL),
prefix.raw(), k.raw(), sizeof(unsigned))) {
object_ref(name_mk_numeral(prefix.raw(), k.raw())) {
inc(prefix.raw());
inc(k.raw());
unsigned h = ::lean::hash(k.hash(), prefix.hash());
cnstr_set_scalar<unsigned>(raw(), 2*sizeof(object*), h); // NOLINT
}
name::name(std::initializer_list<char const *> const & l):name() {

2
src/util/name.h
View file

@ -203,7 +203,7 @@ public:
name string_to_name(std::string const & str);
struct name_hash { unsigned operator()(name const & n) const { return n.hash(); } };
struct name_hash_fn { unsigned operator()(name const & n) const { return n.hash(); } };
struct name_eq { bool operator()(name const & n1, name const & n2) const { return n1 == n2; } };
struct name_cmp {
typedef name type;

2
src/util/name_hash_map.h
View file

@ -8,5 +8,5 @@ Author: Leonardo de Moura
#include <unordered_map>
#include "util/name.h"
namespace lean {
template<typename T> using name_hash_map = std::unordered_map<name, T, name_hash, name_eq>;
template<typename T> using name_hash_map = std::unordered_map<name, T, name_hash_fn, name_eq>;
}

2
src/util/name_hash_set.h
View file

@ -8,5 +8,5 @@ Author: Daniel Selsam
#include <unordered_set>
#include "util/name.h"
namespace lean {
typedef std::unordered_set<name, name_hash, name_eq> name_hash_set;
typedef std::unordered_set<name, name_hash_fn, name_eq> name_hash_set;
}

2
src/util/sexpr/format.cpp
View file

@ -12,7 +12,7 @@
#include <unordered_map>
#include "runtime/interrupt.h"
#include "runtime/sstream.h"
#include "util/hash.h"
#include "runtime/hash.h"
#include "util/escaped.h"
#include "util/sexpr/sexpr.h"
#include "util/sexpr/format.h"

2
src/util/sexpr/sexpr.cpp
View file

@ -8,8 +8,8 @@ Author: Leonardo de Moura
#include <cstring>
#include <string>
#include "runtime/sstream.h"
#include "runtime/hash.h"
#include "util/rc.h"
#include "util/hash.h"
#include "util/name.h"
#include "util/escaped.h"
#include "util/buffer.h"