| /third_party/boost/libs/graph/example/ |
| D | quick-tour.cpp | 17 void print_vertex_name(VertexDescriptor v, VertexNameMap name_map) in print_vertex_name() argument
19 std::cout << get(name_map, v); in print_vertex_name()
24 const Graph& g, TransDelayMap delay_map, VertexNameMap name_map) in print_trans_delay() argument
26 std::cout << "trans-delay(" << get(name_map, source(e, g)) << "," in print_trans_delay()
27 << get(name_map, target(e, g)) << ") = " << get(delay_map, e); in print_trans_delay()
31 void print_vertex_names(const Graph& g, VertexNameMap name_map) in print_vertex_names() argument
38 print_vertex_name(*p.first, name_map); in print_vertex_names()
46 const Graph& g, TransDelayMap trans_delay_map, VertexNameMap name_map) in print_trans_delays() argument
51 print_trans_delay(*first, g, trans_delay_map, name_map); in print_trans_delays()
58 Graph& g, VertexNameMap name_map, TransDelayMap delay_map) in build_router_network() argument
[all …]
|
| D | bfs-name-printer.cpp | 17 Graph& g, VertexNameMap name_map, TransDelayMap delay_map) in build_router_network() argument
21 name_map[a] = 'a'; in build_router_network()
23 name_map[b] = 'b'; in build_router_network()
25 name_map[c] = 'c'; in build_router_network()
27 name_map[d] = 'd'; in build_router_network()
29 name_map[e] = 'e'; in build_router_network()
81 property_map< graph_t, char VP::* >::type name_map = get(&VP::name, g); in main() local
84 build_router_network(g, name_map, delay_map); in main()
88 bfs_name_printer< VertexNameMap > vis(name_map); in main()
|
| D | print-edges.cpp | 18 VertexNamePropertyMap name_map) in read_graph_file() argument
30 put(name_map, u, name); // ** Attach name property to vertex u ** in read_graph_file()
42 std::ostream& out, const Graph& g, VertexNameMap name_map) in print_dependencies() argument
46 out << get(name_map, source(*ei, g)) << " -$>$ " in print_dependencies()
47 << get(name_map, target(*ei, g)) << std::endl; in print_dependencies()
80 property_map< graph_type, vertex_name_t >::type name_map in main() local
82 read_graph_file(file_in, name_in, g, name_map); in main()
|
| D | print-adjacent-vertices.cpp | 18 VertexNamePropertyMap name_map) in read_graph_file() argument
30 put(name_map, u, name); // ** Attach name property to vertex u ** in read_graph_file()
43 VertexNameMap name_map) in output_adjacent_vertices() argument
46 out << get(name_map, u) << " -> { "; in output_adjacent_vertices()
48 out << get(name_map, *vi) << " "; in output_adjacent_vertices()
106 property_map< graph_type, vertex_name_t >::type name_map in main() local
108 read_graph_file(file_in, name_in, g, name_map); in main()
|
| D | print-in-edges.cpp | 18 VertexNamePropertyMap name_map) in read_graph_file() argument
30 put(name_map, u, name); // ** Attach name property to vertex u ** in read_graph_file()
42 typename graph_traits< Graph >::vertex_descriptor v, VertexNameMap name_map) in output_in_edges() argument
46 out << get(name_map, source(*ei, g)) << " -> " in output_in_edges()
47 << get(name_map, target(*ei, g)) << std::endl; in output_in_edges()
106 property_map< graph_type, vertex_name_t >::type name_map in main() local
108 read_graph_file(file_in, name_in, g, name_map); in main()
|
| D | print-out-edges.cpp | 18 VertexNamePropertyMap name_map) in read_graph_file() argument
30 put(name_map, u, name); // ** Attach name property to vertex u ** in read_graph_file()
42 typename graph_traits< Graph >::vertex_descriptor u, VertexNameMap name_map) in output_out_edges() argument
46 out << get(name_map, source(*ei, g)) << " -> " in output_out_edges()
47 << get(name_map, target(*ei, g)) << std::endl; in output_out_edges()
104 property_map< graph_type, vertex_name_t >::type name_map in main() local
106 read_graph_file(file_in, name_in, g, name_map); in main()
|
| D | modify_graph.cpp | 50 typename property_map< MutableGraph, edge_name_t >::type name_map in modify_demo() local
140 name_map[e1] = "I-5"; in modify_demo()
141 name_map[e2] = "Route 66"; in modify_demo()
146 remove_edge_if(name_equals("Route 66", name_map), g); in modify_demo()
150 remove_edge_if(name_equals("I-5", name_map), g); in modify_demo()
161 name_map[e1] = "foo"; in modify_demo()
162 name_map[e2] = "foo"; in modify_demo()
164 remove_out_edge_if(u, name_equals("foo", name_map), g); in modify_demo()
172 name_map[e1] = "bar"; in modify_demo()
173 name_map[e2] = "bar"; in modify_demo()
[all …]
|
| D | edge-function.cpp | 18 VertexNamePropertyMap name_map) in read_graph_file() argument
30 put(name_map, u, name); // ** Attach name property to vertex u ** in read_graph_file()
43 VertexNameMap name_map) in output_adjacent_vertices() argument
46 out << get(name_map, u) << " -> { "; in output_adjacent_vertices()
48 out << get(name_map, *vi) << " "; in output_adjacent_vertices()
108 property_map< graph_type, vertex_name_t >::type name_map in main() local
110 read_graph_file(file_in, name_in, g, name_map); in main()
|
| D | copy-example.cpp | 33 property_map< graph_t, vertex_name_t >::type name_map = get(vertex_name, G); in main() local
37 name_map[*v] = name; in main()
45 print_graph(G, name_map); in main()
51 print_graph(G_copy, name_map); in main()
|
| D | property-map-traits-eg.cpp | 20 property_map< graph_t, vertex_name_t >::type name_map = get(vertex_name, g); in main() local
21 name_map[u] = "Joe"; in main()
22 std::cout << name_map[u] << std::endl; in main()
|
| D | vertex-name-property.cpp | 18 VertexNamePropertyMap name_map) in read_graph_file() argument
30 put(name_map, u, name); // ** Attach name property to vertex u ** in read_graph_file()
70 property_map< graph_type, vertex_name_t >::type name_map in main() local
72 read_graph_file(file_in, name_in, g, name_map); in main()
|
| D | transpose-example.cpp | 33 property_map< graph_t, vertex_name_t >::type name_map = get(vertex_name, G); in main() local
37 name_map[*v] = name; in main()
45 print_graph(G, name_map); in main()
51 print_graph(G_T, name_map); in main()
|
| D | last-mod-time.cpp | 37 VertexNamePropertyMap name_map) in read_graph_file() argument
49 put(name_map, u, name); // ** Attach name property to vertex u ** in read_graph_file()
79 property_map< graph_type, vertex_name_t >::type name_map in main() local
81 read_graph_file(file_in, name_in, g, name_map); in main()
|
| D | filtered-copy-example.cpp | 48 property_map< graph_t, vertex_name_t >::type name_map = get(vertex_name, G); in main() local
52 name_map[*v] = name; in main()
60 print_graph(G, name_map); in main()
|
| D | accum-compile-times.cpp | 79 name_map_t name_map = get(vertex_name, g); in main() local
88 name_in >> name_map[*vi]; in main()
|
| D | parallel-compile-time.cpp | 142 name_map_t name_map = get(vertex_name, g); in main() local
155 name_in >> name_map[*vi]; in main()
|
| /third_party/boost/libs/graph_parallel/test/ |
| D | adjlist_redist_test.cpp | 126 typename property_map<Graph, vertex_name_t>::type name_map in test_redistribution() local
133 put(name_map, v, get(global_index, v)); in test_redistribution()
|
| /third_party/mesa3d/src/intel/dev/ |
| D | intel_device_info.c | 42 } name_map[] = { variable
79 for (unsigned i = 0; i < ARRAY_SIZE(name_map); i++) { in intel_device_name_to_pci_device_id()
80 if (!strcmp(name_map[i].name, name)) in intel_device_name_to_pci_device_id()
81 return name_map[i].pci_id; in intel_device_name_to_pci_device_id()
1566 for (unsigned i = 0; i < ARRAY_SIZE(name_map); i++) in intel_get_device_info_from_fd()
1567 mesa_loge(" %s", name_map[i].name); in intel_get_device_info_from_fd()
|
| /third_party/python/Tools/gdb/ |
| D | libpython.py | 365 name_map = {'bool': PyBoolObjectPtr,
374 if tp_name in name_map:
375 return name_map[tp_name]
|
| /third_party/libdrm/intel/ |
| D | intel_bufmgr_gem.c | 3139 } name_map[] = { in parse_devid_override() local
3153 for (i = 0; i < ARRAY_SIZE(name_map); i++) { in parse_devid_override()
3154 if (!strcmp(name_map[i].name, devid_override)) in parse_devid_override()
3155 return name_map[i].pci_id; in parse_devid_override()
|