HomeSort by relevance Sort by last modified time
    Searched defs:permutation (Results 1 - 25 of 28) sorted by null

1 2

  /external/tensorflow/tensorflow/contrib/distributions/python/ops/bijectors/
permute.py 15 """Permutation bijectors."""
45 reverse = tfd.bijectors.Permute(permutation=[2, 1, 0])
61 `Permute(np.random.permutation(event_size)).astype("int32"))` is not a
70 Permute(permutation=init_once(
71 np.random.permutation(event_size).astype("int32"),
72 name="permutation"))
77 def __init__(self, permutation, validate_args=False, name=None):
81 permutation: An `int`-like vector-shaped `Tensor` representing the
82 permutation to apply to the rightmost dimension of the transformed
89 TypeError: if `not permutation.dtype.is_integer`
122 def permutation(self): member in class:Permute
    [all...]
  /external/tensorflow/tensorflow/core/kernels/
reduction_ops_common.cc 47 gtl::InlinedVector<int32, 8> ReductionHelper::permutation() { function in class:tensorflow::ReductionHelper
transpose_op.cc 34 // inv = InvertPermutationOp(T<int32/int64> p) takes a permutation of
36 // permutation of p. I.e., inv[p[i]] == i, for i in [0 .. n).
39 // REQUIRES: input is a permutation of 0, 1, ..., n-1.
55 errors::InvalidArgument("permutation of nonnegative int32s "
112 std::vector<int32>* permutation) {
120 // asynchrony boundary is permutation.
123 *permutation = std::vector<int32>(perm_begin, perm_begin + dims);
130 // of type T and rank N, and a permutation of 0, 1, ..., N-1. It
131 // shuffles the dimensions of the input tensor according to permutation.
142 // REQUIRES: perm is a permutation
154 std::vector<int32> permutation; local
    [all...]
  /external/webrtc/webrtc/voice_engine/
level_indicator.cc 23 const int8_t permutation[33] = member in namespace:webrtc::voe
73 // the permutation vector
82 _currentLevel = permutation[position];
  /external/tensorflow/tensorflow/compiler/xla/service/
hlo_constant_folding_test.cc 181 const int64 permutation[] = {1, 2, 0, 4, 3}; local
183 HloInstruction::CreateTranspose(shape, literal_instruction, permutation));
199 std::vector<int64> rindexes = Permute(permutation, indices);
hlo_evaluator_test.cc 324 const int64 permutation[] = {1, 2, 0, 4, 3}; local
326 HloInstruction::CreateTranspose(shape, literal_instruction, permutation));
334 std::vector<int64> rindexes = Permute(permutation, indices);
    [all...]
  /external/libunwind_llvm/src/
CompactUnwinder.hpp 128 uint32_t permutation = local
136 // decompress permutation
140 permunreg[0] = permutation / 120;
141 permutation -= (permunreg[0] * 120);
142 permunreg[1] = permutation / 24;
143 permutation -= (permunreg[1] * 24);
144 permunreg[2] = permutation / 6;
145 permutation -= (permunreg[2] * 6);
146 permunreg[3] = permutation / 2;
147 permutation -= (permunreg[3] * 2)
359 uint32_t permutation = local
    [all...]
  /prebuilts/go/darwin-x86/src/runtime/
