#include <itkWatershedSegmentTree.h>
Inheritance diagram for itk::watershed::SegmentTree< TScalarType >:


Public Types | |
| typedef DequeType::const_iterator | ConstIterator |
| typedef SmartPointer< const Self > | ConstPointer |
| typedef std::deque< merge_t > | DequeType |
| typedef DequeType::iterator | Iterator |
| typedef SmartPointer< Self > | Pointer |
| typedef TScalarType | ScalarType |
| typedef DataObject | Superclass |
| typedef DequeType::value_type | ValueType |
Public Member Functions | |
| merge_t & | Back () |
| const merge_t & | Back () const |
| ConstIterator | Begin () const |
| Iterator | Begin () |
| void | Clear () |
| bool | Empty () const |
| ConstIterator | End () const |
| Iterator | End () |
| merge_t & | Front () |
| const merge_t & | Front () const |
| virtual const char * | GetNameOfClass () const |
| void | Initialize () |
| Elements of the | list (nodes of the tree).A record of a merge *between two segments(unsigned long labels) at a particular *saliency.*/struct merge_t |
| void | PopBack () |
| void | PopFront () |
| void | PushBack (const ValueType &t) |
| void | PushFront (const ValueType &t) |
| DequeType::size_type | Size () const |
Static Public Member Functions | |
| static Pointer | New () |
Public Attributes | |
| Define itk Smart Pointers for this object *typedef SegmentTree | Self |
Protected Member Functions | |
| void | operator= (const Self &) |
| void | PrintSelf (std::ostream &os, Indent indent) const |
| SegmentTree (const Self &) | |
| SegmentTree () | |
| virtual | ~SegmentTree () |
Protected Attributes | |
| DequeType | m_Deque |
Classes | |
| struct | merge_comp |
| struct | sort_comp |
|
|||||
|
Definition at line 71 of file itkWatershedSegmentTree.h. |
|
|||||
|
Definition at line 51 of file itkWatershedSegmentTree.h. |
|
|||||
|
Define the container type used in this list data structure Definition at line 65 of file itkWatershedSegmentTree.h. |
|
|||||
|
Definition at line 70 of file itkWatershedSegmentTree.h. |
|
|||||
|
Definition at line 50 of file itkWatershedSegmentTree.h. |
|
|||||
|
Definition at line 53 of file itkWatershedSegmentTree.h. |
|
|||||
|
Definition at line 49 of file itkWatershedSegmentTree.h. |
|
|||||
|
Definition at line 72 of file itkWatershedSegmentTree.h. |
|
|||||||||
|
Definition at line 167 of file itkWatershedSegmentTree.h. |
|
|||||||||
|
Definition at line 168 of file itkWatershedSegmentTree.h. |
|
||||||||||
|
Definition at line 169 of file itkWatershedSegmentTree.h. |
|
|||||||||
|
Returns a reference to the back of the list Definition at line 118 of file itkWatershedSegmentTree.h. |
|
|||||||||
|
Returns a const reference to the back of the list (node with the greatest saliency value). Definition at line 110 of file itkWatershedSegmentTree.h. |
|
|||||||||
|
Returns a const iterator pointing to the first element in the list. Definition at line 142 of file itkWatershedSegmentTree.h. |
|
|||||||||
|
Returns an iterator pointing to the first element in the list. Definition at line 138 of file itkWatershedSegmentTree.h. |
|
|||||||||
|
Clears the Deque completely Definition at line 156 of file itkWatershedSegmentTree.h. |
|
|||||||||
|
Returns TRUE if the SegmentTree is empty, FALSE if the SegmentTree is not empty. Definition at line 100 of file itkWatershedSegmentTree.h. |
|
|||||||||
|
Returns a const iterator pointing one element past the last element in the list. Definition at line 152 of file itkWatershedSegmentTree.h. |
|
|||||||||
|
Returns an iterator pointing one element past the last element in the list. Definition at line 147 of file itkWatershedSegmentTree.h. |
|
|||||||||
|
Returns a reference to the front of the list Definition at line 114 of file itkWatershedSegmentTree.h. |
|
|||||||||
|
Returns a const reference to the front of the list (node with the least saliency value). Definition at line 105 of file itkWatershedSegmentTree.h. |
|
|||||||||
|
|
|
|||||||||
|
Standard DataObject routine to initialize. Returns the segment tree to a default state, deallocating memory. |
|
||||||||||
|
Definition at line 57 of file itkWatershedSegmentTree.h. |
|
|||||||||
|
|
|
||||||||||
|
Definition at line 170 of file itkWatershedSegmentTree.h. |
|
|||||||||
|
Erases the node at the back of the list. Definition at line 134 of file itkWatershedSegmentTree.h. |
|
|||||||||
|
Erases the node at the front of the list. Definition at line 130 of file itkWatershedSegmentTree.h. |
|
||||||||||||||||
|
|
|
||||||||||
|
Inserts a node at the back of the list Definition at line 126 of file itkWatershedSegmentTree.h. |
|
||||||||||
|
Inserts a node at the front of the list. Definition at line 122 of file itkWatershedSegmentTree.h. |
|
|||||||||
|
Returns the size of the list. Definition at line 95 of file itkWatershedSegmentTree.h. |
|
|||||
|
Definition at line 173 of file itkWatershedSegmentTree.h. |
|
|||||
|
Definition at line 48 of file itkWatershedSegmentTree.h. |
1.4.2 written by Dimitri van Heesch,
© 1997-2000