FEI Version of the Day
fei_FillableVec.hpp
00001 /*
00002 // @HEADER
00003 // ************************************************************************
00004 //             FEI: Finite Element Interface to Linear Solvers
00005 //                  Copyright (2005) Sandia Corporation.
00006 //
00007 // Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, the
00008 // 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 Alan Williams (william@sandia.gov) 
00038 //
00039 // ************************************************************************
00040 // @HEADER
00041 */
00042 
00043 
00044 #ifndef _fei_FillableVec_hpp_
00045 #define _fei_FillableVec_hpp_
00046 
00047 #include "fei_macros.hpp"
00048 #include "fei_Pool_alloc.hpp"
00049 #include <map>
00050 
00051 namespace fei {
00052 
00053 class FillableVec {
00054  public:
00055   FillableVec();
00056   virtual ~FillableVec();
00057 
00058   void addEntry(int index, double coef);
00059 
00060   void addEntries(unsigned numEntries,
00061                   const double* coefs,
00062                   const int* indices);
00063 
00064   void putEntry(int index, double coef);
00065 
00066   void putEntries(unsigned numEntries,
00067                   const double* coefs,
00068                   const int* indices);
00069 
00070   void setValues(double value);
00071 
00072   unsigned size() const;
00073 
00074   bool hasEntry(int index) const;
00075 
00078   double getEntry(int index) const;
00079 
00080   void removeEntry(int index);
00081 
00082   void clear();
00083 
00084   typedef
00085     std::map<int,double,std::less<int>,
00086      fei_Pool_alloc<std::pair<const int,double> > > feipoolmap;
00087 
00088   typedef feipoolmap::iterator iterator;
00089   typedef feipoolmap::const_iterator const_iterator;
00090 
00091   iterator begin() {return vecdata_.begin();}
00092   iterator end() {return vecdata_.end();}
00093 
00094   const_iterator begin() const {return vecdata_.begin();}
00095   const_iterator end() const {return vecdata_.end();}
00096 
00097   bool operator==(const FillableVec& rhs) const;
00098 
00099   bool operator!=(const FillableVec& rhs) const;
00100 
00101  private:
00102   feipoolmap vecdata_;
00103 };//class FillableVec
00104 
00105 inline void
00106 FillableVec::addEntry(int index, double coef)
00107 {
00108   feipoolmap::iterator iter = vecdata_.lower_bound(index);
00109   if (iter == vecdata_.end() || iter->first != index) {
00110     vecdata_.insert(iter, std::make_pair(index, coef));
00111   }
00112   else {
00113     iter->second += coef;
00114   }
00115 }
00116 
00117 inline void
00118 FillableVec::putEntry(int index, double coef)
00119 {
00120   feipoolmap::iterator iter = vecdata_.lower_bound(index);
00121   if (iter == vecdata_.end() || iter->first != index) {
00122     vecdata_.insert(iter, std::make_pair(index, coef));
00123   }
00124   else {
00125     iter->second = coef;
00126   }
00127 }
00128 
00129 inline
00130 bool
00131 FillableVec::operator==(const FillableVec& rhs) const
00132 {
00133   return vecdata_ == rhs.vecdata_;
00134 }
00135 
00136 inline
00137 bool
00138 FillableVec::operator!=(const FillableVec& rhs) const
00139 {
00140   return vecdata_ != rhs.vecdata_;
00141 }
00142 
00143 }//namespace fei
00144 
00145 #endif
00146 
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Friends