Searched refs:row (Results 1 – 4 of 4) sorted by relevance
| /oneTBB/examples/task_group/sudoku/ |
| H A D | sudoku.cpp | 69 for (unsigned row = 0; row < BOARD_DIM; ++row) { in print_board() local
76 if (row == 2 || row == 5) in print_board()
82 for (unsigned row = 0; row < BOARD_DIM; ++row) { in print_potential_board() local
84 if (b[row * BOARD_DIM + col].solved_element) in print_potential_board()
92 if (row == 2 || row == 5) in print_potential_board()
136 unsigned b_row = row / 3 * 3, b_col = col / 3 * 3; in in_block()
150 if (!in_row(b, row, col, potential) && !in_col(b, row, col, potential) && in calculate_potentials()
151 !in_block(b, row, col, potential)) in calculate_potentials()
163 if (in_row(b, row, col, b[i].solved_element) || in valid_board()
164 in_col(b, row, col, b[i].solved_element) || in valid_board()
[all …]
|
| /oneTBB/examples/parallel_for/game_of_life/ |
| H A D | Update_state.cpp | 50 for (unsigned row = 0; row < height; ++row) { in shift_left2D() local
51 unsigned ind = row * size_sse_row; in shift_left2D()
73 for (unsigned row = 0; row < height; ++row) { in shift_right2D() local
74 unsigned ind = row * size_sse_row; in shift_right2D()
129 for (unsigned row = 0; row < height; ++row) { in UpdateState() local
130 char* src = &mas[(row + begin) * width]; in UpdateState()
131 unsigned* dst = (unsigned*)&X[(row + 1) * size_sse_row]; in UpdateState()
203 for (unsigned row = 0; row < height; ++row) { in UpdateState() local
204 char* dst = &dest[(row + begin) * width]; in UpdateState()
205 unsigned* src = (unsigned*)&X[(row + 1) * size_sse_row]; in UpdateState()
|
| /oneTBB/doc/main/tbb_userguide/ |
| H A D | Cancellation_and_Nested_Parallelism.rst | 123 Hence when the program completes, each row of ``Data`` may be different,
124 depending upon whether its iteration ``i`` ran at all, but within a row,
129 the inner loop. In that case, a row of ``Data`` might end up with both
|
| /oneTBB/examples/graph/cholesky/ |
| H A D | README.md | 30 * `size` - the row/column size of `NxN` matrix (size <= 46000).
|