| 
    DGtal
    0.6.devel
    
   | 
 
#include <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 | Postcondition | 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 126 of file CSegment.h.
| typedef T::ConstIterator DGtal::CSegment< T >::ConstIterator | 
Definition at line 131 of file CSegment.h.
      
  | 
  inline | 
Definition at line 136 of file CSegment.h.
References DGtal::CSegment< T >::it, DGtal::CSegment< T >::myX, and DGtal::ConceptUtils::sameType().
      
  | 
  private | 
Definition at line 144 of file CSegment.h.
Referenced by DGtal::CSegment< T >::BOOST_CONCEPT_USAGE().
      
  | 
  private | 
Reimplemented in DGtal::CIncrementalSegmentComputer< T >, DGtal::CBidirectionalSegmentComputer< T >, DGtal::CDynamicSegmentComputer< T >, and DGtal::CDynamicBidirectionalSegmentComputer< T >.
Definition at line 143 of file CSegment.h.
Referenced by DGtal::CSegment< T >::BOOST_CONCEPT_USAGE().
 1.8.1.1