Searched refs:idx_a (Results 1 – 5 of 5) sorted by relevance
| /third_party/boost/libs/coroutine/doc/ |
| D | symmetric.qbk | 46 std::size_t idx_a=0,idx_b=0;
51 while(idx_a<a.size())
53 … if(b[idx_b]<a[idx_a]) // test if element in array b is less than in array a
55 c.push_back(a[idx_a++]); // add element to final array
66 … if (a[idx_a]<b[idx_b]) // test if element in array a is less than in array b
71 while ( idx_a < a.size())
72 c.push_back( a[idx_a++]);
|
| D | motivation.qbk | 527 std::size_t idx_a=0,idx_b=0;
532 while(idx_a<a.size()){
533 … if(b[idx_b]<a[idx_a]) // test if element in array b is less than in array a
535 c.push_back(a[idx_a++]); // add element to final array
545 … if(a[idx_a]<b[idx_b]) // test if element in array a is less than in array b
550 while(idx_a<a.size())
551 c.push_back(a[idx_a++]);
|
| /third_party/mesa3d/src/amd/compiler/ |
| D | aco_spill.cpp | 144 get_dominator(int idx_a, int idx_b, Program* program, bool is_linear) in get_dominator() argument
147 if (idx_a == -1) in get_dominator()
150 return idx_a; in get_dominator()
152 while (idx_a != idx_b) { in get_dominator()
153 if (idx_a > idx_b) in get_dominator()
154 idx_a = program->blocks[idx_a].linear_idom; in get_dominator()
159 while (idx_a != idx_b) { in get_dominator()
160 if (idx_a > idx_b) in get_dominator()
161 idx_a = program->blocks[idx_a].logical_idom; in get_dominator()
166 assert(idx_a != -1); in get_dominator()
[all …]
|
| /third_party/mesa3d/src/gallium/drivers/zink/ |
| D | zink_program.c | 220 unsigned idx_a = u_bit_scan(&mask_a); in equals_gfx_pipeline_state() local
222 if (sa->vertex_strides[idx_a] != sb->vertex_strides[idx_b]) in equals_gfx_pipeline_state()
|
| /third_party/mindspore/mindspore/numpy/ |
| D | math_ops.py | 2970 def _get_slice_product(idx_a, idx_b): argument
2971 return multiply(F.tensor_slice(a, a_slice_start + (idx_a,), a_slice_size),
|