gravatar
kpeter (Peter Kovacs)
kpeter@inf.elte.hu
Add creator functions for IdMap and RangeIdMap (#302)
0 1 0
default
1 file changed with 17 insertions and 0 deletions:
↑ Collapse diff ↑
Ignore white space 12 line context
... ...
@@ -1896,12 +1896,20 @@
1896 1896
    /// \brief Gives back the inverse of the map.
1897 1897
    ///
1898 1898
    /// Gives back the inverse of the IdMap.
1899 1899
    InverseMap inverse() const { return InverseMap(*_graph);}
1900 1900
  };
1901 1901

	
1902
  /// \brief Returns an \c IdMap class.
1903
  ///
1904
  /// This function just returns an \c IdMap class.
1905
  /// \relates IdMap
1906
  template <typename K, typename GR>
1907
  inline IdMap<GR, K> idMap(const GR& graph) {
1908
    return IdMap<GR, K>(graph);
1909
  }
1902 1910

	
1903 1911
  /// \brief General cross reference graph map type.
1904 1912

	
1905 1913
  /// This class provides simple invertable graph maps.
1906 1914
  /// It wraps a standard graph map (\c NodeMap, \c ArcMap or \c EdgeMap)
1907 1915
  /// and if a key is set to a new value, then stores it in the inverse map.
... ...
@@ -2359,12 +2367,21 @@
2359 2367
    /// Gives back the inverse of the RangeIdMap.
2360 2368
    const InverseMap inverse() const {
2361 2369
      return InverseMap(*this);
2362 2370
    }
2363 2371
  };
2364 2372

	
2373
  /// \brief Returns a \c RangeIdMap class.
2374
  ///
2375
  /// This function just returns an \c RangeIdMap class.
2376
  /// \relates RangeIdMap
2377
  template <typename K, typename GR>
2378
  inline RangeIdMap<GR, K> rangeIdMap(const GR& graph) {
2379
    return RangeIdMap<GR, K>(graph);
2380
  }
2381
  
2365 2382
  /// \brief Dynamic iterable \c bool map.
2366 2383
  ///
2367 2384
  /// This class provides a special graph map type which can store a
2368 2385
  /// \c bool value for graph items (\c Node, \c Arc or \c Edge).
2369 2386
  /// For both \c true and \c false values it is possible to iterate on
2370 2387
  /// the keys mapped to the value.
0 comments (0 inline)