---

more/phys/level_graph.h

Go to the documentation of this file.

//  Copyright (C) 2002  Petter Urkedal (petter.urkedal@matfys.lth.se)
//
//  This file is free software; you can redistribute it and/or modify
//  it under the terms of the GNU General Public License as published by
//  the Free Software Foundation; either version 2 of the License, or
//  (at your option) any later version.
//
//  This file is distributed in the hope that it will be useful,
//  but WITHOUT ANY WARRANTY; without even the implied warranty of
//  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
//  GNU General Public License for more details.
//
//  You should have received a copy of the GNU General Public License
//  along with this program; if not, write to the Free Software
//  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
//
//  As a special exception, you may use this file as part of a free
//  software library without restriction.  Specifically, if other files
//  instantiate templates or use macros or inline functions from this
//  file, or you compile this file and link it with other files to
//  produce an executable, this file does not by itself cause the
//  resulting executable to be covered by the GNU General Public
//  License.  This exception does not however invalidate any other
//  reasons why the executable file might be covered by the GNU General
//  Public License.
//
//  $Id: level_graph.h,v 1.1 2002/05/30 18:01:40 petter_urkedal Exp $


namespace more {
namespace phys {

  template<typename LevelTraits>
  struct level_graph
  {
      typedef LevelTraits level_traits;

  private:
      struct level_node;

      struct radiation_node
      {
          bool operator<(radiation_node const& rhs) const
          { return m_rad < rhs.m_rad; }

          radiation_type m_rad;
          level_node* m_initial;
          level_node* m_final;
      };

      struct level_node
      {
          bool operator<(level_node const& rhs) const
          { return m_lev < rhs.m_lev; }

          level_type m_lev;
          std::set<radiation_node> m_radiations;
      };

  public:
      typedef std::set<level_node>::iterator vertex_descriptor;
      typedef std::pair<vertex_descriptor, std::set<radiation_node>::iterator

      struct level_iterator
          : std::bidirectional_iterator<level_type, std::ptrdiff_t>
      {
          level_iterator() {}
          explicit level_iterator(std::set<level_node>::iterator it)
              : m_it_lev(it) {}

          level_iterator& operator++() { ++m_it_lev; return *this; }
          level_iterator& operator--() { --m_it_lev; return *this; }
          level_iterator operator++(int)
          { level_iterator tmp = *this; ++*this; return tmp; }
          level_iterator operator--(int)
          { level_iterator tmp = *this; ++*this; return tmp; }

          bool operator==(level_iterator const& rhs) const
          { return m_it_lev == rhs.m_it_lev; }
          bool operator!=(level_iterator const& rhs) const
          { return m_it_lev != rhs.m_it_lev; }

          level_type const& operator*() { return m_it_lev->m_lev; }
          level_type const* operator->() { return &m_it_lev->m_lev; }

      private:
          std::set<level_node>::iterator m_it_lev;
      };
      typedef level_iterator const_level_iterator;

      struct radiation_iterator
      {
      };

      level_iterator

  private:
      std::set<level_node> m_levels;
  };

}}

---