libMesh/libmesh: coverage diff

Base 739e36 Head #4292 63dba7
Total Total +/- New
Rate 65.00% 65.01% +0.00% 100.00%
Hits 76957 76963 +6 1
Misses 41434 41429 -5 0
Filename Stmts Miss Cover
src/geom/reference_elem.C +1 0 +0.05%
src/mesh/distributed_mesh.C 0 -2 +0.25%
src/mesh/mesh_refinement.C 0 -2 +0.29%
src/mesh/mesh_triangle_holes.C 0 -1 +0.27%
TOTAL +1 -5 +0.00%
code
coverage unchanged
code
coverage increased
code
coverage decreased
+
line added or modified

src/geom/reference_elem.C

179  
180  
181  
182 +
183  
184  
185  

    ref_elem_file.clear();

    // 0D elements
    ref_elem_file[NODEELEM] = ElemDataStrings::one_nodeelem;

    // 1D elements
    ref_elem_file[EDGE2]    = ElemDataStrings::one_edge;

src/mesh/distributed_mesh.C

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);

src/mesh/mesh_refinement.C

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 &&

src/mesh/mesh_triangle_holes.C

270  
271  
272  
273  
274  
275  
276  

    {
      ray_target = inside - Point(1);
      intersection_distances =
        this->find_ray_intersections(inside, ray_target);
    }

  // I'd make this an assert, but I'm not 100% confident we can't