Home
last modified time | relevance | path

Searched refs:current_index (Results 1 – 2 of 2) sorted by relevance

/libCEED/tests/
H A Dt593-operator.c47 CeedInt current_index = 0; in main() local
52 for (CeedInt p = 0; p < num_points_per_elem + 1; p++, current_index++) { in main()
53 ind_x_points[num_elem + 1 + current_index] = current_index; in main()
57 CeedGaussQuadrature(num_points_per_elem, &x_array_points[current_index], weight_tmp); in main()
58 ind_x_points[e] = num_elem + 1 + current_index; in main()
59 for (CeedInt p = 0; p < num_points_per_elem; p++, current_index++) { in main()
60 ind_x_points[num_elem + 1 + current_index] = current_index; in main()
64 CeedGaussQuadrature(num_points_per_elem - 1, &x_array_points[current_index], weight_tmp); in main()
65 ind_x_points[num_elem - 1] = num_elem + 1 + current_index; in main()
66 for (CeedInt p = 0; p < num_points_per_elem - 1; p++, current_index++) { in main()
[all …]
H A Dt594-operator.c47 CeedInt current_index = 0; in main() local
52 for (CeedInt p = 0; p < num_points_per_elem + 1; p++, current_index++) { in main()
53 ind_x_points[num_elem + 1 + current_index] = current_index; in main()
57 CeedGaussQuadrature(num_points_per_elem, &x_array_points[current_index], weight_tmp); in main()
58 ind_x_points[e] = num_elem + 1 + current_index; in main()
59 for (CeedInt p = 0; p < num_points_per_elem; p++, current_index++) { in main()
60 ind_x_points[num_elem + 1 + current_index] = current_index; in main()
64 CeedGaussQuadrature(num_points_per_elem - 1, &x_array_points[current_index], weight_tmp); in main()
65 ind_x_points[num_elem - 1] = num_elem + 1 + current_index; in main()
66 for (CeedInt p = 0; p < num_points_per_elem - 1; p++, current_index++) { in main()
[all …]