@@ -31,12 +31,12 @@ Function: add_node
3131
3232\*******************************************************************/
3333
34- static unsigned add_node (
34+ static std:: size_t add_node (
3535 const std::string &name,
36- std::map<std::string, unsigned > &name_to_node,
36+ std::map<std::string, std:: size_t > &name_to_node,
3737 graphmlt &graph)
3838{
39- std::pair<std::map<std::string, unsigned >::iterator, bool > entry=
39+ std::pair<std::map<std::string, std:: size_t >::iterator, bool > entry=
4040 name_to_node.insert (std::make_pair (name, 0 ));
4141 if (entry.second )
4242 entry.first ->second =graph.add_node ();
@@ -58,7 +58,7 @@ Function: build_graph_rec
5858
5959static bool build_graph_rec (
6060 const xmlt &xml,
61- std::map<std::string, unsigned > &name_to_node,
61+ std::map<std::string, std:: size_t > &name_to_node,
6262 std::map<std::string, std::map<std::string, std::string> > &defaults,
6363 graphmlt &dest,
6464 std::string &entrynode)
@@ -67,7 +67,7 @@ static bool build_graph_rec(
6767 {
6868 const std::string node_name=xml.get_attribute (" id" );
6969
70- const unsigned n=add_node (node_name, name_to_node, dest);
70+ const std:: size_t n=add_node (node_name, name_to_node, dest);
7171
7272 graphmlt::nodet &node=dest[n];
7373 node.node_name =node_name;
@@ -184,7 +184,7 @@ static bool build_graph(
184184{
185185 assert (dest.size ()==0 );
186186
187- std::map<std::string, unsigned > name_to_node;
187+ std::map<std::string, std:: size_t > name_to_node;
188188 std::map<std::string, std::map<std::string, std::string> > defaults;
189189 std::string entrynode;
190190
@@ -196,15 +196,15 @@ static bool build_graph(
196196 dest,
197197 entrynode);
198198
199- for (unsigned i=0 ; !err && i<dest.size (); ++i)
199+ for (std:: size_t i=0 ; !err && i<dest.size (); ++i)
200200 {
201201 const graphmlt::nodet &n=dest[i];
202202
203203 assert (!n.node_name .empty ());
204204 }
205205
206206 assert (!entrynode.empty ());
207- std::map<std::string, unsigned >::const_iterator it=
207+ std::map<std::string, std:: size_t >::const_iterator it=
208208 name_to_node.find (entrynode);
209209 assert (it!=name_to_node.end ());
210210 entry=it->second ;
0 commit comments