Commit f9d5dc61 authored by Thomas Witkowski's avatar Thomas Witkowski
Browse files

Soooo small changes, no comment required.

parent 2f0ed3ea
......@@ -75,20 +75,16 @@ namespace AMDiS {
return rclist[i]->flag;
}
/** \brief
* If \ref rclist[i].neigh[j] is not a NULL pointer
* \ref rclist[i].neigh[j]->ith will be returned. Otherwise the return value is -1
*/
/// If \ref rclist[i].neigh[j] is not a NULL pointer
/// \ref rclist[i].neigh[j]->ith will be returned. Otherwise the return value is -1
inline int getNeighbourNr(int i, int j) const
{
return rclist[i]->neigh[j] ? rclist[i]->neigh[j]->ith : -1;
}
/** \brief
* If \ref rclist[i].neigh[j] is not a NULL pointer
* \ref rclist[i].neigh[j]->el will be returned. Otherwise the return value
* is NULL
*/
/// If \ref rclist[i].neigh[j] is not a NULL pointer
/// \ref rclist[i].neigh[j]->el will be returned. Otherwise the return value
/// is NULL
inline Element* getNeighbourElement(int i, int j) const
{
return rclist[i]->neigh[j] ? rclist[i]->neigh[j]->el : NULL;
......@@ -103,6 +99,12 @@ namespace AMDiS {
return rclist[i]->el;
}
/// Returns number of elements in list
inline unsigned int getSize() const
{
return rclist.size();
}
/// Sets \ref rclist[i].el to el and \ref rclist[i].flag to cp.
inline const Element* setElement(int i, const Element* el, bool cp = false)
{
......@@ -123,7 +125,8 @@ namespace AMDiS {
rclist[i]->elType = type;
}
/// If patch can be coarsend return true, else false and reset the element marks.
/// If patch can be coarsend return true, else false and reset the
/// element marks.
virtual bool doCoarsePatch(int n_neigh);
/// Sets \ref rclist[i].oppVertex[j] = k
......@@ -168,12 +171,14 @@ namespace AMDiS {
/// Removes DOFs during refinement (2d)
void removeDOFParents(int n_neigh);
///
void periodicSplit(DegreeOfFreedom *edge[2],
DegreeOfFreedom *nextEdge[2],
int *n_neigh,
int *n_neigh_periodic,
RCNeighbourList &periodicList);
///
void clearList();
protected:
......
......@@ -755,7 +755,7 @@ namespace AMDiS {
DegreeOfFreedom *next_edge[2] = {NULL, NULL};
DegreeOfFreedom *first_edge[2] = {edge[0], edge[1]};
DegreeOfFreedom *last_edge[2] = {NULL, NULL};
int n_neigh_periodic;
int n_neigh_periodic = 0;
DegreeOfFreedom lastNewDof = -1;
DegreeOfFreedom firstNewDof = -1;
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment