mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-23 17:15:31 +00:00
Code Activity

Fix some spelling errors (mostly in comments).

Browse source
This commit is contained in:
Florian Pigorsch 2018-10-20 17:07:41 +02:00
parent 880ce12e2d
commit 326bf401b9
121 changed files with 205 additions and 205 deletions
Download patch file Download diff file Expand all files Collapse all files

2
src/test/ast.cpp
View file

@ -44,7 +44,7 @@ static void tst1() {
// ast_ref<var_ast> v3 (m.mk_var(1), m);
// ENSURE(v1 != v2);
// ENSURE(v1 == v3);
// TRACE("ast", tout << "reseting v1\n";);
// TRACE("ast", tout << "resetting v1\n";);
// v1.reset();
// TRACE("ast", tout << "overwriting v3\n";);
// v3 = v2;

2
src/test/ddnf.cpp
View file

@ -15,7 +15,7 @@ Copyright (c) 2015 Microsoft Corporation
#include <map>
/*
TBD: count number of nodes, number of operations accross all insertions
TBD: count number of nodes, number of operations across all insertions
*/
void read_nums(std::istream& is, unsigned & x, unsigned& y) {

2
src/test/fuzzing/expr_delta.h
View file

@ -33,7 +33,7 @@ public:
//
// Create the n'th delta in dfs mode.
// resturn 'true' if a delta was obtained.
// return 'true' if a delta was obtained.
//
bool delta_dfs(unsigned n, expr_ref_vector& result);

20
src/test/lp/lp.cpp
View file

@ -117,7 +117,7 @@ void test_matrix(square_sparse_matrix<T, X> & a) {
}
void tst1() {
std::cout << "testing the minimial matrix with 1 row and 1 column" << std::endl;
std::cout << "testing the minimal matrix with 1 row and 1 column" << std::endl;
square_sparse_matrix<double, double> m0(1, 1);
m0.set(0, 0, 1);
// print_matrix(m0);
@ -192,7 +192,7 @@ void tst1() {
// print_matrix(m10by9);
}
vector<int> allocate_basis_heading(unsigned count) { // the rest of initilization will be handled by lu_QR
vector<int> allocate_basis_heading(unsigned count) { // the rest of initialization will be handled by lu_QR
vector<int> basis_heading(count, -1);
return basis_heading;
}
@ -850,7 +850,7 @@ void fill_uniformly(dense_matrix<double, double> & m, unsigned dim) {
}
}
void square_sparse_matrix_with_permutaions_test() {
void square_sparse_matrix_with_permutations_test() {
unsigned dim = 4;
square_sparse_matrix<double, double> m(dim, dim);
fill_uniformly(m, dim);
@ -1023,7 +1023,7 @@ void test_dense_matrix() {
vector<permutation_matrix<double, double>> vector_of_permutaions() {
vector<permutation_matrix<double, double>> vector_of_permutations() {
vector<permutation_matrix<double, double>> ret;
{
permutation_matrix<double, double> p0(5);
@ -1058,7 +1058,7 @@ void test_apply_reverse_from_right_to_perm(permutation_matrix<double, double> &
}
void test_apply_reverse_from_right() {
auto vec = vector_of_permutaions();
auto vec = vector_of_permutations();
for (unsigned i = 0; i < vec.size(); i++) {
test_apply_reverse_from_right_to_perm(vec[i]);
}
@ -1901,17 +1901,17 @@ void setup_args_parser(argument_parser & parser) {
parser.add_option_with_after_string_with_help("--density", "the percentage of non-zeroes in the matrix below which it is not dense");
parser.add_option_with_after_string_with_help("--harris_toler", "harris tolerance");
parser.add_option_with_help_string("--test_swaps", "test row swaps with a permutation");
parser.add_option_with_help_string("--test_perm", "test permutaions");
parser.add_option_with_help_string("--test_perm", "test permutations");
parser.add_option_with_after_string_with_help("--checklu", "the file name for lu checking");
parser.add_option_with_after_string_with_help("--partial_pivot", "the partial pivot constant, a number somewhere between 10 and 100");
parser.add_option_with_after_string_with_help("--percent_for_enter", "which percent of columns check for entering column");
parser.add_option_with_help_string("--totalinf", "minimizes the total infeasibility instead of diminishin infeasibility of the rows");
parser.add_option_with_help_string("--totalinf", "minimizes the total infeasibility instead of diminishing infeasibility of the rows");
parser.add_option_with_after_string_with_help("--rep_frq", "the report frequency, in how many iterations print the cost and other info ");
parser.add_option_with_help_string("--smt", "smt file format");
parser.add_option_with_after_string_with_help("--filelist", "the file containing the list of files");
parser.add_option_with_after_string_with_help("--file", "the input file name");
parser.add_option_with_after_string_with_help("--random_seed", "random seed");
parser.add_option_with_help_string("--bp", "bound propogation");
parser.add_option_with_help_string("--bp", "bound propagation");
parser.add_option_with_help_string("--min", "will look for the minimum for the given file if --file is used; the default is looking for the max");
parser.add_option_with_help_string("--max", "will look for the maximum for the given file if --file is used; it is the default behavior");
parser.add_option_with_after_string_with_help("--max_iters", "maximum total iterations in a core solver stage");
@ -1932,7 +1932,7 @@ void setup_args_parser(argument_parser & parser) {
parser.add_option_with_help_string("--lar", "test lar_solver");
parser.add_option_with_after_string_with_help("--maxng", "max iterations without progress");
parser.add_option_with_help_string("-tbq", "test binary queue");
parser.add_option_with_help_string("--randomize_lar", "test randomize funclionality");
parser.add_option_with_help_string("--randomize_lar", "test randomize functionality");
parser.add_option_with_help_string("--smap", "test stacked_map");
parser.add_option_with_help_string("--term", "simple term test");
parser.add_option_with_help_string("--eti"," run a small evidence test for total infeasibility scenario");
@ -3722,7 +3722,7 @@ void test_lp_local(int argn, char**argv) {
test_init_U();
test_replace_column();
#ifdef Z3DEBUG
square_sparse_matrix_with_permutaions_test();
square_sparse_matrix_with_permutations_test();
test_dense_matrix();
test_swap_operations();
test_permutations();

6
src/test/sat_local_search.cpp
View file

@ -7,7 +7,7 @@
static bool build_instance(char const * filename, sat::solver& s, sat::local_search& local_search)
{
char line[16383];
// for temperally storage
// for temporary storage
std::ifstream infile(filename);
//if (infile == NULL) //linux
@ -28,7 +28,7 @@ static bool build_instance(char const * filename, sat::solver& s, sat::local_sea
sat::literal_vector lits;
// process objective function:
// read coefficents
// read coefficients
infile >> cur_term;
while (cur_term != 0) {
coefficients.push_back(cur_term);
@ -43,7 +43,7 @@ static bool build_instance(char const * filename, sat::solver& s, sat::local_sea
}
if (lits.size() != coefficients.size()) {
std::cout << "Objective function format error. They have different lenghts.\n";
std::cout << "Objective function format error. They have different lengths.\n";
return false;
}