itkWatershedSegmentTree.h

Go to the documentation of this file.

/*=========================================================================
 *
 *  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 itkWatershedSegmentTree_h
#define itkWatershedSegmentTree_h

#include "itkProcessObject.h"
#include <deque>
#include <functional>

namespace itk
{
namespace watershed
{
template< typename TScalar >
class SegmentTree:public DataObject
{
public:
  typedef SegmentTree                Self;
  typedef DataObject                 Superclass;
  typedef SmartPointer< Self >       Pointer;
  typedef SmartPointer< const Self > ConstPointer;
  itkNewMacro(Self);
  itkTypeMacro(WatershedSegmentTree, DataObject);
  typedef TScalar ScalarType;

  struct merge_t {
    IdentifierType from;
    IdentifierType to;
    ScalarType saliency;
  };

  typedef std::deque< merge_t >              DequeType;
  typedef typename DequeType::iterator       Iterator;
  typedef typename DequeType::const_iterator ConstIterator;
  typedef typename DequeType::value_type     ValueType;

  struct merge_comp:public std:: binary_function< bool, const merge_t &,
                                                  const merge_t & > {
    merge_comp() {}
    bool operator()(const merge_t & a, const merge_t & b)
    {
      return b.saliency < a.saliency;
    }
  };

  struct sort_comp:public std:: binary_function< bool, const merge_t &,
                                                 const merge_t & > {
    bool operator()(const merge_t & a, const merge_t & b)
    {
      return a.saliency < b.Saliency;
    }
  };

  typename DequeType::size_type Size() const
  { return m_Deque.size(); }

  bool Empty() const
  { return m_Deque.empty();    }

  const merge_t & Front() const
  { return m_Deque.front(); }

  const merge_t & Back() const
  { return m_Deque.back(); }

  merge_t & Front()
  { return m_Deque.front(); }

  merge_t & Back()
  { return m_Deque.back(); }

  void PushFront(const ValueType & t)
  { m_Deque.push_front(t); }

  void PushBack(const ValueType & t)
  { m_Deque.push_back(t); }

  void PopFront()
  { m_Deque.pop_front(); }

  void PopBack()
  { m_Deque.pop_back(); }

  Iterator Begin()
  { return m_Deque.begin(); }

  ConstIterator Begin() const
  { return m_Deque.begin(); }

  Iterator End()
  { return m_Deque.end(); }

  ConstIterator End() const
  { return m_Deque.end(); }

  void Clear()
  { m_Deque.clear(); }

  virtual void Initialize() ITK_OVERRIDE;

protected:
  SegmentTree() {}
  virtual ~SegmentTree() {}
  SegmentTree(const Self &) {}
  void operator=(const Self &) {}
  virtual void PrintSelf(std::ostream & os, Indent indent) const ITK_OVERRIDE;

  DequeType m_Deque;
};
} // end namespace watershed
} // end namespace itk

#ifndef ITK_MANUAL_INSTANTIATION
#include "itkWatershedSegmentTree.hxx"
#endif

#endif