DGtal  0.9.3beta
Public Types | Public Member Functions | Private Attributes
DGtal::concepts::CAdditivePrimitiveComputer< T > Struct Template Reference

#include <DGtal/geometry/surfaces/CAdditivePrimitiveComputer.h>

Inheritance diagram for DGtal::concepts::CAdditivePrimitiveComputer< T >:
[legend]
Collaboration diagram for DGtal::concepts::CAdditivePrimitiveComputer< T >:
[legend]

Public Types

typedef T::Point Point
 
- Public Types inherited from DGtal::concepts::CIncrementalPrimitiveComputer< T >
typedef T::Point Point
 
- Public Types inherited from DGtal::concepts::CPrimitiveComputer< T >
typedef T::Primitive Primitive
 
typedef T::Space Space
 

Public Member Functions

 BOOST_CONCEPT_USAGE (CAdditivePrimitiveComputer)
 
void checkConstConstraints () const
 
- Public Member Functions inherited from DGtal::concepts::CIncrementalPrimitiveComputer< T >
 BOOST_CONCEPT_USAGE (CIncrementalPrimitiveComputer)
 
void checkConstConstraints () const
 
- Public Member Functions inherited from DGtal::concepts::CPrimitiveComputer< T >
 BOOST_CONCEPT_USAGE (CPrimitiveComputer)
 
void checkConstConstraints () const
 

Private Attributes

myX
 
bool myBool
 
CForwardIteratorArchetype< PointmyIt
 

Detailed Description

template<typename T>
struct DGtal::concepts::CAdditivePrimitiveComputer< T >

Aim: Defines the concept describing an object that computes some primitive from input points given group by group, while keeping some internal state. At any moment, the object is supposed to store at least one valid primitive for the formerly given input points. A primitive is an informal word that describes some family of objects that share common characteristics. Often, the primitives are geometric, e.g. digital planes.

Description of concept 'CAdditivePrimitiveComputer'

Refinement of CIncrementalPrimitiveComputer

Associated types :

Notation

Valid expressions and semantics

Name Expression Type requirements Return type Precondition Semantics Post condition Complexity
insert new pointsx.extend(it, itE)ForwardIterator it, itE: the type of iterator on points, a model of boost::ForwardIterator on Point bool tries to find a primitive that matches the new points in range [it, itE) and all formerly given input points, return true on success (state may change), false otherwise (state is unchanged)
check new pointsx.isExtendable(it, itE)ForwardIterator it, itE: the type of iterator on points, a model of boost::ForwardIterator bool tries to find a primitive that matches the new points in range [it, itE) and all formerly given input points, return true only if it possible, the state is always unchanged

Invariants

Models

Notes

Template Parameters
Tthe type that should be a model of CAdditivePrimitiveComputer.

Definition at line 99 of file CAdditivePrimitiveComputer.h.

Member Typedef Documentation

template<typename T >
typedef T::Point DGtal::concepts::CAdditivePrimitiveComputer< T >::Point

Definition at line 104 of file CAdditivePrimitiveComputer.h.

Member Function Documentation

template<typename T >
DGtal::concepts::CAdditivePrimitiveComputer< T >::BOOST_CONCEPT_USAGE ( CAdditivePrimitiveComputer< T >  )
inline
template<typename T >
void DGtal::concepts::CAdditivePrimitiveComputer< T >::checkConstConstraints ( ) const
inline

Field Documentation

template<typename T >
bool DGtal::concepts::CAdditivePrimitiveComputer< T >::myBool
private
template<typename T >
T DGtal::concepts::CAdditivePrimitiveComputer< T >::myX
private

The documentation for this struct was generated from the following file: