| /external/eigen/unsupported/Eigen/CXX11/src/Tensor/ |
| D | TensorDimensionList.h | 25 template <typename Index, std::size_t Rank> struct DimensionList {
32 template<typename Index, std::size_t Rank> struct array_size<DimensionList<Index, Rank> > {
33 static const size_t value = Rank;
35 template<typename Index, std::size_t Rank> struct array_size<const DimensionList<Index, Rank> > {
36 static const size_t value = Rank;
39 …emplate<DenseIndex n, typename Index, std::size_t Rank> const Index array_get(DimensionList<Index,…
42 …late<DenseIndex n, typename Index, std::size_t Rank> const Index array_get(const DimensionList<Ind…
48 template <typename Index, std::size_t Rank>
49 struct index_known_statically_impl<DimensionList<Index, Rank> > {
54 template <typename Index, std::size_t Rank>
[all …]
|
| /external/u-boot/doc/ |
| D | README.fsl-ddr | 28 | | Rank Interleaving |
167 | | | | | | Rank 1 | Rank 2 | Rank 1 | Rank 2 |
172 | Dual Rank | Dual Rank |----------+-------+-------+-------+------+-------+------+-------+------+--…
176 | Dual Rank |Single Rank|----------+-------+-------+-------+------+-------+------+-------+------+--…
180 |Single Rank| Dual Rank |----------+-------+-------+-------+------+-------+------+-------+------+--…
184 |Single Rank|Single Rank|----------+-------+-------+-------+------+-------+------+-------+------+--…
187 | Dual Rank | Empty | Slot 1 | off | 75 | 40 | off | off | off | | | | |
189 | Empty | Dual Rank | Slot 2 | off | 75 | | | | | 40 | off | off | off |
191 |Single Rank| Empty | Slot 1 | off | 75 | 40 | off | | | | | | |
193 | Empty |Single Rank| Slot 2 | off | 75 | | | | | 40 | off | | |
[all …]
|
| /external/tensorflow/tensorflow/core/ops/ |
| D | ragged_math_ops.cc | 55 if (c->Rank(starts) == 1) { in RaggedRangeShapeFn()
58 if (c->Rank(limits) == 1) { in RaggedRangeShapeFn()
61 if (c->Rank(deltas) == 1) { in RaggedRangeShapeFn()
69 } else if (c->Rank(starts) == 0 && c->Rank(limits) == 0 && in RaggedRangeShapeFn()
70 c->Rank(deltas) == 0) { in RaggedRangeShapeFn()
|
| D | rpc_ops.cc | 30 if (c->Rank(address) == 1) { in RpcShapeOp()
34 if (c->Rank(method) == 1) { in RpcShapeOp()
38 if (c->Rank(request) == 1) { in RpcShapeOp()
|
| D | array_ops.cc | 87 TF_RETURN_IF_ERROR(c->WithValue(n_dim, c->Rank(input), &n_dim)); in PadShapeFn()
130 rank = c->Rank(input); in TransposeShapeFn()
200 for (int32 i = 0; i < c->Rank(out); ++i) { in SetOutputShapeForReshape()
218 for (int32 i = 0; i < c->Rank(in); ++i) { in SetOutputShapeForReshape()
337 int32 rank = c->Rank(cur); in __anondb9326b20302()
420 int32 rank = c->Rank(s); in __anondb9326b20502()
452 if (c->RankKnown(indices) && c->Rank(indices) == 0) { in __anondb9326b20602()
486 int out_rank = c->Rank(out); in __anondb9326b20702()
488 int in_rank = c->Rank(in); in __anondb9326b20702()
571 0, c->Rank(input), &split_dimension)); in __anondb9326b20a02()
[all …]
|
| D | set_ops.cc | 57 const int32 input0_rank = c->Rank(input0_shape); in __anon9b840f3f0102()
63 const int32 rank = c->Rank(input1_shape); in __anon9b840f3f0102()
79 output_rank = c->MakeDim(c->Rank(input1_shape)); in __anon9b840f3f0102()
119 const int32 input0_rank = c->Rank(input0_shape); in __anon9b840f3f0202()
|
| /external/tensorflow/tensorflow/core/api_def/base_api/ |
| D | api_def_BoostedTreesMakeStatsSummary.pbtxt | 7 int32 Rank 1 Tensor containing node ids, which each example falls into for the requested layer.
13 float32; Rank 2 Tensor (shape=[#examples, 1]) for gradients.
19 float32; Rank 2 Tensor (shape=[#examples, 1]) for hessians.
25 int32 list of Rank 1 Tensors, each containing the bucketized feature (for each feature column).
31 output Rank 4 Tensor (shape=[#features, #splits, #buckets, 2]) containing accumulated stats put int…
|
| D | api_def_BoostedTreesTrainingPredict.pbtxt | 7 Rank 1 Tensor containing cached tree ids which is the starting
14 Rank 1 Tensor containing cached node id which is the starting
28 Rank 2 Tensor containing logits update (with respect to cached
35 Rank 1 Tensor containing new tree ids for each example.
41 Rank 1 Tensor containing new node ids in the new tree_ids.
|
| D | api_def_BoostedTreesCalculateBestGainsPerFeature.pbtxt | 7 A Rank 1 tensor (shape=[2]) to specify the range [first, last) of node ids to process within `stats…
13 A list of Rank 3 tensor (#shape=[max_splits, bucket, 2]) for accumulated stats summary (gradient/he…
43 An output list of Rank 1 tensors indicating possible split node ids for each feature. The length of…
49 An output list of Rank 1 tensors indicating the best gains for each feature to split for certain no…
55 An output list of Rank 1 tensors indicating the bucket id to compare with (as a threshold) for spli…
61 A list of Rank 2 tensors indicating the contribution of the left nodes when branching from parent n…
67 A list of Rank 2 tensors, with the same shape/conditions as left_node_contribs_list, but just that …
|
| D | api_def_BoostedTreesBucketize.pbtxt | 7 float; List of Rank 1 Tensor each containing float values for a single feature.
13 float; List of Rank 1 Tensors each containing the bucket boundaries for a single
20 int; List of Rank 1 Tensors each containing the bucketized values for a single feature.
|
| D | api_def_BoostedTreesMakeQuantileSummaries.pbtxt | 7 float; List of Rank 1 Tensors each containing values for a single feature.
13 float; Rank 1 Tensor with weights per instance.
25 float; List of Rank 2 Tensors each containing the quantile summary
|
| D | api_def_MatrixSetDiag.pbtxt | 6 Rank `k+1`, where `k >= 1`.
12 Rank `k`, where `k >= 1`.
18 Rank `k+1`, with `output.shape = input.shape`.
|
| D | api_def_Rank.pbtxt | 2 graph_op_name: "Rank"
17 of the tensor. Rank is also known as "order", "degree", or "ndims."
|
| D | api_def_BoostedTreesQuantileStreamResourceGetBucketBoundaries.pbtxt | 13 float; List of Rank 1 Tensors each containing the bucket boundaries for a feature.
25 tensor is Rank 1 containing bucket boundaries for a single feature.
|
| D | api_def_MatrixDiag.pbtxt | 6 Rank `k`, where `k >= 1`.
12 Rank `k+1`, with `output.shape = diagonal.shape + [diagonal.shape[-1]]`.
|
| /external/llvm/include/llvm/Transforms/Scalar/ |
| D | Reassociate.h | 38 unsigned Rank; member
40 ValueEntry(unsigned R, Value *O) : Rank(R), Op(O) {} in ValueEntry()
43 return LHS.Rank > RHS.Rank; // Sort so that highest rank goes to start.
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Transforms/Scalar/ |
| D | Reassociate.h | 48 unsigned Rank; member
51 ValueEntry(unsigned R, Value *O) : Rank(R), Op(O) {} in ValueEntry()
55 return LHS.Rank > RHS.Rank; // Sort so that highest rank goes to start.
|
| /external/Microsoft-GSL/include/gsl/ |
| D | multi_span | 97 template <std::size_t Rank>
100 static_assert(Rank > 0, "Rank must be greater than 0!");
106 static const std::size_t rank = Rank;
114 constexpr multi_span_index(const value_type (&values)[Rank]) noexcept
118 std::copy(values, values + Rank, elems);
121 template <typename... Ts, typename = std::enable_if_t<(sizeof...(Ts) == Rank) &&
135 Expects(component_idx < Rank); // Component index must be less than rank
144 Expects(component_idx < Rank); // Component index must be less than rank
238 value_type elems[Rank] = {};
550 template <std::size_t Rank, bool Enabled = (Rank > 1),
[all …]
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| D | CFGMST.h | 63 if (BB1G->Rank < BB2G->Rank) in unionGroups()
68 if (BB1G->Rank == BB2G->Rank) in unionGroups()
69 BB1G->Rank++; in unionGroups()
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
| D | Reassociate.cpp | 50 unsigned Rank; member
52 ValueEntry(unsigned R, Value *O) : Rank(R), Op(O) {} in ValueEntry()
55 return LHS.Rank > RHS.Rank; // Sort so that highest rank goes to start. in operator <()
69 dbgs() << ", #" << Ops[i].Rank << "] "; in PrintOps()
177 if (unsigned Rank = ValueRankMap[I]) in getRank() local
178 return Rank; // Rank already known? in getRank()
184 unsigned Rank = 0, MaxRank = RankMap[I->getParent()]; in getRank() local
186 i != e && Rank != MaxRank; ++i) in getRank()
187 Rank = std::max(Rank, getRank(I->getOperand(i))); in getRank()
193 ++Rank; in getRank()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Instrumentation/ |
| D | CFGMST.h | 70 if (BB1G->Rank < BB2G->Rank) in unionGroups()
75 if (BB1G->Rank == BB2G->Rank) in unionGroups()
76 BB1G->Rank++; in unionGroups()
|
| /external/golang-protobuf/protoc-gen-go/testdata/ |
| D | extension_test.go | 89 Rank: proto.String("Major"),
113 if r := um_out.(*user.UserMessage).Rank; *r != *um.Rank {
114 t.Errorf("um_out.Rank = %q, expected %q", *r, *um.Rank)
|
| /external/tensorflow/tensorflow/core/framework/ |
| D | shape_inference.cc | 292 for (int32 i = 0; i < Rank(handle); ++i) { in ShapeHandleToProto()
305 for (int i = 0; i < Rank(s); ++i) { in FullyDefined()
312 const auto rank = Rank(s); in NumElements()
371 const int32 existing = Rank(shape); in WithRank()
396 const int32 existing = Rank(shape); in WithRankAtLeast()
411 const int32 existing = Rank(shape); in WithRankAtMost()
495 const int32 rank = Rank(prefix); in MergePrefix()
499 const int32 rank_s = Rank(s); in MergePrefix()
523 const int32 rank = Rank(s_old); in Relax()
524 if (rank != Rank(s_new)) { in Relax()
[all …]
|
| /external/tensorflow/tensorflow/core/grappler/utils/ |
| D | symbolic_shapes_test.cc | 114 EXPECT_EQ(2, Rank(MakeShape({32, 32}))); in TEST_F()
116 EXPECT_EQ(2, Rank(MakeShape({-2, 32}))); in TEST_F()
120 EXPECT_EQ(-1, Rank(shape)); in TEST_F()
|
| /external/tensorflow/tensorflow/compiler/tf2xla/ops/ |
| D | xla_ops.cc | 31 c->set_output(0, c->UnknownShapeOfRank(c->Rank(c->input(0)))); in UnchangedRank()
320 int rank = c->Rank(c->input(0)); in __anon3500048a0302()
523 rank_a = context->Rank(input_a); in __anon3500048a0602()
528 rank_b = context->Rank(input_b); in __anon3500048a0602()
|