| OLD | NEW |
| (Empty) |
| 1 /* | |
| 2 * Copyright (C) 2012 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 COMPUTER, INC. ``AS IS'' AND ANY | |
| 14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
| 15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | |
| 16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR | |
| 17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, | |
| 18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, | |
| 19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR | |
| 20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY | |
| 21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
| 22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
| 23 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
| 24 */ | |
| 25 | |
| 26 #ifndef SkSizeHash_h | |
| 27 #define SkSizeHash_h | |
| 28 | |
| 29 #include "SkScalar.h" | |
| 30 #include "SkSize.h" | |
| 31 | |
| 32 #include "wtf/HashMap.h" | |
| 33 | |
| 34 namespace WTF { | |
| 35 | |
| 36 template<> struct IntHash<SkSize> { | |
| 37 static unsigned hash(const SkSize& key) { return pairIntHash(key.width(), ke
y.height()); } | |
| 38 static bool equal(const SkSize& a, const SkSize& b) { return a == b; } | |
| 39 static const bool safeToCompareToEmptyOrDeleted = true; | |
| 40 }; | |
| 41 | |
| 42 template<> struct DefaultHash<SkSize> { | |
| 43 typedef IntHash<SkSize> Hash; | |
| 44 }; | |
| 45 | |
| 46 template<> struct HashTraits<SkSize> : GenericHashTraits<SkSize> { | |
| 47 static const bool emptyValueIsZero = true; | |
| 48 static const bool needsDestruction = false; | |
| 49 static SkSize emptyValue() { return SkSize::Make(0, 0); } | |
| 50 static void constructDeletedValue(SkSize& slot) | |
| 51 { | |
| 52 slot = SkSize::Make(-1, -1); | |
| 53 } | |
| 54 static bool isDeletedValue(const SkSize& value) | |
| 55 { | |
| 56 return value.width() == -1 && value.height() == -1; | |
| 57 } | |
| 58 }; | |
| 59 | |
| 60 template<> struct IntHash<SkISize> { | |
| 61 static unsigned hash(const SkISize& key) { return pairIntHash(key.width(), k
ey.height()); } | |
| 62 static bool equal(const SkISize& a, const SkISize& b) { return a == b; } | |
| 63 static const bool safeToCompareToEmptyOrDeleted = true; | |
| 64 }; | |
| 65 | |
| 66 template<> struct DefaultHash<SkISize> { | |
| 67 typedef IntHash<SkISize> Hash; | |
| 68 }; | |
| 69 | |
| 70 template<> struct HashTraits<SkISize> : GenericHashTraits<SkISize> { | |
| 71 static const bool emptyValueIsZero = true; | |
| 72 static const bool needsDestruction = false; | |
| 73 static SkISize emptyValue() { return SkISize::Make(0, 0); } | |
| 74 static void constructDeletedValue(SkISize& slot) | |
| 75 { | |
| 76 slot = SkISize::Make(-1, -1); | |
| 77 } | |
| 78 static bool isDeletedValue(const SkISize& value) | |
| 79 { | |
| 80 return value.width() == -1 && value.height() == -1; | |
| 81 } | |
| 82 }; | |
| 83 | |
| 84 } // namespace WTF | |
| 85 | |
| 86 #endif // SkSizeHash_h | |
| OLD | NEW |