SundanceIntVec.hpp
Go to the documentation of this file.
00001 /* @HEADER@ */
00002 // ************************************************************************
00003 // 
00004 //                             Sundance
00005 //                 Copyright 2011 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 #ifndef SUNDANCE_INTVEC_H
00043 #define SUNDANCE_INTVEC_H
00044 
00045 #include "SundanceDefs.hpp"
00046 #include "Teuchos_Array.hpp"
00047 #include "PlayaPrintable.hpp"
00048 
00049 namespace Sundance
00050 {
00051 using Teuchos::Array;
00052 using Teuchos::tuple;
00053 
00054 /** 
00055  * An integer vector class for use in the generalized chain rule
00056  * of Constantine and Savits (1996). See the paper by CS for 
00057  * definitions of the various operations.
00058  */
00059 class IntVec : public Playa::Printable
00060 {
00061 public:
00062   /** */
00063   IntVec(){}
00064   /** */
00065   IntVec(const Array<int>& d) : data_(d) {}
00066   /** */
00067   IntVec(int n);
00068 
00069   /** */
00070   int size() const {return data_.size();}
00071 
00072   /** */
00073   int operator[](int i) const {return data_[i];}
00074 
00075   /** */
00076   int& operator[](int i) {return data_[i];}
00077 
00078   /** */
00079   IntVec operator+(const IntVec& other) const ;
00080 
00081   /** */
00082   IntVec operator*(int alpha) const ;
00083 
00084   /** Return the factorial of this vector, as defined by CS */
00085   int factorial() const ;
00086 
00087   /** */
00088   int pow(const IntVec& other) const ;
00089 
00090   /** Return the sum of elements in this vector */
00091   int abs() const ;
00092 
00093   /** Return the infinity norm of this vector */
00094   int norm() const ;
00095 
00096   /** */
00097   bool operator==(const IntVec& other) const ;
00098 
00099   /** */
00100   bool operator<(const IntVec& other) const ;
00101 
00102   /** */
00103   void print(std::ostream& os) const ;
00104 
00105   /** Get the length-M partitions of this vector. These are all 
00106    * list of exactly M vectors \f$ v_i\f$ such that
00107    * \f[ \sum_{i=1}^M v_i = this. \f]
00108    */
00109   void getPartitions(int M, Array<Array<IntVec> >& parts) const ;
00110 
00111 private:
00112   Array<int> data_;
00113 };
00114 
00115 
00116 
00117 /** \relates IntVec */
00118 inline IntVec operator*(int a, const IntVec& x)
00119 {
00120   return x * a;
00121 }
00122 
00123 /** \relates IntVec*/
00124 inline std::ostream& operator<<(std::ostream& os, const IntVec& v)
00125 {
00126   v.print(os);
00127   return os;
00128 }
00129 
00130 /** */
00131 inline IntVec intVec(int a)
00132 {
00133   Array<int> dat = tuple(a);
00134   return dat;
00135 }
00136 
00137 /** */
00138 inline IntVec intVec(int a, int b)
00139 {
00140   Array<int> dat = tuple(a, b);
00141   return dat;
00142 }
00143 
00144 /** */
00145 inline IntVec intVec(int a, int b, int c)
00146 {
00147   Array<int> dat = tuple(a, b, c);
00148   return dat;
00149 }
00150 
00151 /** */
00152 inline IntVec intVec(int a, int b, int c, int d)
00153 {
00154   Array<int> dat = tuple(a, b, c, d);
00155   return dat;
00156 }
00157 
00158 /** */
00159 inline IntVec intVec(int a, int b, int c, int d, int e)
00160 {
00161   Array<int> dat = tuple(a, b, c, d, e);
00162   return dat;
00163 }
00164 
00165 
00166 
00167 }
00168 
00169 
00170 
00171 
00172 #endif

Site Contact