RhodeCode

      explicit ArcMap(const Graph& _g) 

      explicit EdgeMap(const Graph& _g) 

      explicit NodeMap(const Graph& graph)

      explicit ArcMap(const Graph& graph)

      explicit EdgeMap(const Graph& graph)

  /// It wraps a standard graph map (\c NodeMap, \c ArcMap or \c EdgeMap)

  /// and if a key is set to a new value, then stores it in the inverse map.

  /// This type is not reference map, so it cannot be modified with

  /// the subscript operator.

  ///

    typedef std::multimap<V, K> Container;

    /// They are considered with multiplicity, so each value is

    /// traversed for each item it is assigned to.

      typename Container::iterator it;

      for (it = _inv_map.equal_range(oldval).first;

           it != _inv_map.equal_range(oldval).second; ++it) {

        if (it->second == key) {

          _inv_map.erase(it);

          break;

        }

      _inv_map.insert(std::make_pair(val, key));

    /// \brief Gives back an item by its value.

    /// This function gives back an item that is assigned to

    /// the given value or \c INVALID if no such item exists.

    /// If there are more items with the same associated value,

    /// only one of them is returned.

    Key operator()(const Value& val) const {

      typename Container::const_iterator it = _inv_map.find(val);

      typename Container::iterator it;

      for (it = _inv_map.equal_range(val).first;

           it != _inv_map.equal_range(val).second; ++it) {

        if (it->second == key) {

          _inv_map.erase(it);

          break;

        }

        typename Container::iterator it;

        for (it = _inv_map.equal_range(val).first;

             it != _inv_map.equal_range(val).second; ++it) {

          if (it->second == keys[i]) {

            _inv_map.erase(it);

            break;

          }

      /// Subscript operator. It gives back an item

      /// that is assigned to the given value or \c INVALID

      /// if no such item exists.

#include <lemon/list_graph.h>

  // CrossRefMap

  {

    typedef ListDigraph Graph;

    DIGRAPH_TYPEDEFS(Graph);

    checkConcept<ReadWriteMap<Node, int>,

                 CrossRefMap<Graph, Node, int> >();

    Graph gr;

    typedef CrossRefMap<Graph, Node, char> CRMap;

    typedef CRMap::ValueIterator ValueIt;

    CRMap map(gr);

    Node n0 = gr.addNode();

    Node n1 = gr.addNode();

    Node n2 = gr.addNode();

    map.set(n0, 'A');

    map.set(n1, 'B');

    map.set(n2, 'C');

    map.set(n2, 'A');

    map.set(n0, 'C');

    check(map[n0] == 'C' && map[n1] == 'B' && map[n2] == 'A',

          "Wrong CrossRefMap");

    check(map('A') == n2 && map.inverse()['A'] == n2, "Wrong CrossRefMap");

    check(map('B') == n1 && map.inverse()['B'] == n1, "Wrong CrossRefMap");

    check(map('C') == n0 && map.inverse()['C'] == n0, "Wrong CrossRefMap");

    ValueIt it = map.beginValue();

    check(*it++ == 'A' && *it++ == 'B' && *it++ == 'C' &&

          it == map.endValue(), "Wrong value iterator");

  }