| /third_party/boost/boost/graph/detail/ |
| D | compressed_sparse_row_struct.hpp | 55 template < typename Vertex, typename EdgeIndex > class csr_edge_descriptor;
58 template < typename Vertex, typename EdgeIndex > struct csr_edge_index_map
60 typedef EdgeIndex value_type;
61 typedef EdgeIndex reference;
62 typedef csr_edge_descriptor< Vertex, EdgeIndex > key_type;
66 template < typename Vertex, typename EdgeIndex >
67 inline EdgeIndex get(const csr_edge_index_map< Vertex, EdgeIndex >&, in get() argument
68 const csr_edge_descriptor< Vertex, EdgeIndex >& key) in get()
79 typename EdgeIndex = Vertex >
82 compressed_sparse_row_structure< EdgeProperty, Vertex, EdgeIndex >,
[all …]
|
| D | histogram_sort.hpp | 60 EdgeIndex; in count_starts() typedef
74 EdgeIndex start_of_this_row = 0; in count_starts()
97 EdgeIndex; in histogram_sort() typedef
102 std::vector< EdgeIndex > current_insert_positions( in histogram_sort()
111 EdgeIndex insert_pos = current_insert_positions[source]; in histogram_sort()
134 EdgeIndex; in histogram_sort() typedef
139 std::vector< EdgeIndex > current_insert_positions( in histogram_sort()
149 EdgeIndex insert_pos = current_insert_positions[source]; in histogram_sort()
167 EdgeIndex; in histogram_sort_inplace() typedef
170 std::vector< EdgeIndex > insert_positions( in histogram_sort_inplace()
[all …]
|
| /third_party/boost/boost/graph/ |
| D | compressed_sparse_row_graph.hpp | 143 typename GraphProperty, typename Vertex, typename EdgeIndex
146 GraphProperty, Vertex, EdgeIndex >
149 typename Vertex, typename EdgeIndex
152 GraphProperty, Vertex, EdgeIndex >
155 typename Vertex, typename EdgeIndex
158 GraphProperty, Vertex, EdgeIndex >
212 typename EdgeIndex = Vertex >
216 typename GraphProperty, typename Vertex, typename EdgeIndex >
218 GraphProperty, Vertex, EdgeIndex >
240 EdgeIndex >
[all …]
|
| D | grid_graph.hpp | 275 typename EdgeIndex = VertexIndex >
284 typedef grid_graph< Dimensions, VertexIndex, EdgeIndex > type;
288 typedef EdgeIndex edges_size_type;
289 typedef EdgeIndex degree_size_type;
|
| D | graphviz.hpp | 847 typename EdgeIndex >
849 VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > >
853 EdgeProperty, GraphProperty, Vertex, EdgeIndex >
877 bgl_edge_t, GraphProperty, Vertex, EdgeIndex > in finish_building_graph()
|
| /third_party/boost/boost/graph/distributed/ |
| D | compressed_sparse_row_graph.hpp | 80 InEdgeIndex>::type EdgeIndex; typedef in boost::compressed_sparse_row_graph
87 GraphProperty, Vertex, EdgeIndex>
106 typedef EdgeIndex edges_size_type;
622 typedef typename int_t<CHAR_BIT * sizeof(EdgeIndex)>::fast difference_type;
628 EdgeIndex end_of_this_vertex) in edge_iterator()
666 EdgeIndex local_src;
668 EdgeIndex end_of_this_vertex;
1405 typedef typename BOOST_DISTRIB_CSR_GRAPH_TYPE::edges_size_type EdgeIndex; in edge_range() typedef
1412 EdgeIndex idx_begin = adjacencies.first - g.base().m_forward.m_column.begin(); in edge_range()
1413 EdgeIndex idx_end = adjacencies.second - g.base().m_forward.m_column.begin(); in edge_range()
[all …]
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 182 static int EdgeIndex(Edges *edges, int from, int to) { in EdgeIndex() function
252 if (EdgeIndex(&edges, nodes[from], nodes[to]) == -1) { in TEST()
272 ASSERT_EQ(i, EdgeIndex(&edges, from, to)); in TEST()
275 ASSERT_EQ(-1, EdgeIndex(&edges, from, to)); in TEST()
|
| /third_party/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 182 static int EdgeIndex(Edges *edges, int from, int to) { in EdgeIndex() function
252 if (EdgeIndex(&edges, nodes[from], nodes[to]) == -1) { in TEST()
272 ASSERT_EQ(i, EdgeIndex(&edges, from, to)); in TEST()
275 ASSERT_EQ(-1, EdgeIndex(&edges, from, to)); in TEST()
|
| /third_party/boost/libs/graph/test/ |
| D | csr_graph_test.cpp | 161 typedef typename boost::graph_traits< G >::edges_size_type EdgeIndex; in assert_bidir_equal_in_both_dirs() typedef
162 std::vector< boost::tuple< EdgeIndex, Vertex, Vertex > > edges_forward, in assert_bidir_equal_in_both_dirs()
166 for (EdgeIndex j = g.m_forward.m_rowstart[i]; in assert_bidir_equal_in_both_dirs()
175 for (EdgeIndex j = g.m_backward.m_rowstart[i]; in assert_bidir_equal_in_both_dirs()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/subzero/src/ |
| D | IceCfgNode.cpp | 286 CfgNode *CfgNode::splitIncomingEdge(CfgNode *Pred, SizeT EdgeIndex) { in splitIncomingEdge() argument
295 std::to_string(EdgeIndex)); in splitIncomingEdge()
|