TileIndexHash.h 2.0 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
  1. /*
  2. * Copyright (C) 2009, 2010, 2011, 2012 Research In Motion Limited. All rights reserved.
  3. *
  4. * This library is free software; you can redistribute it and/or
  5. * modify it under the terms of the GNU Lesser General Public
  6. * License as published by the Free Software Foundation; either
  7. * version 2 of the License, or (at your option) any later version.
  8. *
  9. * This library is distributed in the hope that it will be useful,
  10. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  12. * Lesser General Public License for more details.
  13. *
  14. * You should have received a copy of the GNU Lesser General Public
  15. * License along with this library; if not, write to the Free Software
  16. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  17. */
  18. #ifndef TileIndexHash_h
  19. #define TileIndexHash_h
  20. #include "TileIndex.h"
  21. #include <limits>
  22. #include <wtf/HashMap.h>
  23. using BlackBerry::WebKit::TileIndex;
  24. namespace WTF {
  25. template<> struct IntHash<TileIndex> {
  26. static unsigned hash(const TileIndex& key) { return pairIntHash(key.i(), key.j()); }
  27. static bool equal(const TileIndex& a, const TileIndex& b) { return a == b; }
  28. static const bool safeToCompareToEmptyOrDeleted = true;
  29. };
  30. template<> struct DefaultHash<TileIndex> {
  31. typedef IntHash<TileIndex> Hash;
  32. };
  33. template<> struct HashTraits<TileIndex> : GenericHashTraits<TileIndex> {
  34. static const bool emptyValueIsZero = false;
  35. static const bool needsDestruction = false;
  36. static TileIndex emptyValue() { return TileIndex(); }
  37. static void constructDeletedValue(TileIndex& slot)
  38. {
  39. new (&slot) TileIndex(std::numeric_limits<unsigned>::max() - 1, std::numeric_limits<unsigned>::max() - 1);
  40. }
  41. static bool isDeletedValue(const TileIndex& value)
  42. {
  43. return value.i() == (std::numeric_limits<unsigned>::max() - 1) && value.j() == (std::numeric_limits<unsigned>::max() - 1);
  44. }
  45. };
  46. } // namespace WTF
  47. #endif // TileIndexHash_h