mirror of
https://github.com/Z3Prover/z3
synced 2025-04-28 19:35:50 +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
|
@ -107,7 +107,7 @@ public:
|
|||
this method will give preference to the row that occurs first.
|
||||
|
||||
\remark The vector r must have at least A.n() capacity
|
||||
The numer of linear independent rows is returned.
|
||||
The number of linear independent rows is returned.
|
||||
|
||||
Store the new matrix in B.
|
||||
*/
|
||||
|
|
|
@ -6,5 +6,5 @@ def_module_params('rcf',
|
|||
('initial_precision', UINT, 24, "a value k that is the initial interval size (as 1/2^k) when creating transcendentals and approximated division"),
|
||||
('inf_precision', UINT, 24, "a value k that is the initial interval size (i.e., (0, 1/2^l)) used as an approximation for infinitesimal values"),
|
||||
('max_precision', UINT, 128, "during sign determination we switch from interval arithmetic to complete methods when the interval size is less than 1/2^k, where k is the max_precision"),
|
||||
('lazy_algebraic_normalization', BOOL, True, "during sturm-seq and square-free polynomial computations, only normalize algebraic polynomial expressions when the definining polynomial is monic")
|
||||
('lazy_algebraic_normalization', BOOL, True, "during sturm-seq and square-free polynomial computations, only normalize algebraic polynomial expressions when the defining polynomial is monic")
|
||||
))
|
||||
|
|
|
@ -4790,7 +4790,7 @@ namespace realclosure {
|
|||
|
||||
/**
|
||||
\brief Determine the sign of the new rational function value.
|
||||
The idea is to keep refinining the interval until interval of v does not contain 0.
|
||||
The idea is to keep refining the interval until interval of v does not contain 0.
|
||||
After a couple of steps we switch to expensive sign determination procedure.
|
||||
|
||||
Return false if v is actually zero.
|
||||
|
@ -5474,7 +5474,7 @@ namespace realclosure {
|
|||
}
|
||||
else {
|
||||
// Let sdt be alpha->sdt();
|
||||
// In pricipal, the signs of the polynomials sdt->qs can be used
|
||||
// In principal, the signs of the polynomials sdt->qs can be used
|
||||
// to discriminate the roots of new_p. The signs of this polynomials
|
||||
// depend only on alpha, and not on the polynomial used to define alpha
|
||||
// So, in principle, we can reuse m_qs and m_sign_conditions.
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue