Vector Operations

Table of Contents


Constructors


Instantiating and setting up a vector is very easy and intuitive. However, there are a few rules to take care of:


Default Construction

// All vectors can be default constructed. Whereas the size
// of StaticVectors is fixed via the second template parameter,
// the initial size of a default constructed DynamicVector or
// CompressedVector is 0.
StaticVector<int,2UL> v1; // Instantiation of a 2D integer column vector.
// All elements are initialized to 0.
StaticVector<long,3UL,columnVector> v2; // Instantiation of a 3D long integer column vector.
// Again, all elements are initialized to 0L.
DynamicVector<float> v3; // Instantiation of a dynamic single precision column
// vector of size 0.
DynamicVector<double,rowVector> v4; // Instantiation of a dynamic double precision row
// vector of size 0.
CompressedVector<int> v5; // Instantiation of a compressed integer column
// vector of size 0.
CompressedVector<double,rowVector> v6; // Instantiation of a compressed double precision row
// vector of size 0.


Construction with Specific Size

The DynamicVector, HybridVector and CompressedVector classes offer a constructor that allows to immediately give the vector the required size. Whereas both dense vectors (i.e. DynamicVector and HybridVector) use this information to allocate memory for all vector elements, CompressedVector merely acquires the size but remains empty.

DynamicVector<int,columnVector> v7( 9UL ); // Instantiation of an integer dynamic column vector
// of size 9. The elements are NOT initialized!
HybridVector< complex<float>, 5UL > v8( 2UL ); // Instantiation of a column vector with two single
// precision complex values. The elements are
// default constructed.
CompressedVector<int,rowVector> v9( 10UL ); // Instantiation of a compressed row vector with
// size 10. Initially, the vector provides no
// capacity for non-zero elements.


Initialization Constructors

All dense vector classes offer a constructor that allows for a direct, homogeneous initialization of all vector elements. In contrast, for sparse vectors the predicted number of non-zero elements can be specified

StaticVector<int,3UL,rowVector> v10( 2 ); // Instantiation of a 3D integer row vector.
// All elements are initialized to 2.
DynamicVector<float> v11( 3UL, 7.0F ); // Instantiation of a dynamic single precision
// column vector of size 3. All elements are
// set to 7.0F.
CompressedVector<float,rowVector> v12( 15UL, 3UL ); // Instantiation of a single precision column
// vector of size 15, which provides enough
// space for at least 3 non-zero elements.


Array Construction

Alternatively, all dense vector classes offer a constructor for an initialization with a dynamic or static array. If the vector is initialized from a dynamic array, the constructor expects the actual size of the array as first argument, the array as second argument. In case of a static array, the fixed size of the array is used:

const unique_ptr<double[]> array1( new double[2] );
// ... Initialization of the dynamic array
blaze::StaticVector<double,2UL> v13( 2UL, array1.get() );
int array2[4] = { 4, -5, -6, 7 };


Initializer List Construction

In addition, all dense and sparse vector classes can be directly initialized by means of an initializer list:

blaze::DynamicVector<float> v15{ 1.0F, 2.0F, 3.0F, 4.0F };
blaze::CompressedVector<int> v16{ 0, 2, 0, 0, 5, 0, 7, 0 };

In case of sparse vectors, only the non-zero elements are used to initialize the vector.


Copy Construction

All dense and sparse vectors can be created as the copy of any other dense or sparse vector with the same transpose flag (i.e. blaze::rowVector or blaze::columnVector).

StaticVector<int,9UL,columnVector> v17( v7 ); // Instantiation of the dense column vector v17
// as copy of the dense column vector v7.
DynamicVector<int,rowVector> v18( v9 ); // Instantiation of the dense row vector v18 as
// copy of the sparse row vector v9.
CompressedVector<int,columnVector> v19( v1 ); // Instantiation of the sparse column vector v19
// as copy of the dense column vector v1.
CompressedVector<float,rowVector> v20( v12 ); // Instantiation of the sparse row vector v20 as
// copy of the row vector v12.

Note that it is not possible to create a StaticVector as a copy of a vector with a different size:

StaticVector<int,5UL,columnVector> v21( v7 ); // Runtime error: Size does not match!
StaticVector<int,4UL,rowVector> v22( v10 ); // Compile time error: Size does not match!


