lemon/maps.h
changeset 386 9d1faab5e0f1
parent 313 64f8f7cc6168
child 440 88ed40ad0d4f
equal deleted inserted replaced
26:ad360c0b2b4d 27:1e995a4b5d3b
  1681       typedef typename _Iterator::container_type::value_type Value;
  1681       typedef typename _Iterator::container_type::value_type Value;
  1682     };
  1682     };
  1683 
  1683 
  1684   }
  1684   }
  1685 
  1685 
       
  1686   /// @}
       
  1687 
       
  1688   /// \addtogroup maps
       
  1689   /// @{
       
  1690 
  1686   /// \brief Writable bool map for logging each \c true assigned element
  1691   /// \brief Writable bool map for logging each \c true assigned element
  1687   ///
  1692   ///
  1688   /// A \ref concepts::WriteMap "writable" bool map for logging
  1693   /// A \ref concepts::WriteMap "writable" bool map for logging
  1689   /// each \c true assigned element, i.e it copies subsequently each
  1694   /// each \c true assigned element, i.e it copies subsequently each
  1690   /// keys set to \c true to the given iterator.
  1695   /// keys set to \c true to the given iterator.
  1773   template<typename Iterator>
  1778   template<typename Iterator>
  1774   inline LoggerBoolMap<Iterator> loggerBoolMap(Iterator it) {
  1779   inline LoggerBoolMap<Iterator> loggerBoolMap(Iterator it) {
  1775     return LoggerBoolMap<Iterator>(it);
  1780     return LoggerBoolMap<Iterator>(it);
  1776   }
  1781   }
  1777 
  1782 
       
  1783   /// @}
       
  1784 
       
  1785   /// \addtogroup graph_maps
       
  1786   /// @{
       
  1787 
  1778   /// Provides an immutable and unique id for each item in the graph.
  1788   /// Provides an immutable and unique id for each item in the graph.
  1779 
  1789 
  1780   /// The IdMap class provides a unique and immutable id for each item of the
  1790   /// The IdMap class provides a unique and immutable id for each item of the
  1781   /// same type (e.g. node) in the graph. This id is <ul><li>\b unique:
  1791   /// same type (e.g. node) in the graph. This id is <ul><li>\b unique:
  1782   /// different items (nodes) get different ids <li>\b immutable: the id of an
  1792   /// different items (nodes) get different ids <li>\b immutable: the id of an
  1879 
  1889 
  1880     /// The key type of InvertableMap (Node, Arc, Edge).
  1890     /// The key type of InvertableMap (Node, Arc, Edge).
  1881     typedef typename Map::Key Key;
  1891     typedef typename Map::Key Key;
  1882     /// The value type of the InvertableMap.
  1892     /// The value type of the InvertableMap.
  1883     typedef typename Map::Value Value;
  1893     typedef typename Map::Value Value;
  1884 
       
  1885 
       
  1886 
  1894 
  1887     /// \brief Constructor.
  1895     /// \brief Constructor.
  1888     ///
  1896     ///
  1889     /// Construct a new InvertableMap for the graph.
  1897     /// Construct a new InvertableMap for the graph.
  1890     ///
  1898     ///
  2046     ///
  2054     ///
  2047     /// It gives back the just readable inverse map.
  2055     /// It gives back the just readable inverse map.
  2048     InverseMap inverse() const {
  2056     InverseMap inverse() const {
  2049       return InverseMap(*this);
  2057       return InverseMap(*this);
  2050     }
  2058     }
  2051 
       
  2052 
       
  2053 
  2059 
  2054   };
  2060   };
  2055 
  2061 
  2056   /// \brief Provides a mutable, continuous and unique descriptor for each
  2062   /// \brief Provides a mutable, continuous and unique descriptor for each
  2057   /// item in the graph.
  2063   /// item in the graph.