1 /* 2 * Copyright (C) 2011 Google Inc. All rights reserved. 3 * 4 * Redistribution and use in source and binary forms, with or without 5 * modification, are permitted provided that the following conditions 6 * are met: 7 * 1. Redistributions of source code must retain the above copyright 8 * notice, this list of conditions and the following disclaimer. 9 * 2. Redistributions in binary form must reproduce the above copyright 10 * notice, this list of conditions and the following disclaimer in the 11 * documentation and/or other materials provided with the distribution. 12 * 13 * THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' 14 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, 15 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS 17 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 18 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 19 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 20 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 21 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 22 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF 23 * THE POSSIBILITY OF SUCH DAMAGE. 24 */ 25 26 #include "config.h" 27 28 #include "wtf/HashMap.h" 29 #include <gtest/gtest.h> 30 31 namespace { 32 33 typedef WTF::HashMap<int, int> IntHashMap; 34 35 TEST(WTF, HashTableIteratorComparison) 36 { 37 IntHashMap map; 38 map.add(1, 2); 39 ASSERT_TRUE(map.begin() != map.end()); 40 ASSERT_FALSE(map.begin() == map.end()); 41 42 IntHashMap::const_iterator begin = map.begin(); 43 ASSERT_TRUE(begin == map.begin()); 44 ASSERT_TRUE(map.begin() == begin); 45 ASSERT_TRUE(begin != map.end()); 46 ASSERT_TRUE(map.end() != begin); 47 ASSERT_FALSE(begin != map.begin()); 48 ASSERT_FALSE(map.begin() != begin); 49 ASSERT_FALSE(begin == map.end()); 50 ASSERT_FALSE(map.end() == begin); 51 } 52 53 struct TestDoubleHashTraits : HashTraits<double> { 54 static const int minimumTableSize = 8; 55 }; 56 57 typedef HashMap<double, int64_t, DefaultHash<double>::Hash, TestDoubleHashTraits> DoubleHashMap; 58 59 static int bucketForKey(double key) 60 { 61 return DefaultHash<double>::Hash::hash(key) & (TestDoubleHashTraits::minimumTableSize - 1); 62 } 63 64 TEST(WTF, DoubleHashCollisions) 65 { 66 // The "clobber" key here is one that ends up stealing the bucket that the -0 key 67 // originally wants to be in. This makes the 0 and -0 keys collide and the test then 68 // fails unless the FloatHash::equals() implementation can distinguish them. 69 const double clobberKey = 6; 70 const double zeroKey = 0; 71 const double negativeZeroKey = -zeroKey; 72 73 DoubleHashMap map; 74 75 map.add(clobberKey, 1); 76 map.add(zeroKey, 2); 77 map.add(negativeZeroKey, 3); 78 79 ASSERT_EQ(bucketForKey(clobberKey), bucketForKey(negativeZeroKey)); 80 ASSERT_EQ(map.get(clobberKey), 1); 81 ASSERT_EQ(map.get(zeroKey), 2); 82 ASSERT_EQ(map.get(negativeZeroKey), 3); 83 } 84 85 } // namespace 86