hash_test.go 265 // "permutation" is a bad name here, but it is what Smhasher uses.
270 permutation(t, []uint32{0, 1, 2, 3, 4, 5, 6, 7}, 8)
271 permutation(t, []uint32{0, 1 << 29, 2 << 29, 3 << 29, 4 << 29, 5 << 29, 6 << 29, 7 << 29}, 8)
272 permutation(t, []uint32{0, 1}, 20)
273 permutation(t, []uint32{0, 1 << 31}, 20)
274 permutation(t, []uint32{0, 1, 2, 3, 4, 5, 6, 7, 1 << 29, 2 << 29, 3 << 29, 4 << 29, 5 << 29, 6 << 29, 7 << 29}, 6)
276 func permutation(t *testing.T, s []uint32, n int) { func
  /prebuilts/go/linux-x86/src/runtime/
hash_test.go 265 // "permutation" is a bad name here, but it is what Smhasher uses.
270 permutation(t, []uint32{0, 1, 2, 3, 4, 5, 6, 7}, 8)
271 permutation(t, []uint32{0, 1 << 29, 2 << 29, 3 << 29, 4 << 29, 5 << 29, 6 << 29, 7 << 29}, 8)
272 permutation(t, []uint32{0, 1}, 20)
273 permutation(t, []uint32{0, 1 << 31}, 20)
274 permutation(t, []uint32{0, 1, 2, 3, 4, 5, 6, 7, 1 << 29, 2 << 29, 3 << 29, 4 << 29, 5 << 29, 6 << 29, 7 << 29}, 6)
276 func permutation(t *testing.T, s []uint32, n int) { func
  /system/update_engine/payload_generator/
delta_diff_utils_unittest.cc 681 vector<uint64_t> permutation = {0, 1, 5, 6, 7, 2, 3, 4, 9, 10, 11, 12, 8}; local
683 for (uint64_t x : permutation)
687 old_part_.size = block_size_ * permutation.size();
688 new_part_.size = block_size_ * permutation.size();
692 // |permutation| order. Block i in the old_part_ will contain the same data
693 // as block permutation[i] in the new_part_.
702 EXPECT_EQ(permutation.size(), old_visited_blocks_.blocks());
703 EXPECT_EQ(permutation.size(), new_visited_blocks_.blocks());
714 EXPECT_EQ(ExtentForRange(0, permutation.size()), aop.op.dst_extents(0));
  /art/test/957-methodhandle-transforms/src/
Main.java 827 final MethodHandle permutation = MethodHandles.permuteArguments( local
830 permutation.invoke((double) 97.0, (float) 98.0f, (long) 97, 78,
833 // The permutation array was not of the right length.
841 // The permutation array has an element that's out of bounds
850 // The permutation array maps to an incorrect type.
870 MethodHandle permutation = MethodHandles.permuteArguments(target, local
872 assertEquals("barfoo", (String) permutation.invoke("foo", "bar"));
874 permutation = MethodHandles.permuteArguments(target, newType, new int[] { 0, 0 });
875 assertEquals("foofoo", (String) permutation.invoke("foo", "bar"));
877 permutation = MethodHandles.permuteArguments(target, newType, new int[] { 1, 1 })
890 MethodHandle permutation = MethodHandles.permuteArguments(target, local
    [all...]
  /external/eigen/unsupported/Eigen/src/NonLinearOptimization/
LevenbergMarquardt.h 109 PermutationMatrix<Dynamic,Dynamic> permutation; member in class:Eigen::LevenbergMarquardt
234 permutation = qrfac.colsPermutation();
261 if (wa2[permutation.indices()[j]] != 0.)
262 gnorm = (std::max)(gnorm, abs( fjac.col(j).head(j+1).dot(qtf.head(j+1)/fnorm) / wa2[permutation.indices()[j]]));
466 permutation.setIdentity(n);
475 permutation = qrfac.colsPermutation();
511 if (wa2[permutation.indices()[j]] != 0.)
512 gnorm = (std::max)(gnorm, abs( fjac.col(j).head(j+1).dot(qtf.head(j+1)/fnorm) / wa2[permutation.indices()[j]]));
525 internal::lmpar<Scalar>(fjac, permutation.indices(), diag, qtf, delta, par, wa1);
549 wa3 = fjac.topLeftCorner(n,n).template triangularView<Upper>() * (permutation.inverse() * wa1)
    [all...]
  /external/apache-commons-math/src/main/java/org/apache/commons/math/estimation/
LevenbergMarquardtEstimator.java 124 /** Columns permutation array. */
125 private int[] permutation; field in class:LevenbergMarquardtEstimator
258 permutation = new int[cols];
289 int pk = permutation[k];
318 int pj = permutation[j];
345 int pj = permutation[j];
359 int pj = permutation[j];
385 int pj = permutation[j];
435 int pj = permutation[j];
503 lmDir[permutation[j]] = qy[j]
    [all...]
  /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/general/
LevenbergMarquardtOptimizer.java 121 /** Columns permutation array. */
122 private int[] permutation; field in class:LevenbergMarquardtOptimizer
251 permutation = new int[cols];
289 int pk = permutation[k];
318 int pj = permutation[j];
346 int pj = permutation[j];
363 int pj = permutation[j];
388 int pj = permutation[j];
445 int pj = permutation[j];
510 lmDir[permutation[j]] = qy[j]
    [all...]
  /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/
LevenbergMarquardt.h 230 /** the permutation used in the QR factorization
232 PermutationType permutation() {return m_permutation; } function in class:Eigen::LevenbergMarquardt
  /external/eigen/unsupported/Eigen/src/MatrixFunctions/
MatrixFunction.h 204 /** \brief Compute permutation which groups ei'vals in same cluster together */
206 void matrix_function_compute_permutation(const DynVectorType& blockStart, const DynVectorType& eivalToCluster, VectorType& permutation)
210 permutation.resize(eivalToCluster.rows());
213 permutation[i] = indexNextEntry[cluster];
218 /** \brief Permute Schur decomposition in U and T according to permutation */
220 void matrix_function_permute_schur(VectorType& permutation, MatrixType& U, MatrixType& T)
223 for (Index i = 0; i < permutation.rows() - 1; i++) {
225 for (j = i; j < permutation.rows(); j++) {
226 if (permutation(j) == i) break;
228 eigen_assert(permutation(j) == i)
452 Matrix<Index, Traits::RowsAtCompileTime, 1> permutation; local
    [all...]
  /external/tensorflow/tensorflow/contrib/tensorrt/convert/
convert_nodes.cc 420 nvinfer1::Permutation permutation; local
422 permutation.order[i] = order[i + 1] - 1;
424 layer->setFirstTranspose(permutation);
    [all...]
  /libcore/luni/src/test/java/libcore/java/lang/invoke/
MethodHandleCombinersTest.java 764 final MethodHandle permutation = MethodHandles.permuteArguments( local
767 permutation.invoke((double) 97.0, (float) 98.0f, (long) 97, 78,
770 // The permutation array was not of the right length.
778 // The permutation array has an element that's out of bounds
787 // The permutation array maps to an incorrect type.
807 MethodHandle permutation = MethodHandles.permuteArguments(target, local
809 assertEquals("barfoo", (String) permutation.invoke("foo", "bar"));
811 permutation = MethodHandles.permuteArguments(target, newType, new int[]{0, 0});
812 assertEquals("foofoo", (String) permutation.invoke("foo", "bar"));
814 permutation = MethodHandles.permuteArguments(target, newType, new int[]{1, 1})
827 MethodHandle permutation = MethodHandles.permuteArguments(target, local
    [all...]
  /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/
BigMatrixImpl.java 78 /** Permutation associated with LU decomposition */
79 protected int[] permutation = null; field in class:BigMatrixImpl
81 /** Parity of the permutation associated with the LU decomposition */
    [all...]
  /external/deqp/external/vulkancts/modules/vulkan/spirv_assembly/
vktSpvAsmInstructionTests.cpp 6357 ShaderPermutation permutation = local
6396 ShaderPermutation permutation = getShaderPermutation(idx); local
    [all...]
  /frameworks/base/core/java/android/view/
ViewGroup.java 3514 int[] permutation = new int[childrenCount]; local
    [all...]
  /prebuilts/devtools/tools/lib/
commons-compress-1.8.1.jar 
  /prebuilts/misc/common/commons-compress/
commons-compress-prebuilt.jar 
  /prebuilts/tools/common/m2/repository/org/apache/commons/commons-compress/1.8.1/
commons-compress-1.8.1.jar 
  /prebuilts/tools/common/m2/repository/org/apache/commons/commons-compress/1.9/
commons-compress-1.9.jar 

Completed in 1505 milliseconds

1 2