Changeset 1194:699c7eac2c6d in lemon for lemon/lgf_writer.h
- Timestamp:
- 01/11/12 22:21:07 (12 years ago)
- Branch:
- default
- Phase:
- public
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/lgf_writer.h
r1192 r1194 1630 1630 /// sections can contain different set of maps. 1631 1631 /// 1632 /// The red and blue maps are written to the corresponding1632 /// The red and blue node maps are written to the corresponding 1633 1633 /// sections. The node maps are written to both of these sections 1634 1634 /// with the same map name. … … 1806 1806 } 1807 1807 1808 /// \brief Red map writing rule1809 /// 1810 /// Add a red map writing rule to the writer.1808 /// \brief Red node map writing rule 1809 /// 1810 /// Add a red node map writing rule to the writer. 1811 1811 template <typename Map> 1812 BpGraphWriter& red Map(const std::string& caption, const Map& map) {1812 BpGraphWriter& redNodeMap(const std::string& caption, const Map& map) { 1813 1813 checkConcept<concepts::ReadMap<Node, typename Map::Value>, Map>(); 1814 1814 _writer_bits::MapStorageBase<Node>* storage = … … 1818 1818 } 1819 1819 1820 /// \brief Red map writing rule1821 /// 1822 /// Add a red map writing rule with specialized converter to the1820 /// \brief Red node map writing rule 1821 /// 1822 /// Add a red node map writing rule with specialized converter to the 1823 1823 /// writer. 1824 1824 template <typename Map, typename Converter> 1825 BpGraphWriter& red Map(const std::string& caption, const Map& map,1826 const Converter& converter = Converter()) {1825 BpGraphWriter& redNodeMap(const std::string& caption, const Map& map, 1826 const Converter& converter = Converter()) { 1827 1827 checkConcept<concepts::ReadMap<Node, typename Map::Value>, Map>(); 1828 1828 _writer_bits::MapStorageBase<Node>* storage = … … 1832 1832 } 1833 1833 1834 /// \brief Blue map writing rule1835 /// 1836 /// Add a blue map writing rule to the writer.1834 /// \brief Blue node map writing rule 1835 /// 1836 /// Add a blue node map writing rule to the writer. 1837 1837 template <typename Map> 1838 BpGraphWriter& blue Map(const std::string& caption, const Map& map) {1838 BpGraphWriter& blueNodeMap(const std::string& caption, const Map& map) { 1839 1839 checkConcept<concepts::ReadMap<Node, typename Map::Value>, Map>(); 1840 1840 _writer_bits::MapStorageBase<Node>* storage = … … 1844 1844 } 1845 1845 1846 /// \brief Blue map writing rule1847 /// 1848 /// Add a blue map writing rule with specialized converter to the1846 /// \brief Blue node map writing rule 1847 /// 1848 /// Add a blue node map writing rule with specialized converter to the 1849 1849 /// writer. 1850 1850 template <typename Map, typename Converter> 1851 BpGraphWriter& blue Map(const std::string& caption, const Map& map,1852 const Converter& converter = Converter()) {1851 BpGraphWriter& blueNodeMap(const std::string& caption, const Map& map, 1852 const Converter& converter = Converter()) { 1853 1853 checkConcept<concepts::ReadMap<Node, typename Map::Value>, Map>(); 1854 1854 _writer_bits::MapStorageBase<Node>* storage = … … 2059 2059 2060 2060 std::vector<Node> nodes; 2061 for (Red It n(_graph); n != INVALID; ++n) {2061 for (RedNodeIt n(_graph); n != INVALID; ++n) { 2062 2062 nodes.push_back(n); 2063 2063 } … … 2119 2119 2120 2120 std::vector<Node> nodes; 2121 for (Blue It n(_graph); n != INVALID; ++n) {2121 for (BlueNodeIt n(_graph); n != INVALID; ++n) { 2122 2122 nodes.push_back(n); 2123 2123 }
Note: See TracChangeset
for help on using the changeset viewer.