| /dports/lang/gcc48/gcc-4.8.5/libstdc++-v3/testsuite/ext/pb_ds/example/ |
| H A D | priority_queue_dijkstra.cc | 136 for (size_t neighbor_i = 0; neighbor_i < num_vertices; ++neighbor_i) in main() local
141 const size_t pot_dist = dist + a_a_edge_legnth[node_id][neighbor_i]; in main()
143 if (a_it[neighbor_i] == a_it[0]) in main()
147 if (pot_dist < a_it[neighbor_i]->second) in main()
148 p.modify(a_it[neighbor_i], pq_value(neighbor_i, pot_dist)); in main()
|
| /dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/libstdc++-v3/testsuite/ext/pb_ds/example/ |
| H A D | priority_queue_dijkstra.cc | 136 for (size_t neighbor_i = 0; neighbor_i < num_vertices; ++neighbor_i) in main() local
141 const size_t pot_dist = dist + a_a_edge_legnth[node_id][neighbor_i]; in main()
143 if (a_it[neighbor_i] == a_it[0]) in main()
147 if (pot_dist < a_it[neighbor_i]->second) in main()
148 p.modify(a_it[neighbor_i], pq_value(neighbor_i, pot_dist)); in main()
|
| /dports/devel/arm-none-eabi-gcc/gcc-8.4.0/libstdc++-v3/testsuite/ext/pb_ds/example/ |
| H A D | priority_queue_dijkstra.cc | 136 for (size_t neighbor_i = 0; neighbor_i < num_vertices; ++neighbor_i) in main() local
141 const size_t pot_dist = dist + a_a_edge_legnth[node_id][neighbor_i]; in main()
143 if (a_it[neighbor_i] == a_it[0]) in main()
147 if (pot_dist < a_it[neighbor_i]->second) in main()
148 p.modify(a_it[neighbor_i], pq_value(neighbor_i, pot_dist)); in main()
|
| /dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/libstdc++-v3/testsuite/ext/pb_ds/example/ |
| H A D | priority_queue_dijkstra.cc | 136 for (size_t neighbor_i = 0; neighbor_i < num_vertices; ++neighbor_i) in main() local
141 const size_t pot_dist = dist + a_a_edge_legnth[node_id][neighbor_i]; in main()
143 if (a_it[neighbor_i] == a_it[0]) in main()
147 if (pot_dist < a_it[neighbor_i]->second) in main()
148 p.modify(a_it[neighbor_i], pq_value(neighbor_i, pot_dist)); in main()
|
| /dports/lang/gcc11/gcc-11.2.0/libstdc++-v3/testsuite/ext/pb_ds/example/ |
| H A D | priority_queue_dijkstra.cc | 136 for (size_t neighbor_i = 0; neighbor_i < num_vertices; ++neighbor_i) in main() local
141 const size_t pot_dist = dist + a_a_edge_legnth[node_id][neighbor_i]; in main()
143 if (a_it[neighbor_i] == a_it[0]) in main()
147 if (pot_dist < a_it[neighbor_i]->second) in main()
148 p.modify(a_it[neighbor_i], pq_value(neighbor_i, pot_dist)); in main()
|
| /dports/lang/gcc12-devel/gcc-12-20211205/libstdc++-v3/testsuite/ext/pb_ds/example/ |
| H A D | priority_queue_dijkstra.cc | 136 for (size_t neighbor_i = 0; neighbor_i < num_vertices; ++neighbor_i) in main() local
141 const size_t pot_dist = dist + a_a_edge_legnth[node_id][neighbor_i]; in main()
143 if (a_it[neighbor_i] == a_it[0]) in main()
147 if (pot_dist < a_it[neighbor_i]->second) in main()
148 p.modify(a_it[neighbor_i], pq_value(neighbor_i, pot_dist)); in main()
|
| /dports/lang/gcc10/gcc-10.3.0/libstdc++-v3/testsuite/ext/pb_ds/example/ |
| H A D | priority_queue_dijkstra.cc | 136 for (size_t neighbor_i = 0; neighbor_i < num_vertices; ++neighbor_i) in main() local
141 const size_t pot_dist = dist + a_a_edge_legnth[node_id][neighbor_i]; in main()
143 if (a_it[neighbor_i] == a_it[0]) in main()
147 if (pot_dist < a_it[neighbor_i]->second) in main()
148 p.modify(a_it[neighbor_i], pq_value(neighbor_i, pot_dist)); in main()
|
| /dports/lang/gcc11-devel/gcc-11-20211009/libstdc++-v3/testsuite/ext/pb_ds/example/ |
| H A D | priority_queue_dijkstra.cc | 136 for (size_t neighbor_i = 0; neighbor_i < num_vertices; ++neighbor_i) in main() local
141 const size_t pot_dist = dist + a_a_edge_legnth[node_id][neighbor_i]; in main()
143 if (a_it[neighbor_i] == a_it[0]) in main()
147 if (pot_dist < a_it[neighbor_i]->second) in main()
148 p.modify(a_it[neighbor_i], pq_value(neighbor_i, pot_dist)); in main()
|
| /dports/devel/avr-gcc/gcc-10.2.0/libstdc++-v3/testsuite/ext/pb_ds/example/ |
| H A D | priority_queue_dijkstra.cc | 136 for (size_t neighbor_i = 0; neighbor_i < num_vertices; ++neighbor_i) in main() local
141 const size_t pot_dist = dist + a_a_edge_legnth[node_id][neighbor_i]; in main()
143 if (a_it[neighbor_i] == a_it[0]) in main()
147 if (pot_dist < a_it[neighbor_i]->second) in main()
148 p.modify(a_it[neighbor_i], pq_value(neighbor_i, pot_dist)); in main()
|
| /dports/lang/gnat_util/gcc-6-20180516/libstdc++-v3/testsuite/ext/pb_ds/example/ |
| H A D | priority_queue_dijkstra.cc | 136 for (size_t neighbor_i = 0; neighbor_i < num_vertices; ++neighbor_i) in main() local
141 const size_t pot_dist = dist + a_a_edge_legnth[node_id][neighbor_i]; in main()
143 if (a_it[neighbor_i] == a_it[0]) in main()
147 if (pot_dist < a_it[neighbor_i]->second) in main()
148 p.modify(a_it[neighbor_i], pq_value(neighbor_i, pot_dist)); in main()
|
| /dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/libstdc++-v3/testsuite/ext/pb_ds/example/ |
| H A D | priority_queue_dijkstra.cc | 136 for (size_t neighbor_i = 0; neighbor_i < num_vertices; ++neighbor_i) in main() local
141 const size_t pot_dist = dist + a_a_edge_legnth[node_id][neighbor_i]; in main()
143 if (a_it[neighbor_i] == a_it[0]) in main()
147 if (pot_dist < a_it[neighbor_i]->second) in main()
148 p.modify(a_it[neighbor_i], pq_value(neighbor_i, pot_dist)); in main()
|
| /dports/lang/gcc9-devel/gcc-9-20211007/libstdc++-v3/testsuite/ext/pb_ds/example/ |
| H A D | priority_queue_dijkstra.cc | 136 for (size_t neighbor_i = 0; neighbor_i < num_vertices; ++neighbor_i) in main() local
141 const size_t pot_dist = dist + a_a_edge_legnth[node_id][neighbor_i]; in main()
143 if (a_it[neighbor_i] == a_it[0]) in main()
147 if (pot_dist < a_it[neighbor_i]->second) in main()
148 p.modify(a_it[neighbor_i], pq_value(neighbor_i, pot_dist)); in main()
|
| /dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/libstdc++-v3/testsuite/ext/pb_ds/example/ |
| H A D | priority_queue_dijkstra.cc | 136 for (size_t neighbor_i = 0; neighbor_i < num_vertices; ++neighbor_i) in main() local
141 const size_t pot_dist = dist + a_a_edge_legnth[node_id][neighbor_i]; in main()
143 if (a_it[neighbor_i] == a_it[0]) in main()
147 if (pot_dist < a_it[neighbor_i]->second) in main()
148 p.modify(a_it[neighbor_i], pq_value(neighbor_i, pot_dist)); in main()
|
| /dports/misc/cxx_atomics_pic/gcc-11.2.0/libstdc++-v3/testsuite/ext/pb_ds/example/ |
| H A D | priority_queue_dijkstra.cc | 136 for (size_t neighbor_i = 0; neighbor_i < num_vertices; ++neighbor_i) in main() local
141 const size_t pot_dist = dist + a_a_edge_legnth[node_id][neighbor_i]; in main()
143 if (a_it[neighbor_i] == a_it[0]) in main()
147 if (pot_dist < a_it[neighbor_i]->second) in main()
148 p.modify(a_it[neighbor_i], pq_value(neighbor_i, pot_dist)); in main()
|
| /dports/lang/gcc6-aux/gcc-6-20180516/libstdc++-v3/testsuite/ext/pb_ds/example/ |
| H A D | priority_queue_dijkstra.cc | 136 for (size_t neighbor_i = 0; neighbor_i < num_vertices; ++neighbor_i) in main() local
141 const size_t pot_dist = dist + a_a_edge_legnth[node_id][neighbor_i]; in main()
143 if (a_it[neighbor_i] == a_it[0]) in main()
147 if (pot_dist < a_it[neighbor_i]->second) in main()
148 p.modify(a_it[neighbor_i], pq_value(neighbor_i, pot_dist)); in main()
|
| /dports/devel/riscv64-gcc/gcc-8.3.0/libstdc++-v3/testsuite/ext/pb_ds/example/ |
| H A D | priority_queue_dijkstra.cc | 136 for (size_t neighbor_i = 0; neighbor_i < num_vertices; ++neighbor_i) in main() local
141 const size_t pot_dist = dist + a_a_edge_legnth[node_id][neighbor_i]; in main()
143 if (a_it[neighbor_i] == a_it[0]) in main()
147 if (pot_dist < a_it[neighbor_i]->second) in main()
148 p.modify(a_it[neighbor_i], pq_value(neighbor_i, pot_dist)); in main()
|
| /dports/lang/gcc10-devel/gcc-10-20211008/libstdc++-v3/testsuite/ext/pb_ds/example/ |
| H A D | priority_queue_dijkstra.cc | 136 for (size_t neighbor_i = 0; neighbor_i < num_vertices; ++neighbor_i) in main() local
141 const size_t pot_dist = dist + a_a_edge_legnth[node_id][neighbor_i]; in main()
143 if (a_it[neighbor_i] == a_it[0]) in main()
147 if (pot_dist < a_it[neighbor_i]->second) in main()
148 p.modify(a_it[neighbor_i], pq_value(neighbor_i, pot_dist)); in main()
|
| /dports/lang/gcc8/gcc-8.5.0/libstdc++-v3/testsuite/ext/pb_ds/example/ |
| H A D | priority_queue_dijkstra.cc | 136 for (size_t neighbor_i = 0; neighbor_i < num_vertices; ++neighbor_i) in main() local
141 const size_t pot_dist = dist + a_a_edge_legnth[node_id][neighbor_i]; in main()
143 if (a_it[neighbor_i] == a_it[0]) in main()
147 if (pot_dist < a_it[neighbor_i]->second) in main()
148 p.modify(a_it[neighbor_i], pq_value(neighbor_i, pot_dist)); in main()
|
| /dports/lang/gcc9/gcc-9.4.0/libstdc++-v3/testsuite/ext/pb_ds/example/ |
| H A D | priority_queue_dijkstra.cc | 136 for (size_t neighbor_i = 0; neighbor_i < num_vertices; ++neighbor_i) in main() local
141 const size_t pot_dist = dist + a_a_edge_legnth[node_id][neighbor_i]; in main()
143 if (a_it[neighbor_i] == a_it[0]) in main()
147 if (pot_dist < a_it[neighbor_i]->second) in main()
148 p.modify(a_it[neighbor_i], pq_value(neighbor_i, pot_dist)); in main()
|
| /dports/lang/gcc9-aux/gcc-9.1.0/libstdc++-v3/testsuite/ext/pb_ds/example/ |
| H A D | priority_queue_dijkstra.cc | 136 for (size_t neighbor_i = 0; neighbor_i < num_vertices; ++neighbor_i) in main() local
141 const size_t pot_dist = dist + a_a_edge_legnth[node_id][neighbor_i]; in main()
143 if (a_it[neighbor_i] == a_it[0]) in main()
147 if (pot_dist < a_it[neighbor_i]->second) in main()
148 p.modify(a_it[neighbor_i], pq_value(neighbor_i, pot_dist)); in main()
|
| /dports/devel/mingw32-gcc/gcc-4.8.1/libstdc++-v3/testsuite/ext/pb_ds/example/ |
| H A D | priority_queue_dijkstra.cc | 136 for (size_t neighbor_i = 0; neighbor_i < num_vertices; ++neighbor_i) in main() local
141 const size_t pot_dist = dist + a_a_edge_legnth[node_id][neighbor_i]; in main()
143 if (a_it[neighbor_i] == a_it[0]) in main()
147 if (pot_dist < a_it[neighbor_i]->second) in main()
148 p.modify(a_it[neighbor_i], pq_value(neighbor_i, pot_dist)); in main()
|
| /dports/math/libmesh/libmesh-1.6.2/src/geom/ |
| H A D | elem.C | 851 Elem * neighbor_i = this->neighbor_ptr(i); in topological_neighbor() local
852 if (neighbor_i != nullptr) in topological_neighbor()
853 return neighbor_i; in topological_neighbor()
874 if (neighbor_i) in topological_neighbor()
876 neighbor_i = neighbor_i->parent(); in topological_neighbor()
877 return neighbor_i; in topological_neighbor()
894 if (neighbor_i != nullptr) in topological_neighbor()
895 return neighbor_i; in topological_neighbor()
912 if (neighbor_i) in topological_neighbor()
914 neighbor_i = neighbor_i->parent(); in topological_neighbor()
[all …]
|
| /dports/science/berkeleygw/BGW-2.0.0/Common/qhull/ |
| H A D | merge.c | 491 int neighbor_i; in qh_checkzero() local
513 neighbor_i= 0; in qh_checkzero()
516 if (!neighbor_i && !testall) { in qh_checkzero()
518 neighbor_i++; in qh_checkzero()
521 vertex= SETelemt_(facet->vertices, neighbor_i++, vertexT); in qh_checkzero()
1368 int neighbor_i, neighbor_n; in qh_makeridges() local
1390 toporient= facet->toporient ^ (neighbor_i & 0x1); in qh_makeridges()
2082 int neighbor_i, neighbor_n; in qh_mergecycle_ridges() local
2137 toporient= same->toporient ^ (neighbor_i & 0x1); in qh_mergecycle_ridges()
2839 int neighbor_i, neighbor_n; in qh_neighbor_intersections() local
[all …]
|
| /dports/science/afni/afni-AFNI_21.3.16/src/qhulldir/ |
| H A D | merge.c | 491 int neighbor_i; in qh_checkzero() local
513 neighbor_i= 0; in qh_checkzero()
516 if (!neighbor_i && !testall) { in qh_checkzero()
518 neighbor_i++; in qh_checkzero()
521 vertex= SETelemt_(facet->vertices, neighbor_i++, vertexT); in qh_checkzero()
1368 int neighbor_i, neighbor_n; in qh_makeridges() local
1390 toporient= facet->toporient ^ (neighbor_i & 0x1); in qh_makeridges()
2082 int neighbor_i, neighbor_n; in qh_mergecycle_ridges() local
2137 toporient= same->toporient ^ (neighbor_i & 0x1); in qh_mergecycle_ridges()
2839 int neighbor_i, neighbor_n; in qh_neighbor_intersections() local
[all …]
|
| /dports/math/py-matplotlib2/matplotlib-2.2.4/extern/libqhull/ |
| H A D | merge.c | 491 int neighbor_i; in qh_checkzero() local
513 neighbor_i= 0; in qh_checkzero()
516 if (!neighbor_i && !testall) { in qh_checkzero()
518 neighbor_i++; in qh_checkzero()
521 vertex= SETelemt_(facet->vertices, neighbor_i++, vertexT); in qh_checkzero()
1373 int neighbor_i, neighbor_n; in qh_makeridges() local
1395 toporient= facet->toporient ^ (neighbor_i & 0x1); in qh_makeridges()
2087 int neighbor_i, neighbor_n; in qh_mergecycle_ridges() local
2142 toporient= same->toporient ^ (neighbor_i & 0x1); in qh_mergecycle_ridges()
2844 int neighbor_i, neighbor_n; in qh_neighbor_intersections() local
[all …]
|