Home
last modified time | relevance | path

Searched refs:rank (Results 1 - 25 of 39) sorted by relevance

12

/third_party/typescript/tests/baselines/reference/
H A DdeclarationEmitExportAliasVisibiilityMarking.js10 export default (suit: Suit, rank: Rank) => ({suit, rank});
23 exports["default"] = (function (suit, rank) { return ({ suit: suit, rank: rank }); });
38 declare const _default: (suit: Suit, rank: Rank) => {
40 rank: Rank;
44 export declare let lazyCard: () => Promise<(suit: import("./Types").Suit, rank: import("./Types").Rank) => {
46 rank: import("./Types").Rank;
/third_party/rust/crates/memchr/src/memmem/
H A Drarebytes.rs65 if rank(rare2) < rank(rare1) {
70 if rank(b) < rank(rare1) {
75 } else if b != rare1 && rank(b) < rank(rare2) {
123 /// Return the byte frequency rank of each byte. The higher the rank, the
128 (rank(b1), rank(b
134 fn rank(b: u8) -> usize { rank() functions
[all...]
/third_party/node/deps/v8/tools/
H A Deval_gc_time.sh7 # Convenience Script used to rank GC NVP output.
13 echo " -r|--rank new-gen-rank|old-gen-rank GC mode to profile"
14 echo " (default: old-gen-rank)"
24 OP=old-gen-rank
35 -r|--rank)
37 new-gen-rank|old-gen-rank)
141 new-gen-rank)
[all...]
H A Deval_gc_nvp.py174 parser.add_argument('--rank', metavar='<no|min|max|avg>',
177 help="rank keys by metric (default: no)")
215 if args.rank != "no":
216 categories = sorted(categories, key=make_key_func(args.rank), reverse=True)
/third_party/mesa3d/src/gallium/drivers/llvmpipe/
H A Dlp_fence.c40 * The rank will be the number of bins in the scene. Whenever a rendering
42 * the counter == the rank, the fence is finished.
44 * \param rank the expected finished value of the fence counter.
47 lp_fence_create(unsigned rank) in lp_fence_create() argument
61 fence->rank = rank; in lp_fence_create()
85 * When the counter == the rank, the fence is finished.
96 assert(fence->count <= fence->rank); in lp_fence_signal()
99 debug_printf("%s count=%u rank=%u\n", __FUNCTION__, in lp_fence_signal()
100 fence->count, fence->rank); in lp_fence_signal()
[all...]
H A Dlp_fence.h50 unsigned rank; member
56 lp_fence_create(unsigned rank);
/third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/
H A Dgraphcycles.cc25 // (1) Maintain a rank for each node that is consistent
27 // implies rank[x] < rank[y].
28 // (2) When a new edge (x->y) is inserted, do nothing if rank[x] < rank[y].
279 int32_t rank; // rank number assigned by Pearce-Kelly algorithm member
392 if (!ranks.insert(nx->rank)) { in CheckInvariants()
393 ABSL_RAW_LOG(FATAL, "Duplicate occurrence of rank %d", nx->rank); in CheckInvariants()
[all...]
/third_party/rust/crates/memchr/scripts/
H A Dmake-byte-frequency-table5 # assigned a rank. This list is written to src/freqs.rs.
51 # Get the rank of each byte. A lower rank => lower relative frequency.
52 rank = [0] * 256
55 rank[byte] = 255 - i
57 # Forcefully set the highest rank possible for bytes that start multi-byte
61 rank[byte] = 255
66 olines.append(' %3d, // %r' % (rank[byte], chr(byte)))
/third_party/rust/crates/regex/scripts/
H A Dfrequencies.py5 # assigned a rank. This list is written to src/freqs.rs.
51 # Get the rank of each byte. A lower rank => lower relative frequency.
52 rank = [0] * 256
55 rank[byte] = 255 - i
57 # Forcefully set the highest rank possible for bytes that start multi-byte
61 rank[byte] = 255
66 olines.append(' %3d, // %r' % (rank[byte], chr(byte)))
/third_party/vk-gl-cts/framework/platform/lnx/X11/
H A DtcuLnxX11GlxPlatform.cpp569 Rank rank; in configRank()
580 rank.add(1, (caveat != GLX_NON_CONFORMANT_CONFIG)); in configRank()
583 rank.add(1, visual.getAttrib(GLX_TRANSPARENT_TYPE) == GLX_NONE); in configRank()
586 rank.add(1, visual.getAttrib(GLX_STEREO) == False); in configRank()
589 rank.add(1, visual.getAttrib(GLX_LEVEL) == 0); in configRank()
592 rank.add(1, alphaSize > 0); in configRank()
595 rank.add(1, depthSize > 0); in configRank()
598 rank.add(1, stencilSize > 0); in configRank()
601 rank.add(1, (caveat != GLX_SLOW_CONFIG)); in configRank()
604 rank in configRank()
[all...]
/third_party/mesa3d/src/freedreno/ir3/
H A Dir3_sched.c659 dec_rank_name(enum choose_instr_dec_rank rank) in dec_rank_name() argument
661 switch (rank) { in dec_rank_name()
709 enum choose_instr_dec_rank rank; in choose_instr_dec() local
715 rank = DEC_FREED_READY; in choose_instr_dec()
717 rank = DEC_FREED; in choose_instr_dec()
727 rank = DEC_NEUTRAL_READY; in choose_instr_dec()
729 rank = DEC_NEUTRAL; in choose_instr_dec()
732 /* Prefer higher-ranked instructions, or in the case of a rank tie, the in choose_instr_dec()
735 if (!chosen || rank > chosen_rank || in choose_instr_dec()
736 (rank in choose_instr_dec()
756 inc_rank_name(enum choose_instr_inc_rank rank) inc_rank_name() argument
800 enum choose_instr_inc_rank rank; choose_instr_inc() local
[all...]
/third_party/node/deps/v8/src/heap/
H A Dmarking-worklist.cc82 std::vector<std::pair<int, InstanceType>> rank; in PrintWorklist() local
83 rank.reserve(count.size()); in PrintWorklist()
85 rank.emplace_back(i.second, i.first); in PrintWorklist()
91 std::sort(rank.begin(), rank.end(), in PrintWorklist()
94 for (auto i : rank) { in PrintWorklist()
/third_party/skia/third_party/externals/abseil-cpp/absl/random/internal/
H A Dtraits.h43 // So we define rank to be:
44 // - rank(float) -> 2
45 // - rank(signed) -> 1
46 // - rank(unsigned) -> 0
48 static constexpr int rank() { in rank() function in absl::random_internal::is_widening_convertible
55 // and B belongs to a rank no lower than A, then A can be safely represented
59 rank<A>() <= rank<B>();
/third_party/ltp/tools/sparse/sparse-src/
H A Dsymbol.c285 sym->rank = base_type->rank; in examine_base_type()
391 if (t->ctype.base_type == &int_type && t->rank == -2) in count_array_initializer()
510 sym->rank = base_type->rank; in examine_node_type()
657 new->rank = 0; in create_fouled()
884 int rank; member
968 sym->rank = ctype->rank; in init_ctype()
976 sym->rank in init_ctype()
[all...]
H A Dexpand.c164 if (newtype->rank <= 0) { in cast_value()
165 if (newtype->rank == 0) in cast_value()
342 int rank = expr->ctype->rank; in simplify_float_binop() local
351 if (rank > 0) { in simplify_float_binop()
360 } else if (rank == 0) { in simplify_float_binop()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/
H A DPassManagerInternal.h129 check(rank<2>);
139 static decltype(NonceFunction(&Checker<T>::invalidate)) check(rank<1>);
144 static EnabledType check(rank<0>);
147 enum { Value = sizeof(check<ResultT>(rank<2>())) == sizeof(EnabledType) };
/third_party/skia/third_party/externals/angle2/src/libANGLE/
H A DOverlayWidgets.h159 size_t rank = in set() local
162 runningValues[lastValueIndex] = rank; in set()
/third_party/googletest/googletest/src/hwext/
H A Dgtest-ext.cc208 int rank = info->flags; in getTestFlags() local
213 flagList[indexRank] = rank; in getTestFlags()
H A Dgtest-filter.cc164 } else if (strname == "rank") { in postParsingArguments()
191 int rank = flags; in accept() local
201 flags_rank = IsElementInVector(vecRank, rank); in accept()
/third_party/node/deps/v8/third_party/ittapi/src/ittnotify/
H A Dittnotify_static.h330 ITT_STUB(ITTAPI, int, av_saveA, (void *data, int rank, const int *dimensions, int type, const char *filePath, int columnOrder), (ITT_FORMAT data, rank, dimensions, type, filePath, columnOrder), av_saveA, __itt_group_arrays, "%p, %d, %p, %d, \"%s\", %d")
331 ITT_STUB(ITTAPI, int, av_saveW, (void *data, int rank, const int *dimensions, int type, const wchar_t *filePath, int columnOrder), (ITT_FORMAT data, rank, dimensions, type, filePath, columnOrder), av_saveW, __itt_group_arrays, "%p, %d, %p, %d, \"%S\", %d")
333 ITT_STUB(ITTAPI, int, av_save, (void *data, int rank, const int *dimensions, int type, const char *filePath, int columnOrder), (ITT_FORMAT data, rank, dimensions, type, filePath, columnOrder), av_save, __itt_group_arrays, "%p, %d, %p, %d, \"%s\", %d")
/third_party/node/deps/v8/third_party/zlib/
H A Dtrees.c838 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);
/third_party/node/deps/zlib/
H A Dtrees.c833 int rank; /* index in bl_order */ in send_all_trees() local
842 for (rank = 0; rank < blcodes; rank++) { in send_all_trees()
843 Tracev((stderr, "\nbl code %2d ", bl_order[rank])); in send_all_trees()
844 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3); in send_all_trees()
/third_party/libwebsockets/win32port/zlib/
H A Dtrees.c846 int rank; /* index in bl_order */ local
855 for (rank = 0; rank < blcodes; rank++) {
856 Tracev((stderr, "\nbl code %2d ", bl_order[rank]));
857 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
/third_party/skia/third_party/externals/zlib/
H A Dtrees.c838 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);
/third_party/zlib/
H A Dtrees.c857 int rank; /* index in bl_order */ in send_all_trees() local
866 for (rank = 0; rank < blcodes; rank++) { in send_all_trees()
867 Tracev((stderr, "\nbl code %2d ", bl_order[rank])); in send_all_trees()
868 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3); in send_all_trees()

Completed in 21 milliseconds

12