Home
last modified time | relevance | path

Searched defs:num_nodes_u (Results 1 – 10 of 10) sorted by relevance

/libCEED/tests/
H A Dt504-operator.c19 CeedInt num_nodes_x = num_elem + 1, num_nodes_u = num_elem * (p - 1) + 1; in main() local
H A Dt500-operator.c19 CeedInt num_nodes_x = num_elem + 1, num_nodes_u = num_elem * (p - 1) + 1; in main() local
H A Dt503-operator.c19 CeedInt num_nodes_x = num_elem + 1, num_nodes_u = num_elem * (p - 1) + 1; in main() local
H A Dt501-operator.c19 CeedInt num_nodes_x = num_elem + 1, num_nodes_u = num_elem * (p - 1) + 1; in main() local
H A Dt502-operator.c19 CeedInt num_nodes_x = num_elem + 1, num_nodes_u = num_elem * (p - 1) + 1; in main() local
H A Dt507-operator.c19 CeedInt num_nodes_x = num_elem + 1, num_nodes_u = num_elem * (p - 1) + 1; in main() local
H A Dt505-operator.c19 CeedInt num_nodes_x = num_elem + 1, num_nodes_u = num_elem * (p - 1) + 1; in main() local
H A Dt593-operator.c14 …CeedInt num_nodes_x = num_elem + 1, num_nodes_u = num_elem * (p - 1) + 1, num_points_per_elem =… in main() local
H A Dt506-operator.c19 CeedInt num_nodes_x = num_elem + 1, num_nodes_u = num_elem * (p - 1) + 1; in main() local
H A Dt594-operator.c14 …CeedInt num_nodes_x = num_elem + 1, num_nodes_u = num_elem * (p - 1) + 1, num_points_per_elem =… in main() local