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

construction of sparse polynomials_1 

+ comment on solve_2
This commit is contained in:
Monique Teillaud 2006-07-21 11:56:15 +00:00
parent ecf656242e
commit d30a6892ce
3 changed files with 9 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
Algebraic_kernel_d/doc_tex/Algebraic_kernel_d_ref/AlgebraicKernel_d_1.tex
View File

@ -24,10 +24,12 @@ Must provide:\\
\ccc{template <class InputIterator>}\\ \ccc{template <class InputIterator>}\\
\ccc{Polynomial_1 operator()(InputIterator first, InputIterator last)}\\ \ccc{Polynomial_1 operator()(InputIterator first, InputIterator last)}\\
that constructs a polynomial from a range of coefficients of type that constructs a polynomial from a range of coefficients of type
\ccc{Coefficient}, given in the increasing order of monomial degrees.\\ \ccc{Coefficient}, given in the increasing order of monomial degrees,\\
and\\
\ccc{template <class InputIterator1, InputIterator2>}\\
\ccc{Polynomial_1 operator()(InputIterator1 first_coeff, InputIterator1 last_coeff, InputIt2 deg)}\\
that takes as input a range of coefficients of type \ccc{Coefficient}, and an iterator on corresponding degrees of type \ccc{unsigned int}.
} }
\footnote{to be added: constructor for sparse polynomials input range of
\ccc{std::pair<Coefficient, unsigned int>} (int = degree)}
\ccNestedType{Solve_1}{A model of the concept \ccNestedType{Solve_1}{A model of the concept
\ccc{AlgebraicKernel_d_1::Solve_1}.} \ccc{AlgebraicKernel_d_1::Solve_1}.}

6
Algebraic_kernel_d/doc_tex/Algebraic_kernel_d_ref/AlgebraicKernel_d_2.tex
View File

@ -23,9 +23,9 @@ bivariate polynomials on an \ccc{IntegralDomain} coefficient type.}
of two bivariate polynomials of type \ccc{Polynomial_2}.} of two bivariate polynomials of type \ccc{Polynomial_2}.}
\ccNestedType{Construct_polynomial_2}{ \ccNestedType{Construct_polynomial_2}{
Must provide Must provide:\\
\ccc{template <class InputIterator> \ccc{template <class InputIterator>}\\
Polynomial_2 operator()(InputIterator first, InputIterator last)} \ccc{Polynomial_2 operator()(InputIterator first, InputIterator last)}\\
that constructs a polynomial from a range of coefficients of type that constructs a polynomial from a range of coefficients of type
\ccc{Coefficient}, given in the lexicographic order of monomial degrees. \ccc{Coefficient}, given in the lexicographic order of monomial degrees.
} }

3
Algebraic_kernel_d/doc_tex/Algebraic_kernel_d_ref/SolveC_2.tex
View File

@ -6,7 +6,6 @@
A model \ccVar\ of this type must provide: A model \ccVar\ of this type must provide:
\footnote{TBD, I am getting tired... anything to think about before \footnote{TBD, I am getting tired... what about the case of 1-dimensional components? a choice must be made}
adapting the \ccc{_1} case? }
\end{ccRefConcept} \end{ccRefConcept}