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

fixed return type

This commit is contained in:
Susan Hert 2002-04-08 09:40:06 +00:00
parent 728aed762b
commit f6ee5a27ce
4 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Old_Packages/Doc23/doc_tex/kernel/Ref/Kernel_SideOfOrientedSphere_3.tex
View File

@ -3,7 +3,7 @@ A model for this must provide:
\ccCreationVariable{fo}
\ccMemberFunction{Bounded_side operator()(const Kernel::Point_3&p,
\ccMemberFunction{Oriented_side operator()(const Kernel::Point_3&p,
const Kernel::Point_3&q,
const Kernel::Point_3&r,
const Kernel::Point_3&s,

2
Old_Packages/Doc23/doc_tex/kernel/kernel_representation.tex
View File

@ -172,7 +172,7 @@ also makes all \cgal\ classes very uniform. They {\bf always} consist of:
\end{enumerate}
\section{Kernel as a Traits Class}
Algorithms and data structures in the basic library of CGAL are parameterized
Algorithms and data structures in the basic library of \cgal\ are parameterized
by a traits class that subsumes the objects on which the algorithm or data
structure operates as well as the operations to do so. For most of the
algorithms and data structures in the basic library you can use a kernel

2
Packages/Kernel_23/doc_tex/kernel/Ref/Kernel_SideOfOrientedSphere_3.tex
View File

@ -3,7 +3,7 @@ A model for this must provide:
\ccCreationVariable{fo}
\ccMemberFunction{Bounded_side operator()(const Kernel::Point_3&p,
\ccMemberFunction{Oriented_side operator()(const Kernel::Point_3&p,
const Kernel::Point_3&q,
const Kernel::Point_3&r,
const Kernel::Point_3&s,

2
Packages/Kernel_23/doc_tex/kernel/kernel_representation.tex
View File

@ -172,7 +172,7 @@ also makes all \cgal\ classes very uniform. They {\bf always} consist of:
\end{enumerate}
\section{Kernel as a Traits Class}
Algorithms and data structures in the basic library of CGAL are parameterized
Algorithms and data structures in the basic library of \cgal\ are parameterized
by a traits class that subsumes the objects on which the algorithm or data
structure operates as well as the operations to do so. For most of the
algorithms and data structures in the basic library you can use a kernel