1 // Copyright (C) 2007-2012 CEA/DEN, EDF R&D
3 // This library is free software; you can redistribute it and/or
4 // modify it under the terms of the GNU Lesser General Public
5 // License as published by the Free Software Foundation; either
6 // version 2.1 of the License.
8 // This library is distributed in the hope that it will be useful,
9 // but WITHOUT ANY WARRANTY; without even the implied warranty of
10 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 // Lesser General Public License for more details.
13 // You should have received a copy of the GNU Lesser General Public
14 // License along with this library; if not, write to the Free Software
15 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
19 // Author : Anthony Geay (CEA/DEN)
21 #ifndef __PARAMEDMEM_MEDCOUPLINGMEMARRAY_TXX__
22 #define __PARAMEDMEM_MEDCOUPLINGMEMARRAY_TXX__
24 #include "MEDCouplingMemArray.hxx"
25 #include "NormalizedUnstructuredMesh.hxx"
26 #include "InterpKernelException.hxx"
27 #include "InterpolationUtils.hxx"
35 void MEDCouplingPointer<T>::setInternal(T *pointer)
42 void MEDCouplingPointer<T>::setExternal(const T *pointer)
49 MemArray<T>::MemArray(const MemArray<T>& other):_nb_of_elem(0),_nb_of_elem_alloc(0),_ownership(false),_dealloc(CPP_DEALLOC)
51 if(!other._pointer.isNull())
53 _nb_of_elem_alloc=other._nb_of_elem;
54 T *pointer=new T[_nb_of_elem_alloc];
55 std::copy(other._pointer.getConstPointer(),other._pointer.getConstPointer()+other._nb_of_elem,pointer);
56 useArray(pointer,true,CPP_DEALLOC,other._nb_of_elem);
61 void MemArray<T>::useArray(const T *array, bool ownership, DeallocType type, int nbOfElem)
64 _nb_of_elem_alloc=nbOfElem;
67 _pointer.setInternal(const_cast<T *>(array));
69 _pointer.setExternal(array);
75 void MemArray<T>::useExternalArrayWithRWAccess(const T *array, int nbOfElem)
78 _nb_of_elem_alloc=nbOfElem;
80 _pointer.setInternal(const_cast<T *>(array));
86 void MemArray<T>::writeOnPlace(int id, T element0, const T *others, int sizeOfOthers)
88 if(id+sizeOfOthers>=_nb_of_elem_alloc)
89 reserve(2*_nb_of_elem+sizeOfOthers+1);
90 T *pointer=_pointer.getPointer();
92 std::copy(others,others+sizeOfOthers,pointer+id+1);
93 _nb_of_elem=std::max<int>(_nb_of_elem,id+sizeOfOthers+1);
97 template<class InputIterator>
98 void MemArray<T>::insertAtTheEnd(InputIterator first, InputIterator last)
100 T *pointer=_pointer.getPointer();
103 if(_nb_of_elem>=_nb_of_elem_alloc || _nb_of_elem==0)
105 reserve(_nb_of_elem_alloc>0?2*_nb_of_elem_alloc:1);
106 pointer=_pointer.getPointer();
108 pointer[_nb_of_elem++]=*first++;
113 void MemArray<T>::pushBack(T elem) throw(INTERP_KERNEL::Exception)
115 if(_nb_of_elem>=_nb_of_elem_alloc)
116 reserve(_nb_of_elem_alloc>0?2*_nb_of_elem_alloc:1);
118 pt[_nb_of_elem++]=elem;
122 T MemArray<T>::popBack() throw(INTERP_KERNEL::Exception)
126 const T *pt=getConstPointer();
127 return pt[--_nb_of_elem];
129 throw INTERP_KERNEL::Exception("MemArray::popBack : nothing to pop in array !");
133 void MemArray<T>::pack() const
136 (const_cast<MemArray<T> * >(this))->reserve(_nb_of_elem);
140 bool MemArray<T>::isEqual(const MemArray<T>& other, T prec, std::string& reason) const
142 std::ostringstream oss; oss.precision(15);
143 if(_nb_of_elem!=other._nb_of_elem)
145 oss << "Number of elements in coarse data of DataArray mismatch : this=" << _nb_of_elem << " other=" << other._nb_of_elem;
149 const T *pt1=_pointer.getConstPointer();
150 const T *pt2=other._pointer.getConstPointer();
155 oss << "coarse data pointer is defined for only one DataArray instance !";
161 for(int i=0;i<_nb_of_elem;i++)
162 if(pt1[i]-pt2[i]<-prec || (pt1[i]-pt2[i])>prec)
164 oss << "The content of data differs at pos #" << i << " of coarse data ! this[i]=" << pt1[i] << " other[i]=" << pt2[i];
172 * \param [in] sl is typically the number of components
173 * \return True if a not null pointer is present, False if not.
176 bool MemArray<T>::reprHeader(int sl, std::ostream& stream) const
178 stream << "Number of tuples : ";
179 if(!_pointer.isNull())
182 stream << _nb_of_elem/sl << std::endl << "Internal memory facts : " << _nb_of_elem << "/" << _nb_of_elem_alloc;
184 stream << "Empty Data";
189 stream << "Data content :\n";
190 bool ret=!_pointer.isNull();
192 stream << "No data !\n";
197 * \param [in] sl is typically the number of components
200 void MemArray<T>::repr(int sl, std::ostream& stream) const
202 if(reprHeader(sl,stream))
204 const T *data=getConstPointer();
205 if(_nb_of_elem!=0 && sl!=0)
207 int nbOfTuples=_nb_of_elem/sl;
208 for(int i=0;i<nbOfTuples;i++)
210 stream << "Tuple #" << i << " : ";
211 std::copy(data,data+sl,std::ostream_iterator<T>(stream," "));
217 stream << "Empty Data\n";
222 * \param [in] sl is typically the number of components
225 void MemArray<T>::reprZip(int sl, std::ostream& stream) const
227 stream << "Number of tuples : ";
228 if(!_pointer.isNull())
231 stream << _nb_of_elem/sl;
233 stream << "Empty Data";
238 stream << "Data content : ";
239 const T *data=getConstPointer();
240 if(!_pointer.isNull())
242 if(_nb_of_elem!=0 && sl!=0)
244 int nbOfTuples=_nb_of_elem/sl;
245 for(int i=0;i<nbOfTuples;i++)
248 std::copy(data,data+sl,std::ostream_iterator<T>(stream," "));
255 stream << "Empty Data\n";
258 stream << "No data !\n";
262 void MemArray<T>::fillWithValue(const T& val)
264 T *pt=_pointer.getPointer();
265 std::fill(pt,pt+_nb_of_elem,val);
269 T *MemArray<T>::fromNoInterlace(int nbOfComp) const
271 const T *pt=_pointer.getConstPointer();
272 int nbOfTuples=_nb_of_elem/nbOfComp;
273 T *ret=new T[_nb_of_elem];
275 for(int i=0;i<nbOfTuples;i++)
276 for(int j=0;j<nbOfComp;j++,w++)
277 *w=pt[j*nbOfTuples+i];
282 T *MemArray<T>::toNoInterlace(int nbOfComp) const
284 const T *pt=_pointer.getConstPointer();
285 int nbOfTuples=_nb_of_elem/nbOfComp;
286 T *ret=new T[_nb_of_elem];
288 for(int i=0;i<nbOfComp;i++)
289 for(int j=0;j<nbOfTuples;j++,w++)
295 void MemArray<T>::sort(bool asc)
297 T *pt=_pointer.getPointer();
299 std::sort(pt,pt+_nb_of_elem);
302 typename std::reverse_iterator<T *> it1(pt+_nb_of_elem);
303 typename std::reverse_iterator<T *> it2(pt);
309 void MemArray<T>::reverse()
311 T *pt=_pointer.getPointer();
312 std::reverse(pt,pt+_nb_of_elem);
316 void MemArray<T>::alloc(int nbOfElements) throw(INTERP_KERNEL::Exception)
320 throw INTERP_KERNEL::Exception("MemArray::alloc : request for negative length of data !");
321 _nb_of_elem=nbOfElements;
322 _nb_of_elem_alloc=nbOfElements;
323 _pointer.setInternal(new T[_nb_of_elem_alloc]);
325 _dealloc=CPP_DEALLOC;
329 * This method performs systematically an allocation of \a newNbOfElements elements in \a this.
330 * \a _nb_of_elem and \a _nb_of_elem_alloc will \b NOT be systematically equal (contrary to MemArray<T>::reAlloc method.
331 * So after the call of this method \a _nb_of_elem will be equal tostd::min<int>(_nb_of_elem,newNbOfElements) and \a _nb_of_elem_alloc equal to
332 * \a newNbOfElements. This method is typically used to perform a pushBack to avoid systematic allocations-copy-deallocation.
333 * So after the call of this method the accessible content is perfectly set.
335 * So this method should not be confused with MemArray<T>::reserve that is close to MemArray<T>::reAlloc but not same.
338 void MemArray<T>::reserve(int newNbOfElements) throw(INTERP_KERNEL::Exception)
340 if(newNbOfElements<0)
341 throw INTERP_KERNEL::Exception("MemArray::reAlloc : request for negative length of data !");
342 if(_nb_of_elem_alloc==newNbOfElements)
344 T *pointer=new T[newNbOfElements];
345 std::copy(_pointer.getConstPointer(),_pointer.getConstPointer()+std::min<int>(_nb_of_elem,newNbOfElements),pointer);
347 destroyPointer(const_cast<T *>(_pointer.getConstPointer()),_dealloc);//Do not use getPointer because in case of _external
348 _pointer.setInternal(pointer);
349 _nb_of_elem=std::min<int>(_nb_of_elem,newNbOfElements);
350 _nb_of_elem_alloc=newNbOfElements;
352 _dealloc=CPP_DEALLOC;
356 * This method performs systematically an allocation of \a newNbOfElements elements in \a this.
357 * \a _nb_of_elem and \a _nb_of_elem_alloc will be equal even if only std::min<int>(_nb_of_elem,newNbOfElements) come from the .
358 * The remaing part of the new allocated chunk are available but not set previouly !
360 * So this method should not be confused with MemArray<T>::reserve that is close to MemArray<T>::reAlloc but not same.
363 void MemArray<T>::reAlloc(int newNbOfElements) throw(INTERP_KERNEL::Exception)
365 if(newNbOfElements<0)
366 throw INTERP_KERNEL::Exception("MemArray::reAlloc : request for negative length of data !");
367 if(_nb_of_elem==newNbOfElements)
369 T *pointer=new T[newNbOfElements];
370 std::copy(_pointer.getConstPointer(),_pointer.getConstPointer()+std::min<int>(_nb_of_elem,newNbOfElements),pointer);
372 destroyPointer(const_cast<T *>(_pointer.getConstPointer()),_dealloc);//Do not use getPointer because in case of _external
373 _pointer.setInternal(pointer);
374 _nb_of_elem=newNbOfElements;
375 _nb_of_elem_alloc=newNbOfElements;
377 _dealloc=CPP_DEALLOC;
381 void MemArray<T>::destroyPointer(T *pt, DeallocType type)
396 std::ostringstream stream;
397 stream << "Invalid deallocation requested for pointer " << pt;
398 throw INTERP_KERNEL::Exception(stream.str().c_str());
403 void MemArray<T>::destroy()
406 destroyPointer(const_cast<T *>(_pointer.getConstPointer()),_dealloc);//Do not use getPointer because in case of _external
412 MemArray<T> &MemArray<T>::operator=(const MemArray<T>& other)
414 alloc(other._nb_of_elem);
415 std::copy(other._pointer.getConstPointer(),other._pointer.getConstPointer()+_nb_of_elem,_pointer.getPointer());