#include <itkOneWayEquivalencyTable.h>
Inheritance diagram for itk::OneWayEquivalencyTable:
[NOHEADER] | |
typedef OneWayEquivalencyTable | Self |
typedef DataObject | Superclass |
typedef SmartPointer< Self > | Pointer |
typedef SmartPointer< const Self > | ConstPointer |
virtual const char * | GetClassName () const |
Pointer | New () |
Public Types | |
typedef itk::hash_map< unsigned long, unsigned long, itk::hash< unsigned long > > | HashTableType |
typedef HashTableType::iterator | Iterator |
typedef HashTableType::const_iterator | ConstIterator |
typedef HashTableType::value_type | ValueType |
Public Member Functions | |
void | Flatten () |
bool | Add (unsigned long a, unsigned long b) |
unsigned long | RecursiveLookup (const unsigned a) const |
void | Erase (const unsigned long a) |
void | Clear () |
bool | Empty () const |
Iterator | Begin () |
Iterator | End () |
unsigned long | Lookup (const unsigned long a) const |
bool | IsEntry (const unsigned long a) const |
Protected Member Functions | |
OneWayEquivalencyTable () | |
virtual | ~OneWayEquivalencyTable () |
OneWayEquivalencyTable (const Self &) | |
void | operator= (const Self &) |
void | PrintSelf (std::ostream &os, Indent indent) const |
void | UpdateOutputInformation () |
bool | VerifyRequestedRegion () |
void | SetRequestedRegionToLargestPossibleRegion () |
bool | RequestedRegionIsOutsideOfTheBufferedRegion () |
void | SetRequestedRegion (itk::DataObject *) |
Protected Attributes | |
HashTableType | m_HashMap |
OneWayEquivalencyTable is a variation on itk::EquivalencyTable that preserves the order of equivalencies. For example, the entries { 5 = 4 } and {4 = 5} are not equivalent in this table, yet are the treated as the same entry in EquivalencyTable. Because of the one-way logic of the table, reflexive equivalencies will result in cycling from recursive lookups or flattening of the table. The responsibility is on the user for preventing recursive cycling.
Definition at line 47 of file itkOneWayEquivalencyTable.h.
|
Definition at line 63 of file itkOneWayEquivalencyTable.h. Referenced by Lookup(). |
|
Standard typedefs and smart pointer declarations. Reimplemented from itk::DataObject. Definition at line 54 of file itkOneWayEquivalencyTable.h. |
|
Define the container type for this table Definition at line 61 of file itkOneWayEquivalencyTable.h. Referenced by ~OneWayEquivalencyTable(). |
|
Definition at line 62 of file itkOneWayEquivalencyTable.h. |
|
Standard typedefs and smart pointer declarations. Reimplemented from itk::DataObject. Definition at line 53 of file itkOneWayEquivalencyTable.h. |
|
Standard typedefs and smart pointer declarations. Reimplemented from itk::DataObject. Definition at line 51 of file itkOneWayEquivalencyTable.h. Referenced by OneWayEquivalencyTable(). |
|
Standard typedefs and smart pointer declarations. Reimplemented from itk::DataObject. Definition at line 52 of file itkOneWayEquivalencyTable.h. |
|
Definition at line 64 of file itkOneWayEquivalencyTable.h. |
|
Convenience method for debugging. Definition at line 130 of file itkOneWayEquivalencyTable.h. References Self. |
|
Definition at line 131 of file itkOneWayEquivalencyTable.h. References HashTableType. |
|
|
|
Insert an equivalency into the table. A return value of TRUE indicates that the equivalency did not previously exist in the table and was successfully added. A FALSE return value indicates that the equivalency was not added to the table because a conflict with an existing entry occurred (most likely, the equivalency was already recorded directly or indirectly). |
|
Returns an iterator pointing to the first element of the (unordered) table. Definition at line 120 of file itkOneWayEquivalencyTable.h. |
|
Erases all the entries in the table. Definition at line 111 of file itkOneWayEquivalencyTable.h. |
|
Returns TRUE if the table is empty, FALSE if it is not empty. Definition at line 115 of file itkOneWayEquivalencyTable.h. |
|
Returns and iterator pointing to one position past the last element of the (unordered) table. Definition at line 124 of file itkOneWayEquivalencyTable.h. |
|
Erases the entry with key a. Definition at line 107 of file itkOneWayEquivalencyTable.h. |
|
``Flattens'' the equivalency table by eliminating all redundant and recursive equivalencies. I.e. the set { 2=1; 3=2; 4=3 } is converted to {4=1; 3=1; 2=1}. |
|
Standard typedefs and smart pointer declarations. Reimplemented from itk::DataObject.
|
|
Returns TRUE if the label is found in the table and FALSE is the label is not found in the table. Definition at line 99 of file itkOneWayEquivalencyTable.h. |
|
Lookup an equivalency in the table. If no entry is found in the table, the method returns its the value of the argument. Does not recursively descent through equivalencies. Definition at line 83 of file itkOneWayEquivalencyTable.h. References ConstIterator. |
|
Standard typedefs and smart pointer declarations. Reimplemented from itk::Object.
|
|
Reimplemented from itk::DataObject.
|
|
Methods invoked by Print() to print information about the object including superclasses. Typically not called by the user (use Print() instead) but used in the hierarchical print process to combine the output of several classes. Reimplemented from itk::DataObject.
|
|
Lookup an equivalency in the table by recursing through all successive equivalencies. For example, if the follow entries exist in the table {8=7, 7=6, 6=5}, then RecursiveLookup(8) returns 5. |
|
Determine whether the RequestedRegion is outside of the BufferedRegion. This method returns true if the RequestedRegion is outside the BufferedRegion (true if at least one pixel is outside). This is used by the pipeline mechanism to determine whether a filter needs to re-execute in order to satisfy the current request. If the current RequestedRegion is already inside the BufferedRegion from the previous execution (and the current filter is up to date), then a given filter does not need to re-execute Implements itk::DataObject. Definition at line 141 of file itkOneWayEquivalencyTable.h. |
|
Set the requested region from this data object to match the requested region of the data object passed in as a parameter. This method is implemented in the concrete subclasses of DataObject. Implements itk::DataObject. Definition at line 142 of file itkOneWayEquivalencyTable.h. |
|
Set the RequestedRegion to the LargestPossibleRegion. This forces a filter to produce all of the output in one execution (i.e. not streaming) on the next call to Update(). Implements itk::DataObject. Definition at line 140 of file itkOneWayEquivalencyTable.h. |
|
Update the information for this DataObject so that it can be used as an output of a ProcessObject. This method is used in the pipeline mechanism to propagate information and initialize the meta data associated with a DataObject. Any implementation of this method in a derived class is assumed to call its source's ProcessObject::UpdateOutputInformation() which determines modified times, LargestPossibleRegions, and any extra meta data like spacing, origin, etc. Implements itk::DataObject.
|
|
Verify that the RequestedRegion is within the LargestPossibleRegion. If the RequestedRegion is not within the LargestPossibleRegion, then the filter cannot possibly satisfy the request. This method returns true if the request can be satisfied (even if it will be necessary to process the entire LargestPossibleRegion) and returns false otherwise. This method is used by PropagateRequestedRegion(). PropagateRequestedRegion() throws a InvalidRequestedRegionError exception if the requested region is not within the LargestPossibleRegion. Implements itk::DataObject. Definition at line 139 of file itkOneWayEquivalencyTable.h. |
|
Definition at line 136 of file itkOneWayEquivalencyTable.h. |