// $Id$
// Version: $Name$
//
-// Copyright (C) 2011, 2012 by the deal.II authors
+// Copyright (C) 2011, 2012, 2013 by the deal.II authors
//
// This file is subject to QPL and may not be distributed
// without copyright and license information. Please refer
operator [] (const unsigned int comp) const
{
AssertIndexRange (comp, 4);
- return *(reinterpret_cast<const float *>(&data)+comp);;
+ return *(reinterpret_cast<const float *>(&data)+comp);
}
/**
}
else if (info == 3)
{
- Assert (false, ExcArpackNoShifts(1));;
+ Assert (false, ExcArpackNoShifts(1));
}
else if (info!=0)
{
//---------------------------------------------------------------------------
// $Id$
//
-// Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2009, 2012 by the deal.II authors
+// Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2009, 2012, 2013 by the deal.II authors
//
// This file is subject to QPL and may not be distributed
// without copyright and license information. Please refer
matrix = new PointerMatrix<MATRIX, VECTOR>(&m);
if (precondition != 0)
delete precondition;
- precondition = new PointerMatrix<PRECONDITION, VECTOR>(&p);;
+ precondition = new PointerMatrix<PRECONDITION, VECTOR>(&p);
}
// $Id$
// Version: $Name$
//
-// Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012 by the deal.II authors
+// Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013 by the deal.II authors
//
// This file is subject to QPL and may not be distributed
// without copyright and license information. Please refer
summed_multiplicities += multiplicities[i];
}
- unsigned char total_conformity = 0xff;;
+ unsigned char total_conformity = 0xff;
for (unsigned int i=0; i<fes.size(); i++)
if (multiplicities[i]>0)
// $Id$
// Version: $Name$
//
-// Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2009, 2010, 2011, 2012 by the deal.II authors
+// Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2009, 2010, 2011, 2012, 2013 by the deal.II authors
//
// This file is subject to QPL and may not be distributed
// without copyright and license information. Please refer
const SparsityPatternBase &b = block(ib,jb);
for (unsigned int j=0; j<b.n_cols(); ++j)
if (b.exists(i,j))
- out << l+j << " " << -static_cast<signed int>(i+k) << std::endl;;
+ out << l+j << " " << -static_cast<signed int>(i+k) << std::endl;
l += b.n_cols();
}
}