Skip to content
GitLab
Menu
Projects
Groups
Snippets
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
Menu
Open sidebar
Backofen, Rainer
amdis
Commits
a1095c6a
Commit
a1095c6a
authored
Jun 07, 2010
by
Naumann, Andreas
Browse files
removed debug code
parent
7bf56b3a
Changes
3
Show whitespace changes
Inline
Side-by-side
AMDiS/src/ProblemVec.cc
View file @
a1095c6a
...
...
@@ -1118,16 +1118,10 @@ namespace AMDiS {
it
!=
op
->
getAuxFeSpaces
().
end
();
++
it
)
{
if
((
*
it
)
->
getMesh
()
!=
componentSpaces
[
i
]
->
getMesh
()
||
(
*
it
)
->
getMesh
()
!=
componentSpaces
[
j
]
->
getMesh
())
{
// std::cout<<"auxFE "<<k<<" in position ("<<i<<","<<j<<") has different mesh\n"<<std::endl;
op
->
setNeedDualTraverse
(
true
);
break
;
}
}
/* std::cout<<"after adding MatOp to ("<<i<<","<<j<<"):\n";
traverseInfo.updateStatus();
for(int i2=0;i2<nComponents;i2++)
for(int j2=0;j2<nComponents;j2++)
std::cout<<"traverseInfo.getStatus("<<i2<<","<<j2<<"):"<<traverseInfo.getStatus(i2,j2)<<std::endl;*/
}
...
...
AMDiS/src/SubAssembler.cc
View file @
a1095c6a
...
...
@@ -229,17 +229,7 @@ namespace AMDiS {
WorldVector
<
double
>
*
values
=
&
(
gradientsAtQPs
[
vec
]
->
values
[
0
]);
gradientsAtQPs
[
vec
]
->
valid
=
true
;
bool
hasNan
=
false
;
for
(
int
i
=
0
;
i
<
localQuad
->
getNumPoints
()
&&
!
hasNan
;
i
++
)
for
(
int
j
=
0
;
j
<
Global
::
getGeo
(
WORLD
)
&&
!
hasNan
;
j
++
)
hasNan
=
isnan
((
values
[
i
])[
j
]);
TEST_EXIT_DBG
(
!
hasNan
)(
"gradient contains a nan
\n
"
);
vec
->
getGrdAtQPs
(
smallElInfo
,
largeElInfo
,
localQuad
,
NULL
,
values
);
hasNan
=
false
;
for
(
int
i
=
0
;
i
<
localQuad
->
getNumPoints
()
&&
!
hasNan
;
i
++
)
for
(
int
j
=
0
;
j
<
Global
::
getGeo
(
WORLD
)
&&
!
hasNan
;
j
++
)
hasNan
=
isnan
((
values
[
i
])[
j
]);
TEST_EXIT_DBG
(
!
hasNan
)(
"gradient contains a nan
\n
"
);
return
values
;
}
...
...
AMDiS/src/ZeroOrderAssembler.cc
View file @
a1095c6a
...
...
@@ -99,10 +99,6 @@ namespace AMDiS {
for
(
termIt
=
terms
[
myRank
].
begin
();
termIt
!=
terms
[
myRank
].
end
();
++
termIt
)
(
static_cast
<
ZeroOrderTerm
*>
((
*
termIt
)))
->
getC
(
elInfo
,
nPoints
,
c
);
bool
hasNan
=
false
;
for
(
int
i
=
0
;
i
<
nPoints
&&
!
hasNan
;
i
++
)
hasNan
=
isnan
(
c
[
i
]);
TEST_EXIT
(
!
hasNan
)(
"there is a nan in at least one position
\n
"
);
if
(
symmetric
)
{
TEST_EXIT_DBG
(
nCol
==
nRow
)(
"nCol != nRow, but symmetric assembling!
\n
"
);
...
...
@@ -138,11 +134,6 @@ namespace AMDiS {
}
}
}
hasNan
=
false
;
for
(
unsigned
i
=
0
;
i
<
num_rows
(
mat
)
&&
!
hasNan
;
i
++
)
for
(
unsigned
j
=
0
;
j
<
num_cols
(
mat
)
&&
!
hasNan
;
j
++
)
hasNan
=
isnan
(
mat
[
i
][
j
]);
TEST_EXIT
(
!
hasNan
)(
"calculated an element matrix containing a nan
\n
"
);
}
...
...
Write
Preview
Supports
Markdown
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment