danderson@11: // vim: set sts=8 ts=2 sw=2 tw=99 et: danderson@11: // danderson@11: // Copyright (C) 2013, David Anderson and AlliedModders LLC danderson@11: // All rights reserved. danderson@11: // danderson@11: // Redistribution and use in source and binary forms, with or without danderson@11: // modification, are permitted provided that the following conditions are met: danderson@11: // danderson@11: // * Redistributions of source code must retain the above copyright notice, this danderson@11: // list of conditions and the following disclaimer. danderson@11: // * Redistributions in binary form must reproduce the above copyright notice, danderson@11: // this list of conditions and the following disclaimer in the documentation danderson@11: // and/or other materials provided with the distribution. danderson@11: // * Neither the name of AlliedModders LLC nor the names of its contributors danderson@11: // may be used to endorse or promote products derived from this software danderson@11: // without specific prior written permission. danderson@11: // danderson@11: // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" danderson@11: // AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE danderson@11: // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE danderson@11: // ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE danderson@11: // LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR danderson@11: // CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF danderson@11: // SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS danderson@11: // INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN danderson@11: // CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) danderson@11: // ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE danderson@11: // POSSIBILITY OF SUCH DAMAGE. danderson@11: danderson@11: #include danderson@11: #include danderson@11: #include "runner.h" danderson@11: danderson@11: using namespace ke; danderson@11: danderson@11: class IntThing : public InlineListNode danderson@11: { danderson@11: public: danderson@11: IntThing(int value) danderson@11: : value_(value) danderson@11: { danderson@11: } danderson@11: ~IntThing() danderson@11: { danderson@11: } danderson@11: int value() const { danderson@11: return value_; danderson@11: } danderson@11: danderson@11: private: danderson@11: int value_; danderson@11: }; danderson@11: danderson@11: class TestInlineList : public Test danderson@11: { danderson@11: public: danderson@11: TestInlineList() danderson@11: : Test("InlineList") danderson@11: { danderson@11: } danderson@11: danderson@11: bool testBasic() danderson@11: { danderson@11: IntThing thing1(1); danderson@11: IntThing thing2(2); danderson@11: IntThing thing3(3); danderson@11: IntThing thing4(4); danderson@11: IntThing thing5(5); danderson@11: danderson@11: // Do these test twice. InlineList does not take ownership of pointers, danderson@11: // so we should be guaranteed we can keep moving them in between lists. danderson@11: for (size_t i = 0; i <= 1; i++) danderson@11: { danderson@11: InlineList list; danderson@11: danderson@11: InlineList::iterator iter = list.begin(); danderson@11: if (!check(iter == list.end(), "list should be empty")) danderson@11: return false; danderson@11: danderson@11: list.append(&thing1); danderson@11: list.append(&thing2); danderson@11: list.append(&thing3); danderson@11: list.append(&thing4); danderson@11: list.append(&thing5); danderson@11: danderson@11: iter = list.begin(); danderson@11: for (int n = 1; n <= 5; n++) { danderson@11: if (!check(iter->value() == n, "value %d should be %d", iter->value(), n)) danderson@11: return false; danderson@11: iter++; danderson@11: } danderson@11: if (!check(iter == list.end(), "iterator should have ended")) danderson@11: return false; danderson@11: danderson@11: list.remove(&thing1); danderson@11: iter = list.begin(); danderson@11: if (!check(iter->value() == 2, "list should start at 2 after removal")) danderson@11: return false; danderson@11: danderson@11: list.remove(&thing5); danderson@11: iter = list.begin(); danderson@11: iter++; danderson@11: iter++; danderson@11: if (!check(iter->value() == 4, "list should end at 4 after removal")) danderson@11: return false; danderson@11: iter++; danderson@11: if (!check(iter == list.end(), "iterator should have ended")) danderson@11: return false; danderson@11: danderson@11: list.remove(&thing3); danderson@11: iter = list.begin(); danderson@11: if (!check(iter->value() == 2, "first value should be 2 after removal")) danderson@11: return false; danderson@11: iter++; danderson@11: if (!check(iter->value() == 4, "second value should be 4 after removal")) danderson@11: return false; danderson@11: iter++; danderson@11: if (!check(iter == list.end(), "iterator should have ended")) danderson@11: return false; danderson@11: } danderson@11: danderson@11: return true; danderson@11: } danderson@11: danderson@11: bool Run() KE_OVERRIDE danderson@11: { danderson@11: if (!testBasic()) danderson@11: return false; danderson@11: return true; danderson@11: } danderson@11: } sTestInlineList; danderson@11: