songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

- minor fix

This commit is contained in:
Bernd Gärtner 2007-04-03 10:13:10 +00:00
parent d4939fd7bf
commit 2a841b7f4a
2 changed files with 10 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
QP_solver/doc_tex/QP_solver_ref/Linear_program.tex
View File

@ -28,9 +28,11 @@ $x$,
\end{itemize}
This class copies the program data from given iterator ranges; this
is useful if the iterators that you have are not random-access, or
if dereferencing them performs some complex operations. Usually,
you only need to wrap existing iterators, and then you may use the classes
is useful if the iterators that you have are not random-access.
The time taken to copy the data is $\Theta(nm+n^2)$, though, even if
the program description is very sparse. Usually,
you only need to wrap existing (random-access)
iterators, and then you may use the classes
\ccc{Linear_program_from_iterators<A_it, B_it, R_it, FL_it, L_it, FU_it, U_it, C_it>} and \ccc{Linear_program_from_pointers<NT>}).
\ccIsModel

8
QP_solver/doc_tex/QP_solver_ref/Quadratic_program.tex
View File

@ -30,9 +30,11 @@ $x$,
\end{itemize}
This class copies the program data from given iterator ranges;this
is useful if the iterators that you have are not random-access, or
if dereferencing them performs some complex operations. Usually,
you only need to wrap existing iterators, and then you may use the classes
is useful if the iterators that you have are not random-access.
The time taken to copy the data is $\Theta(nm+n^2)$, though, even if the
program description is very sparse. Usually,
you only need to wrap existing (random-access)
iterators, and then you may use the classes
\ccc{Quadratic_program_from_iterators<A_it, B_it, R_it, FL_it, L_it, FU_it, U_it, D_it, C_it>} and \ccc{Quadratic_program_from_pointers<NT>}).
\ccIsModel