[dali_2.3.26] Merge branch 'devel/master'

[platform/core/uifw/dali-core.git] / automated-tests / src / dali-internal / utc-Dali-Internal-OrderedSet.cpp

diff --git a/automated-tests/src/dali-internal/utc-Dali-Internal-OrderedSet.cpp b/automated-tests/src/dali-internal/utc-Dali-Internal-OrderedSet.cpp
index 01c24ed..6f98cb9 100644 (file)
--- a/automated-tests/src/dali-internal/utc-Dali-Internal-OrderedSet.cpp
+++ b/automated-tests/src/dali-internal/utc-Dali-Internal-OrderedSet.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023 Samsung Electronics Co., Ltd.
+ * Copyright (c) 2024 Samsung Electronics Co., Ltd.
  *
  * Licensed under the Apache License, Version 2.0 (the "License");
  * you may not use this file except in compliance with the License.
@@ -20,16 +20,17 @@
 
 // INTERNAL INCLUDES
 #include <dali-test-suite-utils.h>
-#include <dali/internal/common/ordered-set.h>
+#include <dali/integration-api/ordered-set.h>
 
-using namespace Dali::Internal;
+using namespace Dali;
+using namespace Dali::Integration;
 
-void utc_dali_internal_owner_set_startup(void)
+void utc_dali_internal_ordered_set_startup(void)
 {
   test_return_value = TET_UNDEF;
 }
 
-void utc_dali_internal_owner_set_cleanup(void)
+void utc_dali_internal_ordered_set_cleanup(void)
 {
   test_return_value = TET_PASS;
 }
@@ -471,4 +472,88 @@ int UtcDaliOrderedSetFalseIteratorOrderCheck(void)
   DALI_TEST_EQUALS(ClassWithId::gRefCount, 0, TEST_LOCATION);
 
   END_TEST;
+}
+
+int UtcDaliOrderedSetReorderCacheMap(void)
+{
+  // Ensure that order of iterator is equal with Order of Insertion.
+  // And also check the order is valid even if change the order by user, after we call ReorderCacheMap.
+
+  // Reset refcount of class
+  ClassWithId::gRefCount = 0;
+
+  // To avoid lucky pass, run this test multiple time.
+  int tryCnt = 3;
+  while(tryCnt--)
+  {
+    int baseId = tryCnt; // random id
+    int id     = baseId;
+    int n      = 10 + 5 * (tryCnt + 1); // random count
+
+    OrderedSet<ClassWithId> set;
+
+    for(int i = 0; i < n; ++i)
+    {
+      ClassWithId* object = new ClassWithId(id++);
+      set.PushBack(object);
+    }
+
+    int expectId;
+    // Check by for iteration
+    expectId = baseId;
+    for(auto iter = set.Begin(), iterEnd = set.End(); iter != iterEnd; ++iter)
+    {
+      DALI_TEST_EQUALS(expectId++, (*iter)->mId, TEST_LOCATION);
+    }
+    DALI_TEST_EQUALS(expectId, id, TEST_LOCATION);
+
+    // Shuffle it randomly.
+    std::vector<std::pair<int, ClassWithId*>> shuffleList;
+    shuffleList.reserve(n);
+    for(auto iter = set.Begin(), iterEnd = set.End(); iter != iterEnd; ++iter)
+    {
+      shuffleList.emplace_back((*iter)->mId, (*iter));
+    }
+    std::random_shuffle(shuffleList.begin(), shuffleList.end());
+
+    // Change the value of container as shuffled order. After then, call ReorderCacheMap().
+    int shuffleIndex = 0;
+    for(auto iter = set.Begin(), iterEnd = set.End(); iter != iterEnd; ++iter)
+    {
+      (*iter) = shuffleList[shuffleIndex++].second;
+    }
+    set.ReorderCacheMap();
+
+    // Check by iterator. And randomly erase item
+    shuffleIndex = 0;
+    for(auto iter = set.Begin(), iterEnd = set.End(); iter != iterEnd; ++iter)
+    {
+      DALI_TEST_EQUALS(shuffleList[shuffleIndex++].first, (*iter)->mId, TEST_LOCATION);
+    }
+
+    // Randomly erase item, and check again until all items removed.
+    while(!set.IsEmpty())
+    {
+      int removeIndex = rand()%set.Count();
+      auto iter = set.Find(shuffleList[removeIndex].second);
+      DALI_TEST_CHECK(iter != set.End());
+      set.Erase(iter);
+      for(int i = removeIndex + 1; i < n; ++i)
+      {
+        shuffleList[i - 1] = shuffleList[i];
+      }
+      --n;
+
+      shuffleIndex = 0;
+      for(auto iter = set.Begin(), iterEnd = set.End(); iter != iterEnd; ++iter)
+      {
+        DALI_TEST_EQUALS(shuffleList[shuffleIndex++].first, (*iter)->mId, TEST_LOCATION);
+      }
+    }
+  }
+
+  // Check whether leak exist.
+  DALI_TEST_EQUALS(ClassWithId::gRefCount, 0, TEST_LOCATION);
+
+  END_TEST;
 }
\ No newline at end of file