ExactTerminalNodePolicy.h

Go to the documentation of this file.

/***************************************************************************
 *   Copyright (C) 2005 by Christophe GONZALES and Pierre-Henri WUILLEMIN  *
 *   {prenom.nom}_at_lip6.fr                                               *
 *                                                                         *
 *   This program 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 program 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.             *
 ***************************************************************************/
#ifndef GUM_MULTI_DIM_FUNCTION_GRAPH_EXACT_TERMINAL_NODE_POLICY_H
#define GUM_MULTI_DIM_FUNCTION_GRAPH_EXACT_TERMINAL_NODE_POLICY_H

#include <agrum/core/bijection.h>
#include <agrum/graphs/parts/nodeGraphPart.h>
#include <agrum/multidim/utils/FunctionGraphUtilities/terminalNodePolicies/ITerminalNodePolicy.h>

namespace gum {

  // clang-format off
  // clang-format on
  template < typename GUM_SCALAR >
  class ExactTerminalNodePolicy : public ITerminalNodePolicy< GUM_SCALAR > {
    public:
    // ============================================================================
    // ============================================================================

    void addTerminalNode(const NodeId& n, const GUM_SCALAR& v) {
      __map.insert(n, v);
    }

    void eraseTerminalNode(const NodeId& n) { __map.eraseFirst(n); }

    void clearAllTerminalNodes() { __map.clear(); }

    // ============================================================================
    // ============================================================================

    bool existsTerminalNodeWithId(const NodeId& n) const {
      return __map.existsFirst(n);
    }

    bool existsTerminalNodeWithValue(const GUM_SCALAR& v) const {
      return __map.existsSecond(v);
    }

    // ============================================================================
    // ============================================================================

    const GUM_SCALAR& terminalNodeValue(const NodeId& n) const {
      return __map.second(n);
    }

    const NodeId& terminalNodeId(const GUM_SCALAR& v) const {
      return __map.first(v);
    }

    // ============================================================================
    // ============================================================================

    void beginValues() const { __mappy = __map.beginSafe(); }

    bool hasValue() const { return __mappy != __map.endSafe(); }

    void nextValue() const { ++__mappy; }

    const GUM_SCALAR& value() const { return __mappy.second(); }

    const NodeId& id() const { return __mappy.first(); }


    private:
    Bijection< NodeId, GUM_SCALAR >                     __map;
    mutable BijectionIteratorSafe< NodeId, GUM_SCALAR > __mappy;
  };

}   // End of namespace gum

#endif /* GUM_MULTI_DIM_FUNCTION_GRAPH_EXACT_TERMINAL_NODE_POLICY_H */