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: static size_t sCtors = 0; danderson@11: static size_t sCopyCtors = 0; danderson@11: static size_t sMovingCtors = 0; danderson@11: static size_t sMovedDtors = 0; danderson@11: static size_t sDtors = 0; danderson@11: danderson@11: namespace { danderson@11: danderson@11: class BasicThing danderson@11: { danderson@11: public: danderson@11: BasicThing() danderson@11: { danderson@11: sCtors++; danderson@11: } danderson@11: BasicThing(const BasicThing &other) danderson@11: { danderson@11: sCopyCtors++; danderson@11: } danderson@11: ~BasicThing() danderson@11: { danderson@11: sDtors++; danderson@11: } danderson@11: }; danderson@11: danderson@11: class MovingThing danderson@11: { danderson@11: public: danderson@11: MovingThing() danderson@11: : moved_(false) danderson@11: { danderson@11: sCtors++; danderson@11: } danderson@11: MovingThing(Moveable other) danderson@11: { danderson@11: assert(!other->moved_); danderson@11: sMovingCtors++; danderson@11: moved_ = false; danderson@11: other->moved_ = true; danderson@11: } danderson@11: ~MovingThing() danderson@11: { danderson@11: sDtors++; danderson@11: if (moved_) danderson@11: sMovedDtors++; danderson@11: } danderson@11: danderson@11: private: danderson@11: MovingThing(const MovingThing &other) KE_DELETE; danderson@11: bool moved_; danderson@11: }; danderson@11: danderson@11: } // anonymous namespace danderson@11: danderson@11: class TestLinkedList : public Test danderson@11: { danderson@11: public: danderson@11: TestLinkedList() danderson@11: : Test("LinkedList") danderson@11: { danderson@11: } danderson@11: danderson@11: bool testInts() danderson@11: { danderson@11: LinkedList list; danderson@11: danderson@11: if (!check(list.empty(), "list should be empty")) danderson@11: return false; danderson@11: if (!check(list.begin() == list.end(), "list iterator should be empty")) danderson@11: return false; danderson@11: danderson@11: list.append(5); danderson@11: list.append(7); danderson@11: list.append(9); danderson@11: if (!check(!list.empty(), "list should not be empty")) danderson@11: return false; danderson@11: if (!check(list.length() == 3, "list size should be 3")) danderson@11: return false; danderson@11: danderson@11: LinkedList::iterator iter = list.begin(); danderson@11: if (!check(iter != list.end(), "list iterator should not have ended")) danderson@11: return false; danderson@11: if (!check(*iter == 5, "item 1 should be 5")) danderson@11: return false; danderson@11: iter++; danderson@11: if (!check(iter != list.end(), "list iterator should not have ended")) danderson@11: return false; danderson@11: if (!check(*iter == 7, "item 2 should be 7")) danderson@11: return false; danderson@11: iter++; danderson@11: if (!check(iter != list.end(), "list iterator should not have ended")) danderson@11: return false; danderson@11: if (!check(*iter == 9, "item 3 should be 9")) danderson@11: return false; danderson@11: iter++; danderson@11: if (!check(iter == list.end(), "list iterator should have ended")) danderson@11: return false; danderson@11: danderson@11: iter = list.begin(); danderson@11: iter++; danderson@11: iter++; danderson@11: iter = list.erase(iter); danderson@11: if (!check(iter == list.end(), "erasure should have returned ended iterator")) danderson@11: return false; danderson@11: list.append(11); danderson@11: danderson@11: iter = list.begin(); danderson@11: iter = list.erase(iter); danderson@11: if (!check(iter != list.end(), "erasure should not have ended iterator")) danderson@11: return false; danderson@11: if (!check(*iter == 7, "erasure should have returned item 2")) danderson@11: return false; danderson@11: iter++; danderson@11: if (!check(*iter == 11, "second item should be 11")) danderson@11: return false; danderson@11: if (!check(list.length() == 2, "list should have two items")) danderson@11: return false; danderson@11: danderson@11: list.prepend(1); danderson@11: iter = list.begin(); danderson@11: if (!check(*iter == 1, "new item should have been prepended")) danderson@11: return false; danderson@11: iter++; danderson@11: if (!check(*iter == 7, "second item should be 7")) danderson@11: return false; danderson@11: if (!check(list.length() == 3, "list should have three items")) danderson@11: return false; danderson@11: danderson@11: list.clear(); danderson@11: if (!check(list.empty(), "cleared list should be empty")) danderson@11: return false; danderson@11: if (!check(list.begin() == list.end(), "cleared list iterator should be empty")) danderson@11: return false; danderson@11: danderson@11: list.append(1); danderson@11: list.append(2); danderson@11: list.append(3); danderson@11: list.append(4); danderson@11: list.append(5); danderson@11: list.append(5); danderson@11: iter = list.find(3); danderson@11: if (!check(iter != list.end(), "should have found a 3")) danderson@11: return false; danderson@11: if (!check(*iter == 3, "should have found 3")) danderson@11: return false; danderson@11: list.remove(3); danderson@11: iter = list.find(3); danderson@11: if (!check(iter == list.end(), "should not have found a 3")) danderson@11: return false; danderson@11: iter = list.find(5); danderson@11: if (!check(iter != list.end(), "should have found a 5")) danderson@11: return false; danderson@11: if (!check(*iter == 5, "should have found 5")) danderson@11: return false; danderson@11: list.remove(5); danderson@11: iter = list.find(5); danderson@11: if (!check(iter != list.end(), "should have found a second 5")) danderson@11: return false; danderson@11: if (!check(*iter == 5, "should have found a second 5")) danderson@11: return false; danderson@11: list.remove(5); danderson@11: list.remove(5); danderson@11: iter = list.find(5); danderson@11: if (!check(iter == list.end(), "should not have found a third 5")) danderson@11: return false; danderson@11: danderson@11: return true; danderson@11: } danderson@11: danderson@11: bool testDestructors() danderson@11: { danderson@11: { danderson@11: LinkedList list; danderson@11: list.append(BasicThing()); danderson@11: list.append(BasicThing()); danderson@11: list.append(BasicThing()); danderson@11: } danderson@11: if (!check(sCtors == 3, "should get 3 normal constructors")) danderson@11: return false; danderson@11: if (!check(sCopyCtors == 3, "should get 3 copy constructors")) danderson@11: return false; danderson@11: if (!check(sDtors == 6, "should get 6 destructors")) danderson@11: return false; danderson@11: danderson@11: sCtors = 0; danderson@11: sCopyCtors = 0; danderson@11: sDtors = 0; danderson@11: return true; danderson@11: } danderson@11: danderson@11: bool testMoving() danderson@11: { danderson@11: { danderson@11: LinkedList list; danderson@11: MovingThing a, b, c; danderson@11: list.append(Moveable(a)); danderson@11: list.append(Moveable(b)); danderson@11: list.append(Moveable(c)); danderson@11: } danderson@11: danderson@11: if (!check(sCtors == 3, "should get 3 normal constructors")) danderson@11: return false; danderson@11: if (!check(sMovingCtors == 3, "sould get 3 move constructors")) danderson@11: return false; danderson@11: if (!check(sMovedDtors == 3, "sould get 3 moved destructors")) danderson@11: return false; danderson@11: if (!check(sDtors == 6, "should get 6 destructors")) danderson@11: return false; danderson@11: danderson@11: sCtors = 0; danderson@11: sMovingCtors = 0; danderson@11: sMovedDtors = 0; danderson@11: sDtors = 0; danderson@11: return true; danderson@11: } danderson@11: danderson@11: bool testFallibleMalloc() danderson@11: { danderson@11: LinkedList list; danderson@11: list.append(5); danderson@11: list.append(6); danderson@11: list.setOutOfMemory(true); danderson@11: if (!check(!list.append(7), "list handled out-of-memory")) danderson@11: return false; danderson@11: list.setOutOfMemory(false); danderson@11: if (!check(list.append(8), "list recovered out-of-memory")) danderson@11: return false; danderson@11: if (!check(list.ooms() == 1, "list received 1 oom")) danderson@11: return false; danderson@11: return true; danderson@11: } danderson@11: danderson@11: bool Run() KE_OVERRIDE danderson@11: { danderson@11: if (!testInts()) danderson@11: return false; danderson@11: if (!testDestructors()) danderson@11: return false; danderson@11: if (!testMoving()) danderson@11: return false; danderson@11: if (!testFallibleMalloc()) danderson@11: return false; danderson@11: return true; danderson@11: } danderson@11: } sTestLinkedList; danderson@11: