1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
|
/*
* Copyright (C) 2011, 2014 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#pragma once
#include <wtf/HashMap.h>
#include <wtf/Vector.h>
#include <algorithm>
namespace WTF {
template<typename T, typename CounterType = unsigned>
class Spectrum {
WTF_MAKE_FAST_ALLOCATED;
public:
typedef typename UncheckedKeyHashMap<T, CounterType>::iterator iterator;
typedef typename UncheckedKeyHashMap<T, CounterType>::const_iterator const_iterator;
Spectrum() { }
void add(const T& key, CounterType count = 1)
{
Locker locker(m_lock);
if (!count)
return;
typename UncheckedKeyHashMap<T, CounterType>::AddResult result = m_map.add(key, count);
if (!result.isNewEntry)
result.iterator->value += count;
}
template<typename U>
void addAll(const Spectrum<T, U>& otherSpectrum)
{
for (auto& entry : otherSpectrum)
add(entry.key, entry.count);
}
CounterType get(const T& key) const
{
Locker locker(m_lock);
const_iterator iter = m_map.find(key);
if (iter == m_map.end())
return 0;
return iter->value;
}
size_t size() const { return m_map.size(); }
const_iterator begin() const { return m_map.begin(); }
const_iterator end() const { return m_map.end(); }
struct KeyAndCount {
WTF_MAKE_STRUCT_FAST_ALLOCATED;
KeyAndCount() { }
KeyAndCount(const T& key, CounterType count)
: key(&key)
, count(count)
{
}
bool operator<(const KeyAndCount& other) const
{
if (count != other.count)
return count < other.count;
// This causes lower-ordered keys being returned first; this is really just
// here to make sure that the order is somewhat deterministic rather than being
// determined by hashing.
return *key > *other.key;
}
const T* key;
CounterType count;
};
Lock& getLock() { return m_lock; }
// Returns a list ordered from lowest-count to highest-count.
Vector<KeyAndCount> buildList(AbstractLocker&) const
{
Vector<KeyAndCount> list;
for (const auto& entry : *this)
list.append(KeyAndCount(entry.key, entry.value));
std::sort(list.begin(), list.end());
return list;
}
void clear()
{
Locker locker(m_lock);
m_map.clear();
}
template<typename Functor>
void removeIf(const Functor& functor)
{
Locker locker(m_lock);
m_map.removeIf([&functor] (typename UncheckedKeyHashMap<T, CounterType>::KeyValuePairType& pair) {
return functor(KeyAndCount(pair.key, pair.value));
});
}
private:
mutable Lock m_lock;
UncheckedKeyHashMap<T, CounterType> m_map;
};
} // namespace WTF
using WTF::Spectrum;
|
