tests/test-hashmap.cpp
author David Anderson <danderson@mozilla.com>
Thu Aug 29 11:46:21 2013 -0700 (2013-08-29)
changeset 14 4ae6d413d3be
parent 13 ef6b69693bab
permissions -rw-r--r--
Sync AMTL.
danderson@13
     1
// vim: set sts=8 ts=2 sw=2 tw=99 et:
danderson@13
     2
//
danderson@13
     3
// Copyright (C) 2013, David Anderson and AlliedModders LLC
danderson@13
     4
// All rights reserved.
danderson@13
     5
// 
danderson@13
     6
// Redistribution and use in source and binary forms, with or without
danderson@13
     7
// modification, are permitted provided that the following conditions are met:
danderson@13
     8
// 
danderson@13
     9
//  * Redistributions of source code must retain the above copyright notice, this
danderson@13
    10
//    list of conditions and the following disclaimer.
danderson@13
    11
//  * Redistributions in binary form must reproduce the above copyright notice,
danderson@13
    12
//    this list of conditions and the following disclaimer in the documentation
danderson@13
    13
//    and/or other materials provided with the distribution.
danderson@13
    14
//  * Neither the name of AlliedModders LLC nor the names of its contributors
danderson@13
    15
//    may be used to endorse or promote products derived from this software
danderson@13
    16
//    without specific prior written permission.
danderson@13
    17
//
danderson@13
    18
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
danderson@13
    19
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
danderson@13
    20
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
danderson@13
    21
// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
danderson@13
    22
// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
danderson@13
    23
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
danderson@13
    24
// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
danderson@13
    25
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
danderson@13
    26
// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
danderson@13
    27
// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
danderson@13
    28
// POSSIBILITY OF SUCH DAMAGE.
danderson@13
    29
danderson@13
    30
#include <am-hashmap.h>
danderson@13
    31
#include <am-utility.h>
danderson@13
    32
#include <am-string.h>
danderson@13
    33
#include "runner.h"
danderson@13
    34
danderson@13
    35
using namespace ke;
danderson@13
    36
danderson@13
    37
struct StringPolicy
danderson@13
    38
{
danderson@13
    39
  static inline uint32_t hash(const char *key) {
danderson@13
    40
    return FastHashCharSequence(key, strlen(key));
danderson@13
    41
  }
danderson@13
    42
  static inline bool matches(const char *find, const AString &key) {
danderson@13
    43
    return key.compare(find) == 0;
danderson@13
    44
  }
danderson@13
    45
};
danderson@13
    46
danderson@13
    47
class TestHashMap : public Test
danderson@13
    48
{
danderson@13
    49
 public:
danderson@13
    50
  TestHashMap()
danderson@13
    51
   : Test("HashMap")
danderson@13
    52
  {
danderson@13
    53
  }
danderson@13
    54
danderson@13
    55
  bool testBasics() {
danderson@13
    56
    typedef HashMap<AString, int, StringPolicy> Map;
danderson@13
    57
    Map map;
danderson@13
    58
danderson@13
    59
    if (!check(map.init(), "initialized"))
danderson@13
    60
      return false;
danderson@13
    61
danderson@13
    62
    Map::Result r = map.find("cat");
danderson@13
    63
    if (!check(!r.found(), "cat not found"))
danderson@13
    64
      return false;
danderson@13
    65
danderson@13
    66
    Map::Insert i = map.findForAdd("cat");
danderson@13
    67
    if (!check(!i.found(), "cat not found for add"))
danderson@13
    68
      return false;
danderson@13
    69
    if (!check(map.add(i, AString("cat"), 5), "cat added"))
danderson@13
    70
      return false;
danderson@13
    71
    if (!check(r->value == 5, "cat is 5"))
danderson@13
    72
      return false;
danderson@13
    73
danderson@13
    74
    Map::iterator iter = map.iter();
danderson@13
    75
    if (!check(iter->key.compare("cat") == 0, "iterator got key cat"))
danderson@13
    76
      return false;
danderson@13
    77
    if (!check(iter->value == 5, "iterator got value 5"))
danderson@13
    78
      return false;
danderson@13
    79
    iter.next();
danderson@13
    80
    if (!check(iter.empty(), "iterator should be finished"))
danderson@13
    81
      return false;
danderson@13
    82
danderson@13
    83
    i = map.findForAdd("cat");
danderson@13
    84
    if (!check(i.found(), "cat found through insert"))
danderson@13
    85
      return false;
danderson@13
    86
danderson@13
    87
    r = map.find("dog");
danderson@13
    88
    if (!check(!r.found(), "dog not found"))
danderson@13
    89
      return false;
danderson@13
    90
danderson@13
    91
    r = map.find("cat");
danderson@13
    92
    if (!check(r.found(), "cat found"))
danderson@13
    93
      return false;
danderson@13
    94
    if (!check(r->value == 5, "cat is 5"))
danderson@13
    95
      return false;
danderson@13
    96
    map.remove(r);
danderson@13
    97
danderson@13
    98
    r = map.find("cat");
danderson@13
    99
    if (!check(!r.found(), "cat ran away"))
danderson@13
   100
      return false;
danderson@13
   101
danderson@13
   102
    return true;
danderson@13
   103
  }
danderson@13
   104
danderson@13
   105
  bool Run() KE_OVERRIDE
danderson@13
   106
  {
danderson@13
   107
    if (!testBasics())
danderson@13
   108
      return false;
danderson@13
   109
    return true;
danderson@13
   110
  }
danderson@13
   111
} sTestHashMap;
danderson@13
   112