[PPL-devel] [GIT] ppl/ppl(master): CO_Tree and Sparse_Row should only appear in the devref manual.
Enea Zaffanella
zaffanella at cs.unipr.it
Mon Feb 27 10:08:40 CET 2012
Module: ppl/ppl
Branch: master
Commit: a9f93b1ac29223079b9d894b3081cabf43cf407f
URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=a9f93b1ac29223079b9d894b3081cabf43cf407f
Author: Enea Zaffanella <zaffanella at cs.unipr.it>
Date: Mon Feb 27 10:07:48 2012 +0100
CO_Tree and Sparse_Row should only appear in the devref manual.
---
src/CO_Tree.defs.hh | 2 ++
src/Sparse_Row.defs.hh | 2 ++
2 files changed, 4 insertions(+), 0 deletions(-)
diff --git a/src/CO_Tree.defs.hh b/src/CO_Tree.defs.hh
index cba1e10..8482273 100644
--- a/src/CO_Tree.defs.hh
+++ b/src/CO_Tree.defs.hh
@@ -51,6 +51,7 @@ site: http://bugseng.com/products/ppl/ . */
namespace Parma_Polyhedra_Library {
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
//! A cache-oblivious binary search tree of pairs.
/*! \ingroup PPL_CXX_interface
This class implements a binary search tree with keys of dimension_type type
@@ -97,6 +98,7 @@ namespace Parma_Polyhedra_Library {
The tree can store up to \f$(-(dimension_type)1)/100\f$ elements.
This limit allows faster density computations, but can be removed if needed.
*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
class CO_Tree {
public:
diff --git a/src/Sparse_Row.defs.hh b/src/Sparse_Row.defs.hh
index 180a2d1..376907b 100644
--- a/src/Sparse_Row.defs.hh
+++ b/src/Sparse_Row.defs.hh
@@ -33,6 +33,7 @@ site: http://bugseng.com/products/ppl/ . */
namespace Parma_Polyhedra_Library {
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
//! A finite sparse sequence of coefficients.
/*! \ingroup PPL_CXX_interface
This class is implemented using a CO_Tree. See the documentation of CO_Tree
@@ -56,6 +57,7 @@ namespace Parma_Polyhedra_Library {
\see Sparse_Matrix
\see CO_Tree
*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
class Sparse_Row {
public:
More information about the PPL-devel
mailing list