// right child
neighbor = neighbor->child(1);
- while (1)
+ while (true)
{
Assert (neighbor->neighbor(1) == cell->child(0),
ExcInternalError());
// left child
neighbor = neighbor->child(0);
- while (1)
+ while (true)
{
Assert (neighbor->neighbor(0) == cell->child(1),
ExcInternalError());
{
const types::global_dof_index n_dofs = prolongation_matrices[level]->block(block, block).m();
constraints_per_block[block].resize(0);
- constraints_per_block[block].resize(n_dofs, 0);
+ constraints_per_block[block].resize(n_dofs, false);
for (types::global_dof_index i=0; i<n_dofs; ++i, ++index)
constraints_per_block[block][i] = (constrain_indices[index] == 1);
{
Handle(Geom_Curve) curve = intersections[i];
Handle(Geom_BoundedCurve) bcurve = Handle(Geom_BoundedCurve)::DownCast(curve);
- check = convert_bspline.Add(bcurve,tolerance,0,1,0);
+ check = convert_bspline.Add(bcurve,tolerance,false,true,0);
if (check == false) // If we failed, try again with the reversed curve
{
curve->Reverse();
Handle(Geom_BoundedCurve) bcurve = Handle(Geom_BoundedCurve)::DownCast(curve);
- check = convert_bspline.Add(bcurve,tolerance,0,1,0);
+ check = convert_bspline.Add(bcurve,tolerance,false,true,0);
}
one_failed = one_failed || (check == false);
one_added = one_added || (check == true);