@@ -31,12 +31,12 @@ Function: add_node
31
31
32
32
\*******************************************************************/
33
33
34
- static unsigned add_node (
34
+ static std:: size_t add_node (
35
35
const std::string &name,
36
- std::map<std::string, unsigned > &name_to_node,
36
+ std::map<std::string, std:: size_t > &name_to_node,
37
37
graphmlt &graph)
38
38
{
39
- std::pair<std::map<std::string, unsigned >::iterator, bool > entry=
39
+ std::pair<std::map<std::string, std:: size_t >::iterator, bool > entry=
40
40
name_to_node.insert (std::make_pair (name, 0 ));
41
41
if (entry.second )
42
42
entry.first ->second =graph.add_node ();
@@ -58,7 +58,7 @@ Function: build_graph_rec
58
58
59
59
static bool build_graph_rec (
60
60
const xmlt &xml,
61
- std::map<std::string, unsigned > &name_to_node,
61
+ std::map<std::string, std:: size_t > &name_to_node,
62
62
std::map<std::string, std::map<std::string, std::string> > &defaults,
63
63
graphmlt &dest,
64
64
std::string &entrynode)
@@ -67,7 +67,7 @@ static bool build_graph_rec(
67
67
{
68
68
const std::string node_name=xml.get_attribute (" id" );
69
69
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);
71
71
72
72
graphmlt::nodet &node=dest[n];
73
73
node.node_name =node_name;
@@ -184,7 +184,7 @@ static bool build_graph(
184
184
{
185
185
assert (dest.size ()==0 );
186
186
187
- std::map<std::string, unsigned > name_to_node;
187
+ std::map<std::string, std:: size_t > name_to_node;
188
188
std::map<std::string, std::map<std::string, std::string> > defaults;
189
189
std::string entrynode;
190
190
@@ -196,15 +196,15 @@ static bool build_graph(
196
196
dest,
197
197
entrynode);
198
198
199
- for (unsigned i=0 ; !err && i<dest.size (); ++i)
199
+ for (std:: size_t i=0 ; !err && i<dest.size (); ++i)
200
200
{
201
201
const graphmlt::nodet &n=dest[i];
202
202
203
203
assert (!n.node_name .empty ());
204
204
}
205
205
206
206
assert (!entrynode.empty ());
207
- std::map<std::string, unsigned >::const_iterator it=
207
+ std::map<std::string, std:: size_t >::const_iterator it=
208
208
name_to_node.find (entrynode);
209
209
assert (it!=name_to_node.end ());
210
210
entry=it->second ;
0 commit comments