@@ -1341,9 +1341,9 @@ Real FE<3,SIDE_HIERARCHIC>::shape(const Elem * elem,
1341
1341
1342
1342
// We pinky swear not to modify these nodes
1343
1343
Elem & e = const_cast < Elem & > (* elem );
1344
- side .set_node (0 ) = e .node_ptr (face_vertex [0 ]);
1345
- side .set_node (1 ) = e .node_ptr (face_vertex [1 ]);
1346
- side .set_node (2 ) = e .node_ptr (face_vertex [2 ]);
1344
+ side .set_node (0 , e .node_ptr (face_vertex [0 ]) );
1345
+ side .set_node (1 , e .node_ptr (face_vertex [1 ]) );
1346
+ side .set_node (2 , e .node_ptr (face_vertex [2 ]) );
1347
1347
1348
1348
const unsigned int basisnum = i - face_num * dofs_per_side ;
1349
1349
@@ -1438,11 +1438,11 @@ Real FE<3,SIDE_HIERARCHIC>::shape(const Elem * elem,
1438
1438
const std ::array < unsigned int , 4 > face_vertex =
1439
1439
oriented_prism_nodes (* elem , face_num );
1440
1440
1441
- side -> set_node (0 ) = e .node_ptr (face_vertex [0 ]);
1442
- side -> set_node (1 ) = e .node_ptr (face_vertex [1 ]);
1443
- side -> set_node (2 ) = e .node_ptr (face_vertex [2 ]);
1441
+ side -> set_node (0 , e .node_ptr (face_vertex [0 ]) );
1442
+ side -> set_node (1 , e .node_ptr (face_vertex [1 ]) );
1443
+ side -> set_node (2 , e .node_ptr (face_vertex [2 ]) );
1444
1444
if (face_vertex [3 ] < 21 )
1445
- side -> set_node (3 ) = e .node_ptr (face_vertex [3 ]);
1445
+ side -> set_node (3 , e .node_ptr (face_vertex [3 ]) );
1446
1446
1447
1447
if (face_num == 0 || face_num == 4 )
1448
1448
sidep = {zeta [face_vertex [1 ]%3 ], zeta [face_vertex [2 ]%3 ]};
@@ -2313,25 +2313,25 @@ Real fe_hierarchic_3D_shape(const Elem * elem,
2313
2313
Elem & e = const_cast < Elem & > (* elem );
2314
2314
if (i2 == 0 )
2315
2315
{
2316
- tri .set_node (0 ) = e .node_ptr (0 );
2317
- tri .set_node (1 ) = e .node_ptr (1 );
2318
- tri .set_node (2 ) = e .node_ptr (2 );
2316
+ tri .set_node (0 , e .node_ptr (0 ) );
2317
+ tri .set_node (1 , e .node_ptr (1 ) );
2318
+ tri .set_node (2 , e .node_ptr (2 ) );
2319
2319
}
2320
2320
else if (i2 == 1 )
2321
2321
{
2322
- tri .set_node (0 ) = e .node_ptr (3 );
2323
- tri .set_node (1 ) = e .node_ptr (4 );
2324
- tri .set_node (2 ) = e .node_ptr (5 );
2322
+ tri .set_node (0 , e .node_ptr (3 ) );
2323
+ tri .set_node (1 , e .node_ptr (4 ) );
2324
+ tri .set_node (2 , e .node_ptr (5 ) );
2325
2325
}
2326
2326
else
2327
2327
{
2328
2328
// For interior DoFs, no flipping is necessary or done; we
2329
2329
// can just evaluate on any triangle ... but *not* the
2330
2330
// obvious 9,10,11 triangle, because that might not exist
2331
2331
// if we have L2_HIERARCHIC on Prism6.
2332
- tri .set_node (0 ) = e .node_ptr (0 );
2333
- tri .set_node (1 ) = e .node_ptr (1 );
2334
- tri .set_node (2 ) = e .node_ptr (2 );
2332
+ tri .set_node (0 , e .node_ptr (0 ) );
2333
+ tri .set_node (1 , e .node_ptr (1 ) );
2334
+ tri .set_node (2 , e .node_ptr (2 ) );
2335
2335
2336
2336
// For square face DoFs, prism_indices handles flipping,
2337
2337
// and we *can't* override that in the tri shape call.
@@ -2347,8 +2347,8 @@ Real fe_hierarchic_3D_shape(const Elem * elem,
2347
2347
if (tri .point (tri_edge ) > tri .point ((tri_edge + 1 )%3 ))
2348
2348
{
2349
2349
Node * n = tri .node_ptr (tri_edge );
2350
- tri .set_node (tri_edge ) = tri .node_ptr ((tri_edge + 1 )%3 );
2351
- tri .set_node ((tri_edge + 1 )%3 ) = n ;
2350
+ tri .set_node (tri_edge , tri .node_ptr ((tri_edge + 1 )%3 ) );
2351
+ tri .set_node ((tri_edge + 1 )%3 , n ) ;
2352
2352
}
2353
2353
}
2354
2354
}
0 commit comments