Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2012 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 "ui/base/accelerators/accelerator_manager.h" | 5 #include "ui/base/accelerators/accelerator_manager.h" |
| 6 | 6 |
| 7 #include <algorithm> | 7 #include <algorithm> |
| 8 | 8 |
| 9 #include "base/logging.h" | 9 #include "base/logging.h" |
| 10 #include "ui/base/accelerators/accelerator_manager_delegate.h" | 10 #include "ui/base/accelerators/accelerator_manager_delegate.h" |
| 11 | 11 |
| 12 namespace ui { | 12 namespace ui { |
| 13 | 13 |
| 14 AcceleratorManager::AcceleratorManager(AcceleratorManagerDelegate* delegate) | 14 AcceleratorManager::AcceleratorManager(AcceleratorManagerDelegate* delegate) |
| 15 : delegate_(delegate) {} | 15 : delegate_(delegate) {} |
| 16 | 16 |
| 17 AcceleratorManager::~AcceleratorManager() { | 17 AcceleratorManager::~AcceleratorManager() { |
| 18 } | 18 } |
| 19 | 19 |
| 20 void AcceleratorManager::Register(const Accelerator& accelerator, | 20 void AcceleratorManager::Register( |
| 21 HandlerPriority priority, | 21 const std::vector<ui::Accelerator>& accelerators, |
| 22 AcceleratorTarget* target) { | 22 HandlerPriority priority, |
| 23 AcceleratorTarget* target) { | |
| 23 DCHECK(target); | 24 DCHECK(target); |
| 24 AcceleratorTargetList& targets = accelerators_[accelerator].second; | |
| 25 DCHECK(std::find(targets.begin(), targets.end(), target) == targets.end()) | |
| 26 << "Registering the same target multiple times"; | |
| 27 const bool is_first_target_for_accelerator = targets.empty(); | |
| 28 | 25 |
| 29 // All priority accelerators go to the front of the line. | 26 std::vector<ui::Accelerator> first_target_accelerators; |
|
mfomitchev
2016/12/22 01:04:50
Just call this |new_accelerators|? A comment expla
thanhph
2016/12/22 20:36:02
Done.
| |
| 30 if (priority == kHighPriority) { | 27 |
| 31 DCHECK(!accelerators_[accelerator].first) | 28 for (auto iter = accelerators.begin(); iter != accelerators.end(); ++iter) { |
| 32 << "Only one high-priority handler can be registered"; | 29 const Accelerator& accelerator = *iter; |
| 33 targets.push_front(target); | 30 |
| 34 // Mark that we have a priority accelerator at the front. | 31 AcceleratorTargetList& targets = accelerators_[accelerator].second; |
| 35 accelerators_[accelerator].first = true; | 32 DCHECK(std::find(targets.begin(), targets.end(), target) == targets.end()) |
| 36 } else { | 33 << "Registering the same target multiple times"; |
| 37 // We are registering a normal priority handler. If no priority accelerator | 34 const bool is_first_target_for_accelerator = targets.empty(); |
| 38 // handler has been registered before us, just add the new handler to the | 35 |
| 39 // front. Otherwise, register it after the first (only) priority handler. | 36 // All priority accelerators go to the front of the line. |
| 40 if (!accelerators_[accelerator].first) | 37 if (priority == kHighPriority) { |
| 38 DCHECK(!accelerators_[accelerator].first) | |
| 39 << "Only one high-priority handler can be registered"; | |
| 41 targets.push_front(target); | 40 targets.push_front(target); |
| 42 else | 41 // Mark that we have a priority accelerator at the front. |
| 43 targets.insert(++targets.begin(), target); | 42 accelerators_[accelerator].first = true; |
| 43 } else { | |
| 44 // We are registering a normal priority handler. If no priority | |
| 45 // accelerator | |
|
mfomitchev
2016/12/22 01:04:50
Reformat so that there's no gaps like this
thanhph
2016/12/22 20:36:02
Done.
| |
| 46 // handler has been registered before us, just add the new handler to the | |
| 47 // front. Otherwise, register it after the first (only) priority handler. | |
| 48 if (!accelerators_[accelerator].first) | |
| 49 targets.push_front(target); | |
| 50 else | |
| 51 targets.insert(++targets.begin(), target); | |
| 52 } | |
| 53 if (is_first_target_for_accelerator) | |
| 54 first_target_accelerators.push_back(accelerator); | |
| 44 } | 55 } |
| 45 if (is_first_target_for_accelerator && delegate_) | 56 |
| 46 delegate_->OnAcceleratorRegistered(accelerator); | 57 if (delegate_ && !first_target_accelerators.empty()) |
| 58 delegate_->OnAcceleratorsRegistered(first_target_accelerators); | |
| 47 } | 59 } |
| 48 | 60 |
| 49 void AcceleratorManager::Unregister(const Accelerator& accelerator, | 61 void AcceleratorManager::Unregister(const Accelerator& accelerator, |
| 50 AcceleratorTarget* target) { | 62 AcceleratorTarget* target) { |
| 51 AcceleratorMap::iterator map_iter = accelerators_.find(accelerator); | 63 AcceleratorMap::iterator map_iter = accelerators_.find(accelerator); |
| 52 if (map_iter == accelerators_.end()) { | 64 if (map_iter == accelerators_.end()) { |
| 53 NOTREACHED() << "Unregistering non-existing accelerator"; | 65 NOTREACHED() << "Unregistering non-existing accelerator"; |
| 54 return; | 66 return; |
| 55 } | 67 } |
| 56 | 68 |
| (...skipping 73 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 130 targets->remove(target); | 142 targets->remove(target); |
| 131 if (!targets->empty()) | 143 if (!targets->empty()) |
| 132 return; | 144 return; |
| 133 const ui::Accelerator accelerator = map_iter->first; | 145 const ui::Accelerator accelerator = map_iter->first; |
| 134 accelerators_.erase(map_iter); | 146 accelerators_.erase(map_iter); |
| 135 if (delegate_) | 147 if (delegate_) |
| 136 delegate_->OnAcceleratorUnregistered(accelerator); | 148 delegate_->OnAcceleratorUnregistered(accelerator); |
| 137 } | 149 } |
| 138 | 150 |
| 139 } // namespace ui | 151 } // namespace ui |
| OLD | NEW |