Assignment


There are several types of assignment to dense and sparse vectors: Homogeneous Assignment, Array Assignment, Copy Assignment, and Compound Assignment.


Homogeneous Assignment

Sometimes it may be necessary to assign the same value to all elements of a dense vector. For this purpose, the assignment operator can be used:

// Setting all integer elements of the StaticVector to 2
v1 = 2;
// Setting all double precision elements of the DynamicVector to 5.0
v2 = 5.0;


Array Assignment

Dense vectors can also be assigned a static array:

float array1[2] = { 1.0F, 2.0F };
double array2[5] = { 2.1, 4.0, -1.7, 8.6, -7.2 };
v1 = array1;
v2 = array2;


Initializer List Assignment

Alternatively, it is possible to directly assign an initializer list to a dense or sparse vector:

v1 = { 1.0F, 2.0F };
v2 = { 2.1, 0.0, -1.7, 0.0, -7.2 };

In case of sparse vectors, only the non-zero elements are considered.


Copy Assignment

For all vector types it is generally possible to assign another vector with the same transpose flag (i.e. blaze::columnVector or blaze::rowVector). Note that in case of StaticVectors, the assigned vector is required to have the same size as the StaticVector since the size of a StaticVector cannot be adapted!

// ... Initialization of the vectors
v1 = v2; // OK: Assignment of a 3D dense column vector to another 3D dense column vector
v1 = v4; // OK: Assignment of a 3D sparse column vector to a 3D dense column vector
v1 = v3; // Runtime error: Cannot assign a 5D vector to a 3D static vector
v1 = v5; // Compilation error: Cannot assign a row vector to a column vector


Compound Assignment

Next to plain assignment, it is also possible to use addition assignment, subtraction assignment, and multiplication assignment. Note however, that in contrast to plain assignment the size and the transpose flag of the vectors has be to equal in order to able to perform a compound assignment.

// ... Initialization of the vectors
v1 += v2; // OK: Addition assignment between two column vectors of the same size
v1 += v3; // Runtime error: No compound assignment between vectors of different size
v1 -= v4; // Compilation error: No compound assignment between vectors of different transpose flag
v4 *= v5; // OK: Multiplication assignment between two row vectors of the same size


Element Access



Subscript Operator

The easiest and most intuitive way to access a dense or sparse vector is via the subscript operator. The indices to access a vector are zero-based:

v1[0] = 1;
v1[1] = 3;
// ...
v2[2] = 7.3F;
v2[4] = -1.4F;

Whereas using the subscript operator on a dense vector only accesses the already existing element, accessing an element of a sparse vector via the subscript operator potentially inserts the element into the vector and may therefore be more expensive. Consider the following example:

for( size_t i=0UL; i<v1.size(); ++i ) {
... = v1[i];
}

Although the compressed vector is only used for read access within the for loop, using the subscript operator temporarily inserts 10 non-zero elements into the vector. Therefore the preferred way to traverse the non-zero elements of a sparse vector is to use iterators.


Iterators

All vectors (sparse as well as dense) offer an alternate way via the begin(), cbegin(), end(), and cend() functions to traverse the currently contained elements by iterators. In case of non-const vectors, begin() and end() return an Iterator, which allows a manipulation of the non-zero value, in case of a constant vector or in case cbegin() or cend() are used a ConstIterator is returned:

CompressedVector<int> v1( 10UL );
// ... Initialization of the vector
// Traversing the vector by Iterator
for( CompressedVector<int>::Iterator it=v1.begin(); it!=v1.end(); ++it ) {
it->value() = ...; // OK: Write access to the value of the non-zero element.
... = it->value(); // OK: Read access to the value of the non-zero element.
it->index() = ...; // Compilation error: The index of a non-zero element cannot be changed.
... = it->index(); // OK: Read access to the index of the non-zero element.
}
// Traversing the vector by ConstIterator
for( CompressedVector<int>::ConstIterator it=v1.cbegin(); it!=v1.cend(); ++it ) {
it->value() = ...; // Compilation error: Assignment to the value via a ConstIterator is invalid.
... = it->value(); // OK: Read access to the value of the non-zero element.
it->index() = ...; // Compilation error: The index of a non-zero element cannot be changed.
... = it->index(); // OK: Read access to the index of the non-zero element.
}

