Added hash table tests.
1 // vim: set sts=8 ts=2 sw=2 tw=99 et:
3 // Copyright (C) 2013, David Anderson and AlliedModders LLC
4 // All rights reserved.
6 // Redistribution and use in source and binary forms, with or without
7 // modification, are permitted provided that the following conditions are met:
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.
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.
30 #include <am-inlinelist.h>
31 #include <am-utility.h>
36 class IntThing : public InlineListNode<IntThing>
54 class TestInlineList : public Test
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++)
74 InlineList<IntThing> list;
76 InlineList<IntThing>::iterator iter = list.begin();
77 if (!check(iter == list.end(), "list should be empty"))
87 for (int n = 1; n <= 5; n++) {
88 if (!check(iter->value() == n, "value %d should be %d", iter->value(), n))
92 if (!check(iter == list.end(), "iterator should have ended"))
97 if (!check(iter->value() == 2, "list should start at 2 after removal"))
100 list.remove(&thing5);
104 if (!check(iter->value() == 4, "list should end at 4 after removal"))
107 if (!check(iter == list.end(), "iterator should have ended"))
110 list.remove(&thing3);
112 if (!check(iter->value() == 2, "first value should be 2 after removal"))
115 if (!check(iter->value() == 4, "second value should be 4 after removal"))
118 if (!check(iter == list.end(), "iterator should have ended"))
125 bool Run() KE_OVERRIDE