AbstractLinAlgPack: C++ Interfaces For Vectors, Matrices And Related Linear Algebra Objects Version of the Day
AbstractLinAlgPack_SpVectorOp.cpp
00001 // @HEADER
00002 // ***********************************************************************
00003 // 
00004 // Moocho: Multi-functional Object-Oriented arCHitecture for Optimization
00005 //                  Copyright (2003) Sandia Corporation
00006 // 
00007 // Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
00008 // license for use of this work by or on behalf of the U.S. Government.
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 Roscoe A. Bartlett (rabartl@sandia.gov) 
00038 // 
00039 // ***********************************************************************
00040 // @HEADER
00041 
00042 #include "AbstractLinAlgPack_SpVectorOp.hpp"
00043 
00044 namespace {
00045 // Setup some template classes to check at complile time that
00046 // the layout of SpVectorSlice::element_type is proper.
00047 template<int N, class T>
00048 class assert_compile_time {
00049 public:
00050 assert_compile_time()
00051 {
00052   // This should not compile if instantiated with a type T that
00053   // is not an integer.  However, if the compiler checks this
00054   // function without instantiating it, it can not cause an error
00055   // because it does not know the type of T to see if the
00056   // conversion is legal or not.
00057   T d;
00058   static_cast<int*>(d);
00059 }
00060 };
00061 // Template specialization for no error
00062 template<>
00063 class assert_compile_time<0,double> {
00064 public:
00065 assert_compile_time()
00066 {}
00067 };
00068 // Validate that there is an integer stride between values
00069 assert_compile_time<
00070     ((int)sizeof(AbstractLinAlgPack::SpVectorSlice::element_type)
00071    % (int)sizeof(DenseLinAlgPack::value_type))
00072   , double
00073   >
00074     validate_value_stride;
00075 // Validate that there is an integer stride between indexes
00076 assert_compile_time<
00077     ((int)sizeof(AbstractLinAlgPack::SpVectorSlice::element_type)
00078    % (int)sizeof(DenseLinAlgPack::index_type))
00079   , double
00080   >
00081     validate_index_stride;
00082 } // end namespace
00083 
00084 void AbstractLinAlgPack::add_elements( SpVector* sv_lhs, value_type alpha, const DVectorSlice& vs_rhs
00085                    , size_type offset, bool add_zeros )
00086 {
00087   typedef SpVector::element_type ele_t;
00088   const bool assume_sorted = !sv_lhs->nz() || ( sv_lhs->nz() && sv_lhs->is_sorted() );
00089   DVectorSlice::const_iterator
00090     itr = vs_rhs.begin();
00091   if(add_zeros) {
00092     for( size_type i = 1; i <= vs_rhs.dim(); ++i )
00093       sv_lhs->add_element( ele_t( i + offset, alpha * (*itr++) ) );
00094   }
00095   else {
00096     for( size_type i = 1; i <= vs_rhs.dim(); ++i, ++itr )
00097       if( *itr != 0.0 )
00098         sv_lhs->add_element( ele_t( i + offset, alpha * (*itr) ) );
00099   }
00100   sv_lhs->assume_sorted(assume_sorted);
00101 }
00102 
00103 void AbstractLinAlgPack::add_elements( SpVector* sv_lhs, value_type alpha, const SpVectorSlice& sv_rhs
00104                    , size_type offset, bool add_zeros )
00105 {
00106   typedef SpVector::element_type ele_t;
00107   const bool assume_sorted = ( !sv_lhs->nz() || ( sv_lhs->nz() && sv_lhs->is_sorted() ) )
00108     && ( !sv_rhs.nz() || ( sv_rhs.nz() || sv_rhs.is_sorted() ) );
00109   if(add_zeros) {
00110     for( SpVectorSlice::const_iterator itr = sv_rhs.begin(); itr != sv_rhs.end(); ++itr )
00111       sv_lhs->add_element( ele_t( itr->index() + sv_rhs.offset() + offset, alpha * (itr->value()) ) );
00112   }
00113   else {
00114     for( SpVectorSlice::const_iterator itr = sv_rhs.begin(); itr != sv_rhs.end(); ++itr )
00115       if(itr->value() != 0.0 )
00116         sv_lhs->add_element( ele_t( itr->index() + sv_rhs.offset() + offset, alpha * (itr->value()) ) );
00117   }
00118   sv_lhs->assume_sorted(assume_sorted);
00119 }
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends