blob: c26bff1e9afd94ce05e5b204267d68f94cf782b8 (
plain)
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
|
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#ifndef mozilla_SimpleMap_h
#define mozilla_SimpleMap_h
#include "mozilla/Mutex.h"
#include "nsTArray.h"
#include <utility>
namespace mozilla {
template <typename T>
class SimpleMap {
public:
typedef std::pair<int64_t, T> Element;
SimpleMap() : mMutex("SimpleMap") {}
// Insert Key and Value pair at the end of our map.
void Insert(int64_t aKey, const T& aValue) {
MutexAutoLock lock(mMutex);
mMap.AppendElement(std::make_pair(aKey, aValue));
}
// Sets aValue matching aKey and remove it from the map if found.
// The element returned is the first one found.
// Returns true if found, false otherwise.
bool Find(int64_t aKey, T& aValue) {
MutexAutoLock lock(mMutex);
for (uint32_t i = 0; i < mMap.Length(); i++) {
Element& element = mMap[i];
if (element.first == aKey) {
aValue = element.second;
mMap.RemoveElementAt(i);
return true;
}
}
return false;
}
// Remove all elements of the map.
void Clear() {
MutexAutoLock lock(mMutex);
mMap.Clear();
}
private:
Mutex mMutex MOZ_UNANNOTATED; // To protect mMap.
AutoTArray<Element, 16> mMap;
};
} // namespace mozilla
#endif // mozilla_SimpleMap_h
|