Note that begin(), cbegin(), end(), and cend() are also available as free functions:

for( CompressedVector<int>::Iterator it=begin( v1 ); it!=end( v1 ); ++it ) {
// ...
}
for( CompressedVector<int>::ConstIterator it=cbegin( v1 ); it!=cend( v1 ); ++it ) {
// ...
}


Element Insertion


In contrast to dense vectors, that store all elements independent of their value and that offer direct access to all elements, spares vectors only store the non-zero elements contained in the vector. Therefore it is necessary to explicitly add elements to the vector.


Subscript Operator

The first option to add elements to a sparse vector is the subscript operator:

CompressedVector<int> v1( 3UL );
v1[1] = 2;

In case the element at the given index is not yet contained in the vector, it is automatically inserted. Otherwise the old value is replaced by the new value 2. The operator returns a reference to the sparse vector element.


.set()

An alternative to the subscript operator is the set() function: In case the element is not yet contained in the vector the element is inserted, else the element's value is modified:

// Insert or modify the value at index 3
v1.set( 3, 1 );


.insert()

The insertion of elements can be better controlled via the insert() function. In contrast to the subscript operator and the set() function it emits an exception in case the element is already contained in the vector. In order to check for this case, the find() function can be used:

// In case the element at index 4 is not yet contained in the matrix it is inserted
// with a value of 6.
if( v1.find( 4 ) == v1.end() )
v1.insert( 4, 6 );


.append()

Although the insert() function is very flexible, due to performance reasons it is not suited for the setup of large sparse vectors. A very efficient, yet also very low-level way to fill a sparse vector is the append() function. It requires the sparse vector to provide enough capacity to insert a new element. Additionally, the index of the new element must be larger than the index of the previous element. Violating these conditions results in undefined behavior!

v1.reserve( 10 ); // Reserving space for 10 non-zero elements
v1.append( 5, -2 ); // Appending the element -2 at index 5
v1.append( 6, 4 ); // Appending the element 4 at index 6
// ...


Element Removal


.erase()

The erase() member functions can be used to remove elements from a sparse vector. The following example gives an impression of the five different flavors of erase():

CompressedVector<int> v( 42 );
// ... Initialization of the vector
// Erasing the element at index 21
v.erase( 21 );
// Erasing a single element via iterator
v.erase( v.find( 4 ) );
// Erasing all non-zero elements in the range [7..24]
v.erase( v.lowerBound( 7 ), v.upperBound( 24 ) );
// Erasing all non-zero elements with a value larger than 9 by passing a unary predicate
v.erase( []( int i ){ return i > 9; } );
// Erasing all non-zero elements in the range [30..40] with a value larger than 5
v.erase( v.lowerBound( 30 ), v.upperBound( 40 ), []( int i ){ return i > 5; } );


Element Lookup


A sparse vector only stores the non-zero elements contained in the vector. Therefore, whenever accessing a vector element at a specific index a lookup operation is required. Whereas the subscript operator is performing this lookup automatically, it is also possible to use the find(), lowerBound(), and upperBound() member functions for a manual lookup.


.find()

The find() function can be used to check whether a specific element is contained in a sparse vector. It specifically searches for the element at the given index. In case the element is found, the function returns an iterator to the element. Otherwise an iterator just past the last non-zero element of the compressed vector (the end() iterator) is returned. Note that the returned iterator is subject to invalidation due to inserting operations via the subscript operator, the set() function or the insert() function!

CompressedVector<int> a( 42 );
// ... Initialization of the vector
// Searching the element at index 7. In case the element is not
// contained in the vector, the end() iterator is returned.
if( pos != a.end( 7 ) ) {
// ...
}


.lowerBound()

The lowerBound() function returns an iterator to the first element with an index not less then the given index. In combination with the upperBound() function this function can be used to create a pair of iterators specifying a range of indices. Note that the returned iterator is subject to invalidation due to inserting operations via the subscript operator, the set() function or the insert() function!

