Home
last modified time | relevance | path

Searched refs:orders (Results 1 – 25 of 173) sorted by relevance

1234567

/third_party/icu/icu4c/source/test/intltest/
Dtscoll.cpp392 LocalArray<Order> orders(getOrders(iter, orderLength)); in backAndForth() local
417 if (o != orders[index].order) { in backAndForth()
421 while (index > 0 && orders[--index].order == 0) { in backAndForth()
425 if (o != orders[index].order) { in backAndForth()
427 orders[index].order, o); in backAndForth()
435 if (offset != orders[index].offset) { in backAndForth()
437 orders[index].offset, offset); in backAndForth()
445 while (index != 0 && orders[index - 1].order == 0) in backAndForth()
489 LocalArray<Order> orders(new Order[maxSize]); in getOrders() local
501 uprv_memcpy(temp, orders.getAlias(), size * sizeof(Order)); in getOrders()
[all …]
Ditercoll.cpp191 Order *orders = getOrders(*iter, orderLength); in TestOffset() local
218 delete[] orders; in TestOffset()
/third_party/typescript/tests/baselines/reference/
DinferenceLimit.js27 .then((orders: Array<MyModule.MyModel>) => {
28 resolve(orders);
74 .then((orders) => {
75 resolve(orders);
DinferenceLimit.types19 …ise.all(result.map(populateItems)) .then((orders: Array<MyModule.MyModel>) => { resolv…
22 …ise.all(result.map(populateItems)) .then((orders: Array<MyModule.MyModel>) => { resolv…
76 …ise.all(result.map(populateItems)) .then((orders: Array<MyModule.MyModel>) => { resolv…
88 .then((orders: Array<MyModule.MyModel>) => {
90 >(orders: Array<MyModule.MyModel>) => { resolve(orders); } : (orders: Array<MyModule.My…
91 >orders : MyModule.MyModel[]
94 resolve(orders);
95 >resolve(orders) : void
97 >orders : MyModule.MyModel[]
DinferenceLimit.symbols72 .then((orders: Array<MyModule.MyModel>) => {
74 >orders : Symbol(orders, Decl(file1.ts, 23, 13))
79 resolve(orders);
81 >orders : Symbol(orders, Decl(file1.ts, 23, 13))
/third_party/ffmpeg/tests/fate/
Dalac.mak4 fate-alac-16-lpc-orders \
8 fate-alac-24-lpc-orders \
12 fate-alac-%-lpc-orders: OPTS = -min_prediction_order 1 -max_prediction_order 30
/third_party/icu/icu4c/source/test/cintltst/
Dcallcoll.c484 OrderAndOffset *orders =(OrderAndOffset *)malloc(sizeof(OrderAndOffset) * maxSize); in getOrders() local
495 memcpy(temp, orders, size * sizeof(OrderAndOffset)); in getOrders()
496 free(orders); in getOrders()
497 orders = temp; in getOrders()
501 orders[size].order = order; in getOrders()
502 orders[size].offset = offset; in getOrders()
512 memcpy(temp, orders, size * sizeof(OrderAndOffset)); in getOrders()
513 free(orders); in getOrders()
514 orders = temp; in getOrders()
520 return orders; in getOrders()
[all …]
Dcitertst.c566 OrderAndOffset *orders; in TestOffset() local
598 orders = getOrders(iter, &orderLength); in TestOffset()
630 free(orders); in TestOffset()
944 *orders; in TestSmallBuffer() local
966 orders = getOrders(iter, &count); in TestSmallBuffer()
983 if ((count > 250 && testorders[-- count].order != orders[1].order) || in TestSmallBuffer()
984 (count <= 250 && testorders[-- count].order != orders[0].order)) { in TestSmallBuffer()
991 free(orders); in TestSmallBuffer()
/third_party/typescript/tests/cases/compiler/
DinferenceLimit.ts27 .then((orders: Array<MyModule.MyModel>) => {
28 resolve(orders);
/third_party/mindspore/mindspore/common/
Dparameter.py617 orders = {}
624 if x.name not in orders.keys():
625 orders[x.name] = [0, x]
627 if isinstance(orders[x.name], list):
629 orders[name][1].name = name + "_" + str(0)
631 orders[name] = 1
633 orders[x.name] += 1
634 x.name = x.name + "_" + str(orders[x.name])
/third_party/glib/glib/tests/
Dnode.c78 TraverseData orders[] = { in traversal_test() local
214 for (i = 0; i < G_N_ELEMENTS (orders); i++) in traversal_test()
217 data.count = orders[i].limit; in traversal_test()
218 …g_node_traverse (root, orders[i].traverse, orders[i].flags, orders[i].depth, node_build_string, &d… in traversal_test()
219 g_assert_cmpstr (data.s->str, ==, orders[i].expected); in traversal_test()
Dtree.c337 TraverseData orders[] = { in test_tree_traverse() local
394 for (i = 0; i < G_N_ELEMENTS (orders); i++) in test_tree_traverse()
397 data.count = orders[i].limit; in test_tree_traverse()
398 g_tree_traverse (tree, traverse_func, orders[i].traverse, &data); in test_tree_traverse()
399 g_assert_cmpstr (data.s->str, ==, orders[i].expected); in test_tree_traverse()
/third_party/boost/boost/math/differentiation/
Dautodiff_cpp11.hpp66 Orders... orders) const { in at_cpp11()
67 return v.at(order).at(orders...); in at_cpp11()
73 get_type_at<RealType, sizeof...(Orders)> fvar<RealType, Order>::at(size_t order, Orders... orders) … in at()
74 return at_cpp11(std::integral_constant<bool, sizeof...(orders) == 0>{}, order, orders...); in at()
91 Orders... orders) const { in derivative()
94 return at(static_cast<size_t>(orders)...) * in derivative()
95 product(boost::math::factorial<root_type>(static_cast<unsigned>(orders))...); in derivative()
/third_party/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/collator/
DCollationTest.java97 int[] orders = new int[maxSize]; in getOrders() local
104 System.arraycopy(orders, 0, temp, 0, size); in getOrders()
105 orders = temp; in getOrders()
107 orders[size++] = order; in getOrders()
112 System.arraycopy(orders, 0, temp, 0, size); in getOrders()
113 orders = temp; in getOrders()
115 return orders; in getOrders()
122 int[] orders = getOrders(iter); in backAndForth() local
125 int index = orders.length; in backAndForth()
132 if (o != orders[--index]) { in backAndForth()
[all …]
DCollationIteratorTest.java237 int[] orders = CollationTest.getOrders(iter); in TestOffset() local
238 logln("orders.length = " + orders.length); in TestOffset()
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/collator/
DCollationTest.java100 int[] orders = new int[maxSize]; in getOrders() local
107 System.arraycopy(orders, 0, temp, 0, size); in getOrders()
108 orders = temp; in getOrders()
110 orders[size++] = order; in getOrders()
115 System.arraycopy(orders, 0, temp, 0, size); in getOrders()
116 orders = temp; in getOrders()
118 return orders; in getOrders()
125 int[] orders = getOrders(iter); in backAndForth() local
128 int index = orders.length; in backAndForth()
135 if (o != orders[--index]) { in backAndForth()
[all …]
/third_party/mindspore/mindspore/ccsrc/runtime/device/ascend/
Dascend_stream_assign.cc1508 vector<CNodePtr> orders; in InsertEventBetweenHcom() local
1519 …de_ptr_list.begin(), cnode_ptr_list.begin() + first_stream_last_index, std::back_inserter(orders)); in InsertEventBetweenHcom()
1523 orders.emplace_back(cur_cnode); in InsertEventBetweenHcom()
1529 orders.emplace_back(cur_cnode); in InsertEventBetweenHcom()
1531 orders.emplace_back(send); in InsertEventBetweenHcom()
1535 orders.emplace_back(recv); in InsertEventBetweenHcom()
1536 orders.emplace_back(cur_cnode); in InsertEventBetweenHcom()
1551 orders.emplace_back(recv); in InsertEventBetweenHcom()
1553 orders.emplace_back(cur_cnode); in InsertEventBetweenHcom()
1555 orders.emplace_back(send); in InsertEventBetweenHcom()
[all …]
/third_party/vk-gl-cts/external/vulkancts/modules/vulkan/memory/
DvktMemoryAllocationTests.cpp852 } orders[] = in createAllocationTestsCommon() local
868 for (size_t orderNdx = 0; orderNdx < DE_LENGTH_OF_ARRAY(orders); orderNdx++) in createAllocationTestsCommon()
870 const TestConfig::Order order = orders[orderNdx].order; in createAllocationTestsCommon()
871 const char* const orderName = orders[orderNdx].str; in createAllocationTestsCommon()
918 for (size_t orderNdx = 0; orderNdx < DE_LENGTH_OF_ARRAY(orders); orderNdx++) in createAllocationTestsCommon()
920 const TestConfig::Order order = orders[orderNdx].order; in createAllocationTestsCommon()
921 const char* const orderName = orders[orderNdx].str; in createAllocationTestsCommon()
/third_party/mindspore/mindspore/ccsrc/runtime/device/
Dkernel_adjust.cc176 const std::vector<CNodePtr> &orders, size_t order_index, in CopyMemcpyList() argument
182 for (size_t idx = order_index + 1; idx < orders.size(); idx++) { in CopyMemcpyList()
183 cur_cnode = orders[idx]; in CopyMemcpyList()
185 auto pre_node = orders[idx - 1]; in CopyMemcpyList()
313 …t::SetBeforeGetNextStreamID(std::vector<CNodePtr> *exec_order, const std::vector<CNodePtr> &orders, in SetBeforeGetNextStreamID() argument
317 for (; *order_index < orders.size(); (*order_index)++) { in SetBeforeGetNextStreamID()
318 auto node = orders[*order_index]; in SetBeforeGetNextStreamID()
438 const std::vector<CNodePtr> &orders = kernel_graph_ptr->execution_order(); in InsertSwitchLoop() local
439 if (orders.empty()) { in InsertSwitchLoop()
454 SetBeforeGetNextStreamID(&exec_order, orders, &order_index, getnext_cnode, getnext_stream_id); in InsertSwitchLoop()
[all …]
Dkernel_adjust.h115 …id SetBeforeGetNextStreamID(std::vector<CNodePtr> *exec_order, const std::vector<CNodePtr> &orders,
148 … const std::vector<CNodePtr> &orders, size_t order_index, std::vector<CNodePtr> *memcpy_list,
/third_party/mindspore/mindspore/ccsrc/frontend/optimizer/
Drecompute.cc447 std::list<CNodePtr> orders = graph->GetOrderedCnodes(); in InsertRecomputedNodes() local
448 std::vector<CNodePtr> origin_nodes_topological(orders.begin(), orders.end()); in InsertRecomputedNodes()
478 for (const auto &node : orders) { in InsertRecomputedNodes()
/third_party/boost/libs/math/doc/sf/
Dbessel_introduction.qbk11 real or complex number, although integer orders are the most common occurrence.
13 This library supports either integer or real orders.
/third_party/skia/third_party/externals/angle2/src/libANGLE/renderer/vulkan/doc/
DFastOpenGLStateTransitions.md7 [VkPipeline][VkPipeline] for each state vector. Compiling VkPipelines is multiple orders of
15 pipeline recompilations are orders of manitude slower than OpenGL state changes.
/third_party/boost/libs/range/doc/reference/algorithm/
Dnth_element.qbk36 `nth_element` partially orders a range of elements. `nth_element` arranges the range `rng` such tha…
Dpartition.qbk44 `partition` orders the elements in `rng` based on `pred`, such that the elements that satisfy `pred…

1234567