blob: 0266b9ac8f95c93ee2095216849d1d73b1320a8b [file] [log] [blame]
// Copyright 2014 The Chromium Authors. All rights reserved.
// 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 "base/values.h"
namespace extensions {
struct ValueCounter::Entry {
explicit Entry(scoped_ptr<base::Value> value)
: value(value.Pass()), count(1) {}
scoped_ptr<base::Value> value;
int count;
};
ValueCounter::ValueCounter() {
}
ValueCounter::~ValueCounter() {
}
bool ValueCounter::Add(const base::Value& value) {
for (Entry* entry : entries_) {
if (entry->value->Equals(&value)) {
++entry->count;
return false;
}
}
entries_.push_back(new Entry(value.CreateDeepCopy()));
return true;
}
bool ValueCounter::Remove(const base::Value& value) {
for (ScopedVector<Entry>::iterator it = entries_.begin();
it != entries_.end(); ++it) {
if ((*it)->value->Equals(&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