MOOCHO (Single Doxygen Collection) Version of the Day
AbstractLinAlgPack_sparse_bounds_diff.cpp
Go to the documentation of this file.
00001 #if 0
00002 
00003 // @HEADER
00004 // ***********************************************************************
00005 // 
00006 // Moocho: Multi-functional Object-Oriented arCHitecture for Optimization
00007 //                  Copyright (2003) Sandia Corporation
00008 // 
00009 // Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
00010 // license for use of this work by or on behalf of the U.S. Government.
00011 // 
00012 // Redistribution and use in source and binary forms, with or without
00013 // modification, are permitted provided that the following conditions are
00014 // met:
00015 //
00016 // 1. Redistributions of source code must retain the above copyright
00017 // notice, this list of conditions and the following disclaimer.
00018 //
00019 // 2. Redistributions in binary form must reproduce the above copyright
00020 // notice, this list of conditions and the following disclaimer in the
00021 // documentation and/or other materials provided with the distribution.
00022 //
00023 // 3. Neither the name of the Corporation nor the names of the
00024 // contributors may be used to endorse or promote products derived from
00025 // this software without specific prior written permission.
00026 //
00027 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
00028 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
00029 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
00030 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
00031 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
00032 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
00033 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
00034 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
00035 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
00036 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
00037 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00038 //
00039 // Questions? Contact Roscoe A. Bartlett (rabartl@sandia.gov) 
00040 // 
00041 // ***********************************************************************
00042 // @HEADER
00043 
00044 #include "AbstractLinAlgPack_sparse_bounds_diff.hpp"
00045 #include "AbstractLinAlgPack/src/AbstractLinAlgPack_SpVectorClass.hpp"
00046 #include "AbstractLinAlgPack_LinAlgOpPackHack.hpp"
00047 #include "DenseLinAlgPack_AssertOp.hpp"
00048 
00049 void AbstractLinAlgPack::imp_sparse_bnd_diff(
00050     int           sign
00051   , const SpVectorSlice   &sv
00052   , BLAS_Cpp::Uplo      uplo
00053   , const DVectorSlice      &v
00054   , DVectorSlice        *r
00055   )
00056 {
00057   DenseLinAlgPack::Vp_V_assert_sizes(r->size(),sv.size());
00058   DenseLinAlgPack::VopV_assert_sizes(sv.size(),v.size());
00059 
00060   typedef DenseLinAlgPack::value_type value_type;
00061   const value_type
00062     inf = std::numeric_limits<value_type>::max();
00063   *r = ( uplo == BLAS_Cpp::upper ? inf : -inf );
00064   const AbstractLinAlgPack::SpVectorSlice::difference_type o = sv.offset();
00065   for( AbstractLinAlgPack::SpVectorSlice::const_iterator itr = sv.begin();
00066       itr != sv.end(); ++itr )
00067   {
00068     (*r)(itr->indice() + o) = itr->value();
00069   }
00070   DenseLinAlgPack::Vp_StV( r, -1.0, v );
00071   if( sign < 0 )
00072     DenseLinAlgPack::Vt_S( r, -1.0 );
00073 }
00074 
00075 #endif // 0
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines