Base 7216a2 | Head #4210 55aaa3 | ||||
---|---|---|---|---|---|
Total | Total | +/- | New | ||
Rate | 64.77% | 64.78% | +0.01% | - | |
Hits | 76400 | 76411 | +11 | 0 | |
Misses | 41556 | 41545 | -11 | 0 |
Filename | Stmts | Miss | Cover |
---|---|---|---|
src/geom/cell_inf_prism.C | 0 | -7 | +5.34% |
src/mesh/distributed_mesh.C | 0 | -2 | +0.25% |
src/mesh/mesh_refinement.C | 0 | -2 | +0.29% |
TOTAL | 0 | -11 | +0.01% |
code
code
code
+
303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 |
// this captures the case that the point is not (almost) in the direction of the element.: // first, project the problem onto the unit sphere: Point p_o(p - my_origin); pt0_o /= pt0_o.norm(); pt1_o /= pt1_o.norm(); pt2_o /= pt2_o.norm(); p_o /= p_o.norm(); // now, check if it is in the projected face; by comparing the distance of // any point in the element to \p p with the largest distance between this point // to any other point in the element. if ((p_o - pt0_o).norm_sq() > std::max((pt0_o - pt1_o).norm_sq(), (pt0_o - pt2_o).norm_sq()) || (p_o - pt1_o).norm_sq() > std::max((pt1_o - pt2_o).norm_sq(), (pt1_o - pt0_o).norm_sq()) || (p_o - pt2_o).norm_sq() > std::max((pt2_o - pt0_o).norm_sq(), (pt2_o - pt1_o).norm_sq()) ) { // the physical point is definitely not contained in the element return false; } |
1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 |
sender_could_become_owner) { if (it != repartitioned_node_pids.end() && pid < it->second) it->second = pid; else repartitioned_node_pids[n] = pid; } else if (it == repartitioned_node_pids.end()) repartitioned_node_pids[n] = DofObject::invalid_processor_id; repartitioned_node_sets_to_push[pid].insert(n); |
1272 1273 1274 1275 1276 1277 1278 1279 |
if (neighbor->p_level() < my_p_level && neighbor->p_refinement_flag() != Elem::REFINE) { neighbor->set_p_refinement_flag(Elem::REFINE); level_one_satisfied = false; compatible_with_coarsening = false; } if (neighbor->p_level() == my_p_level && |