Source code

Revision control

Other Tools

/* 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 */
#ifndef mozilla_SimpleMap_h
#define mozilla_SimpleMap_h
#include "mozilla/Mutex.h"
#include "nsTArray.h"
#include <utility>
namespace mozilla {
template <typename T>
class SimpleMap {
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;
return true;
return false;
// Remove all elements of the map.
void Clear() {
MutexAutoLock lock(mMutex);
Mutex mMutex; // To protect mMap.
AutoTArray<Element, 16> mMap;
} // namespace mozilla
#endif // mozilla_SimpleMap_h