danderson@13: // vim: set sts=8 ts=2 sw=2 tw=99 et: danderson@13: // danderson@13: // Copyright (C) 2013, David Anderson and AlliedModders LLC danderson@13: // All rights reserved. danderson@13: // danderson@13: // Redistribution and use in source and binary forms, with or without danderson@13: // modification, are permitted provided that the following conditions are met: danderson@13: // danderson@13: // * Redistributions of source code must retain the above copyright notice, this danderson@13: // list of conditions and the following disclaimer. danderson@13: // * Redistributions in binary form must reproduce the above copyright notice, danderson@13: // this list of conditions and the following disclaimer in the documentation danderson@13: // and/or other materials provided with the distribution. danderson@13: // * Neither the name of AlliedModders LLC nor the names of its contributors danderson@13: // may be used to endorse or promote products derived from this software danderson@13: // without specific prior written permission. danderson@13: // danderson@13: // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" danderson@13: // AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE danderson@13: // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE danderson@13: // ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE danderson@13: // LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR danderson@13: // CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF danderson@13: // SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS danderson@13: // INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN danderson@13: // CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) danderson@13: // ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE danderson@13: // POSSIBILITY OF SUCH DAMAGE. danderson@13: danderson@13: #include danderson@13: #include danderson@13: #include danderson@13: #include "runner.h" danderson@13: danderson@13: using namespace ke; danderson@13: danderson@13: struct StringPolicy danderson@13: { danderson@13: static inline uint32_t hash(const char *key) { danderson@13: return FastHashCharSequence(key, strlen(key)); danderson@13: } danderson@13: static inline bool matches(const char *find, const AString &key) { danderson@13: return key.compare(find) == 0; danderson@13: } danderson@13: }; danderson@13: danderson@13: class TestHashMap : public Test danderson@13: { danderson@13: public: danderson@13: TestHashMap() danderson@13: : Test("HashMap") danderson@13: { danderson@13: } danderson@13: danderson@13: bool testBasics() { danderson@13: typedef HashMap Map; danderson@13: Map map; danderson@13: danderson@13: if (!check(map.init(), "initialized")) danderson@13: return false; danderson@13: danderson@13: Map::Result r = map.find("cat"); danderson@13: if (!check(!r.found(), "cat not found")) danderson@13: return false; danderson@13: danderson@13: Map::Insert i = map.findForAdd("cat"); danderson@13: if (!check(!i.found(), "cat not found for add")) danderson@13: return false; danderson@13: if (!check(map.add(i, AString("cat"), 5), "cat added")) danderson@13: return false; danderson@13: if (!check(r->value == 5, "cat is 5")) danderson@13: return false; danderson@13: danderson@13: Map::iterator iter = map.iter(); danderson@13: if (!check(iter->key.compare("cat") == 0, "iterator got key cat")) danderson@13: return false; danderson@13: if (!check(iter->value == 5, "iterator got value 5")) danderson@13: return false; danderson@13: iter.next(); danderson@13: if (!check(iter.empty(), "iterator should be finished")) danderson@13: return false; danderson@13: danderson@13: i = map.findForAdd("cat"); danderson@13: if (!check(i.found(), "cat found through insert")) danderson@13: return false; danderson@13: danderson@13: r = map.find("dog"); danderson@13: if (!check(!r.found(), "dog not found")) danderson@13: return false; danderson@13: danderson@13: r = map.find("cat"); danderson@13: if (!check(r.found(), "cat found")) danderson@13: return false; danderson@13: if (!check(r->value == 5, "cat is 5")) danderson@13: return false; danderson@13: map.remove(r); danderson@13: danderson@13: r = map.find("cat"); danderson@13: if (!check(!r.found(), "cat ran away")) danderson@13: return false; danderson@13: danderson@13: return true; danderson@13: } danderson@13: danderson@13: bool Run() KE_OVERRIDE danderson@13: { danderson@13: if (!testBasics()) danderson@13: return false; danderson@13: return true; danderson@13: } danderson@13: } sTestHashMap; danderson@13: