mirror of
https://github.com/Z3Prover/z3
synced 2025-10-07 08:21:56 +00:00
Fix some spelling errors (mostly in comments).
This commit is contained in:
parent
880ce12e2d
commit
326bf401b9
121 changed files with 205 additions and 205 deletions
|
@ -295,7 +295,7 @@ namespace datalog {
|
|||
Precondition: &orig.get_plugin()==this
|
||||
*/
|
||||
virtual base_object * mk_empty(const signature & s, family_id kind) {
|
||||
SASSERT(kind==get_kind()); //if plugin uses multiple kinds, this function needs to be overriden
|
||||
SASSERT(kind==get_kind()); //if plugin uses multiple kinds, this function needs to be overridden
|
||||
return mk_empty(s);
|
||||
}
|
||||
|
||||
|
|
|
@ -1319,7 +1319,7 @@ namespace datalog {
|
|||
|
||||
if(!m_table_cond_columns.empty()) {
|
||||
//We will keep the table variables that appear in the condition together
|
||||
//with the index column and then iterate throught the tuples, evaluating
|
||||
//with the index column and then iterate through the tuples, evaluating
|
||||
//the rest of the condition on the inner relations.
|
||||
unsigned_vector removed_cols;
|
||||
unsigned table_data_col_cnt = r.m_table_sig.size()-1;
|
||||
|
|
|
@ -640,7 +640,7 @@ namespace datalog {
|
|||
reg_idx m_src;
|
||||
reg_idx m_tgt;
|
||||
reg_idx m_delta;
|
||||
bool m_widen; //if true, widening is performed intead of an union
|
||||
bool m_widen; //if true, widening is performed instead of an union
|
||||
public:
|
||||
instr_union(reg_idx src, reg_idx tgt, reg_idx delta, bool widen)
|
||||
: m_src(src), m_tgt(tgt), m_delta(delta), m_widen(widen) {}
|
||||
|
|
|
@ -253,7 +253,7 @@ namespace datalog {
|
|||
\brief Return functor that transforms a table into one that lacks columns listed in
|
||||
\c removed_cols array.
|
||||
|
||||
The \c removed_cols cotains columns of table \c t in strictly ascending order.
|
||||
The \c removed_cols contains columns of table \c t in strictly ascending order.
|
||||
*/
|
||||
relation_transformer_fn * mk_project_fn(const relation_base & t, unsigned col_cnt,
|
||||
const unsigned * removed_cols);
|
||||
|
@ -420,7 +420,7 @@ namespace datalog {
|
|||
\brief Return functor that transforms a table into one that lacks columns listed in
|
||||
\c removed_cols array.
|
||||
|
||||
The \c removed_cols cotains columns of table \c t in strictly ascending order.
|
||||
The \c removed_cols contains columns of table \c t in strictly ascending order.
|
||||
|
||||
If a project operation removes a non-functional column, all functional columns become
|
||||
non-functional (so that none of the values in functional columns are lost)
|
||||
|
|
|
@ -568,7 +568,7 @@ namespace datalog {
|
|||
}
|
||||
|
||||
/**
|
||||
In this function we modify the content of table functional columns without reseting indexes.
|
||||
In this function we modify the content of table functional columns without resetting indexes.
|
||||
This is ok as long as we do not allow indexing on functional columns.
|
||||
*/
|
||||
void sparse_table::ensure_fact(const table_fact & f) {
|
||||
|
|
|
@ -85,7 +85,7 @@ namespace datalog {
|
|||
/**
|
||||
\brief Restrict the set of used predicates to \c res.
|
||||
|
||||
The function deallocates unsused relations, it does not deal with rules.
|
||||
The function deallocates unused relations, it does not deal with rules.
|
||||
*/
|
||||
void restrict_predicates(func_decl_set const& predicates) override;
|
||||
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue