tests/dpl/core/test_foreach.cpp

   1 /*
   2  * Copyright (c) 2011 Samsung Electronics Co., Ltd All Rights Reserved
   3  *
   4  *    Licensed under the Apache License, Version 2.0 (the "License");
   5  *    you may not use this file except in compliance with the License.
   6  *    You may obtain a copy of the License at
   7  *
   8  *        http://www.apache.org/licenses/LICENSE-2.0
   9  *
  10  *    Unless required by applicable law or agreed to in writing, software
  11  *    distributed under the License is distributed on an "AS IS" BASIS,
  12  *    WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  13  *    See the License for the specific language governing permissions and
  14  *    limitations under the License.
  15  */
  16 /*
  17  * @file        test_foreach.cpp
  18  * @author      Bartosz Janiak (b.janiak@samsung.com)
  19  * @version     1.0
  20  * @brief       This file is the implementation file of foreach tests.
  21  */
  22
  23 #include <dpl/test/test_runner.h>
  24 #include <dpl/foreach.h>
  25 #include <vector>
  26 #include <set>
  27 #include <list>
  28
  29 RUNNER_TEST_GROUP_INIT(DPL)
  30
  31 static const size_t testContainerSize = 1024;
  32
  33 template<typename Container>
  34 void VerifyForeach(Container& container)
  35 {
  36     size_t i = 0;
  37     FOREACH(it, container)
  38     {
  39         RUNNER_ASSERT(*it == i);
  40         i++;
  41     }
  42     RUNNER_ASSERT(i == container.size());
  43 }
  44
  45 #define VERIFY_FOREACH(container)                               \
  46     {                                                           \
  47         size_t i = 0;                                           \
  48         FOREACH(it, container)                                  \
  49         {                                                       \
  50             RUNNER_ASSERT(*it == i);                            \
  51             i++;                                                \
  52         }                                                       \
  53     }
  54
  55 static size_t numberOfCallsToTemporaryList = 0;
  56 std::list<size_t> temporaryList();
  57 std::list<size_t> temporaryList()
  58 {
  59     ++numberOfCallsToTemporaryList;
  60     std::list<size_t> list;
  61     for (size_t i = 0 ; i < testContainerSize ; i++)
  62     {
  63         list.push_back(i);
  64     }
  65     return list;
  66 }
  67
  68 static size_t numberOfCallsToTemporaryVector = 0;
  69 std::vector<size_t> temporaryVector();
  70 std::vector<size_t> temporaryVector()
  71 {
  72     ++numberOfCallsToTemporaryVector;
  73     std::vector<size_t> vector;
  74     for (size_t i = 0 ; i < testContainerSize ; i++)
  75     {
  76         vector.push_back(i);
  77     }
  78     return vector;
  79 }
  80
  81 static size_t numberOfCallsToTemporarySet = 0;
  82 std::set<size_t> temporarySet();
  83 std::set<size_t> temporarySet()
  84 {
  85     ++numberOfCallsToTemporarySet;
  86     std::set<size_t> set;
  87     for (size_t i = 0 ; i < testContainerSize ; i++)
  88     {
  89         set.insert(i);
  90     }
  91     return set;
  92 }
  93
  94 RUNNER_TEST(Foreach_std_containers)
  95 {
  96     std::vector<size_t> vector;
  97     std::list<size_t> list;
  98     std::set<size_t> set;
  99
 100     for (size_t i = 0 ; i < testContainerSize ; i++)
 101     {
 102         vector.push_back(i);
 103         list.push_back(i);
 104         set.insert(i);
 105     }
 106
 107     VerifyForeach(vector);
 108     VerifyForeach(list);
 109     VerifyForeach(set);
 110
 111     VERIFY_FOREACH(temporaryList());
 112     VERIFY_FOREACH(temporaryVector());
 113     VERIFY_FOREACH(temporarySet());
 114
 115     RUNNER_ASSERT(numberOfCallsToTemporaryList == 1);
 116     RUNNER_ASSERT(numberOfCallsToTemporaryVector == 1);
 117     RUNNER_ASSERT(numberOfCallsToTemporarySet == 1);
 118 }