![]() |
Header file for utility functions for sparse matrices. More...
#include <blaze/math/constraints/RequiresEvaluation.h>
#include <blaze/math/constraints/Triangular.h>
#include <blaze/math/expressions/SparseMatrix.h>
#include <blaze/math/Functions.h>
#include <blaze/math/shims/Equal.h>
#include <blaze/math/shims/IsDefault.h>
#include <blaze/math/shims/IsNaN.h>
#include <blaze/math/shims/IsOne.h>
#include <blaze/math/StorageOrder.h>
#include <blaze/math/typetraits/IsExpression.h>
#include <blaze/math/typetraits/IsDiagonal.h>
#include <blaze/math/typetraits/IsIdentity.h>
#include <blaze/math/typetraits/IsLower.h>
#include <blaze/math/typetraits/IsSquare.h>
#include <blaze/math/typetraits/IsStrictlyLower.h>
#include <blaze/math/typetraits/IsStrictlyUpper.h>
#include <blaze/math/typetraits/IsSymmetric.h>
#include <blaze/math/typetraits/IsTriangular.h>
#include <blaze/math/typetraits/IsUniLower.h>
#include <blaze/math/typetraits/IsUniTriangular.h>
#include <blaze/math/typetraits/IsUniUpper.h>
#include <blaze/math/typetraits/IsUpper.h>
#include <blaze/util/Assert.h>
#include <blaze/util/FalseType.h>
#include <blaze/util/mpl/If.h>
#include <blaze/util/TrueType.h>
#include <blaze/util/Types.h>
#include <blaze/util/typetraits/RemoveReference.h>
Go to the source code of this file.
Namespaces | |
blaze | |
Namespace of the Blaze C++ math library. | |
Functions | |
template<typename T1 , typename T2 > | |
bool | blaze::operator== (const SparseMatrix< T1, false > &lhs, const SparseMatrix< T2, false > &rhs) |
Equality operator for the comparison of two row-major sparse matrices. More... | |
template<typename T1 , typename T2 > | |
bool | blaze::operator== (const SparseMatrix< T1, true > &lhs, const SparseMatrix< T2, true > &rhs) |
Equality operator for the comparison of two column-major sparse matrices. More... | |
SparseMatrix operators | |
template<typename T1 , typename T2 , bool SO> | |
bool | blaze::operator== (const SparseMatrix< T1, false > &lhs, const SparseMatrix< T2, false > &rhs) |
Equality operator for the comparison of two row-major sparse matrices. More... | |
template<typename T1 , typename T2 , bool SO> | |
bool | blaze::operator== (const SparseMatrix< T1, true > &lhs, const SparseMatrix< T2, true > &rhs) |
Equality operator for the comparison of two column-major sparse matrices. More... | |
template<typename T1 , typename T2 , bool SO> | |
bool | blaze::operator== (const SparseMatrix< T1, SO > &lhs, const SparseMatrix< T2,!SO > &rhs) |
Equality operator for the comparison of two sparse matrices with different storage order. More... | |
template<typename T1 , bool SO1, typename T2 , bool SO2> | |
bool | blaze::operator!= (const SparseMatrix< T1, SO1 > &lhs, const SparseMatrix< T2, SO2 > &rhs) |
Inequality operator for the comparison of two sparse matrices. More... | |
SparseMatrix functions | |
template<typename MT , bool SO> | |
bool | blaze::isnan (const SparseMatrix< MT, SO > &sm) |
Checks the given sparse matrix for not-a-number elements. More... | |
template<typename MT , bool SO> | |
bool | blaze::isSymmetric (const SparseMatrix< MT, SO > &sm) |
Checks if the given sparse matrix is symmetric. More... | |
template<typename MT , bool SO> | |
bool | blaze::isUniform (const SparseMatrix< MT, SO > &sm) |
Checks if the given sparse matrix is a uniform matrix. More... | |
template<typename MT , bool SO> | |
bool | blaze::isLower (const SparseMatrix< MT, SO > &sm) |
Checks if the given sparse matrix is a lower triangular matrix. More... | |
template<typename MT , bool SO> | |
bool | blaze::isUniLower (const SparseMatrix< MT, SO > &sm) |
Checks if the given sparse matrix is a lower unitriangular matrix. More... | |
template<typename MT , bool SO> | |
bool | blaze::isStrictlyLower (const SparseMatrix< MT, SO > &sm) |
Checks if the given sparse matrix is a strictly lower triangular matrix. More... | |
template<typename MT , bool SO> | |
bool | blaze::isUpper (const SparseMatrix< MT, SO > &sm) |
Checks if the given sparse matrix is an upper triangular matrix. More... | |
template<typename MT , bool SO> | |
bool | blaze::isUniUpper (const SparseMatrix< MT, SO > &sm) |
Checks if the given sparse matrix is an upper unitriangular matrix. More... | |
template<typename MT , bool SO> | |
bool | blaze::isStrictlyUpper (const SparseMatrix< MT, SO > &sm) |
Checks if the given sparse matrix is a strictly upper triangular matrix. More... | |
template<typename MT , bool SO> | |
bool | blaze::isDiagonal (const SparseMatrix< MT, SO > &sm) |
Checks if the give sparse matrix is diagonal. More... | |
template<typename MT , bool SO> | |
bool | blaze::isIdentity (const SparseMatrix< MT, SO > &sm) |
Checks if the give sparse matrix is an identity matrix. More... | |
template<typename MT , bool SO> | |
const MT::ElementType | blaze::min (const SparseMatrix< MT, SO > &sm) |
Returns the smallest element of the sparse matrix. More... | |
template<typename MT , bool SO> | |
const MT::ElementType | blaze::max (const SparseMatrix< MT, SO > &sm) |
Returns the largest element of the sparse matrix. More... | |
Header file for utility functions for sparse matrices.
Copyright (C) 2013 Klaus Iglberger - All Rights Reserved
This file is part of the Blaze library. You can redistribute it and/or modify it under the terms of the New (Revised) BSD License. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.