| /dports/www/osrm-backend/osrm-backend-5.26.0/include/contractor/ |
| H A D | graph_contractor_adaptors.hpp | 25 for (const auto &input_edge : input_edge_list) in toContractorGraph() local
40 edges.emplace_back(input_edge.source, in toContractorGraph()
41 input_edge.target, in toContractorGraph()
43 input_edge.data.duration, in toContractorGraph()
44 input_edge.data.distance, in toContractorGraph()
46 input_edge.data.turn_id, in toContractorGraph()
51 edges.emplace_back(input_edge.target, in toContractorGraph()
52 input_edge.source, in toContractorGraph()
54 input_edge.data.duration, in toContractorGraph()
55 input_edge.data.distance, in toContractorGraph()
[all …]
|
| /dports/www/osrm-backend/osrm-backend-5.26.0/include/util/ |
| H A D | graph_utils.hpp | 74 for (const auto &input_edge : input_edge_list) in directedEdgesFromCompressed() local
77 BOOST_ASSERT(input_edge.flags.forward); in directedEdgesFromCompressed()
79 edge.source = input_edge.source; in directedEdgesFromCompressed()
80 edge.target = input_edge.target; in directedEdgesFromCompressed()
85 copy_data(edge, input_edge); in directedEdgesFromCompressed()
89 if (!input_edge.flags.is_split) in directedEdgesFromCompressed()
92 edge.data.reversed = !input_edge.flags.backward; in directedEdgesFromCompressed()
|
| H A D | node_based_graph.hpp | 84 const extractor::NodeBasedEdge &input_edge) { in NodeBasedDynamicGraphFromEdges() argument
85 output_edge.data.weight = input_edge.weight; in NodeBasedDynamicGraphFromEdges()
86 output_edge.data.duration = input_edge.duration; in NodeBasedDynamicGraphFromEdges()
87 output_edge.data.distance = input_edge.distance; in NodeBasedDynamicGraphFromEdges()
88 output_edge.data.flags = input_edge.flags; in NodeBasedDynamicGraphFromEdges()
89 output_edge.data.annotation_data = input_edge.annotation_data; in NodeBasedDynamicGraphFromEdges()
|
| /dports/www/osrm-backend/osrm-backend-5.26.0/src/tools/ |
| H A D | components.cpp | 50 for (const auto &input_edge : edge_list) in loadGraph() local
52 if (input_edge.source == input_edge.target) in loadGraph()
57 if (input_edge.flags.forward) in loadGraph()
59 graph_edge_list.emplace_back(input_edge.source, input_edge.target); in loadGraph()
62 if (input_edge.flags.backward) in loadGraph()
64 graph_edge_list.emplace_back(input_edge.target, input_edge.source); in loadGraph()
|
| /dports/math/vtk8/VTK-8.2.0/Infovis/Core/ |
| H A D | vtkCollapseGraph.cxx | 63 …for(EdgeListT::const_iterator input_edge = edge_list.begin(); input_edge != edge_list.end(); ++inp… in BuildGraph() local
65 …dgeType output_edge = output_graph->AddEdge(vertex_map[input_edge->Source], vertex_map[input_edge-… in BuildGraph()
66 output_edge_data->CopyData(input_edge_data, input_edge->Id, output_edge.Id); in BuildGraph()
|
| /dports/math/vtk9/VTK-9.1.0/Infovis/Core/ |
| H A D | vtkCollapseGraph.cxx | 64 for (EdgeListT::const_iterator input_edge = edge_list.begin(); input_edge != edge_list.end(); in BuildGraph() local
65 ++input_edge) in BuildGraph()
68 output_graph->AddEdge(vertex_map[input_edge->Source], vertex_map[input_edge->Target]); in BuildGraph()
69 output_edge_data->CopyData(input_edge_data, input_edge->Id, output_edge.Id); in BuildGraph()
|
| /dports/math/vtk6/VTK-6.2.0/Infovis/Core/ |
| H A D | vtkCollapseGraph.cxx | 64 …for(EdgeListT::const_iterator input_edge = edge_list.begin(); input_edge != edge_list.end(); ++inp… in BuildGraph() local
66 …dgeType output_edge = output_graph->AddEdge(vertex_map[input_edge->Source], vertex_map[input_edge-… in BuildGraph()
67 output_edge_data->CopyData(input_edge_data, input_edge->Id, output_edge.Id); in BuildGraph()
|
| /dports/multimedia/v4l_compat/linux-5.13-rc2/include/drm/i2c/ |
| H A D | sil164.h | 42 } input_edge; member
|
| /dports/misc/rump/buildrump.sh-b914579/src/sys/external/bsd/drm2/dist/include/drm/i2c/ |
| H A D | sil164.h | 42 } input_edge; member
|
| /dports/multimedia/v4l-utils/linux-5.13-rc2/include/drm/i2c/ |
| H A D | sil164.h | 42 } input_edge; member
|
| /dports/multimedia/libv4l/linux-5.13-rc2/include/drm/i2c/ |
| H A D | sil164.h | 42 } input_edge; member
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/services/resource_coordinator/memory_instrumentation/ |
| H A D | global_dump_graph_converter.cc | 122 for (const auto& input_edge : input.edges()) { in CopyAndConvertEdges() local
123 CopyAndConvertEdge(input_edge, output, pointer_map); in CopyAndConvertEdges()
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/ |
| H A D | Rotational_sweep_visibility_2.h | 787 void input_edge(const Halfedge_const_handle e, in input_edge() function
853 input_edge(curr, good_edges); in input_face()
861 input_edge(curr, good_edges); in input_face()
|
| /dports/multimedia/libv4l/linux-5.13-rc2/drivers/gpu/drm/i2c/ |
| H A D | sil164_drv.c | 178 (config->input_edge ? SIL164_CONTROL0_EDGE_RISING : 0) | in sil164_init_state()
|
| /dports/misc/rump/buildrump.sh-b914579/src/sys/external/bsd/drm2/dist/drm/i2c/ |
| H A D | sil164_drv.c | 177 (config->input_edge ? SIL164_CONTROL0_EDGE_RISING : 0) | in sil164_init_state()
|
| /dports/multimedia/v4l-utils/linux-5.13-rc2/drivers/gpu/drm/i2c/ |
| H A D | sil164_drv.c | 178 (config->input_edge ? SIL164_CONTROL0_EDGE_RISING : 0) | in sil164_init_state()
|
| /dports/multimedia/v4l_compat/linux-5.13-rc2/drivers/gpu/drm/i2c/ |
| H A D | sil164_drv.c | 178 (config->input_edge ? SIL164_CONTROL0_EDGE_RISING : 0) | in sil164_init_state()
|
| /dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/ |
| H A D | lto-cgraph.c | 1212 input_edge (struct lto_input_block *ib, vec<symtab_node *> nodes, in input_edge() function
1293 input_edge (ib, nodes, false); in input_cgraph_1()
1295 input_edge (ib, nodes, true); in input_cgraph_1()
|
| /dports/lang/gcc48/gcc-4.8.5/gcc/ |
| H A D | lto-cgraph.c | 1087 input_edge (struct lto_input_block *ib, vec<symtab_node> nodes, in input_edge() function
1164 input_edge (ib, nodes, false); in input_cgraph_1()
1166 input_edge (ib, nodes, true); in input_cgraph_1()
|
| /dports/devel/mingw32-gcc/gcc-4.8.1/gcc/ |
| H A D | lto-cgraph.c | 1087 input_edge (struct lto_input_block *ib, vec<symtab_node> nodes, in input_edge() function
1164 input_edge (ib, nodes, false); in input_cgraph_1()
1166 input_edge (ib, nodes, true); in input_cgraph_1()
|
| /dports/lang/gcc9/gcc-9.4.0/gcc/ |
| H A D | lto-cgraph.c | 1431 input_edge (struct lto_input_block *ib, vec<symtab_node *> nodes, in input_edge() function
1511 input_edge (ib, nodes, false); in input_cgraph_1()
1513 input_edge (ib, nodes, true); in input_cgraph_1()
|
| /dports/lang/gcc9-aux/gcc-9.1.0/gcc/ |
| H A D | lto-cgraph.c | 1431 input_edge (struct lto_input_block *ib, vec<symtab_node *> nodes, in input_edge() function
1511 input_edge (ib, nodes, false); in input_cgraph_1()
1513 input_edge (ib, nodes, true); in input_cgraph_1()
|
| /dports/lang/gcc9-devel/gcc-9-20211007/gcc/ |
| H A D | lto-cgraph.c | 1431 input_edge (struct lto_input_block *ib, vec<symtab_node *> nodes, in input_edge() function
1511 input_edge (ib, nodes, false); in input_cgraph_1()
1513 input_edge (ib, nodes, true); in input_cgraph_1()
|
| /dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/ |
| H A D | lto-cgraph.c | 1465 input_edge (struct lto_input_block *ib, vec<symtab_node *> nodes, in input_edge() function
1545 input_edge (ib, nodes, false); in input_cgraph_1()
1547 input_edge (ib, nodes, true); in input_cgraph_1()
|
| /dports/lang/gcc6-aux/gcc-6-20180516/gcc/ |
| H A D | lto-cgraph.c | 1455 input_edge (struct lto_input_block *ib, vec<symtab_node *> nodes, in input_edge() function
1537 input_edge (ib, nodes, false); in input_cgraph_1()
1539 input_edge (ib, nodes, true); in input_cgraph_1()
|