FEI Version of the Day
fei_CSVec.cpp
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 #include <fei_CSVec.hpp>
00045 #include <algorithm>
00046 
00047 namespace fei {
00048 
00049 CSVec::CSVec(const FillableVec& invec)
00050  : indices_(invec.size()),
00051    coefs_(invec.size())
00052 {
00053   operator=(invec);
00054 }
00055 
00056 CSVec::CSVec(unsigned sz)
00057  : indices_(sz, 0),
00058    coefs_(sz, 0.0)
00059 {
00060 }
00061 
00062 CSVec::~CSVec()
00063 {
00064 }
00065 
00066 CSVec&
00067 CSVec::operator=(const CSVec& invec)
00068 {
00069   indices_ = invec.indices_;
00070   coefs_ = invec.coefs_;
00071 
00072   return *this;
00073 }
00074 
00075 CSVec&
00076 CSVec::operator=(const FillableVec& invec)
00077 {
00078   indices_.resize(invec.size());
00079   coefs_.resize(invec.size());
00080 
00081   FillableVec::const_iterator iter = invec.begin(), iter_end = invec.end();
00082 
00083   unsigned i=0;
00084   for(; iter != iter_end; ++iter, ++i) {
00085     indices_[i] = iter->first;
00086     coefs_[i] = iter->second;
00087   }
00088 
00089   return *this;
00090 }
00091 
00092 void add_entry(CSVec& vec, int eqn, double coef)
00093 {
00094   std::vector<int>& v_ind = vec.indices();
00095   std::vector<double>& v_coef = vec.coefs();
00096 
00097   std::vector<int>::iterator
00098     iter = std::lower_bound(v_ind.begin(), v_ind.end(), eqn);
00099 
00100   size_t offset = iter - v_ind.begin();
00101 
00102   if (iter == v_ind.end() || *iter != eqn) {
00103     v_ind.insert(iter, eqn);
00104     v_coef.insert(v_coef.begin()+offset, coef);
00105   }
00106   else {
00107     v_coef[offset] += coef;
00108   }
00109 }
00110 
00111 void put_entry(CSVec& vec, int eqn, double coef)
00112 {
00113   std::vector<int>& v_ind = vec.indices();
00114   std::vector<double>& v_coef = vec.coefs();
00115 
00116   std::vector<int>::iterator
00117     iter = std::lower_bound(v_ind.begin(), v_ind.end(), eqn);
00118 
00119   size_t offset = iter - v_ind.begin();
00120 
00121   if (iter == v_ind.end() || *iter != eqn) {
00122     v_ind.insert(iter, eqn);
00123     v_coef.insert(v_coef.begin()+offset, coef);
00124   }
00125   else {
00126     v_coef[offset] = coef;
00127   }
00128 }
00129 
00130 void remove_entry(CSVec& vec, int eqn)
00131 {
00132   std::vector<int>& v_ind = vec.indices();
00133   std::vector<double>& v_coef = vec.coefs();
00134 
00135   std::vector<int>::iterator
00136     iter = std::lower_bound(v_ind.begin(), v_ind.end(), eqn);
00137 
00138   if (iter != v_ind.end() && *iter == eqn) {
00139     v_ind.erase(iter);
00140 
00141     size_t offset = iter - v_ind.begin();
00142     std::vector<double>::iterator coef_iter = v_coef.begin()+offset;
00143     v_coef.erase(coef_iter);
00144   }
00145 }
00146 
00147 void set_values(CSVec& vec, double scalar)
00148 {
00149   std::fill(vec.coefs().begin(), vec.coefs().end(), scalar);
00150 }
00151 
00152 void add_CSVec_CSVec(const CSVec& u, CSVec& v)
00153 {
00154   const std::vector<int>& indices = u.indices();
00155   const std::vector<double>& coefs = u.coefs();
00156 
00157   for(size_t i=0; i<indices.size(); ++i) {
00158     add_entry(v, indices[i], coefs[i]);
00159   }
00160 }
00161 
00162 }//namespace fei
00163 
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Friends