Eliminate Newborn/NoAddRef (
bug 5907, r=ds).
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-hashmap.h>
31 #include <am-utility.h>
32 #include <am-string.h>
39 static inline uint32_t hash(const char *key) {
40 return FastHashCharSequence(key, strlen(key));
42 static inline bool matches(const char *find, const AString &key) {
43 return key.compare(find) == 0;
47 class TestHashMap : public Test
56 typedef HashMap<AString, int, StringPolicy> Map;
59 if (!check(map.init(), "initialized"))
62 Map::Result r = map.find("cat");
63 if (!check(!r.found(), "cat not found"))
66 Map::Insert i = map.findForAdd("cat");
67 if (!check(!i.found(), "cat not found for add"))
69 if (!check(map.add(i, AString("cat"), 5), "cat added"))
71 if (!check(r->value == 5, "cat is 5"))
74 Map::iterator iter = map.iter();
75 if (!check(iter->key.compare("cat") == 0, "iterator got key cat"))
77 if (!check(iter->value == 5, "iterator got value 5"))
80 if (!check(iter.empty(), "iterator should be finished"))
83 i = map.findForAdd("cat");
84 if (!check(i.found(), "cat found through insert"))
88 if (!check(!r.found(), "dog not found"))
92 if (!check(r.found(), "cat found"))
94 if (!check(r->value == 5, "cat is 5"))
99 if (!check(!r.found(), "cat ran away"))
105 bool Run() KE_OVERRIDE