OLD | NEW |
1 // Copyright (c) 2010 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2010 The Chromium Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #include "chrome/common/extensions/extension_icon_set.h" | 5 #include "chrome/common/extensions/extension_icon_set.h" |
6 | 6 |
7 #include "base/logging.h" | 7 #include "base/logging.h" |
8 | 8 |
9 ExtensionIconSet::ExtensionIconSet() {} | 9 ExtensionIconSet::ExtensionIconSet() {} |
10 | 10 |
11 ExtensionIconSet::~ExtensionIconSet() {} | 11 ExtensionIconSet::~ExtensionIconSet() {} |
12 | 12 |
13 void ExtensionIconSet::Clear() { | 13 void ExtensionIconSet::Clear() { |
14 map_.clear(); | 14 map_.clear(); |
15 } | 15 } |
16 | 16 |
17 void ExtensionIconSet::Add(int size, const std::string& path) { | 17 void ExtensionIconSet::Add(int size, const std::string& path) { |
18 CHECK(!path.empty() && path[0] != '/'); | 18 DCHECK(!path.empty() && path[0] != '/'); |
19 map_[size] = path; | 19 map_[size] = path; |
20 } | 20 } |
21 | 21 |
22 std::string ExtensionIconSet::Get(int size, MatchType match_type) const { | 22 std::string ExtensionIconSet::Get(int size, MatchType match_type) const { |
23 // The searches for MATCH_BIGGER and MATCH_SMALLER below rely on the fact that | 23 // The searches for MATCH_BIGGER and MATCH_SMALLER below rely on the fact that |
24 // std::map is sorted. This is per the spec, so it should be safe to rely on. | 24 // std::map is sorted. This is per the spec, so it should be safe to rely on. |
25 if (match_type == MATCH_EXACTLY) { | 25 if (match_type == MATCH_EXACTLY) { |
26 IconMap::const_iterator result = map_.find(size); | 26 IconMap::const_iterator result = map_.find(size); |
27 return result == map_.end() ? std::string() : result->second; | 27 return result == map_.end() ? std::string() : result->second; |
28 } else if (match_type == MATCH_SMALLER) { | 28 } else if (match_type == MATCH_SMALLER) { |
29 IconMap::const_reverse_iterator result = map_.rend(); | 29 IconMap::const_reverse_iterator result = map_.rend(); |
30 for (IconMap::const_reverse_iterator iter = map_.rbegin(); | 30 for (IconMap::const_reverse_iterator iter = map_.rbegin(); |
31 iter != map_.rend(); ++iter) { | 31 iter != map_.rend(); ++iter) { |
32 if (iter->first <= size) { | 32 if (iter->first <= size) { |
33 result = iter; | 33 result = iter; |
34 break; | 34 break; |
35 } | 35 } |
36 } | 36 } |
37 return result == map_.rend() ? std::string() : result->second; | 37 return result == map_.rend() ? std::string() : result->second; |
38 } else { | 38 } else { |
39 CHECK(match_type == MATCH_BIGGER); | 39 DCHECK(match_type == MATCH_BIGGER); |
40 IconMap::const_iterator result = map_.end(); | 40 IconMap::const_iterator result = map_.end(); |
41 for (IconMap::const_iterator iter = map_.begin(); iter != map_.end(); | 41 for (IconMap::const_iterator iter = map_.begin(); iter != map_.end(); |
42 ++iter) { | 42 ++iter) { |
43 if (iter->first >= size) { | 43 if (iter->first >= size) { |
44 result = iter; | 44 result = iter; |
45 break; | 45 break; |
46 } | 46 } |
47 } | 47 } |
48 return result == map_.end() ? std::string() : result->second; | 48 return result == map_.end() ? std::string() : result->second; |
49 } | 49 } |
50 } | 50 } |
51 | 51 |
52 bool ExtensionIconSet::ContainsPath(const std::string& path) const { | 52 bool ExtensionIconSet::ContainsPath(const std::string& path) const { |
53 if (path.empty()) | 53 if (path.empty()) |
54 return false; | 54 return false; |
55 | 55 |
56 CHECK(path[0] != '/') << | 56 DCHECK(path[0] != '/') << |
57 "ExtensionIconSet stores icon paths without leading slash."; | 57 "ExtensionIconSet stores icon paths without leading slash."; |
58 | 58 |
59 for (IconMap::const_iterator iter = map_.begin(); iter != map_.end(); | 59 for (IconMap::const_iterator iter = map_.begin(); iter != map_.end(); |
60 ++iter) { | 60 ++iter) { |
61 if (iter->second == path) | 61 if (iter->second == path) |
62 return true; | 62 return true; |
63 } | 63 } |
64 | 64 |
65 return false; | 65 return false; |
66 } | 66 } |
OLD | NEW |