CompressedVector<int> a( 42 );
// ... Initialization of the vector
// Searching the lower bound of index 17.
CompressedVector<int>::Iterator pos1( A.lowerBound( 17 ) );
// Searching the upper bound of index 28
CompressedVector<int>::Iterator pos2( A.upperBound( 28 ) );
// Erasing all elements in the specified range
a.erase( pos1, pos2 );


.upperBound()

The upperBound() function returns an iterator to the first element with an index greater then the given index. In combination with the lowerBound() function this function can be used to create a pair of iterators specifying a range of indices. Note that the returned iterator is subject to invalidation due to inserting operations via the subscript operator, the set() function or the insert() function!

CompressedVector<int> a( 42 );
// ... Initialization of the vector
// Searching the lower bound of index 17.
CompressedVector<int>::Iterator pos1( A.lowerBound( 17 ) );
// Searching the upper bound of index 28
CompressedVector<int>::Iterator pos2( A.upperBound( 28 ) );
// Erasing all elements in the specified range
a.erase( pos1, pos2 );


Non-Modifying Operations


.size()

Via the size() member function, the current size of a dense or sparse vector can be queried:

// Instantiating a dynamic vector with size 10
v1.size(); // Returns 10
// Instantiating a compressed vector with size 12 and capacity for 3 non-zero elements
v2.size(); // Returns 12

Alternatively, the free function size() can be used to query to current size of a vector. In contrast to the member function, the free function can also be used to query the size of vector expressions:

size( v1 ); // Returns 10, i.e. has the same effect as the member function
size( v2 ); // Returns 12, i.e. has the same effect as the member function
blaze::DynamicMatrix<int> A( 15UL, 12UL );
size( A * v2 ); // Returns 15, i.e. the size of the resulting vector


.capacity()

Via the capacity() (member) function the internal capacity of a dense or sparse vector can be queried. Note that the capacity of a vector doesn't have to be equal to the size of a vector. In case of a dense vector the capacity will always be greater or equal than the size of the vector, in case of a sparse vector the capacity may even be less than the size.

v1.capacity(); // Returns at least 10

For symmetry reasons, there is also a free function /c capacity() available that can be used to query the capacity:

capacity( v1 ); // Returns at least 10, i.e. has the same effect as the member function

Note, however, that it is not possible to query the capacity of a vector expression:

capacity( A * v1 ); // Compilation error!


.nonZeros()

For both dense and sparse vectors the number of non-zero elements can be determined via the nonZeros() member function. Sparse vectors directly return their number of non-zero elements, dense vectors traverse their elements and count the number of non-zero elements.

v1.nonZeros(); // Returns the number of non-zero elements in the dense vector
v2.nonZeros(); // Returns the number of non-zero elements in the sparse vector

There is also a free function nonZeros() available to query the current number of non-zero elements:

nonZeros( v1 ); // Returns the number of non-zero elements in the dense vector
nonZeros( v2 ); // Returns the number of non-zero elements in the sparse vector

The free nonZeros() function can also be used to query the number of non-zero elements in a vector expression. However, the result is not the exact number of non-zero elements, but may be a rough estimation:

nonZeros( A * v1 ); // Estimates the number of non-zero elements in the vector expression


isnan()

The isnan() function provides the means to check a dense or sparse vector for non-a-number elements:

// ... Resizing and initialization
if( isnan( a ) ) { ... }
// ... Resizing and initialization
if( isnan( a ) ) { ... }

If at least one element of the vector is not-a-number, the function returns true, otherwise it returns false. Please note that this function only works for vectors with floating point elements. The attempt to use it for a vector with a non-floating point element type results in a compile time error.


isDefault()

The isDefault() function returns whether the given dense or sparse vector is in default state:

// ... Resizing and initialization
if( isDefault( a ) ) { ... }

A vector is in default state if it appears to just have been default constructed. All resizable vectors (HybridVector, DynamicVector, or CompressedVector) and CustomVector are in default state if its size is equal to zero. A non-resizable vector (StaticVector, all subvectors, element selections, rows, and columns) is in default state if all its elements are in default state. For instance, in case the vector is instantiated for a built-in integral or floating point data type, the function returns true in case all vector elements are 0 and false in case any vector element is not 0.


isUniform()

In order to check if all vector elements are identical, the isUniform function can be used:

