AbstractLinAlgPack: C++ Interfaces For Vectors, Matrices And Related Linear Algebra Objects  Version of the Day
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
AbstractLinAlgPack_SpVectorOp.cpp
1 // @HEADER
2 // ***********************************************************************
3 //
4 // Moocho: Multi-functional Object-Oriented arCHitecture for Optimization
5 // Copyright (2003) Sandia Corporation
6 //
7 // Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
8 // license for use of this work by or on behalf of the U.S. Government.
9 //
10 // Redistribution and use in source and binary forms, with or without
11 // modification, are permitted provided that the following conditions are
12 // met:
13 //
14 // 1. Redistributions of source code must retain the above copyright
15 // notice, this list of conditions and the following disclaimer.
16 //
17 // 2. Redistributions in binary form must reproduce the above copyright
18 // notice, this list of conditions and the following disclaimer in the
19 // documentation and/or other materials provided with the distribution.
20 //
21 // 3. Neither the name of the Corporation nor the names of the
22 // contributors may be used to endorse or promote products derived from
23 // this software without specific prior written permission.
24 //
25 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
26 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
28 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
29 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
30 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
31 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
32 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
33 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
34 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
35 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
36 //
37 // Questions? Contact Roscoe A. Bartlett (rabartl@sandia.gov)
38 //
39 // ***********************************************************************
40 // @HEADER
41 
42 #include "AbstractLinAlgPack_SpVectorOp.hpp"
43 
44 namespace {
45 // Setup some template classes to check at complile time that
46 // the layout of SpVectorSlice::element_type is proper.
47 template<int N, class T>
48 class assert_compile_time {
49 public:
50 assert_compile_time()
51 {
52  // This should not compile if instantiated with a type T that
53  // is not an integer. However, if the compiler checks this
54  // function without instantiating it, it can not cause an error
55  // because it does not know the type of T to see if the
56  // conversion is legal or not.
57  T d;
58  static_cast<int*>(d);
59 }
60 };
61 // Template specialization for no error
62 template<>
63 class assert_compile_time<0,double> {
64 public:
65 assert_compile_time()
66 {}
67 };
68 // Validate that there is an integer stride between values
69 assert_compile_time<
71  % (int)sizeof(DenseLinAlgPack::value_type))
72  , double
73  >
74  validate_value_stride;
75 // Validate that there is an integer stride between indexes
76 assert_compile_time<
78  % (int)sizeof(DenseLinAlgPack::index_type))
79  , double
80  >
81  validate_index_stride;
82 } // end namespace
83 
84 void AbstractLinAlgPack::add_elements( SpVector* sv_lhs, value_type alpha, const DVectorSlice& vs_rhs
85  , size_type offset, bool add_zeros )
86 {
87  typedef SpVector::element_type ele_t;
88  const bool assume_sorted = !sv_lhs->nz() || ( sv_lhs->nz() && sv_lhs->is_sorted() );
89  DVectorSlice::const_iterator
90  itr = vs_rhs.begin();
91  if(add_zeros) {
92  for( size_type i = 1; i <= vs_rhs.dim(); ++i )
93  sv_lhs->add_element( ele_t( i + offset, alpha * (*itr++) ) );
94  }
95  else {
96  for( size_type i = 1; i <= vs_rhs.dim(); ++i, ++itr )
97  if( *itr != 0.0 )
98  sv_lhs->add_element( ele_t( i + offset, alpha * (*itr) ) );
99  }
100  sv_lhs->assume_sorted(assume_sorted);
101 }
102 
103 void AbstractLinAlgPack::add_elements( SpVector* sv_lhs, value_type alpha, const SpVectorSlice& sv_rhs
104  , size_type offset, bool add_zeros )
105 {
106  typedef SpVector::element_type ele_t;
107  const bool assume_sorted = ( !sv_lhs->nz() || ( sv_lhs->nz() && sv_lhs->is_sorted() ) )
108  && ( !sv_rhs.nz() || ( sv_rhs.nz() || sv_rhs.is_sorted() ) );
109  if(add_zeros) {
110  for( SpVectorSlice::const_iterator itr = sv_rhs.begin(); itr != sv_rhs.end(); ++itr )
111  sv_lhs->add_element( ele_t( itr->index() + sv_rhs.offset() + offset, alpha * (itr->value()) ) );
112  }
113  else {
114  for( SpVectorSlice::const_iterator itr = sv_rhs.begin(); itr != sv_rhs.end(); ++itr )
115  if(itr->value() != 0.0 )
116  sv_lhs->add_element( ele_t( itr->index() + sv_rhs.offset() + offset, alpha * (itr->value()) ) );
117  }
118  sv_lhs->assume_sorted(assume_sorted);
119 }
size_t size_type