| /arkcompiler/ets_runtime/ecmascript/tests/ |
| H A D | tagged_tree_test.cpp | 133 constexpr int NODE_NUMBERS = 64; in HWTEST_F_L0() local
134 JSHandle<TaggedTreeMap> tmap(thread, TaggedTreeMap::Create(thread, NODE_NUMBERS)); in HWTEST_F_L0()
135 EXPECT_EQ(tmap->Capacity(), NODE_NUMBERS); in HWTEST_F_L0()
143 constexpr int NODE_NUMBERS = 64; in HWTEST_F_L0() local
144 JSHandle<TaggedTreeSet> tset(thread, TaggedTreeSet::Create(thread, NODE_NUMBERS)); in HWTEST_F_L0()
145 EXPECT_EQ(tset->Capacity(), NODE_NUMBERS); in HWTEST_F_L0()
154 constexpr int NODE_NUMBERS = 64; in HWTEST_F_L0() local
155 JSMutableHandle<TaggedTreeMap> tmap(thread, TaggedTreeMap::Create(thread, NODE_NUMBERS)); in HWTEST_F_L0()
190 constexpr int NODE_NUMBERS = 64; in HWTEST_F_L0() local
191 JSMutableHandle<TaggedTreeSet> tset(thread, TaggedTreeSet::Create(thread, NODE_NUMBERS)); in HWTEST_F_L0()
219 constexpr int NODE_NUMBERS = 32; HWTEST_F_L0() local
248 constexpr int NODE_NUMBERS = 32; HWTEST_F_L0() local
321 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
340 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
377 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
405 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
428 constexpr int32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
448 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
490 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
528 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
563 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
598 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
621 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
648 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
678 TestSetAfterDeleteCheckOther(JSThread* thread, std::vector<JSMutableHandle<JSTaggedValue>>& keyValue, std::string& myKey, int NODE_NUMBERS) TestSetAfterDeleteCheckOther() argument
725 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
819 constexpr int NODE_NUMBERS = 16; HWTEST_F_L0() local
834 constexpr int NODE_NUMBERS = 16; HWTEST_F_L0() local
869 constexpr int NODE_NUMBERS = 9; HWTEST_F_L0() local
942 constexpr int NODE_NUMBERS = 32; HWTEST_F_L0() local
[all...] |
| H A D | js_api_tree_map_test.cpp | 52 constexpr int NODE_NUMBERS = 8; in HWTEST_F_L0() local
61 for (int i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
68 EXPECT_EQ(tmap->GetSize(), NODE_NUMBERS); in HWTEST_F_L0()
75 for (int i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
89 constexpr int NODE_NUMBERS = 64; in HWTEST_F_L0() local
99 for (int i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
106 EXPECT_EQ(tmap->GetSize(), NODE_NUMBERS); in HWTEST_F_L0()
113 EXPECT_EQ(tmap->GetSize(), NODE_NUMBERS - REMOVE_SIZE); in HWTEST_F_L0()
128 for (int i = REMOVE_SIZE; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
144 constexpr int NODE_NUMBERS in HWTEST_F_L0() local
232 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
293 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
[all...] |
| H A D | js_api_lightweightset_test.cpp | 50 constexpr uint32_t NODE_NUMBERS = 8; // 8 means the value in HWTEST_F_L0() local
58 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
62 EXPECT_EQ(lws->GetSize(), NODE_NUMBERS); in HWTEST_F_L0()
64 uint32_t tmp = NODE_NUMBERS * 2; // 2 means the value in HWTEST_F_L0()
72 JSAPILightWeightSet::IncreaseCapacityTo(thread, lws, NODE_NUMBERS); in HWTEST_F_L0()
76 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
81 for (uint32_t i = 0; i < NODE_NUMBERS + 2; i++) { in HWTEST_F_L0()
86 tmp = NODE_NUMBERS + 2; // 2 means the value in HWTEST_F_L0()
92 constexpr uint32_t NODE_NUMBERS = 8; // 8 means the value in HWTEST_F_L0() local
109 for (uint32_t i = 0; i < NODE_NUMBERS; in HWTEST_F_L0()
148 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
202 constexpr uint32_t NODE_NUMBERS = 8; // 8 means the value HWTEST_F_L0() local
245 constexpr uint32_t NODE_NUMBERS = 8; // 8 means the value HWTEST_F_L0() local
267 uint32_t NODE_NUMBERS = static_cast<uint32_t>(hashCollisionVector.size()); HWTEST_F_L0() local
285 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
315 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
345 constexpr uint32_t NODE_NUMBERS = 3; HWTEST_F_L0() local
[all...] |
| H A D | js_api_tree_set_test.cpp | 72 constexpr int NODE_NUMBERS = 8; in HWTEST_F_L0() local
78 auto tset = TestCommon(key, myKey, NODE_NUMBERS); in HWTEST_F_L0()
85 for (int i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
97 constexpr int NODE_NUMBERS = 64; in HWTEST_F_L0() local
104 auto tset = TestCommon(key, myKey, NODE_NUMBERS); in HWTEST_F_L0()
108 std::string ikey = myKey + std::to_string(NODE_NUMBERS); in HWTEST_F_L0()
120 EXPECT_EQ(tset->GetSize(), NODE_NUMBERS - REMOVE_SIZE); in HWTEST_F_L0()
131 for (int i = REMOVE_SIZE; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
143 constexpr int NODE_NUMBERS = 8; in HWTEST_F_L0() local
149 auto tset = TestCommon(key, myKey, NODE_NUMBERS); in HWTEST_F_L0()
165 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
207 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
266 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
[all...] |
| H A D | js_api_hashmap_test.cpp | 63 constexpr uint32_t NODE_NUMBERS = 8; in HWTEST_F_L0() local
82 Update(hashMap, key, value, pair, NODE_NUMBERS); in HWTEST_F_L0()
83 EXPECT_EQ(hashMap->GetSize(), NODE_NUMBERS); in HWTEST_F_L0()
88 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
102 constexpr uint32_t NODE_NUMBERS = 8; in HWTEST_F_L0() local
121 Update(hashMap, key, value, pair, NODE_NUMBERS); in HWTEST_F_L0()
122 EXPECT_EQ(hashMap->GetSize(), NODE_NUMBERS); in HWTEST_F_L0()
128 for (uint32_t i = 0; i < NODE_NUMBERS / 2; i++) { in HWTEST_F_L0()
133 EXPECT_EQ(hashMap->GetSize(), NODE_NUMBERS / 2); in HWTEST_F_L0()
135 for (uint32_t i = 0; i < NODE_NUMBERS / in HWTEST_F_L0()
164 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
227 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
296 constexpr uint32_t NODE_NUMBERS = 11; HWTEST_F_L0() local
330 uint32_t NODE_NUMBERS = static_cast<uint32_t>(hashCollisionVector.size()); HWTEST_F_L0() local
367 uint32_t NODE_NUMBERS = static_cast<uint32_t>(hashCollisionVector.size()); HWTEST_F_L0() local
[all...] |
| H A D | js_api_hashset_test.cpp | 62 constexpr uint32_t NODE_NUMBERS = 8; in HWTEST_F_L0() local
66 Update(hashSet, value, myValue, NODE_NUMBERS); in HWTEST_F_L0()
69 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
91 constexpr uint32_t NODE_NUMBERS = 8; in HWTEST_F_L0() local
97 Update(hashSet, value, myValue, NODE_NUMBERS); in HWTEST_F_L0()
99 for (uint32_t i = 0; i < NODE_NUMBERS / 2; i++) { in HWTEST_F_L0()
104 EXPECT_EQ(hashSet->GetSize(), NODE_NUMBERS / 2); in HWTEST_F_L0()
106 for (uint32_t i = 0; i < NODE_NUMBERS / 2; i++) { in HWTEST_F_L0()
115 for (uint32_t i = NODE_NUMBERS / 2; i < NODE_NUMBERS; in HWTEST_F_L0()
133 uint32_t NODE_NUMBERS = static_cast<uint32_t>(hashCollisionVector.size()); HWTEST_F_L0() local
174 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
187 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
228 constexpr uint32_t NODE_NUMBERS = 11; HWTEST_F_L0() local
[all...] |
| H A D | js_api_plain_array_test.cpp | 82 constexpr uint32_t NODE_NUMBERS = 8; // 8 means the value in HWTEST_F_L0() local
90 for (uint32_t i = 0; i < NODE_NUMBERS; i = i + 2) { in HWTEST_F_L0()
99 for (uint32_t i = 1; i < NODE_NUMBERS; i = i + 2) { in HWTEST_F_L0()
108 EXPECT_EQ(array->GetSize(), static_cast<int>(NODE_NUMBERS)); in HWTEST_F_L0()
110 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
121 EXPECT_EQ(array->GetKeyAt(NODE_NUMBERS), JSTaggedValue::Undefined()); in HWTEST_F_L0()
129 constexpr uint32_t NODE_NUMBERS = 8; // 8 means the value in HWTEST_F_L0() local
137 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
144 EXPECT_EQ(array->GetSize(), static_cast<int>(NODE_NUMBERS)); in HWTEST_F_L0()
150 EXPECT_EQ(newArray->GetSize(), static_cast<int>(NODE_NUMBERS)); in HWTEST_F_L0()
167 constexpr uint32_t NODE_NUMBERS = 8; // 8 means the value HWTEST_F_L0() local
196 constexpr uint32_t NODE_NUMBERS = 8; // 8 means the value HWTEST_F_L0() local
255 constexpr uint32_t NODE_NUMBERS = 3; // 3 means the value HWTEST_F_L0() local
[all...] |
| H A D | rb_tree_node_test.cpp | 36 uint32_t NODE_NUMBERS = 8;
member in panda::test::RBTreeNodeTest
92 RBTreeNodeInit(rootNode, myKey, myValue, NODE_NUMBERS);
in HWTEST_F_L0()
93 EXPECT_EQ(rootNode->GetCount(), NODE_NUMBERS);
in HWTEST_F_L0()
95 RBTreeValueCheck(rootNode, myKey, myValue, 0, NODE_NUMBERS);
in HWTEST_F_L0()
105 RBTreeNodeInit(rootNode, myKey, myValue, NODE_NUMBERS);
in HWTEST_F_L0()
106 EXPECT_EQ(rootNode->GetCount(), NODE_NUMBERS);
in HWTEST_F_L0()
108 for (uint32_t i = 0; i < NODE_NUMBERS / 2; i++) {
in HWTEST_F_L0()
117 EXPECT_EQ(rootNode->GetCount(), (NODE_NUMBERS / 2));
in HWTEST_F_L0()
119 for (uint32_t i = 0; i < NODE_NUMBERS / 2; i++) {
in HWTEST_F_L0()
128 RBTreeValueCheck(rootNode, myKey, myValue, NODE_NUMBERS / in HWTEST_F_L0()
[all...] |
| H A D | js_api_deque_test.cpp | 51 constexpr uint32_t NODE_NUMBERS = 9; in HWTEST_F_L0() local
61 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
73 constexpr uint32_t NODE_NUMBERS = 9; in HWTEST_F_L0() local
83 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
95 constexpr uint32_t NODE_NUMBERS = 9; in HWTEST_F_L0() local
105 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
117 constexpr uint32_t NODE_NUMBERS = 9; in HWTEST_F_L0() local
127 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
|
| H A D | js_api_vector_test.cpp | 73 constexpr uint32_t NODE_NUMBERS = 9; in HWTEST_F_L0() local
80 value.Update(JSTaggedValue(NODE_NUMBERS)); in HWTEST_F_L0()
84 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
92 value.Update(JSTaggedValue(NODE_NUMBERS)); in HWTEST_F_L0()
94 EXPECT_EQ(static_cast<uint32_t>(toor->GetSize()), NODE_NUMBERS); in HWTEST_F_L0()
99 JSAPIVector::Get(thread, toor, static_cast<int32_t>(NODE_NUMBERS)); in HWTEST_F_L0()
107 constexpr uint32_t NODE_NUMBERS = 9; in HWTEST_F_L0() local
112 auto toor = TestCommon(value, myValue, NODE_NUMBERS); in HWTEST_F_L0()
114 for (int32_t i = NODE_NUMBERS / 2; i > 0; i--) { in HWTEST_F_L0()
127 JSTaggedValue result1 = JSAPIVector::RemoveByIndex(thread, toor, NODE_NUMBERS); in HWTEST_F_L0()
136 constexpr uint32_t NODE_NUMBERS = 9; HWTEST_F_L0() local
150 constexpr uint32_t NODE_NUMBERS = 9; HWTEST_F_L0() local
[all...] |
| H A D | js_api_stack_test.cpp | 74 constexpr uint32_t NODE_NUMBERS = 9; in HWTEST_F_L0() local
84 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
91 EXPECT_EQ(static_cast<uint32_t>(toor->GetTop() + 1), NODE_NUMBERS); in HWTEST_F_L0()
98 constexpr uint32_t NODE_NUMBERS = 9; in HWTEST_F_L0() local
108 for (uint32_t i = 1; i <= NODE_NUMBERS; i++) { in HWTEST_F_L0()
116 for (uint32_t i = NODE_NUMBERS; i >= 1; i--) { in HWTEST_F_L0()
128 constexpr uint32_t NODE_NUMBERS = 9; in HWTEST_F_L0() local
131 auto toor = SearchAndEmptyCommon(value, myValue, NODE_NUMBERS); in HWTEST_F_L0()
135 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
149 constexpr uint32_t NODE_NUMBERS in HWTEST_F_L0() local
[all...] |
| /arkcompiler/ets_runtime/ecmascript/containers/tests/ |
| H A D | containers_treeset_test.cpp | 186 constexpr int NODE_NUMBERS = 8; in HWTEST_F_L0() local
188 for (int i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
200 EXPECT_EQ(tset->GetSize(), NODE_NUMBERS); in HWTEST_F_L0()
206 for (int i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
219 EXPECT_EQ(tset->GetSize(), NODE_NUMBERS + i + 1); in HWTEST_F_L0()
221 EXPECT_EQ(tset->GetSize(), NODE_NUMBERS * 2); in HWTEST_F_L0()
223 for (int i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
234 for (int i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
253 constexpr int NODE_NUMBERS = 64; in HWTEST_F_L0() local
256 for (int i = 0; i < NODE_NUMBERS; in HWTEST_F_L0()
357 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
445 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
532 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
653 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
746 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
791 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
911 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
1009 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
1085 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
[all...] |
| H A D | containers_linked_list_test.cpp | 185 constexpr uint32_t NODE_NUMBERS = 8; in HWTEST_F_L0() local
188 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
196 EXPECT_EQ(linkedlist->Length(), static_cast<int>(NODE_NUMBERS + 1)); in HWTEST_F_L0()
198 // Insert in position NODE_NUMBERS / 2(middle) with value 10 in HWTEST_F_L0()
199 result = LinkedListInsert(linkedlist, JSTaggedValue(NODE_NUMBERS / 2), JSTaggedValue(10)); in HWTEST_F_L0()
201 EXPECT_EQ(linkedlist->Length(), static_cast<int>(NODE_NUMBERS + 2)); in HWTEST_F_L0()
203 // Insert in position NODE_NUMBERS + 2(last) with value 10 in HWTEST_F_L0()
204 result = LinkedListInsert(linkedlist, JSTaggedValue(NODE_NUMBERS + 2), JSTaggedValue(10)); in HWTEST_F_L0()
206 EXPECT_EQ(linkedlist->Length(), static_cast<int>(NODE_NUMBERS + 3)); in HWTEST_F_L0()
213 } else if (i == NODE_NUMBERS / in HWTEST_F_L0()
228 constexpr uint32_t NODE_NUMBERS = 20; HWTEST_F_L0() local
253 constexpr uint32_t NODE_NUMBERS = 20; HWTEST_F_L0() local
275 constexpr uint32_t NODE_NUMBERS = 20; HWTEST_F_L0() local
312 constexpr uint32_t NODE_NUMBERS = 20; HWTEST_F_L0() local
349 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
378 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
415 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
455 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
501 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
[all...] |
| H A D | containers_hashmap_test.cpp | 147 constexpr uint32_t NODE_NUMBERS = 8; in HWTEST_F_L0() local
149 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
163 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
179 constexpr uint32_t NODE_NUMBERS = 8; in HWTEST_F_L0() local
181 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
195 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
228 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
243 EXPECT_EQ(JSAPIHashMap::Cast(result.GetTaggedObject())->GetSize(), NODE_NUMBERS + i + 1); in HWTEST_F_L0()
246 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
281 constexpr uint32_t NODE_NUMBERS in HWTEST_F_L0() local
428 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
518 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
613 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
705 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
816 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
956 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
[all...] |
| H A D | containers_treemap_test.cpp | 190 constexpr int NODE_NUMBERS = 8; in HWTEST_F_L0() local
192 for (int i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
212 for (int i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
227 EXPECT_EQ(JSAPITreeMap::Cast(result.GetTaggedObject())->GetSize(), NODE_NUMBERS + i + 1); in HWTEST_F_L0()
230 for (int i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
242 for (int i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
262 constexpr int NODE_NUMBERS = 64; in HWTEST_F_L0() local
265 for (int i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
290 EXPECT_EQ(tmap->GetSize(), NODE_NUMBERS - REMOVE_SIZE); in HWTEST_F_L0()
292 for (int i = 0; i < NODE_NUMBERS; in HWTEST_F_L0()
353 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
455 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
546 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
638 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
733 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
853 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
1013 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
1124 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
1264 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
1342 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
1376 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
[all...] |
| H A D | containers_list_test.cpp | 171 constexpr uint32_t NODE_NUMBERS = 8; in HWTEST_F_L0() local
173 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
200 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
215 constexpr uint32_t NODE_NUMBERS = 20; in HWTEST_F_L0() local
217 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
235 callInfo->SetCallArg(0, JSTaggedValue(NODE_NUMBERS / 2)); in HWTEST_F_L0()
241 EXPECT_EQ(list->Length(), static_cast<int>(NODE_NUMBERS - 1)); in HWTEST_F_L0()
254 EXPECT_EQ(list->Length(), static_cast<int>(NODE_NUMBERS - 2)); in HWTEST_F_L0()
260 constexpr uint32_t NODE_NUMBERS = 8; in HWTEST_F_L0() local
263 for (uint32_t i = 0; i < NODE_NUMBERS; in HWTEST_F_L0()
306 constexpr uint32_t NODE_NUMBERS = 10; HWTEST_F_L0() local
347 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
383 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
412 constexpr int NODE_NUMBERS = 8; HWTEST_F_L0() local
451 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
497 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
[all...] |
| H A D | containers_hashset_test.cpp | 126 constexpr uint32_t NODE_NUMBERS = 8; in HWTEST_F_L0() local
128 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
141 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
157 constexpr uint32_t NODE_NUMBERS = 8; in HWTEST_F_L0() local
159 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
174 callInfo->SetCallArg(0, JSTaggedValue(NODE_NUMBERS / 2)); in HWTEST_F_L0()
179 EXPECT_EQ(tSet->GetSize(), NODE_NUMBERS - 1); in HWTEST_F_L0()
181 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
189 if (i == (NODE_NUMBERS / 2)) { in HWTEST_F_L0()
200 for (uint32_t i = 0; i < NODE_NUMBERS; in HWTEST_F_L0()
232 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
318 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
415 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
[all...] |
| H A D | containers_deque_test.cpp | 144 constexpr uint32_t NODE_NUMBERS = 8; in HWTEST_F_L0() local
146 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
162 constexpr uint32_t NODE_NUMBERS = 8; in HWTEST_F_L0() local
164 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
180 constexpr uint32_t NODE_NUMBERS = 8; in HWTEST_F_L0() local
182 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
194 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
206 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
221 constexpr uint32_t NODE_NUMBERS = 8; in HWTEST_F_L0() local
223 for (uint32_t i = 0; i < NODE_NUMBERS; in HWTEST_F_L0()
238 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
255 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
286 constexpr uint32_t NODE_NUMBERS = 10; HWTEST_F_L0() local
[all...] |
| H A D | containers_plainarray_test.cpp | 175 constexpr uint32_t NODE_NUMBERS = 8; // 8 means the value in HWTEST_F_L0() local
178 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
192 EXPECT_EQ(tArray1->GetSize(), static_cast<int>(NODE_NUMBERS)); in HWTEST_F_L0()
194 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
206 EXPECT_EQ(tArray1->GetSize(), static_cast<int>(NODE_NUMBERS)); in HWTEST_F_L0()
213 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
230 EXPECT_EQ(tArray->GetSize(), static_cast<int>(NODE_NUMBERS)); in HWTEST_F_L0()
232 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
252 constexpr uint32_t NODE_NUMBERS = 8; in HWTEST_F_L0() local
254 for (uint32_t i = 0; i < NODE_NUMBERS; in HWTEST_F_L0()
320 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
415 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
464 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
[all...] |
| H A D | containers_arraylist_test.cpp | 191 constexpr uint32_t NODE_NUMBERS = 8; in HWTEST_F_L0() local
193 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
203 EXPECT_EQ(arrayList->GetSize(), static_cast<int>(NODE_NUMBERS - 2)); in HWTEST_F_L0()
204 for (uint32_t i = 0; i < NODE_NUMBERS - 2; i++) { in HWTEST_F_L0()
232 constexpr uint32_t NODE_NUMBERS = 8; in HWTEST_F_L0() local
234 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
268 constexpr uint32_t NODE_NUMBERS = 8; in HWTEST_F_L0() local
274 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
280 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
288 for (uint32_t i = 0; i < NODE_NUMBERS; in HWTEST_F_L0()
306 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
[all...] |
| H A D | containers_lightweightmap_test.cpp | 139 constexpr uint32_t NODE_NUMBERS = 8; in HWTEST_F_L0() local
141 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
161 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
177 EXPECT_EQ(length, NODE_NUMBERS + 1 + i); in HWTEST_F_L0()
180 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
192 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
211 constexpr uint32_t NODE_NUMBERS = 8; in HWTEST_F_L0() local
213 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
232 callInfo->SetCallArg(0, JSTaggedValue(NODE_NUMBERS / 2)); in HWTEST_F_L0()
237 EXPECT_EQ(rvalue, JSTaggedValue(NODE_NUMBERS / in HWTEST_F_L0()
272 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
305 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
341 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
391 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
514 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
564 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
[all...] |
| H A D | containers_stack_test.cpp | 144 constexpr uint32_t NODE_NUMBERS = 8; in HWTEST_F_L0() local
146 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
162 constexpr uint32_t NODE_NUMBERS = 8; in HWTEST_F_L0() local
164 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
176 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
191 constexpr uint32_t NODE_NUMBERS = 8; in HWTEST_F_L0() local
193 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
207 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
226 constexpr uint32_t NODE_NUMBERS = 8; in HWTEST_F_L0() local
228 for (uint32_t i = 0; i < NODE_NUMBERS; in HWTEST_F_L0()
244 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
275 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
[all...] |
| H A D | containers_bitvector_test.cpp | 89 constexpr uint32_t NODE_NUMBERS = 64; in Push() local
90 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in Push()
165 constexpr uint32_t NODE_NUMBERS = 8; in HWTEST_F_L0() local
167 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
189 constexpr uint32_t NODE_NUMBERS = 8; in HWTEST_F_L0() local
191 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
202 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
419 constexpr uint32_t NODE_NUMBERS = 64; in HWTEST_F_L0() local
420 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
492 constexpr uint32_t NODE_NUMBERS in HWTEST_F_L0() local
533 constexpr uint32_t NODE_NUMBERS = 64; HWTEST_F_L0() local
692 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
726 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
760 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
803 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
911 constexpr uint32_t NODE_NUMBERS = 64; HWTEST_F_L0() local
1039 constexpr uint32_t NODE_NUMBERS = 64; HWTEST_F_L0() local
1167 constexpr uint32_t NODE_NUMBERS = 64; HWTEST_F_L0() local
1302 constexpr uint32_t NODE_NUMBERS = 64; HWTEST_F_L0() local
1442 constexpr uint32_t NODE_NUMBERS = 64; HWTEST_F_L0() local
1473 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
[all...] |
| H A D | containers_lightweightset_test.cpp | 140 constexpr uint32_t NODE_NUMBERS = 8; // 8 means the value in HWTEST_F_L0() local
142 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
161 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
175 EXPECT_EQ(length, static_cast<int>(NODE_NUMBERS + 1 + i)); in HWTEST_F_L0()
181 constexpr uint32_t NODE_NUMBERS = 8; // 8 means the value in HWTEST_F_L0() local
183 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
200 for (uint32_t i = 0; i < NODE_NUMBERS; i++) { in HWTEST_F_L0()
226 EXPECT_EQ(length, static_cast<int>(NODE_NUMBERS * 2)); in HWTEST_F_L0()
234 constexpr uint32_t NODE_NUMBERS = 8; // 8 means the value in HWTEST_F_L0() local
236 for (uint32_t i = 0; i < NODE_NUMBERS; in HWTEST_F_L0()
330 constexpr uint32_t NODE_NUMBERS = 8; // 8 means the value HWTEST_F_L0() local
388 constexpr uint32_t NODE_NUMBERS = 8; // 8 means the value HWTEST_F_L0() local
489 constexpr uint32_t NODE_NUMBERS = 8; // 8 means the value HWTEST_F_L0() local
548 constexpr uint32_t NODE_NUMBERS = 8; HWTEST_F_L0() local
[all...] |
| /arkcompiler/ets_runtime/test/fuzztest/booleanrefvalue_fuzzer/ |
| H A D | booleanrefvalue_fuzzer.cpp | 31 constexpr size_t NODE_NUMBERS = 2; member
41 bool input = size % NODE_NUMBERS ? true : false; in BooleanRefValueFuzzerTest()
|