HomeSort by relevance Sort by last modified time
    Searched defs:rank (Results 126 - 150 of 475) sorted by null

1 2 3 4 56 7 8 91011>>

  /external/tensorflow/tensorflow/core/framework/
shape_inference_test.cc 156 .contains("Shape must be at most rank 0 but "
157 "is rank 1 for 'foo' (op: "
180 "Invalid argument: Shape must be at most rank 0 but is rank 3 for "
201 "Invalid argument: Shape must be at most rank 0 but is rank 3 for "
224 "Invalid argument: Shape must be at most rank 0 but is rank 1 for "
247 "Invalid argument: Shape must be at most rank 0 but is rank 1 for
959 const int rank = c.Rank(in0); local
    [all...]
  /external/tensorflow/tensorflow/core/graph/
quantize_training.cc 346 Node* rank; local
348 NodeBuilder(strings::StrCat(name_prefix, "/InputRank"), "Rank")
350 .Finalize(graph, &rank));
354 .Input(rank)
  /external/tensorflow/tensorflow/core/kernels/
set_kernels.cc 45 // Validate rank >= 2.
47 const auto rank = shape.dims(); local
48 OP_REQUIRES(ctx, rank >= 2,
49 errors::InvalidArgument("Invalid rank ", rank, "."));
57 "] has rank ", input_shape.size(), " < 2");
65 // [base_index, base_index + 3), and validate its rank and indices.
107 errors::Internal("Rank expected ", expected_rank, ", got ",
  /external/zlib/src/
trees.c 838 int rank; /* index in bl_order */ local
847 for (rank = 0; rank < blcodes; rank++) {
848 Tracev((stderr, "\nbl code %2d ", bl_order[rank]));
849 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
    [all...]
  /frameworks/base/core/java/com/android/internal/inputmethod/
InputMethodSubtypeSwitchingController.java 339 final int rank = i; local
341 pw.println(prefix + "rank=" + rank + " item=" + item);
363 * <p>We call the index of {@link #mUsageHistoryOfSubtypeListItemIndex} as "Usage Rank"
436 final int rank = mUsageHistoryOfSubtypeListItemIndex[i]; local
438 pw.println(prefix + "rank=" + rank + " item=" + item);
  /frameworks/base/tools/apilint/
apilint.py 679 def rank(p): function in function:verify_layering
687 cr = rank(clazz.pkg.name)
691 ir = rank(f.typ)
696 ir = rank(m.typ)
700 ir = rank(arg)
    [all...]
  /hardware/qcom/gps/msm8909/utils/
LocTimer.cpp 506 int rank = -1; local
511 rank = timer->mFutureTime.tv_sec - mFutureTime.tv_sec;
513 return rank;
  /hardware/qcom/gps/msm8909w_3100/utils/
LocTimer.cpp 508 int rank = -1; local
513 rank = timer->mFutureTime.tv_sec - mFutureTime.tv_sec;
514 if(0 == rank)
516 //rank against tv_nsec for msec accuracy
517 rank = (int)(timer->mFutureTime.tv_nsec - mFutureTime.tv_nsec);
520 return rank;
  /hardware/qcom/gps/msm8996/utils/
LocTimer.cpp 505 int rank = -1; local
510 rank = timer->mFutureTime.tv_sec - mFutureTime.tv_sec;
512 return rank;
  /hardware/qcom/gps/msm8998/utils/
LocTimer.cpp 507 int rank = -1; local
512 rank = timer->mFutureTime.tv_sec - mFutureTime.tv_sec;
513 if(0 == rank)
515 //rank against tv_nsec for msec accuracy
516 rank = (int)(timer->mFutureTime.tv_nsec - mFutureTime.tv_nsec);
519 return rank;
  /packages/apps/Settings/src/com/android/settings/notification/
NotificationStation.java 317 final Ranking rank = new Ranking(); local
397 if (mRanking != null && mRanking.getRanking(sbn.getKey(), rank)) {
402 .append(Ranking.importanceToString(rank.getImportance()));
403 if (rank.getImportanceExplanation() != null) {
408 .append(rank.getImportanceExplanation());
414 .append(Boolean.toString(rank.canShowBadge()));
  /packages/apps/Settings/tests/robotests/src/com/android/settings/search/
DatabaseIndexingManagerTest.java 70 private final int rank = 8; field in class:DatabaseIndexingManagerTest
336 data.rank = rank;
  /toolchain/binutils/binutils-2.27/gas/
expr.c 1760 operator_rankT rank = (operator_rankT) rankarg; local
    [all...]
  /toolchain/binutils/binutils-2.27/zlib/
trees.c 840 int rank; /* index in bl_order */ local
849 for (rank = 0; rank < blcodes; rank++) {
850 Tracev((stderr, "\nbl code %2d ", bl_order[rank]));
851 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
    [all...]
  /external/drrickorang/LoopbackApp/app/src/main/java/org/drrickorang/loopback/
NativeAudioThread.java 256 int rank = slesGetCaptureRank(sles_data); local
257 if (rank > 0) {
259 mCaptureHolder.captureState(rank);
  /external/tensorflow/tensorflow/cc/gradients/
math_grad.cc 610 // -rank(input_shape), rank(input_shape)
894 auto rank = Rank(cpu_scope, op.input(0)); local
    [all...]
  /external/tensorflow/tensorflow/compiler/xla/
literal_util.cc 104 ShapeUtil::Rank(subshape)));
194 TF_RET_CHECK(ShapeUtil::Rank(src_literal.shape()) == src_base.size());
195 TF_RET_CHECK(ShapeUtil::Rank(shape()) == dest_base.size());
202 if (ShapeUtil::Rank(src_literal.shape()) == 0 ||
203 ShapeUtil::Rank(shape()) == 0) {
307 std::vector<int64> index(ShapeUtil::Rank(dest_shape));
322 std::vector<int64> origin(ShapeUtil::Rank(subshape()), 0);
679 CHECK_EQ(ShapeUtil::Rank(shape()), 1);
744 Relayout(LayoutUtil::GetDefaultLayoutForRank(ShapeUtil::Rank(shape())));
767 CHECK(IsPermutation(permutation, ShapeUtil::Rank(shape()))
1106 int64 rank = ShapeUtil::Rank(subshape); local
    [all...]
  /external/tensorflow/tensorflow/compiler/xla/service/cpu/
ir_emitter.cc 621 const int64 rank = ShapeUtil::Rank(operand->shape()); local
622 CHECK_EQ(rank, ShapeUtil::Rank(source->shape()));
623 CHECK_EQ(rank, window.dimensions_size());
680 ir_builder_.getInt64Ty(), ir_builder_.getInt32(rank),
703 for (int64 i = 0; i < rank; ++i) {
731 for (int64 i = 0; i < rank; ++i) {
    [all...]
  /external/tensorflow/tensorflow/core/grappler/costs/
graph_properties.cc 74 // rank, make sure we preserve that information.
171 // Rank in the tree, used to figure out how to compress the path to the root
173 int rank; member in struct:tensorflow::grappler::__anon39645::DisjointSet::Rep
211 if (x_root->rank < y_root->rank) {
214 } else if (x_root->rank > y_root->rank) {
221 x_root->rank = x_root->rank + 1;
233 node->rank = 0
454 const int rank = ctx->Rank(shape1); local
491 const int rank = ctx->Rank(shape1); local
519 const int rank = InferenceContext::Rank(s1); local
    [all...]
op_level_cost_estimator.cc 44 constexpr char kRank[] = "Rank";
92 int rank, bool* found_unknown_shapes) {
94 if (shape.unknown_rank() || shape.dim_size() < rank) {
97 VLOG(2) << "Use minimum shape because the rank is unknown.";
100 for (int i = 0; i < rank; i++) {
121 int rank = std::max(1, input_shape_1.dim_size()); local
123 MaybeGetMinimumShape(input_shape_1, rank, &found_unknown_shapes);
127 MaybeGetMinimumShape(input_shape_1, rank, &found_unknown_shapes);
129 MaybeGetMinimumShape(input_shape_2, rank, &found_unknown_shapes);
632 // BatchMatMul requires inputs of at least matrix shape (rank 2)
    [all...]
  /external/tensorflow/tensorflow/core/grappler/optimizers/
constant_folding_test.cc 805 Output rank = ops::Rank(scope.WithOpName("rank"), v1); local
845 Output rank = ops::Rank(scope.WithOpName("rank"), v1); local
    [all...]
  /frameworks/base/packages/SystemUI/src/com/android/systemui/volume/
CarVolumeDialogImpl.java 287 int rank = 0; local
300 volumeItem.rank = rank;
303 rank++;
314 int rank = Integer.MAX_VALUE; local
318 if (volumeItem.rank < rank) {
319 rank = volumeItem.rank;
597 private int rank; field in class:CarVolumeDialogImpl.VolumeItem
    [all...]
  /frameworks/ml/nn/runtime/test/
TestValidateOperations.cpp 1052 ANeuralNetworksOperandType rank = intScalar; local
    [all...]
  /packages/apps/Launcher3/src/com/android/launcher3/
AutoInstallsLayout.java 123 private static final String ATTR_RANK = "rank";
233 long rank = Long.parseLong(getAttributeValue(parser, ATTR_RANK)); local
234 out[1] = (FeatureFlags.NO_ALL_APPS_ICON || rank < mIdp.getAllAppsButtonRank())
235 ? rank : (rank + 1);
572 int rank = 0; local
580 mValues.put(Favorites.RANK, rank);
587 rank++;
  /packages/apps/Launcher3/src/com/android/launcher3/folder/
FolderPagedView.java 189 public void allocateSpaceForRank(int rank) {
191 views.add(rank, null);
196 * Create space for a new item at the end, and returns the rank for that item.
200 int rank = getItemCount(); local
201 allocateSpaceForRank(rank);
202 setCurrentPage(rank / mMaxItemsPerPage);
203 return rank;
206 public View createAndAddViewForRank(ShortcutInfo item, int rank) {
208 allocateSpaceForRank(rank);
209 addViewForRank(icon, item, rank);
321 int newX, newY, rank; local
    [all...]

Completed in 1739 milliseconds

1 2 3 4 56 7 8 91011>>