// ... Resizing and initialization
if( isUniform( a ) ) { ... }

Note that in case of sparse vectors also the zero elements are also taken into account!


length() / sqrLength()

In order to calculate the length (magnitude) of a dense or sparse vector, both the length() and sqrLength() function can be used:

const float len = length ( v ); // Computes the current length of the vector
const float sqrlen = sqrLength( v ); // Computes the square length of the vector

Note that both functions can only be used for vectors with built-in or complex element type!


trans()

As already mentioned, vectors can either be column vectors (blaze::columnVector) or row vectors (blaze::rowVector). A column vector cannot be assigned to a row vector and vice versa. However, vectors can be transposed via the trans() function:

v1 = v2; // Compilation error: Cannot assign a row vector to a column vector
v1 = trans( v2 ); // OK: Transposing the row vector to a column vector and assigning it
// to the column vector v1
v2 = trans( v1 ); // OK: Transposing the column vector v1 and assigning it to the row vector v2
v1 += trans( v2 ); // OK: Addition assignment of two column vectors


ctrans()

It is also possible to compute the conjugate transpose of a vector. This operation is available via the ctrans() function:

v1 = ctrans( v2 ); // Compute the conjugate transpose vector

Note that the ctrans() function has the same effect as manually applying the conj() and trans() function in any order:

v1 = trans( conj( v2 ) ); // Computing the conjugate transpose vector
v1 = conj( trans( v2 ) ); // Computing the conjugate transpose vector


eval() / evaluate()

The evaluate() function forces an evaluation of the given vector expression and enables an automatic deduction of the correct result type of an operation. The following code example demonstrates its intended use for the multiplication of a dense and a sparse vector:

In this scenario, the evaluate() function assists in deducing the exact result type of the operation via the auto keyword. Please note that if evaluate() is used in this way, no temporary vector is created and no copy operation is performed. Instead, the result is directly written to the target vector due to the return value optimization (RVO). However, if evaluate() is used in combination with an explicit target type, a temporary will be created and a copy operation will be performed if the used type differs from the type returned from the function:

CompressedVector<double> d( a * b ); // No temporary & no copy operation
DynamicVector<double> e( a * b ); // Temporary & copy operation
d = evaluate( a * b ); // Temporary & copy operation

Sometimes it might be desirable to explicitly evaluate a sub-expression within a larger expression. However, please note that evaluate() is not intended to be used for this purpose. This task is more elegantly and efficiently handled by the eval() function:

d = a + evaluate( b * c ); // Unnecessary creation of a temporary vector
d = a + eval( b * c ); // No creation of a temporary vector

In contrast to the evaluate() function, eval() can take the complete expression into account and therefore can guarantee the most efficient way to evaluate it (see also Intra-Statement Optimization).


Modifying Operations


.resize() / .reserve()

The size of a StaticVector is fixed by the second template parameter and a CustomVector cannot be resized. In contrast, the size of DynamicVectors, HybridVectors as well as CompressedVectors can be changed via the resize() function:

DynamicVector<int,columnVector> v1;
CompressedVector<int,rowVector> v2( 4 );
v2[1] = -2;
v2[3] = 11;
// Adapting the size of the dynamic and compressed vectors. The (optional) second parameter
// specifies whether the existing elements should be preserved. Per default, the existing
// elements are preserved.
v1.resize( 5UL ); // Resizing vector v1 to 5 elements. Elements of built-in type remain
// uninitialized, elements of class type are default constructed.
v1.resize( 3UL, false ); // Resizing vector v1 to 3 elements. The old elements are lost, the
// new elements are NOT initialized!
v2.resize( 8UL, true ); // Resizing vector v2 to 8 elements. The old elements are preserved.
v2.resize( 5UL, false ); // Resizing vector v2 to 5 elements. The old elements are lost.

Note that resizing a vector invalidates all existing views (see e.g. Subvectors) on the vector:

blaze::DynamicVector<int,rowVector> v1( 10UL ); // Creating a dynamic vector of size 10
auto sv = subvector( v1, 2UL, 5UL ); // Creating a view on the range [2..6]
v1.resize( 6UL ); // Resizing the vector invalidates the view

