OLD | NEW |
1 // Copyright (c) 2011 The Chromium Authors. All rights reserved. | 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 | 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 <algorithm> | 5 #include <algorithm> |
6 | 6 |
7 #include "testing/gtest/include/gtest/gtest.h" | 7 #include "testing/gtest/include/gtest/gtest.h" |
8 #include "ui/gfx/canvas.h" | 8 #include "ui/gfx/canvas.h" |
9 #include "ui/views/view.h" | 9 #include "ui/views/view.h" |
10 #include "ui/views/widget/widget.h" | 10 #include "ui/views/widget/widget.h" |
11 | 11 |
12 namespace ui { | 12 namespace ui { |
13 | 13 |
14 class ViewTest : public testing::Test { | 14 class ViewTest : public testing::Test { |
15 public: | 15 public: |
16 ViewTest() {} | 16 ViewTest() {} |
17 virtual ~ViewTest() {} | 17 virtual ~ViewTest() {} |
18 | 18 |
19 private: | 19 private: |
20 DISALLOW_COPY_AND_ASSIGN(ViewTest); | 20 DISALLOW_COPY_AND_ASSIGN(ViewTest); |
21 }; | 21 }; |
22 | 22 |
23 TEST_F(ViewTest, SizeAndDisposition) { | 23 TEST_F(ViewTest, SizeAndDisposition) { |
24 View v; | 24 View v; |
25 EXPECT_TRUE(v.bounds().IsEmpty()); | 25 EXPECT_TRUE(v.bounds().IsEmpty()); |
26 EXPECT_TRUE(v.visible()); | 26 EXPECT_TRUE(v.visible()); |
27 | 27 |
28 v.SetBoundsRect(gfx::Rect(10, 10, 200, 200)); | 28 v.SetBounds(gfx::Rect(10, 10, 200, 200)); |
29 EXPECT_EQ(200, v.width()); | 29 EXPECT_EQ(200, v.width()); |
30 | 30 |
31 EXPECT_TRUE(v.GetPreferredSize().IsEmpty()); | 31 EXPECT_TRUE(v.GetPreferredSize().IsEmpty()); |
32 } | 32 } |
33 | 33 |
34 TEST_F(ViewTest, TreeOperations) { | 34 TEST_F(ViewTest, TreeOperations) { |
35 View v; | 35 View v; |
36 EXPECT_EQ(NULL, v.GetWidget()); | 36 EXPECT_EQ(NULL, v.GetWidget()); |
37 EXPECT_EQ(0, v.child_count()); | 37 EXPECT_TRUE(v.children_empty()); |
38 | 38 |
39 View child1; | 39 View child1; |
40 v.AddChildView(&child1); | 40 v.AddChildView(&child1); |
41 EXPECT_EQ(1, v.child_count()); | 41 EXPECT_EQ(1, v.children_size()); |
42 EXPECT_EQ(&v, child1.parent()); | 42 EXPECT_EQ(&v, child1.parent()); |
43 | 43 |
44 View child2; | 44 View child2; |
45 v.AddChildViewAt(&child2, 0); | 45 v.AddChildViewAt(&child2, 0); |
46 EXPECT_EQ(2, v.child_count()); | 46 EXPECT_EQ(2, v.children_size()); |
47 EXPECT_EQ(child1.parent(), child2.parent()); | 47 EXPECT_EQ(child1.parent(), child2.parent()); |
48 | 48 |
49 v.RemoveChildView(&child2); | 49 v.RemoveChildView(&child2, false); |
50 EXPECT_EQ(1, v.child_count()); | 50 EXPECT_EQ(1, v.children_size()); |
51 EXPECT_EQ(NULL, child2.parent()); | 51 EXPECT_EQ(NULL, child2.parent()); |
52 | 52 |
53 //v.RemoveAllChildViews(false); | 53 //v.RemoveAllChildViews(false); |
54 //EXPECT_EQ(0, v.child_count()); | 54 //EXPECT_TRUE(v.children_empty()); |
55 } | 55 } |
56 | 56 |
57 class ObserverView : public View { | 57 class ObserverView : public View { |
58 public: | 58 public: |
59 ObserverView() | 59 ObserverView() |
60 : view_added_(false), | 60 : view_added_(false), |
61 view_removed_(false), | 61 view_removed_(false), |
62 subject_view_(NULL) {} | 62 subject_view_(NULL) {} |
63 virtual ~ObserverView() {} | 63 virtual ~ObserverView() {} |
64 | 64 |
(...skipping 87 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
152 ov.RemoveChildView(&v2); | 152 ov.RemoveChildView(&v2); |
153 EXPECT_FALSE(ov.view_added()); | 153 EXPECT_FALSE(ov.view_added()); |
154 EXPECT_TRUE(ov.view_removed()); | 154 EXPECT_TRUE(ov.view_removed()); |
155 EXPECT_EQ(&v2, ov.subject_view()); | 155 EXPECT_EQ(&v2, ov.subject_view()); |
156 | 156 |
157 EXPECT_FALSE(v3.in_widget()); | 157 EXPECT_FALSE(v3.in_widget()); |
158 EXPECT_EQ(NULL, v3.GetWidget()); | 158 EXPECT_EQ(NULL, v3.GetWidget()); |
159 } | 159 } |
160 */ | 160 */ |
161 | 161 |
162 TEST_F(ViewTest, Ids) { | 162 TEST_F(ViewTest, IDs) { |
163 const int kV1Id = 1; | 163 const int kV1ID = 1; |
164 const int kV2Id = 2; | 164 const int kV2ID = 2; |
165 const int kV3Id = 3; | 165 const int kV3ID = 3; |
166 const int kV4Id = 4; | 166 const int kV4ID = 4; |
167 const int kV5Id = 5; | 167 const int kV5ID = 5; |
168 const int kGroupId = 1; | 168 const int kGroupID = 1; |
169 View v1; | 169 View v1; |
170 v1.set_id(kV1Id); | 170 v1.set_id(kV1ID); |
171 View v2; | 171 View v2; |
172 v2.set_id(kV2Id); | 172 v2.set_id(kV2ID); |
173 View v3; | 173 View v3; |
174 v3.set_id(kV3Id); | 174 v3.set_id(kV3ID); |
175 v3.set_group(kGroupId); | 175 v3.set_group(kGroupID); |
176 View v4; | 176 View v4; |
177 v4.set_id(kV4Id); | 177 v4.set_id(kV4ID); |
178 v4.set_group(kGroupId); | 178 v4.set_group(kGroupID); |
179 v1.AddChildView(&v2); | 179 v1.AddChildView(&v2); |
180 v2.AddChildView(&v3); | 180 v2.AddChildView(&v3); |
181 v2.AddChildView(&v4); | 181 v2.AddChildView(&v4); |
182 | 182 |
183 EXPECT_EQ(&v4, v1.GetViewById(kV4Id)); | 183 EXPECT_EQ(&v4, v1.GetViewByID(kV4ID)); |
184 EXPECT_EQ(&v1, v1.GetViewById(kV1Id)); | 184 EXPECT_EQ(&v1, v1.GetViewByID(kV1ID)); |
185 EXPECT_EQ(NULL, v1.GetViewById(kV5Id)); // No V5 exists. | 185 EXPECT_EQ(NULL, v1.GetViewByID(kV5ID)); // No V5 exists. |
186 | 186 |
187 View::ViewVector vec; | 187 View::Views views; |
188 v1.GetViewsWithGroup(kGroupId, &vec); | 188 v1.GetViewsInGroup(kGroupID, &views); |
189 EXPECT_EQ(2, vec.size()); | 189 EXPECT_EQ(2, views.size()); |
190 View::ViewVector::const_iterator it = find(vec.begin(), vec.end(), &v3); | 190 View::Views::const_iterator it = std::find(views.begin(), views.end(), &v3); |
191 EXPECT_NE(vec.end(), it); | 191 EXPECT_NE(views.end(), it); |
192 it = find(vec.begin(), vec.end(), &v4); | 192 it = std::find(views.begin(), views.end(), &v4); |
193 EXPECT_NE(vec.end(), it); | 193 EXPECT_NE(views.end(), it); |
194 } | 194 } |
195 | 195 |
196 TEST_F(ViewTest, EventHandlers) { | 196 TEST_F(ViewTest, EventHandlers) { |
197 | 197 |
198 } | 198 } |
199 | 199 |
200 TEST_F(ViewTest, Painting) { | 200 TEST_F(ViewTest, Painting) { |
201 | 201 |
202 } | 202 } |
203 | 203 |
204 } // namespace ui | 204 } // namespace ui |
OLD | NEW |