All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
SVecDVecMultExpr.h
Go to the documentation of this file.
1 //=================================================================================================
33 //=================================================================================================
34 
35 #ifndef _BLAZE_MATH_EXPRESSIONS_SVECDVECMULTEXPR_H_
36 #define _BLAZE_MATH_EXPRESSIONS_SVECDVECMULTEXPR_H_
37 
38 
39 //*************************************************************************************************
40 // Includes
41 //*************************************************************************************************
42 
43 #include <iterator>
44 #include <stdexcept>
54 #include <blaze/math/shims/Reset.h>
63 #include <blaze/util/Assert.h>
65 #include <blaze/util/EnableIf.h>
67 #include <blaze/util/mpl/Max.h>
68 #include <blaze/util/SelectType.h>
69 #include <blaze/util/Types.h>
71 
72 
73 namespace blaze {
74 
75 //=================================================================================================
76 //
77 // CLASS SVECDVECMULTEXPR
78 //
79 //=================================================================================================
80 
81 //*************************************************************************************************
88 template< typename VT1 // Type of the left-hand side sparse vector
89  , typename VT2 // Type of the right-hand side dense vector
90  , bool TF > // Transpose flag
91 class SVecDVecMultExpr : public SparseVector< SVecDVecMultExpr<VT1,VT2,TF>, TF >
92  , private VecVecMultExpr
93  , private Computation
94 {
95  private:
96  //**Type definitions****************************************************************************
97  typedef typename VT1::ResultType RT1;
98  typedef typename VT2::ResultType RT2;
99  typedef typename VT1::ReturnType RN1;
100  typedef typename VT2::ReturnType RN2;
101  typedef typename VT1::CompositeType CT1;
102  typedef typename VT2::CompositeType CT2;
103  typedef typename VT1::TransposeType TT1;
104  typedef typename VT2::TransposeType TT2;
105  //**********************************************************************************************
106 
107  //**Return type evaluation**********************************************************************
109 
114  enum { returnExpr = !IsTemporary<RN1>::value && !IsTemporary<RN2>::value };
115 
118  //**********************************************************************************************
119 
120  //**Evaluation strategy*************************************************************************
122 
129 
131  template< typename VT >
133  struct UseAssign {
134  enum { value = useAssign };
135  };
137  //**********************************************************************************************
138 
139  public:
140  //**Type definitions****************************************************************************
145 
148 
151 
153  typedef typename SelectType< IsExpression<VT1>::value, const VT1, const VT1& >::Type LeftOperand;
154 
156  typedef typename SelectType< IsExpression<VT2>::value, const VT2, const VT2& >::Type RightOperand;
157  //**********************************************************************************************
158 
159  //**Compilation flags***************************************************************************
161  enum { smpAssignable = 0 };
162  //**********************************************************************************************
163 
164  //**ConstIterator class definition**************************************************************
168  {
169  public:
170  //**Type definitions*************************************************************************
173 
176 
177  typedef std::forward_iterator_tag IteratorCategory;
178  typedef ElementType ValueType;
182 
183  // STL iterator requirements
189  //*******************************************************************************************
190 
191  //**Constructor******************************************************************************
194  inline ConstIterator( IteratorType it, RightOperand vec )
195  : it_ ( it ) // Iterator over the elements of the left-hand side sparse vector expression
196  , vec_( vec ) // Right-hand side dense vector expression
197  {}
198  //*******************************************************************************************
199 
200  //**Prefix increment operator****************************************************************
206  ++it_;
207  return *this;
208  }
209  //*******************************************************************************************
210 
211  //**Element access operator******************************************************************
216  inline const Element operator*() const {
217  return Element( it_->value() * vec_[it_->index()], it_->index() );
218  }
219  //*******************************************************************************************
220 
221  //**Element access operator******************************************************************
226  inline const ConstIterator* operator->() const {
227  return this;
228  }
229  //*******************************************************************************************
230 
231  //**Value function***************************************************************************
236  inline ReturnType value() const {
237  return it_->value() * vec_[it_->index()];
238  }
239  //*******************************************************************************************
240 
241  //**Index function***************************************************************************
246  inline size_t index() const {
247  return it_->index();
248  }
249  //*******************************************************************************************
250 
251  //**Equality operator************************************************************************
257  inline bool operator==( const ConstIterator& rhs ) const {
258  return it_ == rhs.it_;
259  }
260  //*******************************************************************************************
261 
262  //**Inequality operator**********************************************************************
268  inline bool operator!=( const ConstIterator& rhs ) const {
269  return it_ != rhs.it_;
270  }
271  //*******************************************************************************************
272 
273  //**Subtraction operator*********************************************************************
279  inline DifferenceType operator-( const ConstIterator& rhs ) const {
280  return it_ - rhs.it_;
281  }
282  //*******************************************************************************************
283 
284  private:
285  //**Member variables*************************************************************************
287  RightOperand vec_;
288  //*******************************************************************************************
289  };
290  //**********************************************************************************************
291 
292  //**Constructor*********************************************************************************
298  explicit inline SVecDVecMultExpr( const VT1& lhs, const VT2& rhs )
299  : lhs_( lhs ) // Left-hand side sparse vector of the multiplication expression
300  , rhs_( rhs ) // Right-hand side dense vector of the multiplication expression
301  {
302  BLAZE_INTERNAL_ASSERT( lhs.size() == rhs.size(), "Invalid vector sizes" );
303  }
304  //**********************************************************************************************
305 
306  //**Subscript operator**************************************************************************
312  inline ReturnType operator[]( size_t index ) const {
313  BLAZE_INTERNAL_ASSERT( index < lhs_.size(), "Invalid vector access index" );
314  return lhs_[index] * rhs_[index];
315  }
316  //**********************************************************************************************
317 
318  //**Begin function******************************************************************************
323  inline ConstIterator begin() const {
324  return ConstIterator( lhs_.begin(), rhs_ );
325  }
326  //**********************************************************************************************
327 
328  //**End function********************************************************************************
333  inline ConstIterator end() const {
334  return ConstIterator( lhs_.end(), rhs_ );
335  }
336  //**********************************************************************************************
337 
338  //**Size function*******************************************************************************
343  inline size_t size() const {
344  return rhs_.size();
345  }
346  //**********************************************************************************************
347 
348  //**NonZeros function***************************************************************************
353  inline size_t nonZeros() const {
354  return lhs_.nonZeros();
355  }
356  //**********************************************************************************************
357 
358  //**Find function*******************************************************************************
364  inline ConstIterator find( size_t index ) const {
366  return ConstIterator( lhs_.find( index ), rhs_ );
367  }
368  //**********************************************************************************************
369 
370  //**LowerBound function*************************************************************************
376  inline ConstIterator lowerBound( size_t index ) const {
378  return ConstIterator( lhs_.lowerBound( index ), rhs_ );
379  }
380  //**********************************************************************************************
381 
382  //**UpperBound function*************************************************************************
388  inline ConstIterator upperBound( size_t index ) const {
390  return ConstIterator( lhs_.upperBound( index ), rhs_ );
391  }
392  //**********************************************************************************************
393 
394  //**Left operand access*************************************************************************
399  inline LeftOperand leftOperand() const {
400  return lhs_;
401  }
402  //**********************************************************************************************
403 
404  //**Right operand access************************************************************************
409  inline RightOperand rightOperand() const {
410  return rhs_;
411  }
412  //**********************************************************************************************
413 
414  //**********************************************************************************************
420  template< typename T >
421  inline bool canAlias( const T* alias ) const {
422  return ( lhs_.canAlias( alias ) ) || ( rhs_.canAlias( alias ) );
423  }
424  //**********************************************************************************************
425 
426  //**********************************************************************************************
432  template< typename T >
433  inline bool isAliased( const T* alias ) const {
434  return ( lhs_.isAliased( alias ) ) || ( rhs_.isAliased( alias ) );
435  }
436  //**********************************************************************************************
437 
438  private:
439  //**Member variables****************************************************************************
440  LeftOperand lhs_;
441  RightOperand rhs_;
442  //**********************************************************************************************
443 
444  //**Assignment to dense vectors*****************************************************************
458  template< typename VT > // Type of the target dense vector
459  friend inline typename EnableIf< UseAssign<VT> >::Type
460  assign( DenseVector<VT,TF>& lhs, const SVecDVecMultExpr& rhs )
461  {
463 
464  BLAZE_INTERNAL_ASSERT( (~lhs).size() == rhs.size(), "Invalid vector sizes" );
465 
467 
468  CT1 x( serial( rhs.lhs_ ) ); // Evaluation of the left-hand side sparse vector operand
469  CT2 y( serial( rhs.rhs_ ) ); // Evaluation of the right-hand side dense vector operand
470 
471  BLAZE_INTERNAL_ASSERT( x.size() == rhs.lhs_.size(), "Invalid vector size" );
472  BLAZE_INTERNAL_ASSERT( y.size() == rhs.rhs_.size(), "Invalid vector size" );
473  BLAZE_INTERNAL_ASSERT( x.size() == (~lhs).size() , "Invalid vector size" );
474 
475  for( ConstIterator element=x.begin(); element!=x.end(); ++element )
476  (~lhs)[element->index()] = element->value() * y[element->index()];
477  }
479  //**********************************************************************************************
480 
481  //**Assignment to sparse vectors****************************************************************
495  template< typename VT > // Type of the target sparse vector
496  friend inline typename EnableIf< UseAssign<VT> >::Type
497  assign( SparseVector<VT,TF>& lhs, const SVecDVecMultExpr& rhs )
498  {
500 
501  BLAZE_INTERNAL_ASSERT( (~lhs).size() == rhs.size(), "Invalid vector sizes" );
502 
504 
505  CT1 x( serial( rhs.lhs_ ) ); // Evaluation of the left-hand side sparse vector operand
506  CT2 y( serial( rhs.rhs_ ) ); // Evaluation of the right-hand side dense vector operand
507 
508  BLAZE_INTERNAL_ASSERT( x.size() == rhs.lhs_.size(), "Invalid vector size" );
509  BLAZE_INTERNAL_ASSERT( y.size() == rhs.rhs_.size(), "Invalid vector size" );
510  BLAZE_INTERNAL_ASSERT( x.size() == (~lhs).size() , "Invalid vector size" );
511 
512  for( ConstIterator element=x.begin(); element!=x.end(); ++element )
513  (~lhs).append( element->index(), element->value() * y[element->index()] );
514  }
516  //**********************************************************************************************
517 
518  //**Addition assignment to dense vectors********************************************************
532  template< typename VT > // Type of the target dense vector
533  friend inline typename EnableIf< UseAssign<VT> >::Type
534  addAssign( DenseVector<VT,TF>& lhs, const SVecDVecMultExpr& rhs )
535  {
537 
538  BLAZE_INTERNAL_ASSERT( (~lhs).size() == rhs.size(), "Invalid vector sizes" );
539 
541 
542  CT1 x( serial( rhs.lhs_ ) ); // Evaluation of the left-hand side sparse vector operand
543  CT2 y( serial( rhs.rhs_ ) ); // Evaluation of the right-hand side dense vector operand
544 
545  BLAZE_INTERNAL_ASSERT( x.size() == rhs.lhs_.size(), "Invalid vector size" );
546  BLAZE_INTERNAL_ASSERT( y.size() == rhs.rhs_.size(), "Invalid vector size" );
547  BLAZE_INTERNAL_ASSERT( x.size() == (~lhs).size() , "Invalid vector size" );
548 
549  for( ConstIterator element=x.begin(); element!=x.end(); ++element )
550  (~lhs)[element->index()] += element->value() * y[element->index()];
551  }
553  //**********************************************************************************************
554 
555  //**Addition assignment to sparse vectors*******************************************************
556  // No special implementation for the addition assignment to sparse vectors.
557  //**********************************************************************************************
558 
559  //**Subtraction assignment to dense vectors*****************************************************
573  template< typename VT > // Type of the target dense vector
574  friend inline typename EnableIf< UseAssign<VT> >::Type
575  subAssign( DenseVector<VT,TF>& lhs, const SVecDVecMultExpr& rhs )
576  {
578 
579  BLAZE_INTERNAL_ASSERT( (~lhs).size() == rhs.size(), "Invalid vector sizes" );
580 
582 
583  CT1 x( serial( rhs.lhs_ ) ); // Evaluation of the left-hand side sparse vector operand
584  CT2 y( serial( rhs.rhs_ ) ); // Evaluation of the right-hand side dense vector operand
585 
586  BLAZE_INTERNAL_ASSERT( x.size() == rhs.lhs_.size(), "Invalid vector size" );
587  BLAZE_INTERNAL_ASSERT( y.size() == rhs.rhs_.size(), "Invalid vector size" );
588  BLAZE_INTERNAL_ASSERT( x.size() == (~lhs).size() , "Invalid vector size" );
589 
590  for( ConstIterator element=x.begin(); element!=x.end(); ++element )
591  (~lhs)[element->index()] -= element->value() * y[element->index()];
592  }
594  //**********************************************************************************************
595 
596  //**Subtraction assignment to sparse vectors****************************************************
597  // No special implementation for the subtraction assignment to sparse vectors.
598  //**********************************************************************************************
599 
600  //**Multiplication assignment to dense vectors**************************************************
614  template< typename VT > // Type of the target dense vector
615  friend inline typename EnableIf< UseAssign<VT> >::Type
616  multAssign( DenseVector<VT,TF>& lhs, const SVecDVecMultExpr& rhs )
617  {
619 
620  BLAZE_INTERNAL_ASSERT( (~lhs).size() == rhs.size(), "Invalid vector sizes" );
621 
623 
624  CT1 x( serial( rhs.lhs_ ) ); // Evaluation of the left-hand side sparse vector operand
625  CT2 y( serial( rhs.rhs_ ) ); // Evaluation of the right-hand side dense vector operand
626 
627  BLAZE_INTERNAL_ASSERT( x.size() == rhs.lhs_.size(), "Invalid vector size" );
628  BLAZE_INTERNAL_ASSERT( y.size() == rhs.rhs_.size(), "Invalid vector size" );
629  BLAZE_INTERNAL_ASSERT( x.size() == (~lhs).size() , "Invalid vector size" );
630 
631  const ConstIterator end( x.end() );
632  ConstIterator begin( x.begin() );
633  size_t i( 0UL );
634 
635  for( ; begin!=end; ++begin ) {
636  const size_t index( begin->index() );
637  for( ; i<index; ++i )
638  reset( (~lhs)[i] );
639  (~lhs)[index] *= begin->value() * y[index];
640  ++i;
641  }
642 
643  for( ; i<rhs.size(); ++i )
644  reset( (~lhs)[i] );
645  }
647  //**********************************************************************************************
648 
649  //**Multiplication assignment to sparse vectors*************************************************
650  // No special implementation for the multiplication assignment to sparse vectors.
651  //**********************************************************************************************
652 
653  //**Compile time checks*************************************************************************
661  //**********************************************************************************************
662 };
663 //*************************************************************************************************
664 
665 
666 
667 
668 //=================================================================================================
669 //
670 // GLOBAL BINARY ARITHMETIC OPERATORS
671 //
672 //=================================================================================================
673 
674 //*************************************************************************************************
701 template< typename T1 // Type of the left-hand side sparse vector
702  , typename T2 // Type of the right-hand side dense vector
703  , bool TF > // Transpose flag
704 inline const SVecDVecMultExpr<T1,T2,TF>
706 {
708 
709  if( (~lhs).size() != (~rhs).size() )
710  throw std::invalid_argument( "Vector sizes do not match" );
711 
712  return SVecDVecMultExpr<T1,T2,TF>( ~lhs, ~rhs );
713 }
714 //*************************************************************************************************
715 
716 
717 
718 
719 //=================================================================================================
720 //
721 // SIZE SPECIALIZATIONS
722 //
723 //=================================================================================================
724 
725 //*************************************************************************************************
727 template< typename VT1, typename VT2, bool TF >
728 struct Size< SVecDVecMultExpr<VT1,VT2,TF> >
729  : public Max< Size<VT1>, Size<VT2> >::Type
730 {};
732 //*************************************************************************************************
733 
734 
735 
736 
737 //=================================================================================================
738 //
739 // EXPRESSION TRAIT SPECIALIZATIONS
740 //
741 //=================================================================================================
742 
743 //*************************************************************************************************
745 template< typename VT1, typename VT2, bool TF, bool AF >
746 struct SubvectorExprTrait< SVecDVecMultExpr<VT1,VT2,TF>, AF >
747 {
748  public:
749  //**********************************************************************************************
750  typedef typename MultExprTrait< typename SubvectorExprTrait<const VT1,AF>::Type
751  , typename SubvectorExprTrait<const VT2,AF>::Type >::Type Type;
752  //**********************************************************************************************
753 };
755 //*************************************************************************************************
756 
757 } // namespace blaze
758 
759 #endif
ptrdiff_t DifferenceType
Difference between two iterators.
Definition: SVecDVecMultExpr.h:181
Pointer difference type of the Blaze library.
Header file for the Max class template.
ValueType & ReferenceType
Reference return type.
Definition: SVecDVecMultExpr.h:180
size_t nonZeros() const
Returns the number of non-zero elements in the sparse vector.
Definition: SVecDVecMultExpr.h:353
BLAZE_ALWAYS_INLINE void multAssign(Matrix< MT1, SO1 > &lhs, const Matrix< MT2, SO2 > &rhs)
Default implementation of the multiplication assignment of a matrix to a matrix.
Definition: Matrix.h:879
Compile time check whether the given type is a temporary vector or matrix type.This type trait class ...
Definition: IsTemporary.h:87
LeftOperand leftOperand() const
Returns the left-hand side sparse vector operand.
Definition: SVecDVecMultExpr.h:399
ConstIterator find(size_t index) const
Searches for a specific vector element.
Definition: SVecDVecMultExpr.h:364
const DMatDMatMultExpr< T1, T2 > operator*(const DenseMatrix< T1, false > &lhs, const DenseMatrix< T2, false > &rhs)
Multiplication operator for the multiplication of two row-major dense matrices ( ).
Definition: DMatDMatMultExpr.h:4838
ConstIterator begin() const
Returns an iterator to the first non-zero element of the sparse vector.
Definition: SVecDVecMultExpr.h:323
Header file for the SparseVector base class.
ConstIterator lowerBound(size_t index) const
Returns an iterator to the first index not less then the given index.
Definition: SVecDVecMultExpr.h:376
RightOperand vec_
Right-hand side dense vector expression.
Definition: SVecDVecMultExpr.h:287
Efficient implementation of a compressed matrix.The CompressedMatrix class template is the represent...
Definition: CompressedMatrix.h:205
bool operator!=(const ConstIterator &rhs) const
Inequality comparison between two ConstIterator objects.
Definition: SVecDVecMultExpr.h:268
size_t index() const
Access to the current index of the sparse element.
Definition: SVecDVecMultExpr.h:246
VT1::TransposeType TT1
Transpose type of the left-hand side sparse vector expression.
Definition: SVecDVecMultExpr.h:103
IteratorCategory iterator_category
The iterator category.
Definition: SVecDVecMultExpr.h:184
MultExprTrait< RN1, RN2 >::Type ExprReturnType
Expression return type for the subscript operator.
Definition: SVecDVecMultExpr.h:117
RightOperand rhs_
Right-hand side dense vector of the multiplication expression.
Definition: SVecDVecMultExpr.h:441
const This & CompositeType
Data type for composite expression templates.
Definition: CompressedMatrix.h:2478
Type ElementType
Type of the sparse matrix elements.
Definition: CompressedMatrix.h:257
VT2::CompositeType CT2
Composite type of the right-hand side dense vector expression.
Definition: SVecDVecMultExpr.h:102
const DMatSerialExpr< MT, SO > serial(const DenseMatrix< MT, SO > &dm)
Forces the serial evaluation of the given dense matrix expression dm.
Definition: DMatSerialExpr.h:695
Header file for the Computation base class.
ValueType value_type
Type of the underlying pointers.
Definition: SVecDVecMultExpr.h:185
SVecDVecMultExpr< VT1, VT2, TF > This
Type of this SVecDVecMultExpr instance.
Definition: SVecDVecMultExpr.h:141
bool isAliased(const T *alias) const
Returns whether the expression is aliased with the given address alias.
Definition: SVecDVecMultExpr.h:433
size_t size() const
Returns the current size/dimension of the vector.
Definition: SVecDVecMultExpr.h:343
Constraint on the data type.
SelectType< IsExpression< VT2 >::value, const VT2, const VT2 & >::Type RightOperand
Composite type of the right-hand side dense vector expression.
Definition: SVecDVecMultExpr.h:156
RemoveReference< LeftOperand >::Type::ConstIterator IteratorType
Iterator type of the sparse vector expression.
Definition: SVecDVecMultExpr.h:175
ResultType::TransposeType TransposeType
Transpose type for expression template evaluations.
Definition: SVecDVecMultExpr.h:143
VT1::CompositeType CT1
Composite type of the left-hand side sparse vector expression.
Definition: SVecDVecMultExpr.h:101
Header file for the MultExprTrait class template.
ReturnType operator[](size_t index) const
Subscript operator for the direct access to the vector elements.
Definition: SVecDVecMultExpr.h:312
Compile time check to query the requirement to evaluate an expression.Via this type trait it is possi...
Definition: RequiresEvaluation.h:90
ResultType::ElementType ElementType
Resulting element type.
Definition: SVecDVecMultExpr.h:144
Header file for the ValueIndexPair class.
Compile time type selection.The SelectType class template selects one of the two given types T1 and T...
Definition: SelectType.h:59
Header file for the IsTemporary type trait class.
Header file for the multiplication trait.
const Element * ConstIterator
Iterator over constant elements.
Definition: CompressedMatrix.h:2482
BLAZE_ALWAYS_INLINE void assign(Matrix< MT1, SO1 > &lhs, const Matrix< MT2, SO2 > &rhs)
Default implementation of the assignment of a matrix to a matrix.
Definition: Matrix.h:635
bool canAlias(const T *alias) const
Returns whether the expression can alias with the given address alias.
Definition: SVecDVecMultExpr.h:421
SelectType< IsExpression< VT1 >::value, const VT1, const VT1 & >::Type LeftOperand
Composite type of the left-hand side sparse vector expression.
Definition: SVecDVecMultExpr.h:153
Base class for N-dimensional dense vectors.The DenseVector class is a base class for all arbitrarily ...
Definition: DenseVector.h:70
#define BLAZE_CONSTRAINT_MUST_BE_SPARSE_VECTOR_TYPE(T)
Constraint on the data type.In case the given data type T is not a sparse, N-dimensional vector type...
Definition: SparseVector.h:79
LeftOperand lhs_
Left-hand side sparse vector of the multiplication expression.
Definition: SVecDVecMultExpr.h:440
Constraint on the data type.
CompressedMatrix< Type, false > TransposeType
Transpose type for expression template evaluations.
Definition: CompressedMatrix.h:2475
Constraint on the data type.
Header file for the VecVecMultExpr base class.
Constraint on the data type.
Header file for the SelectType class template.
Header file for all forward declarations for expression class templates.
Constraint on the data type.
VT2::ResultType RT2
Result type of the right-hand side dense vector expression.
Definition: SVecDVecMultExpr.h:98
Iterator over the elements of the sparse vector-dense vector multiplication expression.
Definition: SVecDVecMultExpr.h:167
Header file for the EnableIf class template.
VT2::ReturnType RN2
Return type of the right-hand side dense vector expression.
Definition: SVecDVecMultExpr.h:100
RightOperand rightOperand() const
Returns the right-hand side dense vector operand.
Definition: SVecDVecMultExpr.h:409
Header file for the serial shim.
SVecDVecMultExpr(const VT1 &lhs, const VT2 &rhs)
Constructor for the SVecDVecMultExpr class.
Definition: SVecDVecMultExpr.h:298
ReturnType value() const
Access to the current value of the sparse element.
Definition: SVecDVecMultExpr.h:236
ValueType * PointerType
Pointer return type.
Definition: SVecDVecMultExpr.h:179
DifferenceType difference_type
Difference between two iterators.
Definition: SVecDVecMultExpr.h:188
VT1::ResultType RT1
Result type of the left-hand side sparse vector expression.
Definition: SVecDVecMultExpr.h:97
MultTrait< RT1, RT2 >::Type ResultType
Result type for expression template evaluations.
Definition: SVecDVecMultExpr.h:142
SelectType< useAssign, const ResultType, const SVecDVecMultExpr & >::Type CompositeType
Data type for composite expression templates.
Definition: SVecDVecMultExpr.h:150
const Type & ReturnType
Return type for expression template evaluations.
Definition: CompressedMatrix.h:2477
Removal of reference modifiers.The RemoveCV type trait removes any reference modifiers from the given...
Definition: RemoveReference.h:69
VT1::ReturnType RN1
Return type of the left-hand side sparse vector expression.
Definition: SVecDVecMultExpr.h:99
Header file for run time assertion macros.
Base template for the MultTrait class.
Definition: MultTrait.h:142
BLAZE_ALWAYS_INLINE void addAssign(Matrix< MT1, SO1 > &lhs, const Matrix< MT2, SO2 > &rhs)
Default implementation of the addition assignment of a matrix to a matrix.
Definition: Matrix.h:742
ValueIndexPair< ElementType > Element
Element type of the sparse vector expression.
Definition: SVecDVecMultExpr.h:172
Substitution Failure Is Not An Error (SFINAE) class.The EnableIf class template is an auxiliary tool ...
Definition: EnableIf.h:184
Header file for the reset shim.
ConstIterator upperBound(size_t index) const
Returns an iterator to the first index greater then the given index.
Definition: SVecDVecMultExpr.h:388
DifferenceType operator-(const ConstIterator &rhs) const
Calculating the number of elements between two expression iterators.
Definition: SVecDVecMultExpr.h:279
BLAZE_ALWAYS_INLINE void reset(const NonNumericProxy< MT > &proxy)
Resetting the represented element to the default initial values.
Definition: NonNumericProxy.h:833
#define BLAZE_CONSTRAINT_MUST_NOT_REQUIRE_EVALUATION(T)
Constraint on the data type.In case the given data type T requires an intermediate evaluation within ...
Definition: RequiresEvaluation.h:118
Header file for the RemoveReference type trait.
ElementType ValueType
Type of the underlying pointers.
Definition: SVecDVecMultExpr.h:178
#define BLAZE_CONSTRAINT_MUST_BE_DENSE_VECTOR_TYPE(T)
Constraint on the data type.In case the given data type T is not a dense, N-dimensional vector type...
Definition: DenseVector.h:79
IteratorType it_
Iterator over the elements of the left-hand side sparse vector expression.
Definition: SVecDVecMultExpr.h:286
Index-value-pair for sparse vectors and matrices.The ValueIndexPair class represents a single index-v...
Definition: ValueIndexPair.h:70
Constraint on the data type.
const SelectType< returnExpr, ExprReturnType, ElementType >::Type ReturnType
Return type for expression template evaluations.
Definition: SVecDVecMultExpr.h:147
#define BLAZE_CONSTRAINT_MUST_FORM_VALID_VECVECMULTEXPR(T1, T2)
Constraint on the data type.In case the given data types T1 and T2 do not form a valid vector/vector ...
Definition: VecVecMultExpr.h:165
ConstIterator & operator++()
Pre-increment operator.
Definition: SVecDVecMultExpr.h:205
Base class for sparse vectors.The SparseVector class is a base class for all arbitrarily sized (N-dim...
Definition: Forward.h:108
#define BLAZE_FUNCTION_TRACE
Function trace macro.This macro can be used to reliably trace function calls. In case function tracin...
Definition: FunctionTrace.h:157
This ResultType
Result type for expression template evaluations.
Definition: CompressedMatrix.h:2473
PointerType pointer
Pointer return type.
Definition: SVecDVecMultExpr.h:186
Header file for basic type definitions.
const Element operator*() const
Direct access to the sparse vector element at the current iterator position.
Definition: SVecDVecMultExpr.h:216
Header file for the SubvectorExprTrait class template.
ConstIterator(IteratorType it, RightOperand vec)
Constructor for the ConstIterator class.
Definition: SVecDVecMultExpr.h:194
VT2::TransposeType TT2
Transpose type of the right-hand side dense vector expression.
Definition: SVecDVecMultExpr.h:104
ConstIterator end() const
Returns an iterator just past the last non-zero element of the sparse vector.
Definition: SVecDVecMultExpr.h:333
bool operator==(const ConstIterator &rhs) const
Equality comparison between two ConstIterator objects.
Definition: SVecDVecMultExpr.h:257
Header file for the Size type trait.
Evaluation of the resulting expression type of a multiplication.Via this type trait it is possible to...
Definition: MultExprTrait.h:137
#define BLAZE_CONSTRAINT_MUST_BE_VECTOR_WITH_TRANSPOSE_FLAG(T, TF)
Constraint on the data type.In case the given data type T is not a dense or sparse vector type and in...
Definition: TransposeFlag.h:238
#define BLAZE_INTERNAL_ASSERT(expr, msg)
Run time assertion macro for internal checks.In case of an invalid run time expression, the program execution is terminated. The BLAZE_INTERNAL_ASSERT macro can be disabled by setting the BLAZE_USER_ASSERTION flag to zero or by defining NDEBUG during the compilation.
Definition: Assert.h:101
std::forward_iterator_tag IteratorCategory
The iterator category.
Definition: SVecDVecMultExpr.h:177
const ConstIterator * operator->() const
Direct access to the sparse vector element at the current iterator position.
Definition: SVecDVecMultExpr.h:226
ReferenceType reference
Reference return type.
Definition: SVecDVecMultExpr.h:187
Header file for the IsExpression type trait class.
Header file for the FunctionTrace class.
BLAZE_ALWAYS_INLINE void subAssign(Matrix< MT1, SO1 > &lhs, const Matrix< MT2, SO2 > &rhs)
Default implementation of the subtraction assignment of a matrix to matrix.
Definition: Matrix.h:849
Expression object for sparse vector-dense vector multiplications.The SVecDVecMultExpr class represent...
Definition: Forward.h:111