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
|
// Copyright 2014 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "extensions/common/value_counter.h"
#include <algorithm>
#include <memory>
#include <utility>
#include "base/values.h"
namespace extensions {
struct ValueCounter::Entry {
explicit Entry(base::Value value) : value(std::move(value)), count(1) {}
Entry(Entry&) = delete;
Entry& operator=(Entry&) = delete;
Entry(Entry&&) = default;
Entry& operator=(Entry&&) = default;
base::Value value;
int count;
};
ValueCounter::ValueCounter() {
}
ValueCounter::~ValueCounter() {
}
bool ValueCounter::Add(const base::Value& value) {
for (auto& entry : entries_) {
if (entry.value == value) {
++entry.count;
return false;
}
}
entries_.emplace_back(value.Clone());
return true;
}
bool ValueCounter::Remove(const base::Value& value) {
for (auto it = entries_.begin(); it != entries_.end(); ++it) {
if (it->value == value) {
if (--it->count == 0) {
std::swap(*it, entries_.back());
entries_.pop_back();
return true; // Removed the last entry.
}
return false; // Removed, but no the last entry.
}
}
return false; // Nothing to remove.
}
} // namespace extensions
|