When the internal capacity of a vector is no longer sufficient, the allocation of a larger junk of memory is triggered. In order to avoid frequent reallocations, the reserve() function can be used up front to set the internal capacity:

v1.reserve( 100 );
v1.size(); // Returns 0
v1.capacity(); // Returns at least 100

Note that the size of the vector remains unchanged, but only the internal capacity is set according to the specified value!


.shrinkToFit()

The internal capacity of vectors with dynamic memory is preserved in order to minimize the number of reallocations. For that reason, the resize() and reserve() functions can lead to memory overhead. The shrinkToFit() member function can be used to minimize the internal capacity:

blaze::DynamicVector<int> v1( 1000UL ); // Create a vector of 1000 integers
v1.resize( 10UL ); // Resize to 10, but the capacity is preserved
v1.shrinkToFit(); // Remove the unused capacity

Please note that due to padding the capacity might not be reduced exactly to size(). Please also note that in case a reallocation occurs, all iterators (including end() iterators), all pointers and references to elements of the vector are invalidated.

reset() / clear()

In order to reset all elements of a vector, the reset() function can be used:

// Setup of a single precision column vector, whose elements are initialized with 2.0F.
// Resetting all elements to 0.0F. Only the elements are reset, the size of the vector is unchanged.
reset( v1 ); // Resetting all elements
v1.size(); // Returns 3: size and capacity remain unchanged

In order to return a vector to its default state (i.e. the state of a default constructed vector), the clear() function can be used:

// Setup of a single precision column vector, whose elements are initialized with -1.0F.
// Resetting the entire vector.
clear( v1 ); // Resetting the entire vector
v1.size(); // Returns 0: size is reset, but capacity remains unchanged

Note that resetting or clearing both dense and sparse vectors does not change the capacity of the vectors.


swap()

Via the swap() function it is possible to completely swap the contents of two vectors of the same type:

swap( v1, v2 ); // Swapping the contents of v1 and v2


Arithmetic Operations


normalize()

The normalize() function can be used to scale any non-zero vector to a length of 1. In case the vector does not contain a single non-zero element (i.e. is a zero vector), the normalize() function returns a zero vector.

v1 = normalize( v1 ); // Normalizing the dense vector v1
length( v1 ); // Returns 1 (or 0 in case of a zero vector)
v1 = normalize( v2 ); // Assigning v1 the normalized vector v2
length( v1 ); // Returns 1 (or 0 in case of a zero vector)

Note that the normalize() function only works for floating point vectors. The attempt to use it for an integral vector results in a compile time error.


min() / max()

The min() and max() functions can be used for a single vector or multiple vectors. If passed a single vector, the functions return the smallest and largest element of the given dense or sparse vector, respectively:

min( a ); // Returns -5
max( a ); // Returns 7

In case the vector currently has a size of 0, both functions return 0. Additionally, in case a given sparse vector is not completely filled, the zero elements are taken into account. For example, the following compressed vector has only two non-zero elements. However, the minimum of this vector is 0:

b[0] = 1;
b[2] = 3;
min( b ); // Returns 0

If passed two or more dense vectors, the min() and max() functions compute the componentwise minimum or maximum of the given vectors, respectively:

min( a, c ); // Results in the vector ( -5, 1, -7, -4 )
max( a, c, d ); // Results in the vector ( -5, 3, 7, 4 )

Please note that sparse vectors can only be used in the unary min() and max() functions. Also note that all forms of the min() and max() functions can be used to compute the smallest and largest element of a vector expression:

min( a + b + c ); // Returns -9, i.e. the smallest value of the resulting vector
max( a - b - c ); // Returns 11, i.e. the largest value of the resulting vector
min( a + c, c - d ); // Results in ( -10 -2 -7 0 )
max( a - c, c + d ); // Results in ( 0 4 14 6 )


abs()

The abs() function can be used to compute the absolute values of each element of a vector. For instance, the following computation

results in the vector

$ b = \left(\begin{array}{*{1}{c}} 1 \\ 2 \\ 3 \\ \end{array}\right)$


floor() / ceil() / trunc() / round()

The floor(), ceil(), trunc(), and round() functions can be used to round down/up each element of a vector, respectively:

