@@ -50,20 +50,20 @@ int main() {
5050 auto time2 = elapsed_time_avg<double , std::milli>(10 , find_subgraphs,
5151 graph1, subgraph2);
5252 for (auto & i : vec) {
53- for (size_t j = 0 ; j < i. size (); j++ ) {
54- std::cerr << i[j] << ' ' ;
53+ for (int j : i ) {
54+ std::cerr << j << ' ' ;
5555 }
5656 std::cerr << ' \n ' ;
5757 }
58- std::cerr << " Time for path5:" << time << std::endl ;
58+ std::cerr << " Time for path5:" << time << ' \n ' ;
5959
6060 for (auto & i : vec2) {
61- for (size_t j = 0 ; j < i. size (); j++ ) {
62- std::cerr << i[j] << ' ' ;
61+ for (int j : i ) {
62+ std::cerr << j << ' ' ;
6363 }
6464 std::cerr << ' \n ' ;
6565 }
66- std::cerr << " Time for concat:" << time2 << std::endl ;
66+ std::cerr << " Time for concat:" << time2 << ' \n ' ;
6767 } else if (type == 1 ) {
6868 Graph graph1;
6969 build_graph (graph1, input, input, MODEL_PATH_RESNET_ONNX , options, false );
@@ -84,12 +84,12 @@ int main() {
8484 auto time = elapsed_time_avg<double , std::milli>(10 , find_subgraphs, graph1,
8585 subgraph);
8686 for (auto & i : vec) {
87- for (size_t j = 0 ; j < i. size (); j++ ) {
88- std::cerr << i[j] << ' ' ;
87+ for (int j : i ) {
88+ std::cerr << j << ' ' ;
8989 }
9090 std::cerr << ' \n ' ;
9191 }
92- std::cerr << " Time for path5:" << time << std::endl ;
92+ std::cerr << " Time for path5:" << time << ' \n ' ;
9393 } else if (type == 2 ) {
9494 Graph graph1;
9595 build_graph (graph1, input, input, MODEL_PATH_GOOGLENET_ONNX , options,
@@ -117,12 +117,12 @@ int main() {
117117 auto time = elapsed_time_avg<double , std::milli>(10 , find_subgraphs, graph1,
118118 subgraph);
119119 for (auto & i : vec) {
120- for (size_t j = 0 ; j < i. size (); j++ ) {
121- std::cerr << i[j] << ' ' ;
120+ for (int j : i ) {
121+ std::cerr << j << ' ' ;
122122 }
123123 std::cerr << ' \n ' ;
124124 }
125- std::cerr << " Time for concat:" << time << std::endl ;
125+ std::cerr << " Time for concat:" << time << ' \n ' ;
126126 }
127127 return 0 ;
128128}
0 commit comments