2 * Copyright (C) 2011 Apple Inc. All rights reserved.
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
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.
13 * THIS SOFTWARE IS PROVIDED BY APPLE 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 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.
29 #include <wtf/HashMap.h>
30 #include <wtf/Vector.h>
38 typedef typename HashMap<T, unsigned long>::iterator iterator;
39 typedef typename HashMap<T, unsigned long>::const_iterator const_iterator;
43 void add(const T& key, unsigned long count = 1)
45 typename HashMap<T, unsigned long>::AddResult result = m_map.add(key, count);
46 if (!result.isNewEntry)
47 result.iterator->second += count;
50 unsigned long get(const T& key) const
52 const_iterator iter = m_map.find(key);
53 if (iter == m_map.end())
58 iterator begin() { return m_map.begin(); }
59 iterator end() { return m_map.end(); }
60 const_iterator begin() const { return m_map.begin(); }
61 const_iterator end() const { return m_map.end(); }
66 KeyAndCount(const T& key, unsigned long count)
72 bool operator<(const KeyAndCount& other) const
74 if (count != other.count)
75 return count < other.count;
76 // This causes lower-ordered keys being returned first; this is really just
77 // here to make sure that the order is somewhat deterministic rather than being
78 // determined by hashing.
79 return key > other.key;
86 // Returns a list ordered from lowest-count to highest-count.
87 Vector<KeyAndCount> buildList() const
89 Vector<KeyAndCount> list;
90 for (const_iterator iter = begin(); iter != end(); ++iter)
91 list.append(KeyAndCount(iter->first, iter->second));
93 std::sort(list.begin(), list.end());
98 HashMap<T, unsigned long> m_map;