Home
last modified time | relevance | path

Searched refs:m_forward (Results 1 – 6 of 6) sorted by relevance

/third_party/boost/boost/graph/
Dcompressed_sparse_row_graph.hpp306 : inherited_vertex_properties(numverts), m_forward(numverts) in compressed_sparse_row_graph()
318 m_forward.assign_unsorted_multi_pass_edges(edge_begin, edge_end, in compressed_sparse_row_graph()
329 : inherited_vertex_properties(numverts), m_forward(), m_property(prop) in compressed_sparse_row_graph()
331 m_forward.assign_unsorted_multi_pass_edges(edge_begin, edge_end, in compressed_sparse_row_graph()
345 : inherited_vertex_properties(numlocalverts), m_forward(), m_property(prop) in compressed_sparse_row_graph()
347 m_forward.assign_unsorted_multi_pass_edges( in compressed_sparse_row_graph()
360 : inherited_vertex_properties(numlocalverts), m_forward(), m_property(prop) in compressed_sparse_row_graph()
362 m_forward.assign_unsorted_multi_pass_edges(edge_begin, edge_end, in compressed_sparse_row_graph()
374 m_forward.assign_from_sorted_edges(edge_begin, edge_end, in compressed_sparse_row_graph()
388 m_forward.assign_from_sorted_edges(edge_begin, edge_end, ep_iter, in compressed_sparse_row_graph()
[all …]
/third_party/boost/libs/graph/test/
Dcsr_graph_test.cpp152 check_consistency_one(g.m_forward); in check_consistency_dispatch()
158 g.m_forward.m_rowstart.size() == g.m_backward.m_rowstart.size()); in assert_bidir_equal_in_both_dirs()
159 BOOST_TEST(g.m_forward.m_column.size() == g.m_backward.m_column.size()); in assert_bidir_equal_in_both_dirs()
164 for (Vertex i = 0; i < g.m_forward.m_rowstart.size() - 1; ++i) in assert_bidir_equal_in_both_dirs()
166 for (EdgeIndex j = g.m_forward.m_rowstart[i]; in assert_bidir_equal_in_both_dirs()
167 j < g.m_forward.m_rowstart[i + 1]; ++j) in assert_bidir_equal_in_both_dirs()
170 boost::make_tuple(j, i, g.m_forward.m_column[j])); in assert_bidir_equal_in_both_dirs()
191 check_consistency_one(g.m_forward); in check_consistency_dispatch()
/third_party/boost/boost/graph/distributed/
Dcompressed_sparse_row_graph.hpp521 edges_size_type u_row_start = g.base().m_forward.m_rowstart[u_local]; in out_edges()
522 edges_size_type next_row_start = g.base().m_forward.m_rowstart[u_local + 1]; in out_edges()
653 end_of_this_vertex = graph->base().m_forward.m_rowstart[local_src + 1]; in operator ++()
675 return g.base().m_forward.m_column.size(); in num_edges()
686 if (g.base().m_forward.m_rowstart.size() == 1 || in edges()
687 g.base().m_forward.m_column.empty()) { in edges()
692 while (g.base().m_forward.m_rowstart[src + 1] == 0) ++src; in edges()
693 return std::make_pair(ei(g, edgedesc(src, 0), g.base().m_forward.m_rowstart[src + 1]), in edges()
694 ei(g, edgedesc(num_vertices(g), g.base().m_forward.m_column.size()), 0)); in edges()
1412 EdgeIndex idx_begin = adjacencies.first - g.base().m_forward.m_column.begin(); in edge_range()
[all …]
/third_party/vk-gl-cts/framework/common/
DtcuAstcUtil.cpp264 , m_forward (forward) in BitAccessStream()
282 return m_forward ? m_src.getBits(m_startNdxInSrc + low, m_startNdxInSrc + high) in getNext()
290 const bool m_forward; member in tcu::astc::__anon24c6b6c60111::BitAccessStream
1700 , m_forward (forward) in BitAssignAccessStream()
1721 return m_forward ? m_dst.setBits(m_startNdxInSrc + low, m_startNdxInSrc + high, actualBits) in setNext()
1729 const bool m_forward; member in tcu::astc::__anon24c6b6c60111::BitAssignAccessStream
/third_party/boost/boost/msm/back/
Dstate_machine.hpp339 …orwardHelper< ::boost::is_convertible<ForwardEvent,Event>::value>::helper(incomingEvent,m_forward); in forward_event()
343 m_forward = fct; in set_forward_fct()
345 exit_pt():m_forward(){} in exit_pt()
348 exit_pt(RHS&):m_forward(){} in exit_pt()
354 forwarding_function m_forward; member
/third_party/boost/boost/graph/detail/
Dcompressed_sparse_row_struct.hpp557 : rowstart_array(&graph.m_forward.m_rowstart[0]) in csr_edge_iterator()