b = floor( a ); // Rounding down each element of the vector
b = ceil ( a ); // Rounding up each element of the vector
b = trunc( a ); // Truncating each element of the vector
b = round( a ); // Rounding each element of the vector


conj()

The conj() function can be applied on a dense or sparse vector to compute the complex conjugate of each element of the vector:

using cplx = std::complex<double>;
// Creating the vector
// ( (-2,-1) )
// ( ( 1, 1) )
StaticVector<cplx,2UL> a{ cplx(-2.0,-1.0), cplx(1.0,1.0) };
// Computing the vector of complex conjugates
// ( (-2, 1) )
// ( ( 1,-1) )
StaticVector<cplx,2UL> b;
b = conj( a );

Additionally, vectors can be conjugated in-place via the conjugate() function:

conjugate( c ); // In-place conjugate operation.
c = conj( c ); // Same as above


real()

The real() function can be used on a dense or sparse vector to extract the real part of each element of the vector:

using cplx = std::complex<double>;
// Creating the vector
// ( (-2,-1) )
// ( ( 1, 1) )
StaticVector<cplx,2UL> a{ cplx(-2.0,-1.0), cplx(1.0,1.0) };
// Extracting the real part of each vector element
// ( -2 )
// ( 1 )
StaticVector<double,2UL> b;
b = real( a );


imag()

The imag() function can be used on a dense or sparse vector to extract the imaginary part of each element of the vector:

using cplx = std::complex<double>;
// Creating the vector
// ( (-2,-1) )
// ( ( 1, 1) )
StaticVector<cplx,2UL> a{ cplx(-2.0,-1.0), cplx(1.0,1.0) };
// Extracting the imaginary part of each vector element
// ( -1 )
// ( 1 )
StaticVector<double,2UL> b;
b = imag( a );


sqrt() / invsqrt()

Via the sqrt() and invsqrt() functions the (inverse) square root of each element of a vector can be computed:

b = sqrt( a ); // Computes the square root of each element
c = invsqrt( a ); // Computes the inverse square root of each element

Note that in case of sparse vectors only the non-zero elements are taken into account!


cbrt() / invcbrt()

The cbrt() and invcbrt() functions can be used to compute the the (inverse) cubic root of each element of a vector:

b = cbrt( a ); // Computes the cubic root of each element
c = invcbrt( a ); // Computes the inverse cubic root of each element

Note that in case of sparse vectors only the non-zero elements are taken into account!


hypot()

The hypot() function can be used to compute the componentwise hypotenous for a pair of dense vectors:

c = hypot( a, b ); // Computes the componentwise hypotenuous


clamp()

The clamp() function can be used to restrict all elements of a vector to a specific range:

b = clamp( a, -1.0, 1.0 ); // Restrict all elements to the range [-1..1]

Note that in case of sparse vectors only the non-zero elements are taken into account!


pow()

The pow() function can be used to compute the exponential value of each element of a vector. If passed a vector and a numeric exponent, the function computes the exponential value of each element of the vector using the same exponent. If passed a second vector, the function computes the componentwise exponential value:

c = pow( a, 1.2 ); // Computes the exponential value of each element
c = pow( a, b ); // Computes the componentwise exponential value


exp() / exp2() / exp10()

exp(), exp2() and exp10() compute the base e/2/10 exponential of each element of a vector, respectively:

b = exp( a ); // Computes the base e exponential of each element
b = exp2( a ); // Computes the base 2 exponential of each element
b = exp10( a ); // Computes the base 10 exponential of each element

Note that in case of sparse vectors only the non-zero elements are taken into account!


log() / log2() / log10()

The log(), log2() and log10() functions can be used to compute the natural, binary and common logarithm of each element of a vector:

b = log( a ); // Computes the natural logarithm of each element
b = log2( a ); // Computes the binary logarithm of each element
b = log10( a ); // Computes the common logarithm of each element


sin() / cos() / tan() / asin() / acos() / atan()

The following trigonometric functions are available for both dense and sparse vectors:

b = sin( a ); // Computes the sine of each element of the vector
b = cos( a ); // Computes the cosine of each element of the vector
b = tan( a ); // Computes the tangent of each element of the vector
b = asin( a ); // Computes the inverse sine of each element of the vector
b = acos( a ); // Computes the inverse cosine of each element of the vector
b = atan( a ); // Computes the inverse tangent of each element of the vector

