Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(92)

Side by Side Diff: ui/base/models/tree_node_iterator_unittest.cc

Issue 851853002: It is time. (Closed) Base URL: https://github.com/domokit/mojo.git@master
Patch Set: Trying to reup because the last upload failed. Created 5 years, 11 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch
« no previous file with comments | « ui/base/models/tree_node_iterator.h ('k') | ui/base/models/tree_node_model.h » ('j') | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
(Empty)
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 "ui/base/models/tree_node_iterator.h"
6
7 #include "base/bind.h"
8 #include "testing/gtest/include/gtest/gtest.h"
9 #include "ui/base/models/tree_node_model.h"
10
11 namespace ui {
12
13 namespace {
14
15 typedef TreeNodeWithValue<int> TestNode;
16
17 bool PruneOdd(TestNode* node) {
18 return node->value % 2;
19 }
20
21 bool PruneEven(TestNode* node) {
22 return !PruneOdd(node);
23 }
24
25 TEST(TreeNodeIteratorTest, Basic) {
26 TestNode root;
27 root.Add(new TestNode(), 0);
28 root.Add(new TestNode(), 1);
29 TestNode* f3 = new TestNode();
30 root.Add(f3, 2);
31 TestNode* f4 = new TestNode();
32 f3->Add(f4, 0);
33 f4->Add(new TestNode(), 0);
34
35 TreeNodeIterator<TestNode> iterator(&root);
36 ASSERT_TRUE(iterator.has_next());
37 ASSERT_EQ(root.GetChild(0), iterator.Next());
38
39 ASSERT_TRUE(iterator.has_next());
40 ASSERT_EQ(root.GetChild(1), iterator.Next());
41
42 ASSERT_TRUE(iterator.has_next());
43 ASSERT_EQ(root.GetChild(2), iterator.Next());
44
45 ASSERT_TRUE(iterator.has_next());
46 ASSERT_EQ(f4, iterator.Next());
47
48 ASSERT_TRUE(iterator.has_next());
49 ASSERT_EQ(f4->GetChild(0), iterator.Next());
50
51 ASSERT_FALSE(iterator.has_next());
52 }
53
54 // The tree used for testing:
55 // * + 1
56 // + 2
57 // + 3 + 4 + 5
58 // + 7
59 TEST(TreeNodeIteratorTest, Prune) {
60 TestNode root;
61 root.Add(new TestNode(1), 0);
62 root.Add(new TestNode(2), 1);
63 TestNode* f3 = new TestNode(3);
64 root.Add(f3, 2);
65 TestNode* f4 = new TestNode(4);
66 f3->Add(f4, 0);
67 f4->Add(new TestNode(5), 0);
68 f3->Add(new TestNode(7), 1);
69
70 TreeNodeIterator<TestNode> odd_iterator(&root, base::Bind(&PruneOdd));
71 ASSERT_TRUE(odd_iterator.has_next());
72 ASSERT_EQ(2, odd_iterator.Next()->value);
73 ASSERT_FALSE(odd_iterator.has_next());
74
75 TreeNodeIterator<TestNode> even_iterator(&root, base::Bind(&PruneEven));
76 ASSERT_TRUE(even_iterator.has_next());
77 ASSERT_EQ(1, even_iterator.Next()->value);
78 ASSERT_TRUE(even_iterator.has_next());
79 ASSERT_EQ(3, even_iterator.Next()->value);
80 ASSERT_TRUE(even_iterator.has_next());
81 ASSERT_EQ(7, even_iterator.Next()->value);
82 ASSERT_FALSE(even_iterator.has_next());
83 }
84
85 } // namespace
86
87 } // namespace ui
OLDNEW
« no previous file with comments | « ui/base/models/tree_node_iterator.h ('k') | ui/base/models/tree_node_model.h » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698