diff options
| author | Morgan Deters <mdeters@gmail.com> | 2012-07-07 21:01:33 +0000 |
|---|---|---|
| committer | Morgan Deters <mdeters@gmail.com> | 2012-07-07 21:01:33 +0000 |
| commit | 8b01efc32d61391d8d3cd2aaac0de49cd8e88ecc (patch) | |
| tree | 9e61b253a66fc91ca86b11bc1cabae9e1a7394da /src/theory/arith/dio_solver.cpp | |
| parent | 8166b6cef258b198d0ffc97d125da3c85acf9708 (diff) | |
Various fixes to documentation---typos, some incomplete documentation fixed, \file tags corrected, copyright added to files that had it missing, etc.
I ensured that I didn't change any code with this commit, and even tested on the cluster to be doubly sure:
http://church.cims.nyu.edu/regress-results/compare_jobs.php?job_id=4655&reference_id=4646&p=0
Diffstat (limited to 'src/theory/arith/dio_solver.cpp')
| -rw-r--r-- | src/theory/arith/dio_solver.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/theory/arith/dio_solver.cpp b/src/theory/arith/dio_solver.cpp index 38cff88ff..e3eae88b3 100644 --- a/src/theory/arith/dio_solver.cpp +++ b/src/theory/arith/dio_solver.cpp @@ -279,7 +279,7 @@ void DioSolver::enqueueInputConstraints(){ /*TODO Currently linear in the size of the Queue *It is not clear if am O(log n) strategy would be better. - *Right before this in the algorithm is a substition which could potentially + *Right before this in the algorithm is a substitution which could potentially *effect the key values of everything in the queue. */ void DioSolver::moveMinimumByAbsToQueueFront(){ @@ -508,7 +508,7 @@ SumPair DioSolver::processEquationsForCut(){ SumPair DioSolver::purifyIndex(TrailIndex i){ - // TODO: "This uses the substition trail to reverse the substitions from the sum term. Using the proof term should be more efficient." + // TODO: "This uses the substitution trail to reverse the substitutions from the sum term. Using the proof term should be more efficient." SumPair curr = d_trail[i].d_eq; |