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 <set> | 5 #include <set> |
6 | 6 |
7 #include "base/basictypes.h" | 7 #include "base/basictypes.h" |
8 #include "chrome/browser/ui/views/accelerator_table.h" | 8 #include "chrome/browser/ui/views/accelerator_table.h" |
9 #include "testing/gtest/include/gtest/gtest.h" | 9 #include "testing/gtest/include/gtest/gtest.h" |
10 #include "ui/base/events/event_constants.h" | 10 #include "ui/base/events/event_constants.h" |
(...skipping 25 matching lines...) Expand all Loading... | |
36 EXPECT_TRUE(acclerators.insert(entry).second) | 36 EXPECT_TRUE(acclerators.insert(entry).second) |
37 << "Duplicated accelerator: " << entry.keycode << ", " | 37 << "Duplicated accelerator: " << entry.keycode << ", " |
38 << (entry.modifiers & ui::EF_SHIFT_DOWN) << ", " | 38 << (entry.modifiers & ui::EF_SHIFT_DOWN) << ", " |
39 << (entry.modifiers & ui::EF_CONTROL_DOWN) << ", " | 39 << (entry.modifiers & ui::EF_CONTROL_DOWN) << ", " |
40 << (entry.modifiers & ui::EF_ALT_DOWN); | 40 << (entry.modifiers & ui::EF_ALT_DOWN); |
41 } | 41 } |
42 } | 42 } |
43 | 43 |
44 #if defined(USE_ASH) | 44 #if defined(USE_ASH) |
45 TEST(AcceleratorTableTest, CheckDuplicatedAcceleratorsAsh) { | 45 TEST(AcceleratorTableTest, CheckDuplicatedAcceleratorsAsh) { |
46 std::set<AcceleratorMapping, Cmp> allowed_duplicates; | |
47 #if defined(OS_CHROMEOS) | |
48 AcceleratorMapping exception_entry; | |
49 exception_entry.keycode = ui::VKEY_F4; // F4 has Ash and Chrome shortcuts | |
sky
2012/09/16 16:08:03
This comment is better placed above this line:
//
sschmitz
2012/09/17 15:22:05
Done.
| |
50 exception_entry.modifiers = ui::EF_NONE; | |
51 exception_entry.command_id = 0; // dummy | |
52 allowed_duplicates.insert(exception_entry); | |
53 #endif | |
54 | |
46 std::set<AcceleratorMapping, Cmp> acclerators; | 55 std::set<AcceleratorMapping, Cmp> acclerators; |
47 for (size_t i = 0; i < kAcceleratorMapLength; ++i) { | 56 for (size_t i = 0; i < kAcceleratorMapLength; ++i) { |
48 const AcceleratorMapping& entry = kAcceleratorMap[i]; | 57 const AcceleratorMapping& entry = kAcceleratorMap[i]; |
49 acclerators.insert(entry); | 58 acclerators.insert(entry); |
50 } | 59 } |
51 for (size_t i = 0; i < ash::kAcceleratorDataLength; ++i) { | 60 for (size_t i = 0; i < ash::kAcceleratorDataLength; ++i) { |
52 const ash::AcceleratorData& ash_entry = ash::kAcceleratorData[i]; | 61 const ash::AcceleratorData& ash_entry = ash::kAcceleratorData[i]; |
53 if (!ash_entry.trigger_on_press) | 62 if (!ash_entry.trigger_on_press) |
54 continue; // kAcceleratorMap does not have any release accelerators. | 63 continue; // kAcceleratorMap does not have any release accelerators. |
55 AcceleratorMapping entry; | 64 AcceleratorMapping entry; |
56 entry.keycode = ash_entry.keycode; | 65 entry.keycode = ash_entry.keycode; |
57 entry.modifiers = ash_entry.modifiers; | 66 entry.modifiers = ash_entry.modifiers; |
58 entry.command_id = 0; // dummy | 67 entry.command_id = 0; // dummy |
59 EXPECT_TRUE(acclerators.insert(entry).second) | 68 if (allowed_duplicates.find(entry) == allowed_duplicates.end()) { |
60 << "Duplicated accelerator: " << entry.keycode << ", " | 69 EXPECT_TRUE(acclerators.insert(entry).second) |
61 << (entry.modifiers & ui::EF_SHIFT_DOWN) << ", " | 70 << "Duplicated accelerator: " << entry.keycode << ", " |
62 << (entry.modifiers & ui::EF_CONTROL_DOWN) << ", " | 71 << (entry.modifiers & ui::EF_SHIFT_DOWN) << ", " |
63 << (entry.modifiers & ui::EF_ALT_DOWN); | 72 << (entry.modifiers & ui::EF_CONTROL_DOWN) << ", " |
73 << (entry.modifiers & ui::EF_ALT_DOWN); | |
74 } | |
64 } | 75 } |
65 } | 76 } |
66 #endif // USE_ASH | 77 #endif // USE_ASH |
67 | 78 |
68 } // namespace chrome | 79 } // namespace chrome |
OLD | NEW |