base/prefs/pref_value_map.cc

   1 // Copyright (c) 2011 The Chromium Authors. All rights reserved.
   2 // Use of this source code is governed by a BSD-style license that can be
   3 // found in the LICENSE file.
   4
   5 #include "base/prefs/pref_value_map.h"
   6
   7 #include "base/logging.h"
   8 #include "base/memory/scoped_ptr.h"
   9 #include "base/stl_util.h"
  10 #include "base/values.h"
  11
  12 PrefValueMap::PrefValueMap() {}
  13
  14 PrefValueMap::~PrefValueMap() {
  15   Clear();
  16 }
  17
  18 bool PrefValueMap::GetValue(const std::string& key,
  19                             const base::Value** value) const {
  20   const Map::const_iterator entry = prefs_.find(key);
  21   if (entry != prefs_.end()) {
  22     if (value)
  23       *value = entry->second;
  24     return true;
  25   }
  26
  27   return false;
  28 }
  29
  30 bool PrefValueMap::GetValue(const std::string& key, base::Value** value) {
  31   const Map::const_iterator entry = prefs_.find(key);
  32   if (entry != prefs_.end()) {
  33     if (value)
  34       *value = entry->second;
  35     return true;
  36   }
  37
  38   return false;
  39 }
  40
  41 bool PrefValueMap::SetValue(const std::string& key, base::Value* value) {
  42   DCHECK(value);
  43   scoped_ptr<base::Value> value_ptr(value);
  44   const Map::iterator entry = prefs_.find(key);
  45   if (entry != prefs_.end()) {
  46     if (base::Value::Equals(entry->second, value))
  47       return false;
  48     delete entry->second;
  49     entry->second = value_ptr.release();
  50   } else {
  51     prefs_[key] = value_ptr.release();
  52   }
  53
  54   return true;
  55 }
  56
  57 bool PrefValueMap::RemoveValue(const std::string& key) {
  58   const Map::iterator entry = prefs_.find(key);
  59   if (entry != prefs_.end()) {
  60     delete entry->second;
  61     prefs_.erase(entry);
  62     return true;
  63   }
  64
  65   return false;
  66 }
  67
  68 void PrefValueMap::Clear() {
  69   STLDeleteValues(&prefs_);
  70 }
  71
  72 void PrefValueMap::Swap(PrefValueMap* other) {
  73   prefs_.swap(other->prefs_);
  74 }
  75
  76 PrefValueMap::iterator PrefValueMap::begin() {
  77   return prefs_.begin();
  78 }
  79
  80 PrefValueMap::iterator PrefValueMap::end() {
  81   return prefs_.end();
  82 }
  83
  84 PrefValueMap::const_iterator PrefValueMap::begin() const {
  85   return prefs_.begin();
  86 }
  87
  88 PrefValueMap::const_iterator PrefValueMap::end() const {
  89   return prefs_.end();
  90 }
  91
  92 bool PrefValueMap::GetBoolean(const std::string& key,
  93                               bool* value) const {
  94   const base::Value* stored_value = NULL;
  95   return GetValue(key, &stored_value) && stored_value->GetAsBoolean(value);
  96 }
  97
  98 void PrefValueMap::SetBoolean(const std::string& key, bool value) {
  99   SetValue(key, new base::FundamentalValue(value));
 100 }
 101
 102 bool PrefValueMap::GetString(const std::string& key,
 103                              std::string* value) const {
 104   const base::Value* stored_value = NULL;
 105   return GetValue(key, &stored_value) && stored_value->GetAsString(value);
 106 }
 107
 108 void PrefValueMap::SetString(const std::string& key,
 109                              const std::string& value) {
 110   SetValue(key, new base::StringValue(value));
 111 }
 112
 113 bool PrefValueMap::GetInteger(const std::string& key, int* value) const {
 114   const base::Value* stored_value = NULL;
 115   return GetValue(key, &stored_value) && stored_value->GetAsInteger(value);
 116 }
 117
 118 void PrefValueMap::SetInteger(const std::string& key, const int value) {
 119   SetValue(key, new base::FundamentalValue(value));
 120 }
 121
 122 void PrefValueMap::SetDouble(const std::string& key, const double value) {
 123   SetValue(key, new base::FundamentalValue(value));
 124 }
 125
 126 void PrefValueMap::GetDifferingKeys(
 127     const PrefValueMap* other,
 128     std::vector<std::string>* differing_keys) const {
 129   differing_keys->clear();
 130
 131   // Walk over the maps in lockstep, adding everything that is different.
 132   Map::const_iterator this_pref(prefs_.begin());
 133   Map::const_iterator other_pref(other->prefs_.begin());
 134   while (this_pref != prefs_.end() && other_pref != other->prefs_.end()) {
 135     const int diff = this_pref->first.compare(other_pref->first);
 136     if (diff == 0) {
 137       if (!this_pref->second->Equals(other_pref->second))
 138         differing_keys->push_back(this_pref->first);
 139       ++this_pref;
 140       ++other_pref;
 141     } else if (diff < 0) {
 142       differing_keys->push_back(this_pref->first);
 143       ++this_pref;
 144     } else if (diff > 0) {
 145       differing_keys->push_back(other_pref->first);
 146       ++other_pref;
 147     }
 148   }
 149
 150   // Add the remaining entries.
 151   for ( ; this_pref != prefs_.end(); ++this_pref)
 152       differing_keys->push_back(this_pref->first);
 153   for ( ; other_pref != other->prefs_.end(); ++other_pref)
 154       differing_keys->push_back(other_pref->first);
 155 }