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 TestVector : public Test danderson@11: { danderson@11: public: danderson@11: TestVector() danderson@11: : Test("Vector") danderson@11: { danderson@11: } danderson@11: danderson@11: bool testInts() danderson@11: { danderson@11: Vector vector; danderson@11: danderson@11: if (!check(vector.empty(), "vector should be empty")) danderson@11: return false; danderson@11: if (!check(vector.length() == 0, "vector length should be 0")) danderson@11: return false; danderson@11: danderson@11: vector.append(1); danderson@11: vector.append(2); danderson@11: vector.append(3); danderson@11: vector.append(4); danderson@11: vector.append(5); danderson@11: for (int i = 0; i < 5; i++) { danderson@11: if (!check(vector[i] == i + 1, "vector[%d] is %d", i, i)) danderson@11: return false; danderson@11: } danderson@11: if (!check(vector.length() == 5, "vector length is 5")) danderson@11: return false; danderson@11: if (!check(!vector.empty(), "vector is not empty")) danderson@11: return false; danderson@11: danderson@11: if (!check(vector.popCopy() == 5, "popped 5")) danderson@11: return false; danderson@11: if (!check(vector.popCopy() == 4, "popped 4")) danderson@11: return false; danderson@11: if (!check(vector.length() == 3, "vector length is 3")) danderson@11: return false; danderson@11: danderson@11: while (!vector.empty()) danderson@11: vector.pop(); danderson@11: danderson@11: if (!check(vector.empty(), "vector should be empty")) danderson@11: return false; danderson@11: if (!check(vector.ensure(128), "vector size ensured")) danderson@11: return false; danderson@11: if (!check(vector.empty(), "vector should be empty")) danderson@11: return false; danderson@11: danderson@11: for (int i = 0; i < 128; i++) danderson@11: vector.append(i); danderson@11: if (!check(vector.length() == 128, "vector length should be 128")) danderson@11: return false; danderson@11: danderson@11: vector.clear(); danderson@11: if (!check(vector.empty(), "vector should be empty")) danderson@11: return false; danderson@11: danderson@11: return true; danderson@11: } danderson@11: danderson@11: bool testDestructors() danderson@11: { danderson@11: { danderson@11: Vector vector; danderson@11: vector.append(BasicThing()); danderson@11: vector.append(BasicThing()); danderson@11: vector.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: Vector vector; danderson@11: MovingThing a, b, c; danderson@11: vector.append(Moveable(a)); danderson@11: vector.append(Moveable(b)); danderson@11: vector.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: danderson@11: Vector v1; danderson@11: v1.append(10); danderson@11: Vector v2(Move(v1)); danderson@11: if (!check(v2.length() == 1, "should have moved vector")) danderson@11: return false; danderson@11: if (!check(v1.length() == 0, "should have gutted vector")) danderson@11: return false; danderson@11: danderson@11: return true; danderson@11: } danderson@11: danderson@11: bool testFallibleMalloc() danderson@11: { danderson@11: Vector vector; danderson@11: vector.setOutOfMemory(true); danderson@11: if (!check(!vector.append(7), "vector handled out-of-memory")) danderson@11: return false; danderson@11: vector.setOutOfMemory(false); danderson@11: if (!check(vector.append(8), "vector recovered out-of-memory")) danderson@11: return false; danderson@11: if (!check(vector.ooms() == 1, "vector 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: } sTestVector; danderson@11: