| /external/eigen/Eigen/src/Core/ |
| Transpositions.h | 29 /** Copies the \a other transpositions into \c *this */
48 /** \returns the number of transpositions */
70 /** \returns a reference to the stored array representing the transpositions. */
120 struct traits<Transpositions<SizeAtCompileTime,MaxSizeAtCompileTime,_StorageIndex> >
128 /** \class Transpositions
131 * \brief Represents a sequence of transpositions (row/column interchange)
133 * \tparam SizeAtCompileTime the number of transpositions, or Dynamic
134 * \tparam MaxSizeAtCompileTime the maximum number of transpositions, or Dynamic. This optional parameter defaults to SizeAtCompileTime. Most of the time, you should not have to specify it.
136 * This class represents a permutation transformation as a sequence of \em n transpositions
142 * Compared to the class PermutationMatrix, such a sequence of transpositions is what i
[all...] |
| PermutationMatrix.h | 80 /** Assignment from the Transpositions \a tr */
353 /** Convert the Transpositions \a tr to a permutation matrix */
369 /** Assignment from the Transpositions \a tr */
457 /** Assignment from the Transpositions \a tr */
|
| ProductEvaluators.h | [all...] |
| DenseBase.h | 60 * PermutationMatrix or Transpositions, otherwise it defaults to Eigen::Index
|
| /external/eigen/lapack/ |
| lapack_common.h | 20 typedef Eigen::Map<Eigen::Transpositions<Eigen::Dynamic,Eigen::Dynamic,int> > PivotsType;
|
| /external/eigen/test/ |
| eigensolver_complex.cpp | 26 std::vector<std::pair<Index,Index> > transpositions; local
41 transpositions.push_back(std::pair<Index,Index>(n-(i-col)-1,best_index));
44 for(Index k=transpositions.size()-1; k>=0; --k)
45 diffs.row(transpositions[k].first).swap(diffs.row(transpositions[k].second));
|
| /packages/providers/ContactsProvider/src/com/android/providers/contacts/aggregation/util/ |
| NameDistance.java | 137 int transpositions = 0; local
145 transpositions++;
152 float jaro = ((m / length1 + m / length2 + (m - (transpositions / 2f)) / m)) / 3;
|
| /external/eigen/Eigen/src/Cholesky/ |
| LDLT.h | 67 typedef Transpositions<RowsAtCompileTime, MaxRowsAtCompileTime> TranspositionType;
294 static bool unblocked(MatrixType& mat, TranspositionType& transpositions, Workspace& temp, SignMatrix& sign)
307 transpositions.setIdentity();
321 transpositions.coeffRef(k) = IndexType(index_of_biggest_in_corner);
367 // except filling the transpositions, and checking whether the matrix is zero.
371 transpositions.coeffRef(j) = IndexType(j);
442 static bool update(MatrixType& mat, const TranspositionType& transpositions, Workspace& tmp, const WType& w, const typename MatrixType::RealScalar& sigma=1)
445 tmp = transpositions * w;
454 static EIGEN_STRONG_INLINE bool unblocked(MatrixType& mat, TranspositionType& transpositions, Workspace& temp, SignMatrix& sign)
457 return ldlt_inplace<Lower>::unblocked(matt, transpositions, temp, sign)
[all...] |
| /external/python/cpython3/Modules/_decimal/libmpdec/literature/ |
| bignum.txt | 77 transpose.c -> transpositions needed for the sixstep algorithm.
|
| /external/eigen/Eigen/src/LU/ |
| PartialPivLU.h | 89 typedef Transpositions<RowsAtCompileTime, MaxRowsAtCompileTime> TranspositionType;
358 * In addition, this function returns the row transpositions in the
361 * which returns the actual number of transpositions.
415 * In addition, this function returns the row transpositions in the
418 * which returns the actual number of transpositions.
|
| FullPivLU.h | 503 // will store the transpositions, before we accumulate them at the end.
507 Index number_of_transpositions = 0; // number of NONTRIVIAL transpositions, i.e. m_rowsTranspositions[i]!=i
529 // before exiting, make sure to initialize the still uninitialized transpositions
566 // the main loop is over, we still have to accumulate the transpositions to find the
[all...] |
| /external/python/cpython3/Modules/_decimal/libmpdec/ |
| README.txt | 56 transpose.{c,h} -> Transpositions needed for the sixstep algorithm.
|
| /external/tensorflow/tensorflow/core/lib/gtl/ |
| edit_distance.h | 33 // Note, this distance does not consider transpositions.
|
| /external/tensorflow/tensorflow/core/kernels/ |
| determinant_op_gpu.cu.cc | 34 // Compute the order of the permutation from the number of transpositions
|
| /external/eigen/Eigen/src/Core/util/ |
| ForwardDeclarations.h | 106 template<int SizeAtCompileTime, int MaxSizeAtCompileTime = SizeAtCompileTime, typename IndexType=int> class Transpositions;
|
| /external/tensorflow/tensorflow/core/util/sparse/ |
| sparse_tensor.h | 344 // a product of transpositions. Iterate over the cycles in the
346 // transpositions (swaps):
|
| /external/eigen/Eigen/ |
| Core | 467 #include "src/Core/Transpositions.h"
|
| /external/tensorflow/tensorflow/core/grappler/ |
| utils.cc | 295 // transpositions (swaps): https://en.wikipedia.org/wiki/Cyclic_permutation
|
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| layout_assignment_test.cc | 361 // keep linear indices valid across them, and to transpositions to make them
398 // Test whether LayoutAssignment assigns layouts to transpositions to make them
[all...] |
| /external/eigen/Eigen/src/QR/ |
| FullPivHouseholderQR.h | 204 /** \returns a const reference to the vector of indices representing the rows transpositions */
|
| /external/eigen/Eigen/src/SparseQR/ |
| SparseQR.h | 170 * reflectors are stored unsorted, two transpositions are needed to sort
|
| /external/tensorflow/tensorflow/contrib/distributions/python/kernel_tests/ |
| sample_stats_test.py | 81 # Brute for auto-corr -- avoiding fft and transpositions.
|
| /frameworks/data-binding/prebuilds/1.0-rc0/ |
| databinding-studio-bundle.jar | |
| /external/tensorflow/tensorflow/python/ops/ |
| math_ops.py | [all...] |