Note that in case of sparse vectors only the non-zero elements are taken into account!


sinh() / cosh() / tanh() / asinh() / acosh() / atanh()

The following hyperbolic functions are available for both dense and sparse vectors:

b = sinh( a ); // Computes the hyperbolic sine of each element of the vector
b = cosh( a ); // Computes the hyperbolic cosine of each element of the vector
b = tanh( a ); // Computes the hyperbolic tangent of each element of the vector
b = asinh( a ); // Computes the inverse hyperbolic sine of each element of the vector
b = acosh( a ); // Computes the inverse hyperbolic cosine of each element of the vector
b = atanh( a ); // Computes the inverse hyperbolic tangent of each element of the vector

Note that in case of sparse vectors only the non-zero elements are taken into account!


atan2()

The multi-valued inverse tangent is available for a pair of dense vectors:

c = atan2( a, b ); // Computes the componentwise multi-valued inverse tangent


erf() / erfc()

The erf() and erfc() functions compute the (complementary) error function of each element of a vector:

b = erf( a ); // Computes the error function of each element
b = erfc( a ); // Computes the complementary error function of each element

Note that in case of sparse vectors only the non-zero elements are taken into account!


map() / forEach()

Via the unary and binary map() functions it is possible to execute componentwise custom operations on vectors. The unary map() function can be used to apply a custom operation on each element of a dense or sparse vector. For instance, the following example demonstrates a custom square root computation via a lambda:

b = map( a, []( double d ) { return std::sqrt( d ); } );

The binary map() function can be used to apply an operation pairwise to the elements of two dense vectors. The following example demonstrates the merging of two vectors of double precision values into a vector of double precision complex numbers:

blaze::DynamicVector<double> real{ 2.1, -4.2, 1.0, 0.6 };
blaze::DynamicVector<double> imag{ 0.3, 1.4, 2.9, -3.4 };
// Creating the vector
// ( (-2.1, 0.3) )
// ( (-4.2, -1.4) )
// ( ( 1.0, 2.9) )
// ( ( 0.6, -3.4) )
cplx = map( real, imag, []( double r, double i ){ return complex( r, i ); } );

Although the computation can be parallelized it is not vectorized and thus cannot perform at peak performance. However, it is also possible to create vectorized custom operations. See Custom Operations for a detailed overview of the possibilities of custom operations.

Please note that unary custom operations on vectors have been introduced in Blaze 3.0 in form of the forEach() function. With the introduction of binary custom functions, the forEach() function has been renamed to map(). The forEach() function can still be used (even for binary custom operations), but the function might be deprecated in future releases of Blaze.


Norms


norm()

The norm() function computes the L2 norm of the given dense or sparse vector:

// ... Resizing and initialization
const double l2 = norm( a );


sqrNorm()

The sqrNorm() function computes the squared L2 norm of the given dense or sparse vector:

// ... Resizing and initialization
const double l2 = sqrNorm( a );


l1Norm()

The l1Norm() function computes the squared L1 norm of the given dense or sparse vector:

// ... Resizing and initialization
const double l1 = l1Norm( a );


l2Norm()

The l2Norm() function computes the squared L2 norm of the given dense or sparse vector:

// ... Resizing and initialization
const double l2 = l2Norm( a );


l3Norm()

The l3Norm() function computes the squared L3 norm of the given dense or sparse vector:

// ... Resizing and initialization
const double l3 = l3Norm( a );


l4Norm()

The l4Norm() function computes the squared L4 norm of the given dense or sparse vector:

// ... Resizing and initialization
const double l4 = l4Norm( a );


lpNorm()

The lpNorm() function computes the general Lp norm of the given dense or sparse vector, where the norm is specified by either a compile time or a runtime argument:

// ... Resizing and initialization
const double lp1 = lpNorm<2>( a ); // Compile time argument
const double lp2 = lpNorm( a, 2.3 ); // Runtime argument


maxNorm()

The maxNorm() function computes the maximum norm of the given dense or sparse vector:

// ... Resizing and initialization
const double max = maxNorm( a );


Previous: Vector Types     Next: Matrices