|
DGtal 1.4.2
|
Aim: Defines the concept describing a segment, ie. a valid and not empty range. More...
#include <DGtal/geometry/curves/CSegment.h>
Public Types | |
| typedef T::ConstIterator | ConstIterator |
Public Member Functions | |
| BOOST_CONCEPT_USAGE (CSegment) | |
Private Attributes | |
| T | myX |
| ConstIterator | it |
Aim: Defines the concept describing a segment, ie. a valid and not empty range.
Description of concept 'CSegment'
| Name | Expression | Type requirements | Return type | Precondition | Semantics | Post condition | Complexity |
|---|---|---|---|---|---|---|---|
| begin method | x.begin() | ConstIterator | provides an iterator on the first element of the segment | O(1) | |||
| end method | x.end() | ConstIterator | past-the-end value | O(1) |
The range [x.begin(),x.end()) is valid (x.end() is reachable from x.begin()) and not empty (x.begin() != x.end()).
A class of segments \( \Sigma_P \) is a set of segments such that for each segment of the set, a given predicate \( P \) is true: \( \forall s \in \Sigma_P, P(s) = \textrm{true} \).
Segment computers, which refines CSegment, are segment that can control their own extension so that a given predicate remains true.
| T | the type that should be a model of CSegment. |
Definition at line 101 of file CSegment.h.
| T::ConstIterator DGtal::concepts::CSegment< T >::ConstIterator |
Definition at line 106 of file CSegment.h.
|
inline |
Definition at line 111 of file CSegment.h.
References DGtal::concepts::CSegment< T >::it, DGtal::concepts::CSegment< T >::myX, and DGtal::concepts::ConceptUtils::sameType().
|
private |
Definition at line 119 of file CSegment.h.
Referenced by DGtal::concepts::CSegment< T >::BOOST_CONCEPT_USAGE().
|
private |
Definition at line 118 of file CSegment.h.
Referenced by DGtal::concepts::CSegment< T >::BOOST_CONCEPT_USAGE().