PlayaOut.cpp
Go to the documentation of this file.
00001 /* @HEADER@ */
00002 // ************************************************************************
00003 // 
00004 //                 Playa: Programmable Linear Algebra
00005 //                 Copyright 2012 Sandia Corporation
00006 // 
00007 // Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
00008 // the U.S. Government retains certain rights in this software.
00009 //
00010 // Redistribution and use in source and binary forms, with or without
00011 // modification, are permitted provided that the following conditions are
00012 // met:
00013 //
00014 // 1. Redistributions of source code must retain the above copyright
00015 // notice, this list of conditions and the following disclaimer.
00016 //
00017 // 2. Redistributions in binary form must reproduce the above copyright
00018 // notice, this list of conditions and the following disclaimer in the
00019 // documentation and/or other materials provided with the distribution.
00020 //
00021 // 3. Neither the name of the Corporation nor the names of the
00022 // contributors may be used to endorse or promote products derived from
00023 // this software without specific prior written permission.
00024 //
00025 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
00026 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
00027 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
00028 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
00029 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
00030 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
00031 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
00032 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
00033 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
00034 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
00035 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00036 //
00037 // Questions? Contact Kevin Long (kevin.long@ttu.edu)
00038 // 
00039 
00040 /* @HEADER@ */
00041 
00042 #include "PlayaOut.hpp"
00043 #include "PlayaTabs.hpp"
00044 #include "Teuchos_Array.hpp"
00045 
00046 using namespace Playa;
00047 using namespace Teuchos;
00048 using namespace std;
00049 
00050 
00051 namespace Playa
00052 {
00053 
00054 
00055 FancyOStream& Out::os()
00056 {
00057   static RCP<std::ostream> os = rcp(basicStream(), false);
00058   static RCP<FancyOStream> rtn = fancyOStream(os);
00059   static bool first = true;
00060   if (first)
00061   {
00062     rtn->setShowProcRank(true);
00063     first = false;
00064   }
00065   return *rtn;
00066 }
00067 
00068 FancyOStream& Out::root()
00069 {
00070   static bool isRoot = MPIComm::world().getRank()==0;
00071 
00072   static RCP<std::ostream> os = rcp(basicStream(), false);
00073   static RCP<FancyOStream> rtn = fancyOStream(os);
00074 
00075   static RCP<FancyOStream> blackHole
00076     = rcp(new FancyOStream(rcp(new oblackholestream())));
00077   
00078   if (isRoot)
00079   {
00080     return *rtn;
00081   }
00082   else
00083   {
00084     return *blackHole;
00085   } 
00086 }
00087 
00088 
00089 
00090 
00091 void writeTable(std::ostream& os, const Tabs& tab,
00092   const Array<double>& a, int cols)
00093 {
00094   int rows = a.size() / cols;
00095 
00096   for (int i=0; i<rows; i++)
00097   {
00098     os << tab << setw(10) << i << ":";
00099     for (int j=0; j<cols; j++) 
00100       os << setw(12) << setprecision(6) << a[i*cols+j];
00101     os << std::endl;
00102   }
00103   int n = a.size() - rows * cols;
00104   if (n==0) return ;
00105   os << tab << setw(10) << rows << ":" ;
00106   for (int j=0; j<n; j++) 
00107     os << setw(12) << setprecision(6) << a[rows*cols+j];
00108   os << std::endl;
00109 }
00110 
00111 
00112 void writeTable(std::ostream& os, const Tabs& tab,
00113   const Array<int>& a, int cols)
00114 {
00115   int rows = a.size() / cols;
00116 
00117   for (int i=0; i<rows; i++)
00118   {
00119     os << tab << setw(10) << i << ":";
00120     for (int j=0; j<cols; j++) 
00121       os << setw(10) << a[i*cols+j];
00122     os << std::endl;
00123   }
00124   int n = a.size() - rows * cols;
00125   if (n==0) return ;
00126   os << tab << setw(10) << rows << ":" ;
00127   for (int j=0; j<n; j++) 
00128     os << setw(10) << a[rows*cols+j];
00129   os << std::endl;
00130 }
00131 
00132 
00133 }
00134 
00135 
00136 
00137 
00138 
00139 
00140 

Site Contact