RhodeCode

  // \brief Notifier class to notify observes about alterations in

  // a container.

  //

  //

  // nodes and edges in the graph. LEMON would like to handle easily

  // that the node and edge maps should contain values for all nodes or

  // edges. If we want to check on every indicing if the map contains

  // the current indicing key that cause a drawback in the performance

  // an alteration in the graph, which cause only drawback on the

  // alteration of the graph.

  //

  //

  // For the proper functonality of this class, we should notify it

  // clear() and build() members. Important rule that if we erase items

  // them from the container, on the other way on item addition we should

  // first extend the container and just after that signal the alteration.

  //

  // The alteration can be observed with a class inherited from the

  // overriding the virtual functions defined in the base class.  The

  // observer base can be attached to the notifier with the

  // alteration handlers should not call any function which signals

  // an other alteration in the same notifier and should not

  // detach any observer from the notifier.

  //

  // observeres will not be notified and the fulfilled additions will

  //

  // reliable. If we want to carry out the node degree in the graph

  // unreliable functionality. Because the alteration observing signals

  //

  // \param _Container The container which is observed.

  // \param _Item The item type which is obserbved.

    typedef _Container Container;

    typedef _Item Item;

    //

    // exception is allowed to throw. The exception immediatly

    // detaches the current observer from the notifier. Because the

    // it can be used to invalidate the observer.

    struct ImmediateDetach {};

    //

    // The observer interface contains some pure virtual functions

    // to override. The add() and erase() functions are

    //

    // The build() and clear() members are to notify the observer

    // about the container is built from an empty container or

  //

  // \brief Graph map based on the array storage.

  //

  //

  // the Value type of the map.

  template <typename _Graph, typename _Item, typename _Value>

  class ArrayMap

    : public ItemSetTraits<_Graph, _Item>::ItemNotifier::ObserverBase {

  public:

    typedef _Graph Graph;

    typedef _Item Item;

    // The reference map tag.

    typedef True ReferenceMapTag;

    typedef _Item Key;

    // The value type of the map.

    typedef _Value Value;

    // \brief Adds a new key to the map.

    //

    // and it overrides the add() member function of the observer base.

    virtual void add(const Key& key) {

      Notifier* nf = Parent::notifier();

    // \brief Adds more new keys to the map.

    //

    // and it overrides the add() member function of the observer base.

    virtual void add(const std::vector<Key>& keys) {

      Notifier* nf = Parent::notifier();

    // \brief Erase a key from the map.

    //

    // and it overrides the erase() member function of the observer base.

    virtual void erase(const Key& key) {

      int id = Parent::notifier()->id(key);

    // \brief Erase more keys from the map.

    //

    // and it overrides the erase() member function of the observer base.

    virtual void erase(const std::vector<Key>& keys) {

      for (int i = 0; i < int(keys.size()); ++i) {

      }

    }

    //

    // and it overrides the build() member function of the observer base.

    virtual void build() {

      Notifier* nf = Parent::notifier();

    // \brief Clear the map.

    //

    // and it overrides the clear() member function of the observer base.

    virtual void clear() {

      Notifier* nf = Parent::notifier();

//\ingroup digraphbits

//\file

namespace lemon {

  // \ingroup digraphbits

//\ingroup graphbits

//\file

namespace lemon {

  // \ingroup graphbits

  //

  template <typename Base>

  class DigraphExtender : public Base {

  public:

  //

  // \brief Graph map based on the std::vector storage.

  //

  //

  // \tparam _Graph The graph this map is attached to.

  // \tparam _Item The item type of the graph items.

    // \brief Adds a new key to the map.

    //

    // and it overrides the add() member function of the observer base.

    virtual void add(const Key& key) {

      int id = Parent::notifier()->id(key);

    // \brief Adds more new keys to the map.

    //

    // and it overrides the add() member function of the observer base.

    virtual void add(const std::vector<Key>& keys) {

      int max = container.size() - 1;

    // \brief Erase a key from the map.

    //

    // and it overrides the erase() member function of the observer base.

    virtual void erase(const Key& key) {

      container[Parent::notifier()->id(key)] = Value();

    // \brief Erase more keys from the map.

    //

    // and it overrides the erase() member function of the observer base.

    virtual void erase(const std::vector<Key>& keys) {

      for (int i = 0; i < int(keys.size()); ++i) {

      }

    }

    //

    // and it overrides the build() member function of the observer base.

    virtual void build() {

      int size = Parent::notifier()->maxId() + 1;

    // \brief Clear the map.

    //

    // and it overrides the clear() member function of the observer base.

    virtual void clear() {

      container.clear();