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. More...

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

Inheritance 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
T	myX
bool	myBool
CForwardIteratorArchetype< Point >	myIt

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

Primitive, the type that defines the primitive.
Point: the type of the input points.

Notation

X : A type that is a model of CAdditivePrimitiveComputer
x : object of type X

Valid expressions and semantics

Name	Expression	Type requirements	Return type	Precondition	Semantics	Post condition	Complexity
insert new points	x.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 points	x.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