texttest -a netgen -d /home/delphi/gcc/sumo/tests -reconnect /home/delphi/gcc/texttesttmp/gcc4_64.30Nov002132.11576 -g
texttest -a netgen -d /home/delphi/gcc/sumo/tests
---------- Differences in output ---------- 4,5c4,5 < Removing self-loops... done. < Removing empty nodes... done. --- > Removing self-loops ... done. > Removing empty nodes ... done. 7,23c7,23 < Moving network to origin... done. < Computing turning directions... done. < Assigning nodes to traffic lights... done. < Sorting nodes' edges... done. < Computing node shapes... done. < Computing edge shapes... done. < Computing node types... done. < Computing priorities... done. < Computing approached edges... done. < Guessing and setting roundabouts... done. < Computing approaching lanes... done. < Dividing of lanes on approached lanes... done. < Processing turnarounds... done. < Rechecking of lane endings... done. < Computing traffic light control information... done. < Computing node logics... done. < Computing traffic light logics... done. --- > Moving network to origin ... done. > Computing turning directions ... done. > Assigning nodes to traffic lights ... done. > Sorting nodes' edges ... done. > Computing node shapes ... done. <truncated after showing first 30 lines>function junction_types explicite_tls grid__one_tls_set ( Last six runs Nov2019 )
---------- Differences in output ---------- 4,5c4,5 < Removing self-loops... done. < Removing empty nodes... done. --- > Removing self-loops ... done. > Removing empty nodes ... done. 7,23c7,23 < Moving network to origin... done. < Computing turning directions... done. < Assigning nodes to traffic lights... done. < Sorting nodes' edges... done. < Computing node shapes... done. < Computing edge shapes... done. < Computing node types... done. < Computing priorities... done. < Computing approached edges... done. < Guessing and setting roundabouts... done. < Computing approaching lanes... done. < Dividing of lanes on approached lanes... done. < Processing turnarounds... done. < Rechecking of lane endings... done. < Computing traffic light control information... done. < Computing node logics... done. < Computing traffic light logics... --- > Moving network to origin ... done. > Computing turning directions ... done. > Assigning nodes to traffic lights ... done. > Sorting nodes' edges ... done. > Computing node shapes ... done. <truncated after showing first 30 lines>
---------- Differences in errors ---------- 1,8c1,8 < Warning: Intersecting left turns at junction 'B1' from lane 'B2B1_0' and lane 'B0B1_0'. (increase junction radius to avoid this) < Warning: Intersecting left turns at junction 'B1' from lane 'C1B1_0' and lane 'A1B1_0'. (increase junction radius to avoid this) < Warning: Intersecting left turns at junction 'B2' from lane 'B3B2_0' and lane 'B1B2_0'. (increase junction radius to avoid this) < Warning: Intersecting left turns at junction 'B2' from lane 'C2B2_0' and lane 'A2B2_0'. (increase junction radius to avoid this) < Warning: Intersecting left turns at junction 'C1' from lane 'C2C1_0' and lane 'C0C1_0'. (increase junction radius to avoid this) < Warning: Intersecting left turns at junction 'C1' from lane 'D1C1_0' and lane 'B1C1_0'. (increase junction radius to avoid this) < Warning: Intersecting left turns at junction 'C2' from lane 'C3C2_0' and lane 'C1C2_0'. (increase junction radius to avoid this) < Warning: Intersecting left turns at junction 'C2' from lane 'D2C2_0' and lane 'B2C2_0'. (increase junction radius to avoid this) --- > Warning: Intersecting left turns at junction 'B1' from lane 'B2B1_0' and lane 'B0B1_0' (increase junction radius to avoid this). > Warning: Intersecting left turns at junction 'B1' from lane 'C1B1_0' and lane 'A1B1_0' (increase junction radius to avoid this). > Warning: Intersecting left turns at junction 'B2' from lane 'B3B2_0' and lane 'B1B2_0' (increase junction radius to avoid this). > Warning: Intersecting left turns at junction 'B2' from lane 'C2B2_0' and lane 'A2B2_0' (increase junction radius to avoid this). > Warning: Intersecting left turns at junction 'C1' from lane 'C2C1_0' and lane 'C0C1_0' (increase junction radius to avoid this). > Warning: Intersecting left turns at junction 'C1' from lane 'D1C1_0' and lane 'B1C1_0' (increase junction radius to avoid this). > Warning: Intersecting left turns at junction 'C2' from lane 'C3C2_0' and lane 'C1C2_0' (increase junction radius to avoid this). > Warning: Intersecting left turns at junction 'C2' from lane 'D2C2_0' and lane 'B2C2_0' (increase junction radius to avoid this).
---------- Differences in log ---------- 4,5c4,5 < Removing self-loops... done. < Removing empty nodes... done. --- > Removing self-loops ... done. > Removing empty nodes ... done. 7,23c7,23 < Moving network to origin... done. < Computing turning directions... done. < Assigning nodes to traffic lights... done. < Sorting nodes' edges... done. < Computing node shapes... done. < Computing edge shapes... done. < Computing node types... done. < Computing priorities... done. < Computing approached edges... done. < Guessing and setting roundabouts... done. < Computing approaching lanes... done. < Dividing of lanes on approached lanes... done. < Processing turnarounds... done. < Rechecking of lane endings... done. < Computing traffic light control information... done. < Computing node logics... done. < Computing traffic light logics... done. --- > Moving network to origin ... done. > Computing turning directions ... done. > Assigning nodes to traffic lights ... done. > Sorting nodes' edges ... done. > Computing node shapes ... done. <truncated after showing first 30 lines> ---------- Differences in output ---------- 4,5c4,5 < Removing self-loops... done. < Removing empty nodes... done. --- > Removing self-loops ... done. > Removing empty nodes ... done. 7,23c7,23 < Moving network to origin... done. < Computing turning directions... done. < Assigning nodes to traffic lights... done. < Sorting nodes' edges... done. < Computing node shapes... done. < Computing edge shapes... done. < Computing node types... done. < Computing priorities... done. < Computing approached edges... done. < Guessing and setting roundabouts... done. < Computing approaching lanes... done. < Dividing of lanes on approached lanes... done. < Processing turnarounds... done. < Rechecking of lane endings... done. < Computing traffic light control information... done. < Computing node logics... done. < Computing traffic light logics... done. --- > Moving network to origin ... done. > Computing turning directions ... done. > Assigning nodes to traffic lights ... done. > Sorting nodes' edges ... done. > Computing node shapes ... done. <truncated after showing first 30 lines>