1 /*
2 * Copyright (c) 2022 Huawei Device Co., Ltd.
3 * Licensed under the Apache License, Version 2.0 (the "License");
4 * you may not use this file except in compliance with the License.
5 * You may obtain a copy of the License at
6 *
7 * http://www.apache.org/licenses/LICENSE-2.0
8 *
9 * Unless required by applicable law or agreed to in writing, software
10 * distributed under the License is distributed on an "AS IS" BASIS,
11 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12 * See the License for the specific language governing permissions and
13 * limitations under the License.
14 */
15
16 #include "ecmascript/containers/containers_private.h"
17 #include "ecmascript/ecma_string.h"
18 #include "ecmascript/ecma_vm.h"
19 #include "ecmascript/global_env.h"
20 #include "ecmascript/js_api/js_api_tree_map.h"
21 #include "ecmascript/js_api/js_api_tree_map_iterator.h"
22 #include "ecmascript/js_function.h"
23 #include "ecmascript/js_handle.h"
24 #include "ecmascript/js_iterator.h"
25 #include "ecmascript/js_object-inl.h"
26 #include "ecmascript/js_tagged_value.h"
27 #include "ecmascript/object_factory.h"
28 #include "ecmascript/tagged_tree.h"
29 #include "ecmascript/tests/ecma_test_common.h"
30
31 using namespace panda;
32
33 using namespace panda::ecmascript;
34
35 namespace panda::test {
36 class JSAPITreeMapTest : public BaseTestWithScope<false> {
37 protected:
CreateTreeMap()38 JSAPITreeMap *CreateTreeMap()
39 {
40 return *EcmaContainerCommon::CreateTreeMap(thread);
41 }
42 };
43
HWTEST_F_L0(JSAPITreeMapTest,TreeMapCreate)44 HWTEST_F_L0(JSAPITreeMapTest, TreeMapCreate)
45 {
46 JSAPITreeMap *map = CreateTreeMap();
47 EXPECT_TRUE(map != nullptr);
48 }
49
HWTEST_F_L0(JSAPITreeMapTest,TreeMapSetAndGet)50 HWTEST_F_L0(JSAPITreeMapTest, TreeMapSetAndGet)
51 {
52 constexpr int NODE_NUMBERS = 8;
53 ObjectFactory *factory = thread->GetEcmaVM()->GetFactory();
54 JSMutableHandle<JSTaggedValue> key(thread, JSTaggedValue::Undefined());
55 JSMutableHandle<JSTaggedValue> value(thread, JSTaggedValue::Undefined());
56
57 // test JSAPITreeMap
58 JSHandle<JSAPITreeMap> tmap(thread, CreateTreeMap());
59 std::string myKey("mykey");
60 std::string myValue("myvalue");
61 for (int i = 0; i < NODE_NUMBERS; i++) {
62 std::string ikey = myKey + std::to_string(i);
63 std::string ivalue = myValue + std::to_string(i);
64 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
65 value.Update(factory->NewFromStdString(ivalue).GetTaggedValue());
66 JSAPITreeMap::Set(thread, tmap, key, value);
67 }
68 EXPECT_EQ(tmap->GetSize(), NODE_NUMBERS);
69
70 // test Set exception
71 key.Update(JSTaggedValue::Hole());
72 JSAPITreeMap::Set(thread, tmap, key, value);
73 EXPECT_EXCEPTION();
74
75 for (int i = 0; i < NODE_NUMBERS; i++) {
76 std::string ikey = myKey + std::to_string(i);
77 std::string ivalue = myValue + std::to_string(i);
78 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
79 value.Update(factory->NewFromStdString(ivalue).GetTaggedValue());
80
81 // test get
82 JSTaggedValue gvalue = JSAPITreeMap::Get(thread, tmap, key);
83 EXPECT_EQ(gvalue, value.GetTaggedValue());
84 }
85 }
86
HWTEST_F_L0(JSAPITreeMapTest,TreeMapDeleteAndHas)87 HWTEST_F_L0(JSAPITreeMapTest, TreeMapDeleteAndHas)
88 {
89 constexpr int NODE_NUMBERS = 64;
90 constexpr int REMOVE_SIZE = 48;
91 ObjectFactory *factory = thread->GetEcmaVM()->GetFactory();
92 JSMutableHandle<JSTaggedValue> key(thread, JSTaggedValue::Undefined());
93 JSMutableHandle<JSTaggedValue> value(thread, JSTaggedValue::Undefined());
94
95 // test JSAPITreeMap
96 JSHandle<JSAPITreeMap> tmap(thread, CreateTreeMap());
97 std::string myKey("mykey");
98 std::string myValue("myvalue");
99 for (int i = 0; i < NODE_NUMBERS; i++) {
100 std::string ikey = myKey + std::to_string(i);
101 std::string ivalue = myValue + std::to_string(i);
102 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
103 value.Update(factory->NewFromStdString(ivalue).GetTaggedValue());
104 JSAPITreeMap::Set(thread, tmap, key, value);
105 }
106 EXPECT_EQ(tmap->GetSize(), NODE_NUMBERS);
107
108 for (int i = 0; i < REMOVE_SIZE; i++) {
109 std::string ikey = myKey + std::to_string(i);
110 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
111 [[maybe_unused]] JSTaggedValue dvalue = JSAPITreeMap::Delete(thread, tmap, key);
112 }
113 EXPECT_EQ(tmap->GetSize(), NODE_NUMBERS - REMOVE_SIZE);
114
115 for (int i = 0; i < REMOVE_SIZE; i++) {
116 std::string ikey = myKey + std::to_string(i);
117 std::string ivalue = myValue + std::to_string(i);
118 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
119 value.Update(factory->NewFromStdString(ivalue).GetTaggedValue());
120
121 // test has
122 bool hasKey = JSAPITreeMap::HasKey(thread, tmap, key);
123 EXPECT_EQ(hasKey, false);
124 bool hasValue = tmap->HasValue(thread, value);
125 EXPECT_EQ(hasValue, false);
126 }
127
128 for (int i = REMOVE_SIZE; i < NODE_NUMBERS; i++) {
129 std::string ikey = myKey + std::to_string(i);
130 std::string ivalue = myValue + std::to_string(i);
131 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
132 value.Update(factory->NewFromStdString(ivalue).GetTaggedValue());
133
134 // test has
135 bool hasKey = JSAPITreeMap::HasKey(thread, tmap, key);
136 EXPECT_EQ(hasKey, true);
137 bool hasValue = tmap->HasValue(thread, value);
138 EXPECT_EQ(hasValue, true);
139 }
140 }
141
HWTEST_F_L0(JSAPITreeMapTest,TreeMapReplaceAndClear)142 HWTEST_F_L0(JSAPITreeMapTest, TreeMapReplaceAndClear)
143 {
144 constexpr int NODE_NUMBERS = 8;
145 ObjectFactory *factory = thread->GetEcmaVM()->GetFactory();
146 JSMutableHandle<JSTaggedValue> key(thread, JSTaggedValue::Undefined());
147 JSMutableHandle<JSTaggedValue> value(thread, JSTaggedValue::Undefined());
148
149 // test TaggedTreeMap
150 JSHandle<JSAPITreeMap> tmap(thread, CreateTreeMap());
151 std::string myKey("mykey");
152 std::string myValue("myvalue");
153 for (int i = 0; i < NODE_NUMBERS; i++) {
154 std::string ikey = myKey + std::to_string(i);
155 std::string ivalue = myValue + std::to_string(i);
156 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
157 value.Update(factory->NewFromStdString(ivalue).GetTaggedValue());
158 JSAPITreeMap::Set(thread, tmap, key, value);
159 }
160 EXPECT_EQ(tmap->GetSize(), NODE_NUMBERS);
161
162 for (int i = 0; i < NODE_NUMBERS / 2; i++) {
163 std::string ikey = myKey + std::to_string(i);
164 std::string ivalue = myValue + std::to_string(i + 1);
165 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
166 value.Update(factory->NewFromStdString(ivalue).GetTaggedValue());
167
168 // test replace
169 bool success = JSAPITreeMap::Replace(thread, tmap, key, value);
170 EXPECT_EQ(success, true);
171 }
172
173 {
174 std::string ikey = myKey + std::to_string(NODE_NUMBERS);
175 std::string ivalue = myValue + std::to_string(NODE_NUMBERS + 1);
176 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
177 value.Update(factory->NewFromStdString(ivalue).GetTaggedValue());
178 bool success = JSAPITreeMap::Replace(thread, tmap, key, value);
179 EXPECT_FALSE(success);
180 }
181
182 for (int i = 0; i < NODE_NUMBERS / 2; i++) {
183 std::string ikey = myKey + std::to_string(i);
184 std::string ivalue = myValue + std::to_string(i + 1);
185 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
186 value.Update(factory->NewFromStdString(ivalue).GetTaggedValue());
187
188 // test get
189 JSTaggedValue gvalue = JSAPITreeMap::Get(thread, tmap, key);
190 EXPECT_EQ(gvalue, value.GetTaggedValue());
191 }
192
193 for (int i = NODE_NUMBERS / 2; i < NODE_NUMBERS; i++) {
194 std::string ikey = myKey + std::to_string(i);
195 std::string ivalue = myValue + std::to_string(i);
196 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
197 value.Update(factory->NewFromStdString(ivalue).GetTaggedValue());
198
199 // test get
200 JSTaggedValue gvalue = JSAPITreeMap::Get(thread, tmap, key);
201 EXPECT_EQ(gvalue, value.GetTaggedValue());
202 }
203
204 for (int i = 0; i < NODE_NUMBERS / 2; i++) {
205 std::string ikey = myKey + std::to_string(i);
206 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
207 [[maybe_unused]] JSTaggedValue dvalue = JSAPITreeMap::Delete(thread, tmap, key);
208 }
209
210 JSAPITreeMap::Clear(thread, tmap);
211 EXPECT_EQ(tmap->GetSize(), 0);
212 for (int i = 0; i < NODE_NUMBERS; i++) {
213 std::string ikey = myKey + std::to_string(i);
214 std::string ivalue = myValue + std::to_string(i);
215 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
216 value.Update(factory->NewFromStdString(ivalue).GetTaggedValue());
217
218 // test get
219 JSTaggedValue gvalue = JSAPITreeMap::Get(thread, tmap, key);
220 EXPECT_EQ(gvalue, JSTaggedValue::Undefined());
221
222 // test has
223 bool hasKey = JSAPITreeMap::HasKey(thread, tmap, key);
224 EXPECT_EQ(hasKey, false);
225 bool hasValue = tmap->HasValue(thread, value);
226 EXPECT_EQ(hasValue, false);
227 }
228 }
229
HWTEST_F_L0(JSAPITreeMapTest,JSAPITreeMapIterator)230 HWTEST_F_L0(JSAPITreeMapTest, JSAPITreeMapIterator)
231 {
232 constexpr int NODE_NUMBERS = 8;
233 ObjectFactory *factory = thread->GetEcmaVM()->GetFactory();
234 JSHandle<JSAPITreeMap> tmap(thread, CreateTreeMap());
235
236 JSMutableHandle<JSTaggedValue> key(thread, JSTaggedValue::Undefined());
237 JSMutableHandle<JSTaggedValue> value(thread, JSTaggedValue::Undefined());
238 for (int i = 0; i < NODE_NUMBERS; i++) {
239 key.Update(JSTaggedValue(i));
240 value.Update(JSTaggedValue(i + 1));
241 JSAPITreeMap::Set(thread, tmap, key, value);
242 }
243
244 // test key or value
245 JSHandle<JSTaggedValue> keyIter(factory->NewJSAPITreeMapIterator(tmap, IterationKind::KEY));
246 JSHandle<JSTaggedValue> valueIter(factory->NewJSAPITreeMapIterator(tmap, IterationKind::VALUE));
247 JSMutableHandle<JSTaggedValue> keyIterResult(thread, JSTaggedValue::Undefined());
248 JSMutableHandle<JSTaggedValue> valueIterResult(thread, JSTaggedValue::Undefined());
249 for (int i = 0; i < NODE_NUMBERS / 2; i++) {
250 keyIterResult.Update(JSIterator::IteratorStep(thread, keyIter).GetTaggedValue());
251 valueIterResult.Update(JSIterator::IteratorStep(thread, valueIter).GetTaggedValue());
252 EXPECT_EQ(i, JSIterator::IteratorValue(thread, keyIterResult)->GetInt());
253 EXPECT_EQ(i + 1, JSIterator::IteratorValue(thread, valueIterResult)->GetInt());
254 }
255
256 // test key and value
257 JSHandle<JSTaggedValue> indexKey(thread, JSTaggedValue(0));
258 JSHandle<JSTaggedValue> elementKey(thread, JSTaggedValue(1));
259 JSHandle<JSTaggedValue> iter(factory->NewJSAPITreeMapIterator(tmap, IterationKind::KEY_AND_VALUE));
260 JSMutableHandle<JSTaggedValue> iterResult(thread, JSTaggedValue::Undefined());
261 JSMutableHandle<JSTaggedValue> result(thread, JSTaggedValue::Undefined());
262 for (int i = 0; i < NODE_NUMBERS; i++) {
263 iterResult.Update(JSIterator::IteratorStep(thread, iter).GetTaggedValue());
264 result.Update(JSIterator::IteratorValue(thread, iterResult).GetTaggedValue());
265 EXPECT_EQ(i, JSObject::GetProperty(thread, result, indexKey).GetValue()->GetInt());
266 EXPECT_EQ(i + 1, JSObject::GetProperty(thread, result, elementKey).GetValue()->GetInt());
267 }
268
269 // test delete
270 key.Update(JSTaggedValue(NODE_NUMBERS / 2));
271 JSTaggedValue dvalue = JSAPITreeMap::Delete(thread, tmap, key);
272 EXPECT_EQ(dvalue, JSTaggedValue(NODE_NUMBERS / 2 + 1));
273 for (int i = NODE_NUMBERS / 2 + 1; i < NODE_NUMBERS; i++) {
274 keyIterResult.Update(JSIterator::IteratorStep(thread, keyIter).GetTaggedValue());
275 valueIterResult.Update(JSIterator::IteratorStep(thread, valueIter).GetTaggedValue());
276 EXPECT_EQ(i, JSIterator::IteratorValue(thread, keyIterResult)->GetInt());
277 EXPECT_EQ(i + 1, JSIterator::IteratorValue(thread, valueIterResult)->GetInt());
278 }
279
280 // test set
281 key.Update(JSTaggedValue(NODE_NUMBERS));
282 JSAPITreeMap::Set(thread, tmap, key, key);
283 keyIterResult.Update(JSIterator::IteratorStep(thread, keyIter).GetTaggedValue());
284 EXPECT_EQ(NODE_NUMBERS, JSIterator::IteratorValue(thread, keyIterResult)->GetInt());
285
286 // test end
287 keyIterResult.Update(JSIterator::IteratorStep(thread, keyIter).GetTaggedValue());
288 EXPECT_EQ(JSTaggedValue::False(), keyIterResult.GetTaggedValue());
289 }
290
HWTEST_F_L0(JSAPITreeMapTest,TreeMapGetKeyAndGetValue)291 HWTEST_F_L0(JSAPITreeMapTest, TreeMapGetKeyAndGetValue)
292 {
293 constexpr int NODE_NUMBERS = 8;
294 JSMutableHandle<JSTaggedValue> key(thread, JSTaggedValue::Undefined());
295 JSMutableHandle<JSTaggedValue> value(thread, JSTaggedValue::Undefined());
296
297 // init treemap
298 JSHandle<JSAPITreeMap> tmap(thread, CreateTreeMap());
299 for (int i = 0; i < NODE_NUMBERS; i++) {
300 key.Update(JSTaggedValue(i));
301 if (i == NODE_NUMBERS / 2) {
302 value.Update(JSTaggedValue::Hole());
303 } else {
304 value.Update(JSTaggedValue(i));
305 }
306 JSAPITreeMap::Set(thread, tmap, key, value);
307 }
308 EXPECT_EQ(tmap->GetSize(), NODE_NUMBERS);
309
310 // test GetKey and GetValue
311 for (int i = 0; i < NODE_NUMBERS; i++) {
312 EXPECT_EQ(tmap->GetKey(i), JSTaggedValue(i));
313 if (i == NODE_NUMBERS / 2) {
314 EXPECT_EQ(tmap->GetValue(i), JSTaggedValue::Undefined());
315 } else {
316 EXPECT_EQ(tmap->GetValue(i), JSTaggedValue(i));
317 }
318 }
319 EXPECT_EQ(tmap->GetKey(-1), JSTaggedValue::Undefined());
320 }
321 } // namespace panda::test
322