| /third_party/boost/boost/numeric/ublas/ |
| D | operation_blocked.hpp | 45 size_type i_end = i_begin + (std::min) (i_size - i_begin, block_size); in block_prod() local
48 vector_range<vector_type> v_range (v, range (i_begin, i_end)); in block_prod()
51 vector<value_type> v_range (i_end - i_begin); in block_prod()
53 v_range.assign (zero_vector<value_type> (i_end - i_begin)); in block_prod()
57 …const matrix_range<expression1_type> e1_range (e1 (), range (i_begin, i_end), range (j_begin, j_en… in block_prod()
63 …const matrix<value_type, row_major> e1_range (project (e1 (), range (i_begin, i_end), range (j_beg… in block_prod()
69 project (v, range (i_begin, i_end)).assign (v_range); in block_prod()
110 size_type i_end = i_begin + (std::min) (i_size - i_begin, block_size); in block_prod() local
112 const vector_range<expression1_type> e1_range (e1 (), range (i_begin, i_end)); in block_prod()
113 …const matrix_range<expression2_type> e2_range (e2 (), range (i_begin, i_end), range (j_begin, j_en… in block_prod()
[all …]
|
| /third_party/pulseaudio/src/pulsecore/resampler/ |
| D | peaks.c | 39 unsigned i, i_end = 0; in peaks_resample() local
55 while (i_end < in_n_frames) { in peaks_resample()
56 i_end = ((uint64_t) (peaks_data->o_counter + 1) * r->i_ss.rate) / r->o_ss.rate; in peaks_resample()
57 i_end = i_end > peaks_data->i_counter ? i_end - peaks_data->i_counter : 0; in peaks_resample()
66 for (; i < i_end && i < in_n_frames; i++) { in peaks_resample()
73 if (i == i_end) { in peaks_resample()
82 for (; i < i_end && i < in_n_frames; i++) in peaks_resample()
90 if (i == i_end) { in peaks_resample()
101 for (; i < i_end && i < in_n_frames; i++) in peaks_resample()
109 if (i == i_end) { in peaks_resample()
|
| /third_party/boost/libs/graph/test/ |
| D | transitive_closure_test.cpp | 42 typename graph_traits< Graph >::out_edge_iterator i, i_end; in num_incident() local
43 for (boost::tie(i, i_end) = out_edges(u, g); i != i_end; ++i) in num_incident()
56 typename graph_traits< Graph >::vertex_iterator i, i_end; in check_transitive_closure() local
57 for (boost::tie(i, i_end) = vertices(g); i != i_end; ++i) in check_transitive_closure()
|
| /third_party/boost/libs/graph/example/ |
| D | parallel-compile-time.cpp | 162 graph_traits< file_dep_graph2 >::vertex_iterator i, i_end; in main() local
167 for (boost::tie(i, i_end) = vertices(g); i != i_end; ++i) in main()
169 for (boost::tie(i, i_end) = vertices(g); i != i_end; ++i) in main()
175 for (boost::tie(i, i_end) = vertices(g); i != i_end; ++i) in main()
|
| D | reachable-loop-tail.cpp | 61 graph_traits< GraphvizDigraph >::vertex_iterator i, i_end; in main() local
62 for (boost::tie(i, i_end) = vertices(g_in); i != i_end; ++i) in main()
|
| D | reachable-loop-head.cpp | 48 graph_traits< GraphvizDigraph >::vertex_iterator i, i_end; in main() local
49 for (boost::tie(i, i_end) = vertices(g); i != i_end; ++i) in main()
|
| /third_party/grpc/test/cpp/qps/ |
| D | driver.cc | 243 for (size_t i = 0, i_end = clients.size(); i < i_end; i++) { in FinishClients() local
261 for (size_t i = 0, i_end = clients.size(); i < i_end; i++) { in ReceiveFinalStatusFromClients() local
285 for (size_t i = 0, i_end = clients.size(); i < i_end; i++) { in ShutdownClients() local
304 for (size_t i = 0, i_end = servers.size(); i < i_end; i++) { in FinishServers() local
321 for (size_t i = 0, i_end = servers.size(); i < i_end; i++) { in ReceiveFinalStatusFromServer() local
340 for (size_t i = 0, i_end = servers.size(); i < i_end; i++) { in ShutdownServers() local
|
| /third_party/boost/boost/graph/ |
| D | transitive_closure.hpp | 220 vertex_iterator i, i_end; in transitive_closure() local
221 for (boost::tie(i, i_end) = vertices(g); i != i_end; ++i) in transitive_closure()
229 typename std::vector< cg_vertex >::const_iterator i, i_end; in transitive_closure() local
230 for (i = CG_vec[s].begin(), i_end = CG_vec[s].end(); i != i_end; ++i) in transitive_closure()
252 vertex_iterator i, i_end; in transitive_closure() local
253 for (boost::tie(i, i_end) = vertices(g); i != i_end; ++i) in transitive_closure()
|
| D | undirected_graph.hpp | 230 out_edge_iterator i, i_end; in remove_edge() local
231 for (boost::tie(i, i_end) = boost::out_edges(u, m_graph); i != i_end; in remove_edge()
260 vertex_iterator i, i_end; in renumber_vertex_indices() local
261 boost::tie(i, i_end) = vertices(m_graph); in renumber_vertex_indices()
262 m_max_vertex_index = renumber_vertex_indices(i, i_end, 0); in renumber_vertex_indices()
|
| D | neighbor_bfs.hpp | 234 i_end; in neighbor_bfs_helper() local
235 for (boost::tie(i, i_end) = vertices(g); i != i_end; ++i) in neighbor_bfs_helper()
|
| D | breadth_first_search.hpp | 130 typename boost::graph_traits< VertexListGraph >::vertex_iterator i, i_end; in breadth_first_search() local
131 for (boost::tie(i, i_end) = vertices(g); i != i_end; ++i) in breadth_first_search()
|
| D | stanford_graph.hpp | 267 boost::graph_traits< sgb_graph_ptr >::out_edge_iterator i, i_end; in out_degree() local
268 boost::tie(i, i_end) = out_edges(u, g); in out_degree()
269 return std::distance(i, i_end); in out_degree()
|
| D | minimum_degree_ordering.hpp | 483 adj_iter i, i_end; in eliminate() local
484 for (boost::tie(i, i_end) = adjacent_vertices(element, G); in eliminate()
485 i != i_end; ++i) in eliminate()
|
| D | directed_graph.hpp | 227 out_edge_iterator i, i_end; in remove_edge() local
228 for (boost::tie(i, i_end) = boost::out_edges(u, m_graph); i != i_end; in remove_edge()
|
| D | subgraph.hpp | 159 typename subgraph< Graph >::children_iterator i, i_end; in subgraph() local
160 boost::tie(i, i_end) = x.children(); in subgraph()
161 for (; i != i_end; ++i) in subgraph()
|
| /third_party/mindspore/mindspore/ccsrc/minddata/mindrecord/io/ |
| D | shard_segment.cc | 169 …uint64_t i_end = std::min(static_cast<int64_t>(total_rows_in_category), (page_no + 1) * n_rows_of_… in ReadAtPageById() local
172 if (idx >= i_end) break; in ReadAtPageById()
189 if (idx >= i_start && idx < i_end) { in ReadAtPageById()
257 …int i_end = std::min(static_cast<int64_t>(total_rows_in_category), (page_no + 1) * n_rows_of_page); in ReadAllAtPageById() local
260 if (idx >= i_end) { in ReadAllAtPageById()
282 if (idx >= i_start && idx < i_end) { in ReadAllAtPageById()
|
| /third_party/boost/libs/iterator/example/ |
| D | transform_iterator_example.cpp | 60 i_end(x + N, boost::bind1st(std::multiplies<int>(), 2)); in main() local
63 while (i != i_end) in main()
|
| /third_party/boost/libs/bimap/example/ |
| D | mighty_bimap.cpp | 96 i_end = trans.end(); in main() local
98 i != i_end ; ++i ) in main()
|
| /third_party/boost/libs/iterator/doc/ |
| D | transform_iterator_eg.rst | 22 i_end(x + N, boost::bind1st(std::multiplies<int>(), 2));
25 while (i != i_end)
|
| /third_party/boost/boost/spirit/home/classic/tree/ |
| D | common.hpp | 453 typename ContainerT::const_iterator i_end = nodes.end(); in group_nodes() local
456 i != i_end; ++i) in group_nodes()
497 typename ContainerT::const_iterator i_end = nodes.end(); in group_nodes() local
500 i != i_end; ++i) in group_nodes()
1064 iter_t i_end = m.trees.end(); in operator ()() local
1065 for (iter_t i = m.trees.begin(); i != i_end; ++i) in operator ()()
1119 iter_t i = m.trees.begin(), i_end = m.trees.end(); in operator ()() local
1120 for (++i; i != i_end; ++i) in operator ()()
1184 iter_t i_end = m.trees.end(); in operator ()() local
1185 for (iter_t i = m.trees.begin(); i != i_end; ++i) in operator ()()
[all …]
|
| /third_party/skia/third_party/externals/brotli/c/enc/ |
| D | hash_to_binary_tree_inc.h | 307 const size_t i_end = BROTLI_MIN(size_t, position, i_start + num_bytes); in FN() local
309 for (i = i_start; i < i_end; ++i) { in FN()
|
| /third_party/node/deps/brotli/c/enc/ |
| D | hash_to_binary_tree_inc.h | 307 const size_t i_end = BROTLI_MIN(size_t, position, i_start + num_bytes); in FN() local
309 for (i = i_start; i < i_end; ++i) { in FN()
|
| /third_party/boost/libs/graph/doc/ |
| D | transitive_closure.w | 516 vertex_iterator i, i_end;
517 for (tie(i, i_end) = vertices(g); i != i_end; ++i)
524 graph_traits<CG_t>::adjacency_iterator i, i_end;
525 for (tie(i, i_end) = adjacent_vertices(s, CG); i != i_end; ++i) {
545 vertex_iterator i, i_end;
546 for (tie(i, i_end) = vertices(g); i != i_end; ++i)
|
| D | minimum_degree_ordering.w | 188 adjacency_iterator i, i_end;
189 for (tie(i, i_end) = adjacent_vertices(neighbor, G); i != i_end; ++i) {
|
| /third_party/boost/libs/iterator/doc/quickbook/ |
| D | transform_iterator.qbk | 23 i_end(x + N, boost::bind1st(std::multiplies<int>(), 2));
26 while (i != i_end)
|