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
134
135
136
137
138
139
140
141
142
143
144
|
/*
* Copyright (C) 2022 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. AND ITS CONTRIBUTORS ``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 ITS 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/WeakHashMap.h>
namespace WTF {
template<typename Value, typename WeakPtrImpl = DefaultWeakPtrImpl>
class WeakHashCountedSet {
WTF_MAKE_FAST_ALLOCATED;
private:
using ImplType = WeakHashMap<Value, unsigned, WeakPtrImpl>;
public:
using ValueType = Value;
using iterator = typename ImplType::iterator;
using const_iterator = typename ImplType::const_iterator;
using AddResult = typename ImplType::AddResult;
// Iterators iterate over pairs of values and counts.
iterator begin() { return m_impl.begin(); }
iterator end() { return m_impl.end(); }
const_iterator begin() const { return m_impl.begin(); }
const_iterator end() const { return m_impl.end(); }
iterator find(const ValueType& value) { return m_impl.find(value); }
const_iterator find(const ValueType& value) const { return m_impl.find(value); }
bool contains(const ValueType& value) const { return m_impl.contains(value); }
bool isEmptyIgnoringNullReferences() const { return m_impl.isEmptyIgnoringNullReferences(); }
unsigned computeSize() const { return m_impl.computeSize(); }
// Increments the count if an equal value is already present.
// The return value includes both an iterator to the value's location,
// and an isNewEntry bool that indicates whether it is a new or existing entry.
AddResult add(const ValueType&);
AddResult add(ValueType&&);
// Decrements the count of the value, and removes it if count goes down to zero.
// Returns true if the value is removed.
bool remove(const ValueType&);
bool remove(iterator);
// Removes the value, regardless of its count.
// Returns true if a value was removed.
bool removeAll(const ValueType&);
bool removeAll(iterator);
// Clears the whole set.
void clear() { m_impl.clear(); }
private:
WeakHashMap<Value, unsigned, WeakPtrImpl> m_impl;
};
template<typename Value, typename WeakPtrImpl>
inline auto WeakHashCountedSet<Value, WeakPtrImpl>::add(const ValueType &value) -> AddResult
{
auto result = m_impl.add(value, 0);
++result.iterator->value;
return result;
}
template<typename Value, typename WeakPtrImpl>
inline auto WeakHashCountedSet<Value, WeakPtrImpl>::add(ValueType&& value) -> AddResult
{
auto result = m_impl.add(std::forward<Value>(value), 0);
++result.iterator->value;
return result;
}
template<typename Value, typename WeakPtrImpl>
inline bool WeakHashCountedSet<Value, WeakPtrImpl>::remove(const ValueType& value)
{
return remove(find(value));
}
template<typename Value, typename WeakPtrImpl>
inline bool WeakHashCountedSet<Value, WeakPtrImpl>::remove(iterator it)
{
if (it == end())
return false;
unsigned oldVal = it->value;
ASSERT(oldVal);
unsigned newVal = oldVal - 1;
if (newVal) {
it->value = newVal;
return false;
}
m_impl.remove(it);
return true;
}
template<typename Value, typename WeakPtrImpl>
inline bool WeakHashCountedSet<Value, WeakPtrImpl>::removeAll(const ValueType& value)
{
return removeAll(find(value));
}
template<typename Value, typename WeakPtrImpl>
inline bool WeakHashCountedSet<Value, WeakPtrImpl>::removeAll(iterator it)
{
if (it == end())
return false;
m_impl.remove(it);
return true;
}
template<typename Value, typename WeakMapImpl>
size_t containerSize(const WeakHashCountedSet<Value, WeakMapImpl>& container) { return container.computeSize(); }
template<typename Value>
using SingleThreadWeakHashCountedSet = WeakHashCountedSet<Value, SingleThreadWeakPtrImpl>;
} // namespace WTF
using WTF::SingleThreadWeakHashCountedSet;
using WTF::WeakHashCountedSet;
|
