* @p DoFAccessor::vertex_dof_index
* functions.
*/
- int vertex_index (const unsigned int i) const;
+ unsigned int vertex_index (const unsigned int i) const;
/**
* Return a reference to the
* @p DoFAccessor::vertex_dof_index
* functions.
*/
- int vertex_index (const unsigned int i) const;
+ unsigned int vertex_index (const unsigned int i) const;
/**
* Return a reference to the
* DoFAccessor::vertex_dof_index
* functions.
*/
- int vertex_index (const unsigned int i) const;
+ unsigned int vertex_index (const unsigned int i) const;
/**
* Return a reference to the
* @p DoFAccessor::vertex_dof_index
* functions.
*/
- int vertex_index (const unsigned int i) const;
+ unsigned int vertex_index (const unsigned int i) const;
/**
* Return a reference to the
// $Id$
// Version: $Name$
//
-// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007 by the deal.II authors
+// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 by the deal.II authors
//
// This file is subject to QPL and may not be distributed
// without copyright and license information. Please refer
// if the vertex is part of that cell
for (; cell != endc; ++cell)
for (unsigned v = 0; v < GeometryInfo<dim>::vertices_per_cell; v++)
- if (cell->vertex_index(v) == (int)vertex)
+ if (cell->vertex_index(v) == vertex)
{
// OK, we found a cell that contains
// the particular vertex. We add it
{
bool found = false;
for (unsigned v=0; v<GeometryInfo<dim>::vertices_per_cell; v++)
- if (nb->vertex_index(v) == (int)vertex)
+ if (nb->vertex_index(v) == vertex)
{
found = true;
break;
// $Id$
// Version: $Name$
//
-// Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007 by the deal.II authors
+// Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 by the deal.II authors
//
// This file is subject to QPL and may not be distributed
// without copyright and license information. Please refer
unsigned int max_vertex_index = 0;
for (; cell!=endc; ++cell)
for (unsigned vertex=0; vertex<GeometryInfo<dim>::vertices_per_cell; ++vertex)
- if (cell->vertex_index(vertex) > (signed int)max_vertex_index)
+ if (cell->vertex_index(vertex) > max_vertex_index)
max_vertex_index = cell->vertex_index(vertex);
// store the number of times a cell
// first vertex is the same middle
// vertex.
for (unsigned int i=0; i<24; ++i)
- if (lines[i]->vertex_index((i+1)%2)==static_cast<int>(vertex_indices[i/4]))
+ if (lines[i]->vertex_index((i+1)%2)==vertex_indices[i/4])
line_orientation[i]=true;
else
{
// it must be the other way
// round then
- Assert(lines[i]->vertex_index(i%2)==static_cast<int>(vertex_indices[i/4]),
+ Assert(lines[i]->vertex_index(i%2)==vertex_indices[i/4],
ExcInternalError());
line_orientation[i]=false;
}
template <int dim>
-int TriaObjectAccessor<1, dim>::vertex_index (const unsigned int i) const
+unsigned int TriaObjectAccessor<1, dim>::vertex_index (const unsigned int i) const
{
Assert (i<2, ExcIndexRange(i,0,2));
return objects().cells[this->present_index].face (i);
template <int dim>
-int TriaObjectAccessor<2, dim>::vertex_index (const unsigned int corner) const
+unsigned int TriaObjectAccessor<2, dim>::vertex_index (const unsigned int corner) const
{
Assert (corner<4, ExcIndexRange(corner,0,4));
template <int dim>
-int TriaObjectAccessor<3, dim>::vertex_index (const unsigned int corner) const
+unsigned int TriaObjectAccessor<3, dim>::vertex_index (const unsigned int corner) const
{
Assert (corner<8, ExcIndexRange(corner,0,8));