Dogcows Code - chaz/yoink/blob - src/Moof/Tree.hh

   1
   2 /*******************************************************************************
   3
   4  Copyright (c) 2009, Charles McGarvey
   5  All rights reserved.
   6
   7  Redistribution   and   use  in  source  and  binary  forms,  with  or  without
   8  modification, are permitted provided that the following conditions are met:
   9
  10    * Redistributions  of  source  code  must retain the above copyright notice,
  11      this list of conditions and the following disclaimer.
  12    * Redistributions  in binary form must reproduce the above copyright notice,
  13      this  list of conditions and the following disclaimer in the documentation
  14      and/or other materials provided with the distribution.
  15
  16  THIS  SOFTWARE  IS  PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  17  AND  ANY  EXPRESS  OR  IMPLIED  WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  18  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  19  DISCLAIMED.  IN  NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
  20  FOR  ANY  DIRECT,  INDIRECT,  INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  21  DAMAGES  (INCLUDING,  BUT  NOT  LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  22  SERVICES;  LOSS  OF  USE,  DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  23  CAUSED  AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  24  OR  TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  25  OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  26
  27 *******************************************************************************/
  28
  29 #ifndef _MOOF_TREE_HH_
  30 #define _MOOF_TREE_HH_
  31
  32 #include <boost/shared_ptr.hpp>
  33 #include <boost/weak_ptr.hpp>
  34
  35
  36 namespace Mf {
  37
  38
  39 template <typename T>
  40 class Tree
  41 {
  42 public:
  43         typedef boost::shared_ptr<Tree> Ptr;
  44         typedef boost::weak_ptr<Tree> WeakPtr;
  45
  46 private:
  47         WeakPtr parent_;
  48         WeakPtr prevSibling_;
  49         Ptr             next_;
  50         WeakPtr lastDescendant_;
  51
  52 public:
  53
  54         T               data;
  55
  56         Tree() {}
  57         Tree(const T& item) :
  58                 data(item) {}
  59
  60         inline Ptr next() const
  61         {
  62                 return next_;
  63         }
  64
  65         inline Ptr prev() const
  66         {
  67                 Ptr parent = parent_.lock();
  68
  69                 if (parent)
  70                 {
  71                         if (parent->next_.get() == this)
  72                         {
  73                                 return parent;
  74                         }
  75                         else
  76                         {
  77                                 return prevSibling_.lock()->lastDescendant_.lock();
  78                         }
  79                 }
  80
  81                 return Ptr();
  82         }
  83
  84         inline Ptr firstChild() const
  85         {
  86                 if (next_ && next_->parent_.lock().get() == this)
  87                 {
  88                         return next_;
  89                 }
  90
  91                 return Ptr();
  92         }
  93
  94         inline Ptr lastChild() const
  95         {
  96                 Ptr child = firstChild();
  97
  98                 if (child)
  99                 {
 100                         child = child->prevSibling_.lock();
 101                 }
 102
 103                 return child;
 104         }
 105
 106         inline Ptr nextSibling() const
 107         {
 108                 Ptr sibling = lastDescendant_.lock()->next_;
 109
 110                 if (sibling && sibling->parent_.lock() != parent_.lock())
 111                 {
 112                         return Ptr();
 113                 }
 114
 115                 return sibling;
 116         }
 117
 118         inline Ptr prevSibling() const
 119         {
 120                 Ptr parent = parent_.lock();
 121
 122                 if (parent && parent->next_.get() != this)
 123                 {
 124                         return prevSibling_.lock();
 125                 }
 126
 127                 return Ptr();
 128         }
 129
 130
 131         class Iterator
 132         {
 133                 Ptr current;
 134
 135         public:
 136
 137         };
 138
 139
 140         void insert()
 141         {
 142         }
 143
 144         void remove()
 145         {
 146         }
 147
 148 };
 149
 150
 151 } // namespace Mf
 152
 153 #endif // _MOOF_TREE_HH_
 154
 155 /** vim: set ts=4 sw=4 tw=80: *************************************************/
 156