LEMON/LEMON-official Changeset - r1087:b96574ff36ec

Repositories » LEMON » LEMON-official

Summary
Changelog
Files
Switch To
- loading...
Options
- Lightweight changelog
- Search
Pull Requests

Changeset - r1087:b96574ff36ec

« 1086:08cbd4

1102:17e36e »
1091:4dd3dc »
1090:c1a959 »
1089:2b47db »

r1087:b96574ff36ec

Sun, 23 Oct 2011 22:49:04

[Not Reviewed]

0 comments (0 inline)

kpeter (Peter Kovacs)
kpeter@inf.elte.hu

Fix VS warnings (#429)

0 1 0

default

1 file changed with 4 insertions and 4 deletions:

test/lgf_test.cc

↑ Collapse diff ↑

test/lgf_test.cc

Show inline comments

@@ -72,98 +72,98 @@
    std::istringstream input(test_lgf);
    digraphReader(d, input).
      node("source", s).
      node("target", t).
      arcMap("label", label).
      run();
    check(countNodes(d) == 2,"There should be 2 nodes");
    check(countArcs(d) == 2,"There should be 2 arcs");
  }
  {
    ListGraph g;
    ListGraph::Node s,t;
    ListGraph::EdgeMap<int> label(g);
    std::istringstream input(test_lgf);
    graphReader(g, input).
      node("source", s).
      node("target", t).
      edgeMap("label", label).
      run();
    check(countNodes(g) == 2,"There should be 2 nodes");
    check(countEdges(g) == 2,"There should be 2 arcs");
  }

  {
    ListDigraph d; 
    std::istringstream input(test_lgf_nomap);
    digraphReader(d, input).
      run();
    check(countNodes(d) == 2,"There should be 2 nodes");
    check(countArcs(d) == 1,"There should be 1 arc");
  }
  {
    ListGraph g;
    std::istringstream input(test_lgf_nomap);
    graphReader(g, input).
      run();
    check(countNodes(g) == 2,"There should be 2 nodes");
    check(countEdges(g) == 1,"There should be 1 edge");
  }

  {
    ListDigraph d; 
    std::istringstream input(test_lgf_bad1);
    bool ok=false;
    try {
      digraphReader(d, input).
        run();
    }
    catch (FormatError& error) 
    catch (FormatError&) 
      {
        ok = true;
      }
    check(ok,"FormatError exception should have occured");
  }
  {
    ListGraph g;
    std::istringstream input(test_lgf_bad1);
    bool ok=false;
    try {
      graphReader(g, input).
        run();
    }
    catch (FormatError& error)
    catch (FormatError&)
      {
        ok = true;
      }
    check(ok,"FormatError exception should have occured");
  }

  {
    ListDigraph d; 
    std::istringstream input(test_lgf_bad2);
    bool ok=false;
    try {
      digraphReader(d, input).
        run();
    }
    catch (FormatError& error)
    catch (FormatError&)
      {
        ok = true;
      }
    check(ok,"FormatError exception should have occured");
  }
  {
    ListGraph g;
    std::istringstream input(test_lgf_bad2);
    bool ok=false;
    try {
      graphReader(g, input).
        run();
    }
    catch (FormatError& error)
    catch (FormatError&)
      {
        ok = true;
      }
    check(ok,"FormatError exception should have occured");
  }
}

0 comments (0 inline)

...	...	@@ -72,98 +72,98 @@
72	72	std::istringstream input(test_lgf);
73	73	digraphReader(d, input).
74	74	node("source", s).
75	75	node("target", t).
76	76	arcMap("label", label).
77	77	run();
78	78	check(countNodes(d) == 2,"There should be 2 nodes");
79	79	check(countArcs(d) == 2,"There should be 2 arcs");
80	80	}
81	81	{
82	82	ListGraph g;
83	83	ListGraph::Node s,t;
84	84	ListGraph::EdgeMap<int> label(g);
85	85	std::istringstream input(test_lgf);
86	86	graphReader(g, input).
87	87	node("source", s).
88	88	node("target", t).
89	89	edgeMap("label", label).
90	90	run();
91	91	check(countNodes(g) == 2,"There should be 2 nodes");
92	92	check(countEdges(g) == 2,"There should be 2 arcs");
93	93	}
94	94
95	95	{
96	96	ListDigraph d;
97	97	std::istringstream input(test_lgf_nomap);
98	98	digraphReader(d, input).
99	99	run();
100	100	check(countNodes(d) == 2,"There should be 2 nodes");
101	101	check(countArcs(d) == 1,"There should be 1 arc");
102	102	}
103	103	{
104	104	ListGraph g;
105	105	std::istringstream input(test_lgf_nomap);
106	106	graphReader(g, input).
107	107	run();
108	108	check(countNodes(g) == 2,"There should be 2 nodes");
109	109	check(countEdges(g) == 1,"There should be 1 edge");
110	110	}
111	111
112	112	{
113	113	ListDigraph d;
114	114	std::istringstream input(test_lgf_bad1);
115	115	bool ok=false;
116	116	try {
117	117	digraphReader(d, input).
118	118	run();
119	119	}
120		catch (FormatError& ~~error~~)
	120	catch (FormatError&)
121	121	{
122	122	ok = true;
123	123	}
124	124	check(ok,"FormatError exception should have occured");
125	125	}
126	126	{
127	127	ListGraph g;
128	128	std::istringstream input(test_lgf_bad1);
129	129	bool ok=false;
130	130	try {
131	131	graphReader(g, input).
132	132	run();
133	133	}
134		catch (FormatError& ~~error~~)
	134	catch (FormatError&)
135	135	{
136	136	ok = true;
137	137	}
138	138	check(ok,"FormatError exception should have occured");
139	139	}
140	140
141	141	{
142	142	ListDigraph d;
143	143	std::istringstream input(test_lgf_bad2);
144	144	bool ok=false;
145	145	try {
146	146	digraphReader(d, input).
147	147	run();
148	148	}
149		catch (FormatError& ~~error~~)
	149	catch (FormatError&)
150	150	{
151	151	ok = true;
152	152	}
153	153	check(ok,"FormatError exception should have occured");
154	154	}
155	155	{
156	156	ListGraph g;
157	157	std::istringstream input(test_lgf_bad2);
158	158	bool ok=false;
159	159	try {
160	160	graphReader(g, input).
161	161	run();
162	162	}
163		catch (FormatError& ~~error~~)
	163	catch (FormatError&)
164	164	{
165	165	ok = true;
166	166	}
167	167	check(ok,"FormatError exception should have occured");
168	168	}
169	169	}

RhodeCode

Login to your account