#include <CDigitalSet.h>

Inheritance diagram for DGtal::CDigitalSet< T >:

Collaboration diagram for DGtal::CDigitalSet< T >:

Public Types
typedef T::Domain	Domain
typedef T::Point	Point
typedef T::Size	Size
typedef T::Iterator	Iterator
typedef T::ConstIterator	ConstIterator

Public Member Functions
	BOOST_CONCEPT_ASSERT ((boost_concepts::ReadableIteratorConcept< Iterator >))
	BOOST_CONCEPT_ASSERT ((boost_concepts::BidirectionalTraversalConcept< Iterator >))
	BOOST_CONCEPT_ASSERT ((boost_concepts::ReadableIteratorConcept< ConstIterator >))
	BOOST_CONCEPT_ASSERT ((boost_concepts::BidirectionalTraversalConcept< ConstIterator >))
	BOOST_CONCEPT_USAGE (CDigitalSet)
void	checkConstConstraints () const
void	checkNonConstConstraints ()

Private Attributes
T	myX
Domain	myDomain
Size	mySize
bool	myBool
Point	myPoint
Iterator	myIterator
ConstIterator	myConstIterator
Point *	myOutputIt

Detailed Description

template<typename T>
struct DGtal::CDigitalSet< T >

Aim: Represents a set of points within the given domain. This set of points is modifiable by the user.

Description of concept 'CDigitalSet'

Refinement of boost::CopyConstructible, boost::Assignable

\xrefitem todo 54.

Associated types :

Notation

X : A type that is a model of CDigitalSet
x, y : object of type X

Definitions

Valid expressions and

Name

Expression

Type requirements

Return type

Precondition

Semantics

Postcondition

Complexity

Invariants

Models

Notes

Template Parameters:

T	the type that should be a model of CDigitalSet.

Definition at line 113 of file CDigitalSet.h.

Member Typedef Documentation

template<typename T >

typedef T::ConstIterator DGtal::CDigitalSet< T >::ConstIterator

Definition at line 124 of file CDigitalSet.h.

template<typename T >

typedef T::Domain DGtal::CDigitalSet< T >::Domain

Definition at line 120 of file CDigitalSet.h.

template<typename T >

typedef T::Iterator DGtal::CDigitalSet< T >::Iterator

Definition at line 123 of file CDigitalSet.h.

template<typename T >

typedef T::Point DGtal::CDigitalSet< T >::Point

Definition at line 121 of file CDigitalSet.h.

template<typename T >

typedef T::Size DGtal::CDigitalSet< T >::Size

Definition at line 122 of file CDigitalSet.h.

Member Function Documentation

template<typename T >

DGtal::CDigitalSet< T >::BOOST_CONCEPT_ASSERT ( (boost_concepts::ReadableIteratorConcept< Iterator >) )

template<typename T >

DGtal::CDigitalSet< T >::BOOST_CONCEPT_ASSERT ( (boost_concepts::BidirectionalTraversalConcept< Iterator >) )

template<typename T >

DGtal::CDigitalSet< T >::BOOST_CONCEPT_ASSERT ( (boost_concepts::ReadableIteratorConcept< ConstIterator >) )

template<typename T >

DGtal::CDigitalSet< T >::BOOST_CONCEPT_ASSERT ( (boost_concepts::BidirectionalTraversalConcept< ConstIterator >) )

template<typename T >

DGtal::CDigitalSet< T >::BOOST_CONCEPT_USAGE ( CDigitalSet< T > )

inline

Definition at line 141 of file CDigitalSet.h.

References DGtal::CDigitalSet< T >::checkConstConstraints(), DGtal::CDigitalSet< T >::checkNonConstConstraints(), DGtal::CDigitalSet< T >::myBool, DGtal::CDigitalSet< T >::myDomain, DGtal::CDigitalSet< T >::myIterator, DGtal::CDigitalSet< T >::myOutputIt, DGtal::CDigitalSet< T >::myPoint, DGtal::CDigitalSet< T >::mySize, DGtal::CDigitalSet< T >::myX, and DGtal::ConceptUtils::sameType().

    {
      ConceptUtils::sameType( myDomain, myX.domain() );
      ConceptUtils::sameType( mySize, myX.size() );
      ConceptUtils::sameType( myBool, myX.empty() );
      myX.insert( myPoint );
      // template <typename PointInputIterator>
      //   BOOST_CONCEPT_REQUIRES
      //   ( ((boost::InputIterator<PointInputIterator>)),
      //     (void) )
      //   myX.insert( PointInputIterator, PointInputIterator );
      myX.insertNew( myPoint );
      ConceptUtils::sameType( mySize, myX.erase( myPoint ) );
      myX.erase( myIterator );
      myX.erase( myIterator, myIterator );
      myX.clear();
      ConceptUtils::sameType( myIterator, myX.begin() );
      ConceptUtils::sameType( myIterator, myX.end() );
      ConceptUtils::sameType( myX, myX.operator+=( myX ) );
      myX.computeComplement( myOutputIt );
      myX.assignFromComplement( myX );
      myX.computeBoundingBox( myPoint, myPoint );
      checkConstConstraints();
      checkNonConstConstraints();
      // look at CInteger.h for testing tags.
    }

template<typename T >

void DGtal::CDigitalSet< T >::checkConstConstraints ( ) const

inline

This method checks const methods when a non-const version exist.

Definition at line 170 of file CDigitalSet.h.

References DGtal::CDigitalSet< T >::myConstIterator, DGtal::CDigitalSet< T >::myPoint, DGtal::CDigitalSet< T >::myX, and DGtal::ConceptUtils::sameType().

Referenced by DGtal::CDigitalSet< T >::BOOST_CONCEPT_USAGE().

    {
      ConceptUtils::sameType( myConstIterator, myX.find( myPoint ) );
      ConceptUtils::sameType( myConstIterator, myX.begin() );
      ConceptUtils::sameType( myConstIterator, myX.end() );
    }

template<typename T >

void DGtal::CDigitalSet< T >::checkNonConstConstraints ( )

inline

This method checks non-const methods when a const version exist.

Definition at line 180 of file CDigitalSet.h.

References DGtal::CDigitalSet< T >::myIterator, DGtal::CDigitalSet< T >::myPoint, DGtal::CDigitalSet< T >::myX, and DGtal::ConceptUtils::sameType().

Referenced by DGtal::CDigitalSet< T >::BOOST_CONCEPT_USAGE().

    {
      ConceptUtils::sameType( myIterator, myX.find( myPoint ) );
      ConceptUtils::sameType( myIterator, myX.begin() );
      ConceptUtils::sameType( myIterator, myX.end() );
    }