lean2/src/kernel/justification.cpp

70 lines
2.1 KiB
C++
Raw Normal View History

/*
Copyright (c) 2013 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
*/
#include <vector>
#include "util/buffer.h"
#include "kernel/justification.h"
namespace lean {
void justification_cell::add_pos_info(format & r, optional<expr> const & e, pos_info_provider const * p) {
if (!p || !e)
return;
format f = p->pp(*e);
if (!f)
return;
r += f;
r += space();
}
format justification_cell::pp(formatter const & fmt, options const & opts, pos_info_provider const * p, bool display_children) const {
format r;
add_pos_info(r, get_main_expr(), p);
r += pp_header(fmt, opts);
if (display_children) {
buffer<justification_cell *> children;
get_children(children);
unsigned indent = get_pp_indent(opts);
for (justification_cell * child : children) {
r += nest(indent, compose(line(), child->pp(fmt, opts, p, display_children)));
}
}
return r;
}
bool justification::has_children() const {
buffer<justification_cell *> r;
get_children(r);
return !r.empty();
}
assumption_justification::assumption_justification(unsigned idx):m_idx(idx) {}
void assumption_justification::get_children(buffer<justification_cell*> &) const {}
optional<expr> assumption_justification::get_main_expr() const { return none_expr(); }
format assumption_justification::pp_header(formatter const &, options const &) const {
return format{format("Assumption"), space(), format(m_idx)};
}
bool depends_on(justification const & t, justification const & d) {
buffer<justification_cell *> todo;
buffer<justification_cell *> children;
todo.push_back(t.raw());
while (!todo.empty()) {
justification_cell * curr = todo.back();
todo.pop_back();
if (curr == d.raw()) {
return true;
} else {
children.clear();
curr->get_children(children);
for (justification_cell * child : children) {
todo.push_back(child);
}
}
}
return false;
}
}