From defc8c5c6c311ad2905548a5281ec3d69061ec45 Mon Sep 17 00:00:00 2001
From: Christophe Geuzaine <cgeuzaine@ulg.ac.be>
Date: Wed, 4 Jun 2008 05:32:42 +0000
Subject: [PATCH] re-fix adaptive view for vectors
---
Post/PViewDataList.cpp | 5 +----
Post/adaptiveData.cpp | 8 +++-----
2 files changed, 4 insertions(+), 9 deletions(-)
diff --git a/Post/PViewDataList.cpp b/Post/PViewDataList.cpp
index 434b91c0f4..fd273ce901 100644
--- a/Post/PViewDataList.cpp
+++ b/Post/PViewDataList.cpp
@@ -1,4 +1,4 @@
-// $Id: PViewDataList.cpp,v 1.25 2008-06-03 12:43:42 remacle Exp $
+// $Id: PViewDataList.cpp,v 1.26 2008-06-04 05:32:42 geuzaine Exp $
//
// Copyright (C) 1997-2008 C. Geuzaine, J.-F. Remacle
//
@@ -249,8 +249,6 @@ void PViewDataList::_stat(List_T *list, int nbcomp, int nbelm, int nbnod, int nb
// if some elts have less steps, reduce the total number!
NbTimeStep = N / nbval;
}
-
- // printf("nbT = %d %d %d %d %d\n",NbTimeStep,N,nbval,nbcomp,nbnod);
// update min/max
for(int j = 0; j < N; j += nbcomp) {
@@ -277,7 +275,6 @@ void PViewDataList::_setLast(int ele, int dim, int nbnod, int nbcomp, int nbedg,
_lastXYZ = (double*)List_Pointer_Fast(list, ele * nb);
_lastVal = (double*)List_Pointer_Fast(list, ele * nb + 3 * _lastNumNodes);
_lastNumValues = (nb - 3 * nbnod) / NbTimeStep;
- // printf("%d %d %d %d %d %d %d %d\n",ele,dim,nbnod,nbcomp,nbedg,nb, _lastNumValues,NbTimeStep);
}
void PViewDataList::_setLast(int ele)
diff --git a/Post/adaptiveData.cpp b/Post/adaptiveData.cpp
index a6408f57dc..90e4d1f3b4 100644
--- a/Post/adaptiveData.cpp
+++ b/Post/adaptiveData.cpp
@@ -880,11 +880,9 @@ void adaptiveElements<T>::initWithLowResolution(PViewData *data, int step)
double val[3];
// adaptation of the visualization mesh bases on the norm
// squared of the vector
- data->getValue(step, ent, ele, i , val[0]);
- data->getValue(step, ent, ele, i + numVal / 3, val[1]);
- data->getValue(step, ent, ele, i + 2*numVal / 3, val[2]);
- // printf("%g %g %g %d %d\n",val[0],val[1],val[2],numVal,_coefs->size2());
-
+ data->getValue(step, ent, ele, 3 * i, val[0]);
+ data->getValue(step, ent, ele, 3 * i + 1, val[1]);
+ data->getValue(step, ent, ele, 3 * i + 2, val[2]);
(*_val)(k, i) = (val[0] * val[0] + val[1] * val[1] + val[2] * val[2]);
(*_valX)(k, i) = val[0];
(*_valY)(k, i) = val[1];
--
GitLab