|
escript
Revision_
|
Typedefs | |
| typedef std::pair< index_t, index_t > | IndexPair |
| typedef std::vector< IndexPair > | ValueAndIndexList |
Functions | |
| bool | ValueAndIndexCompare (const std::pair< int, int > &i, const std::pair< int, int > &j) |
| comparison function for sortValueAndIndex More... | |
| void | sortValueAndIndex (ValueAndIndexList &array) |
| orders a ValueAndIndexList by value. More... | |
| void | gather (int len, const index_t *index, int numData, const double *in, double *out) |
| template<typename Scalar > | |
| void | addScatter (int len, const index_t *index, int numData, const Scalar *in, Scalar *out, index_t upperBound) |
| template void | addScatter< real_t > (int len, const index_t *index, int numData, const real_t *in, real_t *out, index_t upperBound) |
| template void | addScatter< cplx_t > (int len, const index_t *index, int numData, const cplx_t *in, cplx_t *out, index_t upperBound) |
| void | smallMatMult (int A1, int A2, double *A, int B2, const double *B, const double *C) |
| multiplies two matrices: A(1:A1,1:A2) := B(1:A1,1:B2)*C(1:B2,1:A2) More... | |
| template<typename Scalar > | |
| void | smallMatSetMult1 (int len, int A1, int A2, Scalar *A, int B2, const Scalar *B, const double *C) |
| template void | smallMatSetMult1< real_t > (int len, int A1, int A2, real_t *A, int B2, const real_t *B, const real_t *C) |
| template void | smallMatSetMult1< cplx_t > (int len, int A1, int A2, cplx_t *A, int B2, const cplx_t *B, const real_t *C) |
| void | normalVector (int len, int dim, int dim1, const double *A, double *Normal) |
| IndexPair | getMinMaxInt (int dim, dim_t N, const index_t *values) |
| IndexPair | getFlaggedMinMaxInt (dim_t N, const index_t *values, index_t ignore) |
| std::vector< index_t > | packMask (const std::vector< short > &mask) |
| void | setValuesInUse (const int *values, dim_t numValues, std::vector< int > &valuesInUse, escript::JMPI mpiinfo) |
| typedef std::pair<index_t,index_t> dudley::util::IndexPair |
| typedef std::vector<IndexPair> dudley::util::ValueAndIndexList |
| void dudley::util::addScatter | ( | int | len, |
| const index_t * | index, | ||
| int | numData, | ||
| const Scalar * | in, | ||
| Scalar * | out, | ||
| index_t | upperBound | ||
| ) |
adds array in into out using an index: out(1:numData,index[p])+=in(1:numData,p) where p={k=1...len, index[k]<upperBound}
Referenced by dudley::Assemble_PDE_Single_2D(), and dudley::Assemble_PDE_Single_3D().
| template void dudley::util::addScatter< cplx_t > | ( | int | len, |
| const index_t * | index, | ||
| int | numData, | ||
| const cplx_t * | in, | ||
| cplx_t * | out, | ||
| index_t | upperBound | ||
| ) |
| template void dudley::util::addScatter< real_t > | ( | int | len, |
| const index_t * | index, | ||
| int | numData, | ||
| const real_t * | in, | ||
| real_t * | out, | ||
| index_t | upperBound | ||
| ) |
| void dudley::util::gather | ( | int | len, |
| const index_t * | index, | ||
| int | numData, | ||
| const double * | in, | ||
| double * | out | ||
| ) |
gathers values into array out from array in using index: out(1:numData, 1:len) := in(1:numData, index(1:len))
| IndexPair dudley::util::getFlaggedMinMaxInt | ( | dim_t | N, |
| const index_t * | values, | ||
| index_t | ignore | ||
| ) |
calculates the minimum and maximum value from an integer array of length N disregarding the value ignore
| IndexPair dudley::util::getMinMaxInt | ( | int | dim, |
| dim_t | N, | ||
| const index_t * | values | ||
| ) |
calculates the minimum and maximum value from an integer array of length N x dim
References escript::DataTypes::index_t_max(), escript::DataTypes::index_t_min(), and paso::N.
| void dudley::util::normalVector | ( | int | len, |
| int | dim, | ||
| int | dim1, | ||
| const double * | A, | ||
| double * | normal | ||
| ) |
returns the normalized vector normal[dim,len] orthogonal to A(:,0,q) and A(:,1,q) in the case of dim=3, or the vector A(:,0,q) in the case of dim=2
| std::vector< index_t > dudley::util::packMask | ( | const std::vector< short > & | mask | ) |
extracts the positive entries in mask returning a contiguous vector of those entries
| void dudley::util::setValuesInUse | ( | const int * | values, |
| dim_t | numValues, | ||
| std::vector< int > & | valuesInUse, | ||
| escript::JMPI | mpiinfo | ||
| ) |
Referenced by dudley::NodeFile::updateTagList().
| void dudley::util::smallMatMult | ( | int | A1, |
| int | A2, | ||
| double * | A, | ||
| int | B2, | ||
| const double * | B, | ||
| const double * | C | ||
| ) |
multiplies two matrices: A(1:A1,1:A2) := B(1:A1,1:B2)*C(1:B2,1:A2)
| void dudley::util::smallMatSetMult1 | ( | int | len, |
| int | A1, | ||
| int | A2, | ||
| Scalar * | A, | ||
| int | B2, | ||
| const Scalar * | B, | ||
| const double * | C | ||
| ) |
| template void dudley::util::smallMatSetMult1< cplx_t > | ( | int | len, |
| int | A1, | ||
| int | A2, | ||
| cplx_t * | A, | ||
| int | B2, | ||
| const cplx_t * | B, | ||
| const real_t * | C | ||
| ) |
| template void dudley::util::smallMatSetMult1< real_t > | ( | int | len, |
| int | A1, | ||
| int | A2, | ||
| real_t * | A, | ||
| int | B2, | ||
| const real_t * | B, | ||
| const real_t * | C | ||
| ) |
| void dudley::util::sortValueAndIndex | ( | ValueAndIndexList & | array | ) |
orders a ValueAndIndexList by value.
| bool dudley::util::ValueAndIndexCompare | ( | const std::pair< int, int > & | i, |
| const std::pair< int, int > & | j | ||
| ) |
comparison function for sortValueAndIndex
References INDEX2.
1.8.17