tests/test-inlinelist.cpp
author David Anderson <dvander@alliedmods.net>
Thu Aug 29 23:51:20 2013 -0700 (2013-08-29)
changeset 15 245a69265bd5
parent 11 cfe800908837
child 17 563aea5eba06
permissions -rw-r--r--
Fix race bug.
     1 // vim: set sts=8 ts=2 sw=2 tw=99 et:
     2 //
     3 // Copyright (C) 2013, David Anderson and AlliedModders LLC
     4 // All rights reserved.
     5 // 
     6 // Redistribution and use in source and binary forms, with or without
     7 // modification, are permitted provided that the following conditions are met:
     8 // 
     9 //  * Redistributions of source code must retain the above copyright notice, this
    10 //    list of conditions and the following disclaimer.
    11 //  * Redistributions in binary form must reproduce the above copyright notice,
    12 //    this list of conditions and the following disclaimer in the documentation
    13 //    and/or other materials provided with the distribution.
    14 //  * Neither the name of AlliedModders LLC nor the names of its contributors
    15 //    may be used to endorse or promote products derived from this software
    16 //    without specific prior written permission.
    17 //
    18 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
    19 // AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
    20 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
    21 // ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
    22 // LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
    23 // CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
    24 // SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
    25 // INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
    26 // CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
    27 // ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
    28 // POSSIBILITY OF SUCH DAMAGE.
    29 
    30 #include <am-inlinelist.h>
    31 #include <am-utility.h>
    32 #include "runner.h"
    33 
    34 using namespace ke;
    35 
    36 class IntThing : public InlineListNode<IntThing>
    37 {
    38  public:
    39   IntThing(int value)
    40    : value_(value)
    41   {
    42   }
    43   ~IntThing()
    44   {
    45   }
    46   int value() const {
    47     return value_;
    48   }
    49 
    50  private:
    51   int value_;
    52 };
    53 
    54 class TestInlineList : public Test
    55 {
    56  public:
    57   TestInlineList()
    58    : Test("InlineList")
    59   {
    60   }
    61 
    62   bool testBasic()
    63   {
    64     IntThing thing1(1);
    65     IntThing thing2(2);
    66     IntThing thing3(3);
    67     IntThing thing4(4);
    68     IntThing thing5(5);
    69 
    70     // Do these test twice. InlineList does not take ownership of pointers,
    71     // so we should be guaranteed we can keep moving them in between lists.
    72     for (size_t i = 0; i <= 1; i++)
    73     {
    74       InlineList<IntThing> list;
    75 
    76       InlineList<IntThing>::iterator iter = list.begin();
    77       if (!check(iter == list.end(), "list should be empty"))
    78         return false;
    79       
    80       list.append(&thing1);
    81       list.append(&thing2);
    82       list.append(&thing3);
    83       list.append(&thing4);
    84       list.append(&thing5);
    85 
    86       iter = list.begin();
    87       for (int n = 1; n <= 5; n++) {
    88         if (!check(iter->value() == n, "value %d should be %d", iter->value(), n))
    89           return false;
    90         iter++;
    91       }
    92       if (!check(iter == list.end(), "iterator should have ended"))
    93         return false;
    94 
    95       list.remove(&thing1);
    96       iter = list.begin();
    97       if (!check(iter->value() == 2, "list should start at 2 after removal"))
    98         return false;
    99 
   100       list.remove(&thing5);
   101       iter = list.begin();
   102       iter++;
   103       iter++;
   104       if (!check(iter->value() == 4, "list should end at 4 after removal"))
   105         return false;
   106       iter++;
   107       if (!check(iter == list.end(), "iterator should have ended"))
   108         return false;
   109 
   110       list.remove(&thing3);
   111       iter = list.begin();
   112       if (!check(iter->value() == 2, "first value should be 2 after removal"))
   113         return false;
   114       iter++;
   115       if (!check(iter->value() == 4, "second value should be 4 after removal"))
   116         return false;
   117       iter++;
   118       if (!check(iter == list.end(), "iterator should have ended"))
   119         return false;
   120     }
   121 
   122     return true;
   123   }
   124 
   125   bool Run() KE_OVERRIDE
   126   {
   127     if (!testBasic())
   128       return false;
   129     return true;
   130   }
   131 } sTestInlineList;
   132