/[escript]/trunk/escript/src/Data.cpp
ViewVC logotype

Annotation of /trunk/escript/src/Data.cpp

Parent Directory Parent Directory | Revision Log Revision Log


Revision 922 - (hide annotations)
Fri Jan 5 04:23:05 2007 UTC (12 years, 8 months ago) by gross
File size: 83868 byte(s)
setValueOfDataPoint accepts double value as argument now
1 jgs 94 // $Id$
2 jgs 480
3 elspeth 615 /*
4     ************************************************************
5     * Copyright 2006 by ACcESS MNRF *
6     * *
7     * http://www.access.edu.au *
8     * Primary Business: Queensland, Australia *
9     * Licensed under the Open Software License version 3.0 *
10     * http://www.opensource.org/licenses/osl-3.0.php *
11     * *
12     ************************************************************
13     */
14 jgs 474 #include "Data.h"
15 jgs 94
16 jgs 480 #include "DataExpanded.h"
17     #include "DataConstant.h"
18     #include "DataTagged.h"
19     #include "DataEmpty.h"
20     #include "DataArray.h"
21     #include "DataArrayView.h"
22     #include "DataProf.h"
23     #include "FunctionSpaceFactory.h"
24     #include "AbstractContinuousDomain.h"
25     #include "UnaryFuncs.h"
26    
27 jgs 119 #include <fstream>
28 jgs 94 #include <algorithm>
29     #include <vector>
30     #include <functional>
31    
32 jgs 153 #include <boost/python/dict.hpp>
33 jgs 94 #include <boost/python/extract.hpp>
34     #include <boost/python/long.hpp>
35    
36     using namespace std;
37     using namespace boost::python;
38     using namespace boost;
39     using namespace escript;
40    
41 jgs 151 #if defined DOPROF
42 jgs 123 //
43     // global table of profiling data for all Data objects
44     DataProf dataProfTable;
45 jgs 151 #endif
46 jgs 123
47 jgs 94 Data::Data()
48     {
49     //
50     // Default data is type DataEmpty
51     DataAbstract* temp=new DataEmpty();
52 jgs 102 shared_ptr<DataAbstract> temp_data(temp);
53     m_data=temp_data;
54 gross 783 m_protected=false;
55 jgs 151 #if defined DOPROF
56 jgs 123 // create entry in global profiling table for this object
57     profData = dataProfTable.newData();
58 jgs 151 #endif
59 jgs 94 }
60    
61     Data::Data(double value,
62     const tuple& shape,
63     const FunctionSpace& what,
64     bool expanded)
65     {
66     DataArrayView::ShapeType dataPointShape;
67     for (int i = 0; i < shape.attr("__len__")(); ++i) {
68     dataPointShape.push_back(extract<const int>(shape[i]));
69     }
70     DataArray temp(dataPointShape,value);
71     initialise(temp.getView(),what,expanded);
72 gross 783 m_protected=false;
73 jgs 151 #if defined DOPROF
74 jgs 123 // create entry in global profiling table for this object
75     profData = dataProfTable.newData();
76 jgs 151 #endif
77 jgs 94 }
78    
79     Data::Data(double value,
80     const DataArrayView::ShapeType& dataPointShape,
81     const FunctionSpace& what,
82     bool expanded)
83     {
84     DataArray temp(dataPointShape,value);
85     pair<int,int> dataShape=what.getDataShape();
86     initialise(temp.getView(),what,expanded);
87 gross 783 m_protected=false;
88 jgs 151 #if defined DOPROF
89 jgs 123 // create entry in global profiling table for this object
90     profData = dataProfTable.newData();
91 jgs 151 #endif
92 jgs 94 }
93    
94 jgs 102 Data::Data(const Data& inData)
95 jgs 94 {
96 jgs 102 m_data=inData.m_data;
97 gross 783 m_protected=inData.isProtected();
98 jgs 151 #if defined DOPROF
99 jgs 123 // create entry in global profiling table for this object
100     profData = dataProfTable.newData();
101 jgs 151 #endif
102 jgs 94 }
103    
104     Data::Data(const Data& inData,
105     const DataArrayView::RegionType& region)
106     {
107     //
108 jgs 102 // Create Data which is a slice of another Data
109     DataAbstract* tmp = inData.m_data->getSlice(region);
110     shared_ptr<DataAbstract> temp_data(tmp);
111     m_data=temp_data;
112 gross 783 m_protected=false;
113 jgs 151 #if defined DOPROF
114 jgs 123 // create entry in global profiling table for this object
115     profData = dataProfTable.newData();
116 jgs 151 #endif
117 jgs 94 }
118    
119     Data::Data(const Data& inData,
120     const FunctionSpace& functionspace)
121     {
122 gross 711 #if defined DOPROF
123     // create entry in global profiling table for this object
124     profData = dataProfTable.newData();
125     #endif
126 jgs 94 if (inData.getFunctionSpace()==functionspace) {
127     m_data=inData.m_data;
128     } else {
129 gross 711 #if defined DOPROF
130     profData->interpolate++;
131     #endif
132 jgs 94 Data tmp(0,inData.getPointDataView().getShape(),functionspace,true);
133 jgs 123 // Note: Must use a reference or pointer to a derived object
134 jgs 94 // in order to get polymorphic behaviour. Shouldn't really
135     // be able to create an instance of AbstractDomain but that was done
136 jgs 123 // as a boost:python work around which may no longer be required.
137 jgs 94 const AbstractDomain& inDataDomain=inData.getDomain();
138     if (inDataDomain==functionspace.getDomain()) {
139     inDataDomain.interpolateOnDomain(tmp,inData);
140     } else {
141     inDataDomain.interpolateACross(tmp,inData);
142     }
143     m_data=tmp.m_data;
144     }
145 gross 783 m_protected=false;
146 jgs 94 }
147    
148     Data::Data(const DataTagged::TagListType& tagKeys,
149     const DataTagged::ValueListType & values,
150     const DataArrayView& defaultValue,
151     const FunctionSpace& what,
152     bool expanded)
153     {
154     DataAbstract* temp=new DataTagged(tagKeys,values,defaultValue,what);
155 jgs 102 shared_ptr<DataAbstract> temp_data(temp);
156     m_data=temp_data;
157 gross 783 m_protected=false;
158 jgs 94 if (expanded) {
159     expand();
160     }
161 jgs 151 #if defined DOPROF
162 jgs 123 // create entry in global profiling table for this object
163     profData = dataProfTable.newData();
164 jgs 151 #endif
165 jgs 94 }
166    
167     Data::Data(const numeric::array& value,
168     const FunctionSpace& what,
169     bool expanded)
170     {
171     initialise(value,what,expanded);
172 gross 783 m_protected=false;
173 jgs 151 #if defined DOPROF
174 jgs 123 // create entry in global profiling table for this object
175     profData = dataProfTable.newData();
176 jgs 151 #endif
177 jgs 94 }
178    
179     Data::Data(const DataArrayView& value,
180     const FunctionSpace& what,
181     bool expanded)
182     {
183     initialise(value,what,expanded);
184 gross 783 m_protected=false;
185 jgs 151 #if defined DOPROF
186 jgs 123 // create entry in global profiling table for this object
187     profData = dataProfTable.newData();
188 jgs 151 #endif
189 jgs 94 }
190    
191     Data::Data(const object& value,
192     const FunctionSpace& what,
193     bool expanded)
194     {
195     numeric::array asNumArray(value);
196     initialise(asNumArray,what,expanded);
197 gross 783 m_protected=false;
198 jgs 151 #if defined DOPROF
199 jgs 123 // create entry in global profiling table for this object
200     profData = dataProfTable.newData();
201 jgs 151 #endif
202 jgs 94 }
203    
204     Data::Data(const object& value,
205     const Data& other)
206     {
207     //
208     // Create DataConstant using the given value and all other parameters
209     // copied from other. If value is a rank 0 object this Data
210     // will assume the point data shape of other.
211     DataArray temp(value);
212     if (temp.getView().getRank()==0) {
213     //
214     // Create a DataArray with the scalar value for all elements
215     DataArray temp2(other.getPointDataView().getShape(),temp.getView()());
216     initialise(temp2.getView(),other.getFunctionSpace(),false);
217     } else {
218     //
219     // Create a DataConstant with the same sample shape as other
220     initialise(temp.getView(),other.getFunctionSpace(),false);
221     }
222 gross 783 m_protected=false;
223 jgs 151 #if defined DOPROF
224 jgs 123 // create entry in global profiling table for this object
225     profData = dataProfTable.newData();
226 jgs 151 #endif
227 jgs 94 }
228    
229 jgs 151 Data::~Data()
230     {
231    
232     }
233    
234 jgs 94 escriptDataC
235     Data::getDataC()
236     {
237     escriptDataC temp;
238     temp.m_dataPtr=(void*)this;
239     return temp;
240     }
241    
242     escriptDataC
243     Data::getDataC() const
244     {
245     escriptDataC temp;
246     temp.m_dataPtr=(void*)this;
247     return temp;
248     }
249    
250 jgs 121 const boost::python::tuple
251 jgs 94 Data::getShapeTuple() const
252     {
253     const DataArrayView::ShapeType& shape=getDataPointShape();
254     switch(getDataPointRank()) {
255     case 0:
256     return make_tuple();
257     case 1:
258     return make_tuple(long_(shape[0]));
259     case 2:
260     return make_tuple(long_(shape[0]),long_(shape[1]));
261     case 3:
262     return make_tuple(long_(shape[0]),long_(shape[1]),long_(shape[2]));
263     case 4:
264     return make_tuple(long_(shape[0]),long_(shape[1]),long_(shape[2]),long_(shape[3]));
265     default:
266     throw DataException("Error - illegal Data rank.");
267     }
268     }
269    
270     void
271     Data::copy(const Data& other)
272     {
273     //
274     // Perform a deep copy
275     {
276     DataExpanded* temp=dynamic_cast<DataExpanded*>(other.m_data.get());
277     if (temp!=0) {
278     //
279     // Construct a DataExpanded copy
280     DataAbstract* newData=new DataExpanded(*temp);
281 jgs 102 shared_ptr<DataAbstract> temp_data(newData);
282     m_data=temp_data;
283 jgs 94 return;
284     }
285     }
286     {
287     DataTagged* temp=dynamic_cast<DataTagged*>(other.m_data.get());
288     if (temp!=0) {
289     //
290 jgs 102 // Construct a DataTagged copy
291 jgs 94 DataAbstract* newData=new DataTagged(*temp);
292 jgs 102 shared_ptr<DataAbstract> temp_data(newData);
293     m_data=temp_data;
294 jgs 94 return;
295     }
296     }
297     {
298     DataConstant* temp=dynamic_cast<DataConstant*>(other.m_data.get());
299     if (temp!=0) {
300     //
301     // Construct a DataConstant copy
302     DataAbstract* newData=new DataConstant(*temp);
303 jgs 102 shared_ptr<DataAbstract> temp_data(newData);
304     m_data=temp_data;
305 jgs 94 return;
306     }
307     }
308 jgs 102 {
309     DataEmpty* temp=dynamic_cast<DataEmpty*>(other.m_data.get());
310     if (temp!=0) {
311     //
312     // Construct a DataEmpty copy
313     DataAbstract* newData=new DataEmpty();
314     shared_ptr<DataAbstract> temp_data(newData);
315     m_data=temp_data;
316     return;
317     }
318     }
319 jgs 94 throw DataException("Error - Copy not implemented for this Data type.");
320     }
321    
322     void
323     Data::copyWithMask(const Data& other,
324     const Data& mask)
325     {
326     Data mask1;
327     Data mask2;
328    
329     mask1 = mask.wherePositive();
330     mask2.copy(mask1);
331    
332     mask1 *= other;
333     mask2 *= *this;
334     mask2 = *this - mask2;
335    
336     *this = mask1 + mask2;
337     }
338    
339     bool
340     Data::isExpanded() const
341     {
342     DataExpanded* temp=dynamic_cast<DataExpanded*>(m_data.get());
343     return (temp!=0);
344     }
345    
346     bool
347     Data::isTagged() const
348     {
349     DataTagged* temp=dynamic_cast<DataTagged*>(m_data.get());
350     return (temp!=0);
351     }
352    
353     bool
354     Data::isEmpty() const
355     {
356     DataEmpty* temp=dynamic_cast<DataEmpty*>(m_data.get());
357     return (temp!=0);
358     }
359    
360     bool
361     Data::isConstant() const
362     {
363     DataConstant* temp=dynamic_cast<DataConstant*>(m_data.get());
364     return (temp!=0);
365     }
366    
367     void
368 gross 783 Data::setProtection()
369     {
370     m_protected=true;
371     }
372    
373     bool
374     Data::isProtected() const
375     {
376     return m_protected;
377     }
378    
379    
380    
381     void
382 jgs 94 Data::expand()
383     {
384     if (isConstant()) {
385     DataConstant* tempDataConst=dynamic_cast<DataConstant*>(m_data.get());
386     DataAbstract* temp=new DataExpanded(*tempDataConst);
387 jgs 102 shared_ptr<DataAbstract> temp_data(temp);
388     m_data=temp_data;
389 jgs 94 } else if (isTagged()) {
390     DataTagged* tempDataTag=dynamic_cast<DataTagged*>(m_data.get());
391     DataAbstract* temp=new DataExpanded(*tempDataTag);
392 jgs 102 shared_ptr<DataAbstract> temp_data(temp);
393     m_data=temp_data;
394 jgs 94 } else if (isExpanded()) {
395     //
396     // do nothing
397     } else if (isEmpty()) {
398     throw DataException("Error - Expansion of DataEmpty not possible.");
399     } else {
400     throw DataException("Error - Expansion not implemented for this Data type.");
401     }
402     }
403    
404     void
405     Data::tag()
406     {
407     if (isConstant()) {
408     DataConstant* tempDataConst=dynamic_cast<DataConstant*>(m_data.get());
409     DataAbstract* temp=new DataTagged(*tempDataConst);
410 jgs 102 shared_ptr<DataAbstract> temp_data(temp);
411     m_data=temp_data;
412 jgs 94 } else if (isTagged()) {
413     // do nothing
414     } else if (isExpanded()) {
415     throw DataException("Error - Creating tag data from DataExpanded not possible.");
416     } else if (isEmpty()) {
417     throw DataException("Error - Creating tag data from DataEmpty not possible.");
418     } else {
419     throw DataException("Error - Tagging not implemented for this Data type.");
420     }
421     }
422    
423 gross 854 Data
424     Data::oneOver() const
425 jgs 102 {
426 gross 854 #if defined DOPROF
427     profData->where++;
428     #endif
429     return escript::unaryOp(*this,bind1st(divides<double>(),1.));
430 jgs 102 }
431    
432 jgs 94 Data
433 gross 698 Data::wherePositive() const
434 jgs 94 {
435 jgs 151 #if defined DOPROF
436 jgs 123 profData->where++;
437 jgs 151 #endif
438 gross 698 return escript::unaryOp(*this,bind2nd(greater<double>(),0.0));
439 jgs 94 }
440    
441     Data
442 gross 698 Data::whereNegative() const
443 jgs 102 {
444 jgs 151 #if defined DOPROF
445 jgs 123 profData->where++;
446 jgs 151 #endif
447 gross 698 return escript::unaryOp(*this,bind2nd(less<double>(),0.0));
448 jgs 102 }
449    
450     Data
451 gross 698 Data::whereNonNegative() const
452 jgs 94 {
453 jgs 151 #if defined DOPROF
454 jgs 123 profData->where++;
455 jgs 151 #endif
456 gross 698 return escript::unaryOp(*this,bind2nd(greater_equal<double>(),0.0));
457 jgs 94 }
458    
459     Data
460 gross 698 Data::whereNonPositive() const
461 jgs 94 {
462 jgs 151 #if defined DOPROF
463 jgs 123 profData->where++;
464 jgs 151 #endif
465 gross 698 return escript::unaryOp(*this,bind2nd(less_equal<double>(),0.0));
466 jgs 94 }
467    
468     Data
469 jgs 571 Data::whereZero(double tol) const
470 jgs 94 {
471 jgs 151 #if defined DOPROF
472 jgs 123 profData->where++;
473 jgs 151 #endif
474 jgs 571 Data dataAbs=abs();
475     return escript::unaryOp(dataAbs,bind2nd(less_equal<double>(),tol));
476 jgs 94 }
477    
478     Data
479 jgs 571 Data::whereNonZero(double tol) const
480 jgs 102 {
481 jgs 151 #if defined DOPROF
482 jgs 123 profData->where++;
483 jgs 151 #endif
484 jgs 571 Data dataAbs=abs();
485     return escript::unaryOp(dataAbs,bind2nd(greater<double>(),tol));
486 jgs 102 }
487    
488     Data
489 jgs 94 Data::interpolate(const FunctionSpace& functionspace) const
490     {
491 jgs 151 #if defined DOPROF
492 jgs 123 profData->interpolate++;
493 jgs 151 #endif
494 jgs 94 return Data(*this,functionspace);
495     }
496    
497     bool
498     Data::probeInterpolation(const FunctionSpace& functionspace) const
499     {
500     if (getFunctionSpace()==functionspace) {
501     return true;
502     } else {
503     const AbstractDomain& domain=getDomain();
504     if (domain==functionspace.getDomain()) {
505     return domain.probeInterpolationOnDomain(getFunctionSpace().getTypeCode(),functionspace.getTypeCode());
506     } else {
507     return domain.probeInterpolationACross(getFunctionSpace().getTypeCode(),functionspace.getDomain(),functionspace.getTypeCode());
508     }
509     }
510     }
511    
512     Data
513     Data::gradOn(const FunctionSpace& functionspace) const
514     {
515 jgs 151 #if defined DOPROF
516 jgs 123 profData->grad++;
517 jgs 151 #endif
518 jgs 94 if (functionspace.getDomain()!=getDomain())
519     throw DataException("Error - gradient cannot be calculated on different domains.");
520     DataArrayView::ShapeType grad_shape=getPointDataView().getShape();
521     grad_shape.push_back(functionspace.getDim());
522     Data out(0.0,grad_shape,functionspace,true);
523     getDomain().setToGradient(out,*this);
524     return out;
525     }
526    
527     Data
528     Data::grad() const
529     {
530     return gradOn(escript::function(getDomain()));
531     }
532    
533     int
534     Data::getDataPointSize() const
535     {
536     return getPointDataView().noValues();
537     }
538    
539     DataArrayView::ValueType::size_type
540     Data::getLength() const
541     {
542     return m_data->getLength();
543     }
544    
545     const DataArrayView::ShapeType&
546     Data::getDataPointShape() const
547     {
548     return getPointDataView().getShape();
549     }
550    
551 gross 921
552    
553 jgs 126 void
554     Data::fillFromNumArray(const boost::python::numeric::array num_array)
555     {
556 gross 783 if (isProtected()) {
557     throw DataException("Error - attempt to update protected Data object.");
558     }
559 jgs 126 //
560 jgs 149 // check rank
561 jgs 126 if (num_array.getrank()<getDataPointRank())
562     throw DataException("Rank of numarray does not match Data object rank");
563 jgs 149
564 jgs 126 //
565 jgs 149 // check shape of num_array
566 jgs 126 for (int i=0; i<getDataPointRank(); i++) {
567     if (extract<int>(num_array.getshape()[i+1])!=getDataPointShape()[i])
568     throw DataException("Shape of numarray does not match Data object rank");
569     }
570 jgs 149
571 jgs 126 //
572     // make sure data is expanded:
573 jgs 149 if (!isExpanded()) {
574     expand();
575     }
576    
577 jgs 126 //
578 jgs 149 // and copy over
579 jgs 126 m_data->copyAll(num_array);
580     }
581    
582 jgs 121 const
583 jgs 94 boost::python::numeric::array
584 jgs 117 Data::convertToNumArray()
585     {
586     //
587 jgs 121 // determine the total number of data points
588 jgs 117 int numSamples = getNumSamples();
589     int numDataPointsPerSample = getNumDataPointsPerSample();
590     int numDataPoints = numSamples * numDataPointsPerSample;
591    
592     //
593     // determine the rank and shape of each data point
594     int dataPointRank = getDataPointRank();
595     DataArrayView::ShapeType dataPointShape = getDataPointShape();
596    
597     //
598     // create the numeric array to be returned
599     boost::python::numeric::array numArray(0.0);
600    
601     //
602     // the rank of the returned numeric array will be the rank of
603     // the data points, plus one. Where the rank of the array is n,
604     // the last n-1 dimensions will be equal to the shape of the
605     // data points, whilst the first dimension will be equal to the
606     // total number of data points. Thus the array will consist of
607     // a serial vector of the data points.
608     int arrayRank = dataPointRank + 1;
609     DataArrayView::ShapeType arrayShape;
610     arrayShape.push_back(numDataPoints);
611     for (int d=0; d<dataPointRank; d++) {
612     arrayShape.push_back(dataPointShape[d]);
613     }
614    
615     //
616     // resize the numeric array to the shape just calculated
617     if (arrayRank==1) {
618     numArray.resize(arrayShape[0]);
619     }
620     if (arrayRank==2) {
621     numArray.resize(arrayShape[0],arrayShape[1]);
622     }
623     if (arrayRank==3) {
624     numArray.resize(arrayShape[0],arrayShape[1],arrayShape[2]);
625     }
626     if (arrayRank==4) {
627     numArray.resize(arrayShape[0],arrayShape[1],arrayShape[2],arrayShape[3]);
628     }
629     if (arrayRank==5) {
630     numArray.resize(arrayShape[0],arrayShape[1],arrayShape[2],arrayShape[3],arrayShape[4]);
631     }
632    
633     //
634     // loop through each data point in turn, loading the values for that data point
635     // into the numeric array.
636     int dataPoint = 0;
637     for (int sampleNo = 0; sampleNo < numSamples; sampleNo++) {
638     for (int dataPointNo = 0; dataPointNo < numDataPointsPerSample; dataPointNo++) {
639     DataArrayView dataPointView = getDataPoint(sampleNo, dataPointNo);
640     if (dataPointRank==0) {
641     numArray[dataPoint]=dataPointView();
642     }
643     if (dataPointRank==1) {
644     for (int i=0; i<dataPointShape[0]; i++) {
645 gross 921 numArray[make_tuple(dataPoint,i)]=dataPointView(i);
646 jgs 117 }
647     }
648     if (dataPointRank==2) {
649     for (int i=0; i<dataPointShape[0]; i++) {
650     for (int j=0; j<dataPointShape[1]; j++) {
651 gross 921 numArray[make_tuple(dataPoint,i,j)] = dataPointView(i,j);
652 jgs 117 }
653     }
654     }
655     if (dataPointRank==3) {
656     for (int i=0; i<dataPointShape[0]; i++) {
657     for (int j=0; j<dataPointShape[1]; j++) {
658     for (int k=0; k<dataPointShape[2]; k++) {
659 gross 921 numArray[make_tuple(dataPoint,i,j,k)]=dataPointView(i,j,k);
660 jgs 117 }
661     }
662     }
663     }
664     if (dataPointRank==4) {
665     for (int i=0; i<dataPointShape[0]; i++) {
666     for (int j=0; j<dataPointShape[1]; j++) {
667     for (int k=0; k<dataPointShape[2]; k++) {
668     for (int l=0; l<dataPointShape[3]; l++) {
669 gross 921 numArray[make_tuple(dataPoint,i,j,k,l)]=dataPointView(i,j,k,l);
670 jgs 117 }
671     }
672     }
673     }
674     }
675     dataPoint++;
676 jgs 121 }
677     }
678 jgs 117
679 jgs 121 //
680     // return the loaded array
681     return numArray;
682     }
683    
684 gross 921
685     const
686 jgs 121 boost::python::numeric::array
687 gross 921 Data:: getValueOfDataPoint(int dataPointNo)
688 jgs 121 {
689 gross 921 size_t length=0;
690     int i, j, k, l;
691 jgs 121 //
692     // determine the rank and shape of each data point
693     int dataPointRank = getDataPointRank();
694     DataArrayView::ShapeType dataPointShape = getDataPointShape();
695    
696     //
697     // create the numeric array to be returned
698     boost::python::numeric::array numArray(0.0);
699    
700     //
701 gross 921 // the shape of the returned numeric array will be the same
702     // as that of the data point
703     int arrayRank = dataPointRank;
704     DataArrayView::ShapeType arrayShape = dataPointShape;
705 jgs 121
706     //
707     // resize the numeric array to the shape just calculated
708 gross 921 if (arrayRank==0) {
709     numArray.resize(1);
710     }
711 jgs 121 if (arrayRank==1) {
712     numArray.resize(arrayShape[0]);
713     }
714     if (arrayRank==2) {
715     numArray.resize(arrayShape[0],arrayShape[1]);
716     }
717     if (arrayRank==3) {
718     numArray.resize(arrayShape[0],arrayShape[1],arrayShape[2]);
719     }
720     if (arrayRank==4) {
721     numArray.resize(arrayShape[0],arrayShape[1],arrayShape[2],arrayShape[3]);
722     }
723    
724 gross 921 if (getNumDataPointsPerSample()>0) {
725     int sampleNo = dataPointNo/getNumDataPointsPerSample();
726     int dataPointNoInSample = dataPointNo - sampleNo * getNumDataPointsPerSample();
727     //
728     // Check a valid sample number has been supplied
729     if (sampleNo >= getNumSamples() or sampleNo < 0 ) {
730     throw DataException("Error - Data::convertToNumArray: invalid sampleNo.");
731     }
732    
733     //
734     // Check a valid data point number has been supplied
735     if (dataPointNoInSample >= getNumDataPointsPerSample() or dataPointNoInSample < 0) {
736     throw DataException("Error - Data::convertToNumArray: invalid dataPointNoInSample.");
737     }
738     // TODO: global error handling
739     // create a view of the data if it is stored locally
740     DataArrayView dataPointView = getDataPoint(sampleNo, dataPointNoInSample);
741    
742     switch( dataPointRank ){
743     case 0 :
744     numArray[0] = dataPointView();
745     break;
746     case 1 :
747     for( i=0; i<dataPointShape[0]; i++ )
748     numArray[i]=dataPointView(i);
749     break;
750     case 2 :
751     for( i=0; i<dataPointShape[0]; i++ )
752     for( j=0; j<dataPointShape[1]; j++)
753     numArray[make_tuple(i,j)]=dataPointView(i,j);
754     break;
755     case 3 :
756     for( i=0; i<dataPointShape[0]; i++ )
757     for( j=0; j<dataPointShape[1]; j++ )
758     for( k=0; k<dataPointShape[2]; k++)
759     numArray[make_tuple(i,j,k)]=dataPointView(i,j,k);
760     break;
761     case 4 :
762     for( i=0; i<dataPointShape[0]; i++ )
763     for( j=0; j<dataPointShape[1]; j++ )
764     for( k=0; k<dataPointShape[2]; k++ )
765     for( l=0; l<dataPointShape[3]; l++)
766     numArray[make_tuple(i,j,k,l)]=dataPointView(i,j,k,l);
767     break;
768     }
769 jgs 117 }
770     //
771 gross 921 // return the array
772 jgs 117 return numArray;
773 gross 921
774 jgs 117 }
775 gross 921 void
776 gross 922 Data::setValueOfDataPointToArray(int dataPointNo, const boost::python::numeric::array num_array)
777 jgs 121 {
778 gross 921 if (isProtected()) {
779     throw DataException("Error - attempt to update protected Data object.");
780     }
781     //
782     // check rank
783     if (num_array.getrank()<getDataPointRank())
784     throw DataException("Rank of numarray does not match Data object rank");
785 bcumming 790
786 jgs 121 //
787 gross 921 // check shape of num_array
788     for (int i=0; i<getDataPointRank(); i++) {
789     if (extract<int>(num_array.getshape()[i])!=getDataPointShape()[i])
790     throw DataException("Shape of numarray does not match Data object rank");
791 jgs 121 }
792     //
793 gross 921 // make sure data is expanded:
794     if (!isExpanded()) {
795     expand();
796 jgs 121 }
797 gross 921 if (getNumDataPointsPerSample()>0) {
798     int sampleNo = dataPointNo/getNumDataPointsPerSample();
799     int dataPointNoInSample = dataPointNo - sampleNo * getNumDataPointsPerSample();
800     m_data->copyToDataPoint(sampleNo, dataPointNoInSample,num_array);
801     } else {
802     m_data->copyToDataPoint(-1, 0,num_array);
803     }
804     }
805 jgs 121
806 gross 922 void
807     Data::setValueOfDataPoint(int dataPointNo, const double value)
808     {
809     if (isProtected()) {
810     throw DataException("Error - attempt to update protected Data object.");
811     }
812     //
813     // make sure data is expanded:
814     if (!isExpanded()) {
815     expand();
816     }
817     if (getNumDataPointsPerSample()>0) {
818     int sampleNo = dataPointNo/getNumDataPointsPerSample();
819     int dataPointNoInSample = dataPointNo - sampleNo * getNumDataPointsPerSample();
820     m_data->copyToDataPoint(sampleNo, dataPointNoInSample,value);
821     } else {
822     m_data->copyToDataPoint(-1, 0,value);
823     }
824     }
825    
826 gross 921 const
827     boost::python::numeric::array
828     Data::getValueOfGlobalDataPoint(int procNo, int dataPointNo)
829     {
830     size_t length=0;
831     int i, j, k, l, pos;
832 jgs 121 //
833     // determine the rank and shape of each data point
834     int dataPointRank = getDataPointRank();
835     DataArrayView::ShapeType dataPointShape = getDataPointShape();
836    
837     //
838     // create the numeric array to be returned
839     boost::python::numeric::array numArray(0.0);
840    
841     //
842     // the shape of the returned numeric array will be the same
843     // as that of the data point
844     int arrayRank = dataPointRank;
845     DataArrayView::ShapeType arrayShape = dataPointShape;
846    
847     //
848     // resize the numeric array to the shape just calculated
849     if (arrayRank==0) {
850     numArray.resize(1);
851     }
852     if (arrayRank==1) {
853     numArray.resize(arrayShape[0]);
854     }
855     if (arrayRank==2) {
856     numArray.resize(arrayShape[0],arrayShape[1]);
857     }
858     if (arrayRank==3) {
859     numArray.resize(arrayShape[0],arrayShape[1],arrayShape[2]);
860     }
861     if (arrayRank==4) {
862     numArray.resize(arrayShape[0],arrayShape[1],arrayShape[2],arrayShape[3]);
863     }
864    
865 gross 921 // added for the MPI communication
866     length=1;
867     for( i=0; i<arrayRank; i++ ) length *= arrayShape[i];
868     double *tmpData = new double[length];
869 bcumming 790
870 jgs 121 //
871     // load the values for the data point into the numeric array.
872 bcumming 790
873     // updated for the MPI case
874     if( get_MPIRank()==procNo ){
875 gross 921 if (getNumDataPointsPerSample()>0) {
876     int sampleNo = dataPointNo/getNumDataPointsPerSample();
877     int dataPointNoInSample = dataPointNo - sampleNo * getNumDataPointsPerSample();
878     //
879     // Check a valid sample number has been supplied
880     if (sampleNo >= getNumSamples() or sampleNo < 0 ) {
881     throw DataException("Error - Data::convertToNumArray: invalid sampleNo.");
882     }
883    
884     //
885     // Check a valid data point number has been supplied
886     if (dataPointNoInSample >= getNumDataPointsPerSample() or dataPointNoInSample < 0) {
887     throw DataException("Error - Data::convertToNumArray: invalid dataPointNoInSample.");
888     }
889     // TODO: global error handling
890 bcumming 790 // create a view of the data if it is stored locally
891 gross 921 DataArrayView dataPointView = getDataPoint(sampleNo, dataPointNoInSample);
892 bcumming 790
893     // pack the data from the view into tmpData for MPI communication
894     pos=0;
895     switch( dataPointRank ){
896     case 0 :
897     tmpData[0] = dataPointView();
898     break;
899     case 1 :
900     for( i=0; i<dataPointShape[0]; i++ )
901     tmpData[i]=dataPointView(i);
902     break;
903     case 2 :
904     for( i=0; i<dataPointShape[0]; i++ )
905     for( j=0; j<dataPointShape[1]; j++, pos++ )
906     tmpData[pos]=dataPointView(i,j);
907     break;
908     case 3 :
909     for( i=0; i<dataPointShape[0]; i++ )
910     for( j=0; j<dataPointShape[1]; j++ )
911     for( k=0; k<dataPointShape[2]; k++, pos++ )
912     tmpData[pos]=dataPointView(i,j,k);
913     break;
914     case 4 :
915     for( i=0; i<dataPointShape[0]; i++ )
916     for( j=0; j<dataPointShape[1]; j++ )
917     for( k=0; k<dataPointShape[2]; k++ )
918     for( l=0; l<dataPointShape[3]; l++, pos++ )
919     tmpData[pos]=dataPointView(i,j,k,l);
920     break;
921     }
922 gross 921 }
923 bcumming 790 }
924 gross 921 #ifdef PASO_MPI
925     // broadcast the data to all other processes
926     MPI_Bcast( tmpData, length, MPI_DOUBLE, procNo, get_MPIComm() );
927     #endif
928 bcumming 790
929     // unpack the data
930     switch( dataPointRank ){
931     case 0 :
932 gross 921 numArray[0]=tmpData[0];
933 bcumming 790 break;
934     case 1 :
935     for( i=0; i<dataPointShape[0]; i++ )
936     numArray[i]=tmpData[i];
937     break;
938     case 2 :
939     for( i=0; i<dataPointShape[0]; i++ )
940     for( j=0; j<dataPointShape[1]; j++ )
941 gross 921 numArray[make_tuple(i,j)]=tmpData[i+j*dataPointShape[0]];
942 bcumming 790 break;
943     case 3 :
944     for( i=0; i<dataPointShape[0]; i++ )
945     for( j=0; j<dataPointShape[1]; j++ )
946     for( k=0; k<dataPointShape[2]; k++ )
947 gross 921 numArray[make_tuple(i,j,k)]=tmpData[i+dataPointShape[0]*(j*+k*dataPointShape[1])];
948 bcumming 790 break;
949     case 4 :
950     for( i=0; i<dataPointShape[0]; i++ )
951     for( j=0; j<dataPointShape[1]; j++ )
952     for( k=0; k<dataPointShape[2]; k++ )
953     for( l=0; l<dataPointShape[3]; l++ )
954 gross 921 numArray[make_tuple(i,j,k,l)]=tmpData[i+dataPointShape[0]*(j*+dataPointShape[1]*(k+l*dataPointShape[2]))];
955 bcumming 790 break;
956     }
957    
958     delete [] tmpData;
959 jgs 121 //
960     // return the loaded array
961     return numArray;
962     }
963    
964 gross 921
965    
966 jgs 121 boost::python::numeric::array
967 jgs 94 Data::integrate() const
968     {
969     int index;
970     int rank = getDataPointRank();
971     DataArrayView::ShapeType shape = getDataPointShape();
972    
973 jgs 151 #if defined DOPROF
974 jgs 123 profData->integrate++;
975 jgs 151 #endif
976 jgs 123
977 jgs 94 //
978     // calculate the integral values
979     vector<double> integrals(getDataPointSize());
980     AbstractContinuousDomain::asAbstractContinuousDomain(getDomain()).setToIntegrals(integrals,*this);
981    
982     //
983     // create the numeric array to be returned
984     // and load the array with the integral values
985     boost::python::numeric::array bp_array(1.0);
986     if (rank==0) {
987 jgs 108 bp_array.resize(1);
988 jgs 94 index = 0;
989     bp_array[0] = integrals[index];
990     }
991     if (rank==1) {
992     bp_array.resize(shape[0]);
993     for (int i=0; i<shape[0]; i++) {
994     index = i;
995     bp_array[i] = integrals[index];
996     }
997     }
998     if (rank==2) {
999 gross 436 bp_array.resize(shape[0],shape[1]);
1000     for (int i=0; i<shape[0]; i++) {
1001     for (int j=0; j<shape[1]; j++) {
1002     index = i + shape[0] * j;
1003     bp_array[make_tuple(i,j)] = integrals[index];
1004     }
1005     }
1006 jgs 94 }
1007     if (rank==3) {
1008     bp_array.resize(shape[0],shape[1],shape[2]);
1009     for (int i=0; i<shape[0]; i++) {
1010     for (int j=0; j<shape[1]; j++) {
1011     for (int k=0; k<shape[2]; k++) {
1012     index = i + shape[0] * ( j + shape[1] * k );
1013 gross 436 bp_array[make_tuple(i,j,k)] = integrals[index];
1014 jgs 94 }
1015     }
1016     }
1017     }
1018     if (rank==4) {
1019     bp_array.resize(shape[0],shape[1],shape[2],shape[3]);
1020     for (int i=0; i<shape[0]; i++) {
1021     for (int j=0; j<shape[1]; j++) {
1022     for (int k=0; k<shape[2]; k++) {
1023     for (int l=0; l<shape[3]; l++) {
1024     index = i + shape[0] * ( j + shape[1] * ( k + shape[2] * l ) );
1025 gross 436 bp_array[make_tuple(i,j,k,l)] = integrals[index];
1026 jgs 94 }
1027     }
1028     }
1029     }
1030     }
1031    
1032     //
1033     // return the loaded array
1034     return bp_array;
1035     }
1036    
1037     Data
1038 ksteube 876 Data::erf() const
1039     {
1040     #if defined DOPROF
1041     profData->unary++;
1042     #endif
1043     return escript::unaryOp(*this,(Data::UnaryDFunPtr)::erf);
1044     }
1045    
1046     Data
1047 jgs 94 Data::sin() const
1048     {
1049 jgs 151 #if defined DOPROF
1050 jgs 123 profData->unary++;
1051 jgs 151 #endif
1052 jgs 94 return escript::unaryOp(*this,(Data::UnaryDFunPtr)::sin);
1053     }
1054    
1055     Data
1056     Data::cos() const
1057     {
1058 jgs 151 #if defined DOPROF
1059 jgs 123 profData->unary++;
1060 jgs 151 #endif
1061 jgs 94 return escript::unaryOp(*this,(Data::UnaryDFunPtr)::cos);
1062     }
1063    
1064     Data
1065     Data::tan() const
1066     {
1067 jgs 151 #if defined DOPROF
1068 jgs 123 profData->unary++;
1069 jgs 151 #endif
1070 jgs 94 return escript::unaryOp(*this,(Data::UnaryDFunPtr)::tan);
1071     }
1072    
1073     Data
1074 jgs 150 Data::asin() const
1075     {
1076 jgs 151 #if defined DOPROF
1077 jgs 150 profData->unary++;
1078 jgs 151 #endif
1079 jgs 150 return escript::unaryOp(*this,(Data::UnaryDFunPtr)::asin);
1080     }
1081    
1082     Data
1083     Data::acos() const
1084     {
1085 jgs 151 #if defined DOPROF
1086 jgs 150 profData->unary++;
1087 jgs 151 #endif
1088 jgs 150 return escript::unaryOp(*this,(Data::UnaryDFunPtr)::acos);
1089     }
1090    
1091     Data
1092     Data::atan() const
1093     {
1094 jgs 151 #if defined DOPROF
1095 jgs 150 profData->unary++;
1096 jgs 151 #endif
1097 jgs 150 return escript::unaryOp(*this,(Data::UnaryDFunPtr)::atan);
1098     }
1099    
1100     Data
1101     Data::sinh() const
1102     {
1103 jgs 151 #if defined DOPROF
1104 jgs 150 profData->unary++;
1105 jgs 151 #endif
1106 jgs 150 return escript::unaryOp(*this,(Data::UnaryDFunPtr)::sinh);
1107     }
1108    
1109     Data
1110     Data::cosh() const
1111     {
1112 jgs 151 #if defined DOPROF
1113 jgs 150 profData->unary++;
1114 jgs 151 #endif
1115 jgs 150 return escript::unaryOp(*this,(Data::UnaryDFunPtr)::cosh);
1116     }
1117    
1118     Data
1119     Data::tanh() const
1120     {
1121 jgs 151 #if defined DOPROF
1122 jgs 150 profData->unary++;
1123 jgs 151 #endif
1124 jgs 150 return escript::unaryOp(*this,(Data::UnaryDFunPtr)::tanh);
1125     }
1126    
1127     Data
1128     Data::asinh() const
1129     {
1130 jgs 151 #if defined DOPROF
1131 jgs 150 profData->unary++;
1132 jgs 151 #endif
1133 jgs 150 return escript::unaryOp(*this,(Data::UnaryDFunPtr)::asinh);
1134     }
1135    
1136     Data
1137     Data::acosh() const
1138     {
1139 jgs 151 #if defined DOPROF
1140 jgs 150 profData->unary++;
1141 jgs 151 #endif
1142 jgs 150 return escript::unaryOp(*this,(Data::UnaryDFunPtr)::acosh);
1143     }
1144    
1145     Data
1146     Data::atanh() const
1147     {
1148 jgs 151 #if defined DOPROF
1149 jgs 150 profData->unary++;
1150 jgs 151 #endif
1151 jgs 150 return escript::unaryOp(*this,(Data::UnaryDFunPtr)::atanh);
1152     }
1153    
1154     Data
1155 gross 286 Data::log10() const
1156 jgs 94 {
1157 jgs 151 #if defined DOPROF
1158 jgs 123 profData->unary++;
1159 jgs 151 #endif
1160 jgs 94 return escript::unaryOp(*this,(Data::UnaryDFunPtr)::log10);
1161     }
1162    
1163     Data
1164 gross 286 Data::log() const
1165 jgs 94 {
1166 jgs 151 #if defined DOPROF
1167 jgs 123 profData->unary++;
1168 jgs 151 #endif
1169 jgs 94 return escript::unaryOp(*this,(Data::UnaryDFunPtr)::log);
1170     }
1171    
1172 jgs 106 Data
1173     Data::sign() const
1174 jgs 94 {
1175 jgs 151 #if defined DOPROF
1176 jgs 123 profData->unary++;
1177 jgs 151 #endif
1178 jgs 106 return escript::unaryOp(*this,escript::fsign);
1179 jgs 94 }
1180    
1181 jgs 106 Data
1182     Data::abs() const
1183 jgs 94 {
1184 jgs 151 #if defined DOPROF
1185 jgs 123 profData->unary++;
1186 jgs 151 #endif
1187 jgs 106 return escript::unaryOp(*this,(Data::UnaryDFunPtr)::fabs);
1188 jgs 94 }
1189    
1190 jgs 106 Data
1191     Data::neg() const
1192 jgs 94 {
1193 jgs 151 #if defined DOPROF
1194 jgs 123 profData->unary++;
1195 jgs 151 #endif
1196 jgs 106 return escript::unaryOp(*this,negate<double>());
1197 jgs 94 }
1198    
1199 jgs 102 Data
1200 jgs 106 Data::pos() const
1201 jgs 94 {
1202 jgs 151 #if defined DOPROF
1203 jgs 123 profData->unary++;
1204 jgs 151 #endif
1205 jgs 148 Data result;
1206     // perform a deep copy
1207     result.copy(*this);
1208     return result;
1209 jgs 102 }
1210    
1211     Data
1212 jgs 106 Data::exp() const
1213 jgs 102 {
1214 jgs 151 #if defined DOPROF
1215 jgs 123 profData->unary++;
1216 jgs 151 #endif
1217 jgs 106 return escript::unaryOp(*this,(Data::UnaryDFunPtr)::exp);
1218 jgs 102 }
1219    
1220     Data
1221 jgs 106 Data::sqrt() const
1222 jgs 102 {
1223 jgs 151 #if defined DOPROF
1224 jgs 123 profData->unary++;
1225 jgs 151 #endif
1226 jgs 106 return escript::unaryOp(*this,(Data::UnaryDFunPtr)::sqrt);
1227 jgs 102 }
1228    
1229 jgs 106 double
1230     Data::Lsup() const
1231 jgs 102 {
1232 bcumming 751 double localValue, globalValue;
1233 jgs 151 #if defined DOPROF
1234 jgs 123 profData->reduction1++;
1235 jgs 151 #endif
1236 jgs 106 //
1237     // set the initial absolute maximum value to zero
1238 bcumming 751
1239 jgs 147 AbsMax abs_max_func;
1240 bcumming 751 localValue = algorithm(abs_max_func,0);
1241     #ifdef PASO_MPI
1242     MPI_Allreduce( &localValue, &globalValue, 1, MPI_DOUBLE, MPI_MAX, MPI_COMM_WORLD );
1243     return globalValue;
1244     #else
1245     return localValue;
1246     #endif
1247 jgs 102 }
1248    
1249 jgs 106 double
1250 jgs 117 Data::Linf() const
1251     {
1252 bcumming 751 double localValue, globalValue;
1253 jgs 151 #if defined DOPROF
1254 jgs 123 profData->reduction1++;
1255 jgs 151 #endif
1256 jgs 117 //
1257     // set the initial absolute minimum value to max double
1258 jgs 147 AbsMin abs_min_func;
1259 bcumming 751 localValue = algorithm(abs_min_func,numeric_limits<double>::max());
1260    
1261     #ifdef PASO_MPI
1262     MPI_Allreduce( &localValue, &globalValue, 1, MPI_DOUBLE, MPI_MIN, MPI_COMM_WORLD );
1263     return globalValue;
1264     #else
1265     return localValue;
1266     #endif
1267 jgs 117 }
1268    
1269     double
1270 jgs 106 Data::sup() const
1271 jgs 102 {
1272 bcumming 751 double localValue, globalValue;
1273 jgs 151 #if defined DOPROF
1274 jgs 123 profData->reduction1++;
1275 jgs 151 #endif
1276 jgs 106 //
1277     // set the initial maximum value to min possible double
1278 jgs 147 FMax fmax_func;
1279 bcumming 751 localValue = algorithm(fmax_func,numeric_limits<double>::max()*-1);
1280     #ifdef PASO_MPI
1281     MPI_Allreduce( &localValue, &globalValue, 1, MPI_DOUBLE, MPI_MAX, MPI_COMM_WORLD );
1282     return globalValue;
1283     #else
1284     return localValue;
1285     #endif
1286 jgs 102 }
1287    
1288 jgs 106 double
1289     Data::inf() const
1290 jgs 102 {
1291 bcumming 751 double localValue, globalValue;
1292 jgs 151 #if defined DOPROF
1293 jgs 123 profData->reduction1++;
1294 jgs 151 #endif
1295 jgs 106 //
1296     // set the initial minimum value to max possible double
1297 jgs 147 FMin fmin_func;
1298 bcumming 751 localValue = algorithm(fmin_func,numeric_limits<double>::max());
1299     #ifdef PASO_MPI
1300     MPI_Allreduce( &localValue, &globalValue, 1, MPI_DOUBLE, MPI_MIN, MPI_COMM_WORLD );
1301     return globalValue;
1302     #else
1303     return localValue;
1304     #endif
1305 jgs 102 }
1306    
1307 bcumming 751 /* TODO */
1308     /* global reduction */
1309 jgs 102 Data
1310 jgs 106 Data::maxval() const
1311 jgs 102 {
1312 jgs 151 #if defined DOPROF
1313 jgs 123 profData->reduction2++;
1314 jgs 151 #endif
1315 jgs 113 //
1316     // set the initial maximum value to min possible double
1317 jgs 147 FMax fmax_func;
1318     return dp_algorithm(fmax_func,numeric_limits<double>::max()*-1);
1319 jgs 102 }
1320    
1321     Data
1322 jgs 106 Data::minval() const
1323 jgs 102 {
1324 jgs 151 #if defined DOPROF
1325 jgs 123 profData->reduction2++;
1326 jgs 151 #endif
1327 jgs 113 //
1328     // set the initial minimum value to max possible double
1329 jgs 147 FMin fmin_func;
1330     return dp_algorithm(fmin_func,numeric_limits<double>::max());
1331 jgs 102 }
1332    
1333 jgs 123 Data
1334 gross 804 Data::swapaxes(const int axis0, const int axis1) const
1335 jgs 123 {
1336 gross 804 int axis0_tmp,axis1_tmp;
1337 gross 800 #if defined DOPROF
1338     profData->unary++;
1339     #endif
1340     DataArrayView::ShapeType s=getDataPointShape();
1341     DataArrayView::ShapeType ev_shape;
1342     // Here's the equivalent of python s_out=s[axis_offset:]+s[:axis_offset]
1343     // which goes thru all shape vector elements starting with axis_offset (at index=rank wrap around to 0)
1344     int rank=getDataPointRank();
1345 gross 804 if (rank<2) {
1346     throw DataException("Error - Data::swapaxes argument must have at least rank 2.");
1347 gross 800 }
1348 gross 804 if (axis0<0 || axis0>rank-1) {
1349     throw DataException("Error - Data::swapaxes: axis0 must be between 0 and rank-1=" + rank-1);
1350     }
1351     if (axis1<0 || axis1>rank-1) {
1352     throw DataException("Error - Data::swapaxes: axis1 must be between 0 and rank-1=" + rank-1);
1353     }
1354     if (axis0 == axis1) {
1355     throw DataException("Error - Data::swapaxes: axis indices must be different.");
1356     }
1357     if (axis0 > axis1) {
1358     axis0_tmp=axis1;
1359     axis1_tmp=axis0;
1360     } else {
1361     axis0_tmp=axis0;
1362     axis1_tmp=axis1;
1363     }
1364 gross 800 for (int i=0; i<rank; i++) {
1365 gross 804 if (i == axis0_tmp) {
1366     ev_shape.push_back(s[axis1_tmp]);
1367     } else if (i == axis1_tmp) {
1368     ev_shape.push_back(s[axis0_tmp]);
1369 gross 800 } else {
1370     ev_shape.push_back(s[i]);
1371     }
1372     }
1373     Data ev(0.,ev_shape,getFunctionSpace());
1374     ev.typeMatchRight(*this);
1375 gross 804 m_data->swapaxes(ev.m_data.get(), axis0_tmp, axis1_tmp);
1376 gross 800 return ev;
1377    
1378 jgs 123 }
1379    
1380     Data
1381 ksteube 775 Data::symmetric() const
1382 jgs 123 {
1383 ksteube 775 #if defined DOPROF
1384     profData->unary++;
1385     #endif
1386     // check input
1387     DataArrayView::ShapeType s=getDataPointShape();
1388     if (getDataPointRank()==2) {
1389     if(s[0] != s[1])
1390     throw DataException("Error - Data::symmetric can only be calculated for rank 2 object with equal first and second dimension.");
1391     }
1392     else if (getDataPointRank()==4) {
1393     if(!(s[0] == s[2] && s[1] == s[3]))
1394     throw DataException("Error - Data::symmetric can only be calculated for rank 4 object with dim0==dim2 and dim1==dim3.");
1395     }
1396     else {
1397     throw DataException("Error - Data::symmetric can only be calculated for rank 2 or 4 object.");
1398     }
1399     Data ev(0.,getDataPointShape(),getFunctionSpace());
1400     ev.typeMatchRight(*this);
1401     m_data->symmetric(ev.m_data.get());
1402     return ev;
1403     }
1404    
1405     Data
1406     Data::nonsymmetric() const
1407     {
1408     #if defined DOPROF
1409     profData->unary++;
1410     #endif
1411     // check input
1412     DataArrayView::ShapeType s=getDataPointShape();
1413     if (getDataPointRank()==2) {
1414     if(s[0] != s[1])
1415     throw DataException("Error - Data::nonsymmetric can only be calculated for rank 2 object with equal first and second dimension.");
1416     DataArrayView::ShapeType ev_shape;
1417     ev_shape.push_back(s[0]);
1418     ev_shape.push_back(s[1]);
1419     Data ev(0.,ev_shape,getFunctionSpace());
1420     ev.typeMatchRight(*this);
1421     m_data->nonsymmetric(ev.m_data.get());
1422     return ev;
1423     }
1424     else if (getDataPointRank()==4) {
1425     if(!(s[0] == s[2] && s[1] == s[3]))
1426     throw DataException("Error - Data::nonsymmetric can only be calculated for rank 4 object with dim0==dim2 and dim1==dim3.");
1427     DataArrayView::ShapeType ev_shape;
1428     ev_shape.push_back(s[0]);
1429     ev_shape.push_back(s[1]);
1430     ev_shape.push_back(s[2]);
1431     ev_shape.push_back(s[3]);
1432     Data ev(0.,ev_shape,getFunctionSpace());
1433     ev.typeMatchRight(*this);
1434     m_data->nonsymmetric(ev.m_data.get());
1435     return ev;
1436     }
1437     else {
1438     throw DataException("Error - Data::nonsymmetric can only be calculated for rank 2 or 4 object.");
1439     }
1440     }
1441    
1442     Data
1443 gross 800 Data::trace(int axis_offset) const
1444 ksteube 775 {
1445     #if defined DOPROF
1446     profData->unary++;
1447     #endif
1448     DataArrayView::ShapeType s=getDataPointShape();
1449     if (getDataPointRank()==2) {
1450     DataArrayView::ShapeType ev_shape;
1451     Data ev(0.,ev_shape,getFunctionSpace());
1452     ev.typeMatchRight(*this);
1453 gross 800 m_data->trace(ev.m_data.get(), axis_offset);
1454 ksteube 775 return ev;
1455     }
1456     if (getDataPointRank()==3) {
1457     DataArrayView::ShapeType ev_shape;
1458     if (axis_offset==0) {
1459     int s2=s[2];
1460     ev_shape.push_back(s2);
1461     }
1462     else if (axis_offset==1) {
1463     int s0=s[0];
1464     ev_shape.push_back(s0);
1465     }
1466     Data ev(0.,ev_shape,getFunctionSpace());
1467     ev.typeMatchRight(*this);
1468 gross 800 m_data->trace(ev.m_data.get(), axis_offset);
1469 ksteube 775 return ev;
1470     }
1471     if (getDataPointRank()==4) {
1472     DataArrayView::ShapeType ev_shape;
1473     if (axis_offset==0) {
1474     ev_shape.push_back(s[2]);
1475     ev_shape.push_back(s[3]);
1476     }
1477     else if (axis_offset==1) {
1478     ev_shape.push_back(s[0]);
1479     ev_shape.push_back(s[3]);
1480     }
1481     else if (axis_offset==2) {
1482     ev_shape.push_back(s[0]);
1483     ev_shape.push_back(s[1]);
1484     }
1485     Data ev(0.,ev_shape,getFunctionSpace());
1486     ev.typeMatchRight(*this);
1487 gross 800 m_data->trace(ev.m_data.get(), axis_offset);
1488 ksteube 775 return ev;
1489     }
1490     else {
1491 gross 800 throw DataException("Error - Data::trace can only be calculated for rank 2, 3 or 4 object.");
1492 ksteube 775 }
1493     }
1494    
1495     Data
1496     Data::transpose(int axis_offset) const
1497     {
1498 gross 800 #if defined DOPROF
1499     profData->unary++;
1500     #endif
1501 ksteube 775 DataArrayView::ShapeType s=getDataPointShape();
1502     DataArrayView::ShapeType ev_shape;
1503     // Here's the equivalent of python s_out=s[axis_offset:]+s[:axis_offset]
1504     // which goes thru all shape vector elements starting with axis_offset (at index=rank wrap around to 0)
1505     int rank=getDataPointRank();
1506     if (axis_offset<0 || axis_offset>rank) {
1507     throw DataException("Error - Data::transpose must have 0 <= axis_offset <= rank=" + rank);
1508     }
1509     for (int i=0; i<rank; i++) {
1510     int index = (axis_offset+i)%rank;
1511     ev_shape.push_back(s[index]); // Append to new shape
1512     }
1513     Data ev(0.,ev_shape,getFunctionSpace());
1514     ev.typeMatchRight(*this);
1515     m_data->transpose(ev.m_data.get(), axis_offset);
1516     return ev;
1517 jgs 123 }
1518    
1519 gross 576 Data
1520     Data::eigenvalues() const
1521     {
1522     #if defined DOPROF
1523     profData->unary++;
1524     #endif
1525     // check input
1526     DataArrayView::ShapeType s=getDataPointShape();
1527     if (getDataPointRank()!=2)
1528     throw DataException("Error - Data::eigenvalues can only be calculated for rank 2 object.");
1529     if(s[0] != s[1])
1530     throw DataException("Error - Data::eigenvalues can only be calculated for object with equal first and second dimension.");
1531     // create return
1532     DataArrayView::ShapeType ev_shape(1,s[0]);
1533     Data ev(0.,ev_shape,getFunctionSpace());
1534     ev.typeMatchRight(*this);
1535     m_data->eigenvalues(ev.m_data.get());
1536     return ev;
1537     }
1538    
1539 jgs 121 const boost::python::tuple
1540 gross 576 Data::eigenvalues_and_eigenvectors(const double tol) const
1541     {
1542     #if defined DOPROF
1543     profData->unary++;
1544     #endif
1545     DataArrayView::ShapeType s=getDataPointShape();
1546     if (getDataPointRank()!=2)
1547     throw DataException("Error - Data::eigenvalues and eigenvectors can only be calculated for rank 2 object.");
1548     if(s[0] != s[1])
1549     throw DataException("Error - Data::eigenvalues and eigenvectors can only be calculated for object with equal first and second dimension.");
1550     // create return
1551     DataArrayView::ShapeType ev_shape(1,s[0]);
1552     Data ev(0.,ev_shape,getFunctionSpace());
1553     ev.typeMatchRight(*this);
1554     DataArrayView::ShapeType V_shape(2,s[0]);
1555     Data V(0.,V_shape,getFunctionSpace());
1556     V.typeMatchRight(*this);
1557     m_data->eigenvalues_and_eigenvectors(ev.m_data.get(),V.m_data.get(),tol);
1558     return make_tuple(boost::python::object(ev),boost::python::object(V));
1559     }
1560    
1561     const boost::python::tuple
1562 gross 921 Data::minGlobalDataPoint() const
1563 jgs 121 {
1564 gross 921 // NB: calc_minGlobalDataPoint( had to be split off from minGlobalDataPoint( as boost::make_tuple causes an
1565 jgs 148 // abort (for unknown reasons) if there are openmp directives with it in the
1566     // surrounding function
1567    
1568     int DataPointNo;
1569 gross 921 int ProcNo;
1570     calc_minGlobalDataPoint(ProcNo,DataPointNo);
1571     return make_tuple(ProcNo,DataPointNo);
1572 jgs 148 }
1573    
1574     void
1575 gross 921 Data::calc_minGlobalDataPoint(int& ProcNo,
1576     int& DataPointNo) const
1577 jgs 148 {
1578     int i,j;
1579     int lowi=0,lowj=0;
1580     double min=numeric_limits<double>::max();
1581    
1582 jgs 121 Data temp=minval();
1583    
1584     int numSamples=temp.getNumSamples();
1585     int numDPPSample=temp.getNumDataPointsPerSample();
1586    
1587 jgs 148 double next,local_min;
1588     int local_lowi,local_lowj;
1589 jgs 121
1590 jgs 148 #pragma omp parallel private(next,local_min,local_lowi,local_lowj)
1591     {
1592     local_min=min;
1593     #pragma omp for private(i,j) schedule(static)
1594     for (i=0; i<numSamples; i++) {
1595     for (j=0; j<numDPPSample; j++) {
1596     next=temp.getDataPoint(i,j)();
1597     if (next<local_min) {
1598     local_min=next;
1599     local_lowi=i;
1600     local_lowj=j;
1601     }
1602 jgs 121 }
1603     }
1604 jgs 148 #pragma omp critical
1605     if (local_min<min) {
1606     min=local_min;
1607     lowi=local_lowi;
1608     lowj=local_lowj;
1609     }
1610 jgs 121 }
1611    
1612 bcumming 782 #ifdef PASO_MPI
1613     // determine the processor on which the minimum occurs
1614     next = temp.getDataPoint(lowi,lowj)();
1615     int lowProc = 0;
1616     double *globalMins = new double[get_MPISize()+1];
1617     int error = MPI_Gather ( &next, 1, MPI_DOUBLE, globalMins, 1, MPI_DOUBLE, 0, get_MPIComm() );
1618    
1619     if( get_MPIRank()==0 ){
1620     next = globalMins[lowProc];
1621     for( i=1; i<get_MPISize(); i++ )
1622     if( next>globalMins[i] ){
1623     lowProc = i;
1624     next = globalMins[i];
1625     }
1626     }
1627     MPI_Bcast( &lowProc, 1, MPI_DOUBLE, 0, get_MPIComm() );
1628    
1629     delete [] globalMins;
1630     ProcNo = lowProc;
1631 bcumming 790 #else
1632     ProcNo = 0;
1633 bcumming 782 #endif
1634 gross 921 DataPointNo = lowj + lowi * numDPPSample;
1635 jgs 121 }
1636    
1637 jgs 104 void
1638     Data::saveDX(std::string fileName) const
1639     {
1640 jgs 153 boost::python::dict args;
1641     args["data"]=boost::python::object(this);
1642     getDomain().saveDX(fileName,args);
1643 jgs 104 return;
1644     }
1645    
1646 jgs 110 void
1647     Data::saveVTK(std::string fileName) const
1648     {
1649 jgs 153 boost::python::dict args;
1650     args["data"]=boost::python::object(this);
1651     getDomain().saveVTK(fileName,args);
1652 jgs 110 return;
1653     }
1654    
1655 jgs 102 Data&
1656     Data::operator+=(const Data& right)
1657     {
1658 gross 783 if (isProtected()) {
1659     throw DataException("Error - attempt to update protected Data object.");
1660     }
1661 jgs 94 binaryOp(right,plus<double>());
1662     return (*this);
1663     }
1664    
1665 jgs 102 Data&
1666     Data::operator+=(const boost::python::object& right)
1667 jgs 94 {
1668 gross 854 Data tmp(right,getFunctionSpace(),false);
1669     binaryOp(tmp,plus<double>());
1670 jgs 94 return (*this);
1671     }
1672    
1673 jgs 102 Data&
1674     Data::operator-=(const Data& right)
1675 jgs 94 {
1676 gross 783 if (isProtected()) {
1677     throw DataException("Error - attempt to update protected Data object.");
1678     }
1679 jgs 94 binaryOp(right,minus<double>());
1680     return (*this);
1681     }
1682    
1683 jgs 102 Data&
1684     Data::operator-=(const boost::python::object& right)
1685 jgs 94 {
1686 gross 854 Data tmp(right,getFunctionSpace(),false);
1687     binaryOp(tmp,minus<double>());
1688 jgs 94 return (*this);
1689     }
1690    
1691 jgs 102 Data&
1692     Data::operator*=(const Data& right)
1693 jgs 94 {
1694 gross 783 if (isProtected()) {
1695     throw DataException("Error - attempt to update protected Data object.");
1696     }
1697 jgs 94 binaryOp(right,multiplies<double>());
1698     return (*this);
1699     }
1700    
1701 jgs 102 Data&
1702     Data::operator*=(const boost::python::object& right)
1703 jgs 94 {
1704 gross 854 Data tmp(right,getFunctionSpace(),false);
1705     binaryOp(tmp,multiplies<double>());
1706 jgs 94 return (*this);
1707     }
1708    
1709 jgs 102 Data&
1710     Data::operator/=(const Data& right)
1711 jgs 94 {
1712 gross 783 if (isProtected()) {
1713     throw DataException("Error - attempt to update protected Data object.");
1714     }
1715 jgs 94 binaryOp(right,divides<double>());
1716     return (*this);
1717     }
1718    
1719 jgs 102 Data&
1720     Data::operator/=(const boost::python::object& right)
1721 jgs 94 {
1722 gross 854 Data tmp(right,getFunctionSpace(),false);
1723     binaryOp(tmp,divides<double>());
1724 jgs 94 return (*this);
1725     }
1726    
1727 jgs 102 Data
1728 gross 699 Data::rpowO(const boost::python::object& left) const
1729     {
1730     Data left_d(left,*this);
1731     return left_d.powD(*this);
1732     }
1733    
1734     Data
1735 jgs 102 Data::powO(const boost::python::object& right) const
1736 jgs 94 {
1737 gross 854 Data tmp(right,getFunctionSpace(),false);
1738     return powD(tmp);
1739 jgs 94 }
1740    
1741 jgs 102 Data
1742     Data::powD(const Data& right) const
1743 jgs 94 {
1744     Data result;
1745 gross 854 if (getDataPointRank()<right.getDataPointRank()) {
1746     result.copy(right);
1747     result.binaryOp(*this,escript::rpow);
1748     } else {
1749     result.copy(*this);
1750     result.binaryOp(right,(Data::BinaryDFunPtr)::pow);
1751     }
1752 jgs 94 return result;
1753     }
1754    
1755 bcumming 751
1756 jgs 94 //
1757 jgs 123 // NOTE: It is essential to specify the namespace this operator belongs to
1758 jgs 102 Data
1759     escript::operator+(const Data& left, const Data& right)
1760 jgs 94 {
1761     Data result;
1762     //
1763     // perform a deep copy
1764 gross 854 if (left.getDataPointRank()<right.getDataPointRank()) {
1765     result.copy(right);
1766     result+=left;
1767     } else {
1768     result.copy(left);
1769     result+=right;
1770     }
1771 jgs 94 return result;
1772     }
1773    
1774     //
1775 jgs 123 // NOTE: It is essential to specify the namespace this operator belongs to
1776 jgs 102 Data
1777     escript::operator-(const Data& left, const Data& right)
1778 jgs 94 {
1779     Data result;
1780     //
1781     // perform a deep copy
1782 gross 854 if (left.getDataPointRank()<right.getDataPointRank()) {
1783     result=right.neg();
1784     result+=left;
1785     } else {
1786     result.copy(left);
1787     result-=right;
1788     }
1789 jgs 94 return result;
1790     }
1791    
1792     //
1793 jgs 123 // NOTE: It is essential to specify the namespace this operator belongs to
1794 jgs 102 Data
1795     escript::operator*(const Data& left, const Data& right)
1796 jgs 94 {
1797     Data result;
1798     //
1799     // perform a deep copy
1800 gross 854 if (left.getDataPointRank()<right.getDataPointRank()) {
1801     result.copy(right);
1802     result*=left;
1803     } else {
1804     result.copy(left);
1805     result*=right;
1806     }
1807 jgs 94 return result;
1808     }
1809    
1810     //
1811 jgs 123 // NOTE: It is essential to specify the namespace this operator belongs to
1812 jgs 102 Data
1813     escript::operator/(const Data& left, const Data& right)
1814 jgs 94 {
1815     Data result;
1816     //
1817     // perform a deep copy
1818 gross 854 if (left.getDataPointRank()<right.getDataPointRank()) {
1819     result=right.oneOver();
1820     result*=left;
1821     } else {
1822     result.copy(left);
1823     result/=right;
1824     }
1825 jgs 94 return result;
1826     }
1827    
1828     //
1829 jgs 123 // NOTE: It is essential to specify the namespace this operator belongs to
1830 jgs 102 Data
1831     escript::operator+(const Data& left, const boost::python::object& right)
1832 jgs 94 {
1833 gross 854 return left+Data(right,left.getFunctionSpace(),false);
1834 jgs 94 }
1835    
1836     //
1837 jgs 123 // NOTE: It is essential to specify the namespace this operator belongs to
1838 jgs 102 Data
1839     escript::operator-(const Data& left, const boost::python::object& right)
1840 jgs 94 {
1841 gross 854 return left-Data(right,left.getFunctionSpace(),false);
1842 jgs 94 }
1843    
1844     //
1845 jgs 123 // NOTE: It is essential to specify the namespace this operator belongs to
1846 jgs 102 Data
1847     escript::operator*(const Data& left, const boost::python::object& right)
1848 jgs 94 {
1849 gross 854 return left*Data(right,left.getFunctionSpace(),false);
1850 jgs 94 }
1851    
1852     //
1853 jgs 123 // NOTE: It is essential to specify the namespace this operator belongs to
1854 jgs 102 Data
1855     escript::operator/(const Data& left, const boost::python::object& right)
1856 jgs 94 {
1857 gross 854 return left/Data(right,left.getFunctionSpace(),false);
1858 jgs 94 }
1859    
1860     //
1861 jgs 123 // NOTE: It is essential to specify the namespace this operator belongs to
1862 jgs 102 Data
1863     escript::operator+(const boost::python::object& left, const Data& right)
1864 jgs 94 {
1865 gross 854 return Data(left,right.getFunctionSpace(),false)+right;
1866 jgs 94 }
1867    
1868     //
1869 jgs 123 // NOTE: It is essential to specify the namespace this operator belongs to
1870 jgs 102 Data
1871     escript::operator-(const boost::python::object& left, const Data& right)
1872 jgs 94 {
1873 gross 854 return Data(left,right.getFunctionSpace(),false)-right;
1874 jgs 94 }
1875    
1876     //
1877 jgs 123 // NOTE: It is essential to specify the namespace this operator belongs to
1878 jgs 102 Data
1879     escript::operator*(const boost::python::object& left, const Data& right)
1880 jgs 94 {
1881 gross 854 return Data(left,right.getFunctionSpace(),false)*right;
1882 jgs 94 }
1883    
1884     //
1885 jgs 123 // NOTE: It is essential to specify the namespace this operator belongs to
1886 jgs 102 Data
1887     escript::operator/(const boost::python::object& left, const Data& right)
1888 jgs 94 {
1889 gross 854 return Data(left,right.getFunctionSpace(),false)/right;
1890 jgs 94 }
1891    
1892     //
1893 jgs 102 //bool escript::operator==(const Data& left, const Data& right)
1894     //{
1895     // /*
1896     // NB: this operator does very little at this point, and isn't to
1897     // be relied on. Requires further implementation.
1898     // */
1899     //
1900     // bool ret;
1901     //
1902     // if (left.isEmpty()) {
1903     // if(!right.isEmpty()) {
1904     // ret = false;
1905     // } else {
1906     // ret = true;
1907     // }
1908     // }
1909     //
1910     // if (left.isConstant()) {
1911     // if(!right.isConstant()) {
1912     // ret = false;
1913     // } else {
1914     // ret = true;
1915     // }
1916     // }
1917     //
1918     // if (left.isTagged()) {
1919     // if(!right.isTagged()) {
1920     // ret = false;
1921     // } else {
1922     // ret = true;
1923     // }
1924     // }
1925     //
1926     // if (left.isExpanded()) {
1927     // if(!right.isExpanded()) {
1928     // ret = false;
1929     // } else {
1930     // ret = true;
1931     // }
1932     // }
1933     //
1934     // return ret;
1935     //}
1936    
1937 bcumming 751 /* TODO */
1938     /* global reduction */
1939 jgs 102 Data
1940     Data::getItem(const boost::python::object& key) const
1941 jgs 94 {
1942 jgs 102 const DataArrayView& view=getPointDataView();
1943 jgs 94
1944 jgs 102 DataArrayView::RegionType slice_region=view.getSliceRegion(key);
1945 jgs 94
1946 jgs 102 if (slice_region.size()!=view.getRank()) {
1947     throw DataException("Error - slice size does not match Data rank.");
1948 jgs 94 }
1949    
1950 jgs 102 return getSlice(slice_region);
1951 jgs 94 }
1952    
1953 bcumming 751 /* TODO */
1954     /* global reduction */
1955 jgs 94 Data
1956 jgs 102 Data::getSlice(const DataArrayView::RegionType& region) const
1957 jgs 94 {
1958 jgs 151 #if defined DOPROF
1959 jgs 123 profData->slicing++;
1960 jgs 151 #endif
1961 jgs 102 return Data(*this,region);
1962 jgs 94 }
1963    
1964 bcumming 751 /* TODO */
1965     /* global reduction */
1966 jgs 94 void
1967 jgs 102 Data::setItemO(const boost::python::object& key,
1968     const boost::python::object& value)
1969 jgs 94 {
1970 jgs 102 Data tempData(value,getFunctionSpace());
1971     setItemD(key,tempData);
1972     }
1973    
1974 bcumming 751 /* TODO */
1975     /* global reduction */
1976 jgs 102 void
1977     Data::setItemD(const boost::python::object& key,
1978     const Data& value)
1979     {
1980 jgs 94 const DataArrayView& view=getPointDataView();
1981 jgs 123
1982 jgs 94 DataArrayView::RegionType slice_region=view.getSliceRegion(key);
1983     if (slice_region.size()!=view.getRank()) {
1984     throw DataException("Error - slice size does not match Data rank.");
1985     }
1986 jgs 108 if (getFunctionSpace()!=value.getFunctionSpace()) {
1987     setSlice(Data(value,getFunctionSpace()),slice_region);
1988     } else {
1989     setSlice(value,slice_region);
1990     }
1991 jgs 94 }
1992    
1993 bcumming 751 /* TODO */
1994     /* global reduction */
1995 jgs 94 void
1996 jgs 102 Data::setSlice(const Data& value,
1997     const DataArrayView::RegionType& region)
1998 jgs 94 {
1999 gross 783 if (isProtected()) {
2000     throw DataException("Error - attempt to update protected Data object.");
2001     }
2002 jgs 151 #if defined DOPROF
2003 jgs 123 profData->slicing++;
2004 jgs 151 #endif
2005 jgs 102 Data tempValue(value);
2006     typeMatchLeft(tempValue);
2007     typeMatchRight(tempValue);
2008     m_data->setSlice(tempValue.m_data.get(),region);
2009     }
2010    
2011     void
2012     Data::typeMatchLeft(Data& right) const
2013     {
2014     if (isExpanded()){
2015     right.expand();
2016     } else if (isTagged()) {
2017     if (right.isConstant()) {
2018     right.tag();
2019     }
2020     }
2021     }
2022    
2023     void
2024     Data::typeMatchRight(const Data& right)
2025     {
2026 jgs 94 if (isTagged()) {
2027     if (right.isExpanded()) {
2028     expand();
2029     }
2030     } else if (isConstant()) {
2031     if (right.isExpanded()) {
2032     expand();
2033     } else if (right.isTagged()) {
2034     tag();
2035     }
2036     }
2037     }
2038    
2039 bcumming 751 /* TODO */
2040     /* global reduction */
2041 jgs 94 void
2042     Data::setTaggedValue(int tagKey,
2043     const boost::python::object& value)
2044     {
2045 gross 783 if (isProtected()) {
2046     throw DataException("Error - attempt to update protected Data object.");
2047     }
2048 jgs 94 //
2049     // Ensure underlying data object is of type DataTagged
2050     tag();
2051    
2052     if (!isTagged()) {
2053     throw DataException("Error - DataTagged conversion failed!!");
2054     }
2055    
2056     //
2057     // Construct DataArray from boost::python::object input value
2058     DataArray valueDataArray(value);
2059    
2060     //
2061     // Call DataAbstract::setTaggedValue
2062     m_data->setTaggedValue(tagKey,valueDataArray.getView());
2063     }
2064    
2065 bcumming 751 /* TODO */
2066     /* global reduction */
2067 jgs 110 void
2068 jgs 121 Data::setTaggedValueFromCPP(int tagKey,
2069     const DataArrayView& value)
2070     {
2071 gross 783 if (isProtected()) {
2072     throw DataException("Error - attempt to update protected Data object.");
2073     }
2074 jgs 121 //
2075     // Ensure underlying data object is of type DataTagged
2076     tag();
2077    
2078     if (!isTagged()) {
2079     throw DataException("Error - DataTagged conversion failed!!");
2080     }
2081    
2082     //
2083     // Call DataAbstract::setTaggedValue
2084     m_data->setTaggedValue(tagKey,value);
2085     }
2086    
2087 bcumming 751 /* TODO */
2088     /* global reduction */
2089 jgs 149 int
2090     Data::getTagNumber(int dpno)
2091     {
2092     return m_data->getTagNumber(dpno);
2093     }
2094    
2095 bcumming 751 /* TODO */
2096     /* global reduction */
2097 jgs 121 void
2098 jgs 110 Data::setRefValue(int ref,
2099     const boost::python::numeric::array& value)
2100     {
2101 gross 783 if (isProtected()) {
2102     throw DataException("Error - attempt to update protected Data object.");
2103     }
2104 jgs 110 //
2105     // Construct DataArray from boost::python::object input value
2106     DataArray valueDataArray(value);
2107    
2108     //
2109     // Call DataAbstract::setRefValue
2110     m_data->setRefValue(ref,valueDataArray);
2111     }
2112    
2113 bcumming 751 /* TODO */
2114     /* global reduction */
2115 jgs 110 void
2116     Data::getRefValue(int ref,
2117     boost::python::numeric::array& value)
2118     {
2119     //
2120     // Construct DataArray for boost::python::object return value
2121     DataArray valueDataArray(value);
2122    
2123     //
2124     // Load DataArray with values from data-points specified by ref
2125     m_data->getRefValue(ref,valueDataArray);
2126    
2127     //
2128     // Load values from valueDataArray into return numarray
2129    
2130     // extract the shape of the numarray
2131     int rank = value.getrank();
2132     DataArrayView::ShapeType shape;
2133     for (int i=0; i < rank; i++) {
2134     shape.push_back(extract<int>(value.getshape()[i]));
2135     }
2136    
2137     // and load the numarray with the data from the DataArray
2138     DataArrayView valueView = valueDataArray.getView();
2139    
2140     if (rank==0) {
2141 jgs 126 boost::python::numeric::array temp_numArray(valueView());
2142     value = temp_numArray;
2143 jgs 110 }
2144     if (rank==1) {
2145     for (int i=0; i < shape[0]; i++) {
2146     value[i] = valueView(i);
2147     }
2148     }
2149     if (rank==2) {
2150 jgs 126 for (int i=0; i < shape[0]; i++) {
2151     for (int j=0; j < shape[1]; j++) {
2152 gross 921 value[make_tuple(i,j)] = valueView(i,j);
2153 jgs 126 }
2154     }
2155 jgs 110 }
2156     if (rank==3) {
2157 jgs 126 for (int i=0; i < shape[0]; i++) {
2158     for (int j=0; j < shape[1]; j++) {
2159     for (int k=0; k < shape[2]; k++) {
2160 gross 921 value[make_tuple(i,j,k)] = valueView(i,j,k);
2161 jgs 126 }
2162     }
2163     }
2164 jgs 110 }
2165     if (rank==4) {
2166 jgs 126 for (int i=0; i < shape[0]; i++) {
2167     for (int j=0; j < shape[1]; j++) {
2168     for (int k=0; k < shape[2]; k++) {
2169     for (int l=0; l < shape[3]; l++) {
2170 gross 921 value[make_tuple(i,j,k,l)] = valueView(i,j,k,l);
2171 jgs 126 }
2172     }
2173     }
2174     }
2175 jgs 110 }
2176    
2177     }
2178    
2179 jgs 94 void
2180 jgs 119 Data::archiveData(const std::string fileName)
2181     {
2182     cout << "Archiving Data object to: " << fileName << endl;
2183    
2184     //
2185     // Determine type of this Data object
2186     int dataType = -1;
2187    
2188     if (isEmpty()) {
2189     dataType = 0;
2190     cout << "\tdataType: DataEmpty" << endl;
2191     }
2192     if (isConstant()) {
2193     dataType = 1;
2194     cout << "\tdataType: DataConstant" << endl;
2195     }
2196     if (isTagged()) {
2197     dataType = 2;
2198     cout << "\tdataType: DataTagged" << endl;
2199     }
2200     if (isExpanded()) {
2201     dataType = 3;
2202     cout << "\tdataType: DataExpanded" << endl;
2203     }
2204 jgs 123
2205 jgs 119 if (dataType == -1) {
2206     throw DataException("archiveData Error: undefined dataType");
2207     }
2208    
2209     //
2210     // Collect data items common to all Data types
2211     int noSamples = getNumSamples();
2212     int noDPPSample = getNumDataPointsPerSample();
2213     int functionSpaceType = getFunctionSpace().getTypeCode();
2214     int dataPointRank = getDataPointRank();
2215     int dataPointSize = getDataPointSize();
2216     int dataLength = getLength();
2217     DataArrayView::ShapeType dataPointShape = getDataPointShape();
2218 woo409 757 vector<int> referenceNumbers(noSamples);
2219 jgs 119 for (int sampleNo=0; sampleNo<noSamples; sampleNo++) {
2220     referenceNumbers[sampleNo] = getFunctionSpace().getReferenceNoFromSampleNo(sampleNo);
2221     }
2222 woo409 757 vector<int> tagNumbers(noSamples);
2223 jgs 119 if (isTagged()) {
2224     for (int sampleNo=0; sampleNo<noSamples; sampleNo++) {
2225     tagNumbers[sampleNo] = getFunctionSpace().getTagFromSampleNo(sampleNo);
2226     }
2227     }
2228    
2229     cout << "\tnoSamples: " << noSamples << " noDPPSample: " << noDPPSample << endl;
2230     cout << "\tfunctionSpaceType: " << functionSpaceType << endl;
2231     cout << "\trank: " << dataPointRank << " size: " << dataPointSize << " length: " << dataLength << endl;
2232    
2233     //
2234     // Flatten Shape to an array of integers suitable for writing to file
2235     int flatShape[4] = {0,0,0,0};
2236     cout << "\tshape: < ";
2237     for (int dim=0; dim<dataPointRank; dim++) {
2238     flatShape[dim] = dataPointShape[dim];
2239     cout << dataPointShape[dim] << " ";
2240     }
2241     cout << ">" << endl;
2242    
2243     //
2244 jgs 123 // Open archive file
2245 jgs 119 ofstream archiveFile;
2246     archiveFile.open(fileName.data(), ios::out);
2247    
2248     if (!archiveFile.good()) {
2249     throw DataException("archiveData Error: problem opening archive file");
2250     }
2251    
2252 jgs 123 //
2253     // Write common data items to archive file
2254 jgs 119 archiveFile.write(reinterpret_cast<char *>(&dataType),sizeof(int));
2255     archiveFile.write(reinterpret_cast<char *>(&noSamples),sizeof(int));
2256     archiveFile.write(reinterpret_cast<char *>(&noDPPSample),sizeof(int));
2257     archiveFile.write(reinterpret_cast<char *>(&functionSpaceType),sizeof(int));
2258     archiveFile.write(reinterpret_cast<char *>(&dataPointRank),sizeof(int));
2259     archiveFile.write(reinterpret_cast<char *>(&dataPointSize),sizeof(int));
2260     archiveFile.write(reinterpret_cast<char *>(&dataLength),sizeof(int));
2261     for (int dim = 0; dim < 4; dim++) {
2262     archiveFile.write(reinterpret_cast<char *>(&flatShape[dim]),sizeof(int));
2263     }
2264     for (int sampleNo=0; sampleNo<noSamples; sampleNo++) {
2265     archiveFile.write(reinterpret_cast<char *>(&referenceNumbers[sampleNo]),sizeof(int));
2266     }
2267     if (isTagged()) {
2268     for (int sampleNo=0; sampleNo<noSamples; sampleNo++) {
2269     archiveFile.write(reinterpret_cast<char *>(&tagNumbers[sampleNo]),sizeof(int));
2270     }
2271     }
2272    
2273     if (!archiveFile.good()) {
2274     throw DataException("archiveData Error: problem writing to archive file");
2275     }
2276    
2277     //
2278 jgs 123 // Archive underlying data values for each Data type
2279     int noValues;
2280 jgs 119 switch (dataType) {
2281     case 0:
2282     // DataEmpty
2283 jgs 123 noValues = 0;
2284     archiveFile.write(reinterpret_cast<char *>(&noValues),sizeof(int));
2285     cout << "\tnoValues: " << noValues << endl;
2286 jgs 119 break;
2287     case 1:
2288     // DataConstant
2289 jgs 123 noValues = m_data->getLength();
2290     archiveFile.write(reinterpret_cast<char *>(&noValues),sizeof(int));
2291     cout << "\tnoValues: " << noValues << endl;
2292     if (m_data->archiveData(archiveFile,noValues)) {
2293     throw DataException("archiveData Error: problem writing data to archive file");
2294     }
2295 jgs 119 break;
2296     case 2:
2297     // DataTagged
2298 jgs 123 noValues = m_data->getLength();
2299     archiveFile.write(reinterpret_cast<char *>(&noValues),sizeof(int));
2300     cout << "\tnoValues: " << noValues << endl;
2301     if (m_data->archiveData(archiveFile,noValues)) {
2302     throw DataException("archiveData Error: problem writing data to archive file");
2303     }
2304 jgs 119 break;
2305     case 3:
2306     // DataExpanded
2307 jgs 123 noValues = m_data->getLength();
2308     archiveFile.write(reinterpret_cast<char *>(&noValues),sizeof(int));
2309     cout << "\tnoValues: " << noValues << endl;
2310     if (m_data->archiveData(archiveFile,noValues)) {
2311     throw DataException("archiveData Error: problem writing data to archive file");
2312     }
2313 jgs 119 break;
2314     }
2315    
2316 jgs 123 if (!archiveFile.good()) {
2317     throw DataException("archiveData Error: problem writing data to archive file");
2318     }
2319    
2320     //
2321     // Close archive file
2322     archiveFile.close();
2323    
2324     if (!archiveFile.good()) {
2325     throw DataException("archiveData Error: problem closing archive file");
2326     }
2327    
2328 jgs 119 }
2329    
2330     void
2331     Data::extractData(const std::string fileName,
2332     const FunctionSpace& fspace)
2333     {
2334     //
2335     // Can only extract Data to an object which is initially DataEmpty
2336     if (!isEmpty()) {
2337     throw DataException("extractData Error: can only extract to DataEmpty object");
2338     }
2339    
2340     cout << "Extracting Data object from: " << fileName << endl;
2341    
2342     int dataType;
2343     int noSamples;
2344     int noDPPSample;
2345     int functionSpaceType;
2346     int dataPointRank;
2347     int dataPointSize;
2348     int dataLength;
2349     DataArrayView::ShapeType dataPointShape;
2350     int flatShape[4];
2351    
2352     //
2353 jgs 123 // Open the archive file
2354 jgs 119 ifstream archiveFile;
2355     archiveFile.open(fileName.data(), ios::in);
2356    
2357     if (!archiveFile.good()) {
2358     throw DataException("extractData Error: problem opening archive file");
2359     }
2360    
2361 jgs 123 //
2362     // Read common data items from archive file
2363 jgs 119 archiveFile.read(reinterpret_cast<char *>(&dataType),sizeof(int));
2364     archiveFile.read(reinterpret_cast<char *>(&noSamples),sizeof(int));
2365     archiveFile.read(reinterpret_cast<char *>(&noDPPSample),sizeof(int));
2366     archiveFile.read(reinterpret_cast<char *>(&functionSpaceType),sizeof(int));
2367     archiveFile.read(reinterpret_cast<char *>(&dataPointRank),sizeof(int));
2368     archiveFile.read(reinterpret_cast<char *>(&dataPointSize),sizeof(int));
2369     archiveFile.read(reinterpret_cast<char *>(&dataLength),sizeof(int));
2370     for (int dim = 0; dim < 4; dim++) {
2371     archiveFile.read(reinterpret_cast<char *>(&flatShape[dim]),sizeof(int));
2372     if (flatShape[dim]>0) {
2373     dataPointShape.push_back(flatShape[dim]);
2374     }
2375     }
2376 woo409 757 vector<int> referenceNumbers(noSamples);
2377 jgs 119 for (int sampleNo=0; sampleNo<noSamples; sampleNo++) {
2378     archiveFile.read(reinterpret_cast<char *>(&referenceNumbers[sampleNo]),sizeof(int));
2379     }
2380 woo409 757 vector<int> tagNumbers(noSamples);
2381 jgs 119 if (dataType==2) {
2382     for (int sampleNo=0; sampleNo<noSamples; sampleNo++) {
2383     archiveFile.read(reinterpret_cast<char *>(&tagNumbers[sampleNo]),sizeof(int));
2384     }
2385     }
2386    
2387     if (!archiveFile.good()) {
2388     throw DataException("extractData Error: problem reading from archive file");
2389     }
2390    
2391 jgs 123 //
2392     // Verify the values just read from the archive file
2393 jgs 119 switch (dataType) {
2394     case 0:
2395     cout << "\tdataType: DataEmpty" << endl;
2396     break;
2397     case 1:
2398     cout << "\tdataType: DataConstant" << endl;
2399     break;
2400     case 2:
2401     cout << "\tdataType: DataTagged" << endl;
2402     break;
2403     case 3:
2404     cout << "\tdataType: DataExpanded" << endl;
2405     break;
2406     default:
2407     throw DataException("extractData Error: undefined dataType read from archive file");
2408     break;
2409     }
2410    
2411     cout << "\tnoSamples: " << noSamples << " noDPPSample: " << noDPPSample << endl;
2412     cout << "\tfunctionSpaceType: " << functionSpaceType << endl;
2413     cout << "\trank: " << dataPointRank << " size: " << dataPointSize << " length: " << dataLength << endl;
2414     cout << "\tshape: < ";
2415     for (int dim = 0; dim < dataPointRank; dim++) {
2416     cout << dataPointShape[dim] << " ";
2417     }
2418     cout << ">" << endl;
2419    
2420     //
2421     // Verify that supplied FunctionSpace object is compatible with this Data object.
2422     if ( (fspace.getTypeCode()!=functionSpaceType) ||
2423     (fspace.getNumSamples()!=noSamples) ||
2424     (fspace.getNumDPPSample()!=noDPPSample)
2425     ) {
2426     throw DataException("extractData Error: incompatible FunctionSpace");
2427     }
2428     for (int sampleNo=0; sampleNo<noSamples; sampleNo++) {
2429     if (referenceNumbers[sampleNo] != fspace.getReferenceNoFromSampleNo(sampleNo)) {
2430     throw DataException("extractData Error: incompatible FunctionSpace");
2431     }
2432     }
2433     if (dataType==2) {
2434     for (int sampleNo=0; sampleNo<noSamples; sampleNo++) {
2435     if (tagNumbers[sampleNo] != fspace.getTagFromSampleNo(sampleNo)) {
2436     throw DataException("extractData Error: incompatible FunctionSpace");
2437     }
2438     }
2439     }
2440    
2441     //
2442     // Construct a DataVector to hold underlying data values
2443     DataVector dataVec(dataLength);
2444    
2445     //
2446     // Load this DataVector with the appropriate values
2447 jgs 123 int noValues;
2448     archiveFile.read(reinterpret_cast<char *>(&noValues),sizeof(int));
2449     cout << "\tnoValues: " << noValues << endl;
2450 jgs 119 switch (dataType) {
2451     case 0:
2452     // DataEmpty
2453 jgs 123 if (noValues != 0) {
2454     throw DataException("extractData Error: problem reading data from archive file");
2455     }
2456 jgs 119 break;
2457     case 1:
2458     // DataConstant
2459 jgs 123 if (dataVec.extractData(archiveFile,noValues)) {
2460     throw DataException("extractData Error: problem reading data from archive file");
2461     }
2462 jgs 119 break;
2463     case 2:
2464     // DataTagged
2465 jgs 123 if (dataVec.extractData(archiveFile,noValues)) {
2466     throw DataException("extractData Error: problem reading data from archive file");
2467     }
2468 jgs 119 break;
2469     case 3:
2470     // DataExpanded
2471 jgs 123 if (dataVec.extractData(archiveFile,noValues)) {
2472     throw DataException("extractData Error: problem reading data from archive file");
2473     }
2474 jgs 119 break;
2475     }
2476    
2477 jgs 123 if (!archiveFile.good()) {
2478     throw DataException("extractData Error: problem reading from archive file");
2479     }
2480    
2481 jgs 119 //
2482 jgs 123 // Close archive file
2483     archiveFile.close();