/usr/include/ITK-4.9/itkOneWayEquivalencyTable.h is in libinsighttoolkit4-dev 4.9.0-4ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 | /*=========================================================================
*
* Copyright Insight Software Consortium
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0.txt
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*=========================================================================*/
#ifndef itkOneWayEquivalencyTable_h
#define itkOneWayEquivalencyTable_h
#include "itkProcessObject.h"
#include "itksys/hash_map.hxx"
#include "ITKWatershedsExport.h"
namespace itk
{
/** \class OneWayEquivalencyTable
* \brief Hash table to manage integral label equivalencies that are order dependent.
*
* 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.
*
* \par
* See itk::EquivalencyTable for more information
* \ingroup WatershedSegmentation
*
* \sa EquivalencyTable
* \ingroup ITKWatersheds
*/
class ITKWatersheds_EXPORT OneWayEquivalencyTable:public DataObject
{
public:
/** Standard typedefs and smart pointer declarations. */
typedef OneWayEquivalencyTable Self;
typedef DataObject Superclass;
typedef SmartPointer< Self > Pointer;
typedef SmartPointer< const Self > ConstPointer;
itkNewMacro(Self);
itkTypeMacro(OneWayEquivalencyTable, DataObject);
/** Define the container type for this table */
typedef itksys::hash_map< unsigned long, unsigned long,
itksys::hash< unsigned long > > HashTableType;
typedef HashTableType::iterator Iterator;
typedef HashTableType::const_iterator ConstIterator;
typedef HashTableType::value_type ValueType;
/** ``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}. */
void Flatten();
/** 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).
*/
bool Add(unsigned long a, unsigned long b);
/** 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. */
unsigned long Lookup(const unsigned long a) const
{
ConstIterator result = m_HashMap.find(a);
if ( result == m_HashMap.end() ) { return a; }
else { return ( *result ).second; }
}
/** 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. */
unsigned long RecursiveLookup(const unsigned long a) const;
/** Returns TRUE if the label is found in the table and FALSE is the
* label is not found in the table. */
bool IsEntry(const unsigned long a) const
{
if ( m_HashMap.find(a) == m_HashMap.end() ) { return false; }
else { return true; }
}
/** Erases the entry with key a. */
void Erase(const unsigned long a)
{ m_HashMap.erase(a); }
/** Erases all the entries in the table. */
void Clear()
{ m_HashMap.clear(); }
/** Returns TRUE if the table is empty, FALSE if it is not empty. */
bool Empty() const
{ return m_HashMap.empty(); }
/** Returns an iterator pointing to the first element of the (unordered)
table. */
Iterator Begin() { return m_HashMap.begin(); }
/** Returns and iterator pointing to one position past the last
* element of the (unordered) table. */
Iterator End() { return m_HashMap.end(); }
/** Convenience method for debugging. */
// void PrintHashTable();
protected:
OneWayEquivalencyTable() {}
virtual ~OneWayEquivalencyTable() {}
OneWayEquivalencyTable(const Self &) ITK_DELETE_FUNCTION;
void operator=(const Self &) ITK_DELETE_FUNCTION;
virtual void PrintSelf(std::ostream & os, Indent indent) const ITK_OVERRIDE;
HashTableType m_HashMap;
};
} // end namespace itk
#endif
|