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(unsigned sz)
00050  : indices_(sz, 0),
00051    coefs_(sz, 0.0)
00052 {
00053 }
00054 
00055 CSVec::~CSVec()
00056 {
00057 }
00058 
00059 CSVec&
00060 CSVec::operator=(const CSVec& invec)
00061 {
00062   indices_ = invec.indices_;
00063   coefs_ = invec.coefs_;
00064 
00065   return *this;
00066 }
00067 
00068 void add_entries(CSVec& vec, int num, const int* eqns, const double* coefs)
00069 {
00070   for(int i=0; i<num; ++i) add_entry(vec, eqns[i], coefs[i]);
00071 }
00072 
00073 void put_entry(CSVec& vec, int eqn, double coef)
00074 {
00075   std::vector<int>& v_ind = vec.indices();
00076   std::vector<double>& v_coef = vec.coefs();
00077 
00078   std::vector<int>::iterator
00079     iter = std::lower_bound(v_ind.begin(), v_ind.end(), eqn);
00080 
00081   size_t offset = iter - v_ind.begin();
00082 
00083   if (iter == v_ind.end() || *iter != eqn) {
00084     v_ind.insert(iter, eqn);
00085     v_coef.insert(v_coef.begin()+offset, coef);
00086   }
00087   else {
00088     v_coef[offset] = coef;
00089   }
00090 }
00091 
00092 double get_entry(const CSVec& vec, int eqn)
00093 {
00094   const std::vector<int>& v_ind = vec.indices();
00095   const std::vector<double>& v_coef = vec.coefs();
00096 
00097   if (vec.size() == 0) {
00098     throw std::runtime_error("get_entry error, CSVec is empty");
00099   }
00100 
00101   std::vector<int>::const_iterator
00102     iter = std::lower_bound(v_ind.begin(), v_ind.end(), eqn);
00103 
00104   if (iter == v_ind.end()) {
00105     throw std::runtime_error("get_entry error, entry not found.");
00106   }
00107 
00108   return v_coef[iter - v_ind.begin()];
00109 }
00110 
00111 void remove_entry(CSVec& vec, int eqn)
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   if (iter != v_ind.end() && *iter == eqn) {
00120     size_t offset = iter - v_ind.begin();
00121     v_ind.erase(iter);
00122 
00123     std::vector<double>::iterator coef_iter = v_coef.begin()+offset;
00124     v_coef.erase(coef_iter);
00125   }
00126 }
00127 
00128 void set_values(CSVec& vec, double scalar)
00129 {
00130   std::fill(vec.coefs().begin(), vec.coefs().end(), scalar);
00131 }
00132 
00133 void add_CSVec_CSVec(const CSVec& u, CSVec& v)
00134 {
00135   const std::vector<int>& indices = u.indices();
00136   const std::vector<double>& coefs = u.coefs();
00137 
00138   for(size_t i=0; i<indices.size(); ++i) {
00139     add_entry(v, indices[i], coefs[i]);
00140   }
00141 }
00142 
00143 }//namespace fei
00144 
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Friends