structuralConstraintTabuList_inl.h

Go to the documentation of this file.

#ifndef DOXYGEN_SHOULD_SKIP_THIS

namespace gum {

  namespace learning {

    INLINE
    void StructuralConstraintTabuList::setTabuListSize(Size new_size) {
      if (new_size == _TabuList__changes.size()) return;

      if (_TabuList__changes.size() > new_size) {
        // remove the oldest elements, so that only newsize elements remain
        while (_TabuList__changes.size() > new_size) {
          _TabuList__changes.eraseSecond(_TabuList__offset);
          ++_TabuList__offset;
        }
      } else {
        // add dummy elements
        while (_TabuList__changes.size() < new_size) {
          --_TabuList__offset;
          _TabuList__changes.insert(
             ArcAddition(std::numeric_limits< NodeId >::max() - _TabuList__offset,
                         std::numeric_limits< NodeId >::max()),
             _TabuList__offset);
        }
      }
    }

    INLINE void StructuralConstraintTabuList::setGraphAlone(const DiGraph& graph) {
    }

    INLINE bool
       StructuralConstraintTabuList::checkArcAdditionAlone(NodeId x,
                                                           NodeId y) const {
      return !_TabuList__changes.existsFirst(ArcDeletion(x, y))
             && !_TabuList__changes.existsFirst(ArcAddition(x, y));
    }

    INLINE bool
       StructuralConstraintTabuList::checkArcDeletionAlone(NodeId x,
                                                           NodeId y) const {
      return !_TabuList__changes.existsFirst(ArcAddition(x, y))
             && !_TabuList__changes.existsFirst(ArcDeletion(x, y));
    }

    INLINE bool
       StructuralConstraintTabuList::checkArcReversalAlone(NodeId x,
                                                           NodeId y) const {
      return !_TabuList__changes.existsFirst(ArcReversal(y, x))
             && !_TabuList__changes.existsFirst(ArcReversal(x, y));
    }

    INLINE bool StructuralConstraintTabuList::checkModificationAlone(
       const ArcAddition& change) const {
      return checkArcAdditionAlone(change.node1(), change.node2());
    }

    INLINE bool StructuralConstraintTabuList::checkModificationAlone(
       const ArcDeletion& change) const {
      return checkArcDeletionAlone(change.node1(), change.node2());
    }

    INLINE bool StructuralConstraintTabuList::checkModificationAlone(
       const ArcReversal& change) const {
      return checkArcReversalAlone(change.node1(), change.node2());
    }

    INLINE bool StructuralConstraintTabuList::checkModificationAlone(
       const GraphChange& change) const {
      switch (change.type()) {
        case GraphChangeType::ARC_ADDITION:
          return checkArcAdditionAlone(change.node1(), change.node2());

        case GraphChangeType::ARC_DELETION:
          return checkArcDeletionAlone(change.node1(), change.node2());

        case GraphChangeType::ARC_REVERSAL:
          return checkArcReversalAlone(change.node1(), change.node2());

        default:
          GUM_ERROR(OperationNotAllowed,
                    "edge modifications are not "
                    "supported by StructuralConstraintTabuList");
      }
    }

    INLINE void
       StructuralConstraintTabuList::modifyGraphAlone(const ArcAddition& change) {
      _TabuList__changes.eraseSecond(_TabuList__offset);
      ++_TabuList__offset;
      _TabuList__changes.insert(
         change, NodeId(_TabuList__offset + _TabuList__changes.size()));
    }

    INLINE void
       StructuralConstraintTabuList::modifyGraphAlone(const ArcDeletion& change) {
      _TabuList__changes.eraseSecond(_TabuList__offset);
      ++_TabuList__offset;
      _TabuList__changes.insert(
         change, _TabuList__offset + NodeId(_TabuList__changes.size()));
    }

    INLINE void
       StructuralConstraintTabuList::modifyGraphAlone(const ArcReversal& change) {
      _TabuList__changes.eraseSecond(_TabuList__offset);
      ++_TabuList__offset;
      _TabuList__changes.insert(
         change, _TabuList__offset + NodeId(_TabuList__changes.size()));
    }

    INLINE void
       StructuralConstraintTabuList::modifyGraphAlone(const GraphChange& change) {
      switch (change.type()) {
        case GraphChangeType::ARC_ADDITION:
          modifyGraphAlone(static_cast< const ArcAddition& >(change));
          break;

        case GraphChangeType::ARC_DELETION:
          modifyGraphAlone(static_cast< const ArcDeletion& >(change));
          break;

        case GraphChangeType::ARC_REVERSAL:
          modifyGraphAlone(static_cast< const ArcReversal& >(change));
          break;

        default:
          GUM_ERROR(OperationNotAllowed,
                    "edge modifications are not supported by digraph constraint");
      }
    }

    INLINE bool StructuralConstraintTabuList::isAlwaysInvalidAlone(
       const GraphChange&) const {
      return false;
    }

// include all the methods applicable to the whole class hierarchy
#  define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintTabuList
#  include <agrum/learning/constraints/structuralConstraintPatternRootInline.h>
#  undef GUM_CONSTRAINT_CLASS_NAME

  } /* namespace learning */

} /* namespace gum */

#endif /* DOXYGEN_SHOULD_SKIP_THIS */