| OLD | NEW |
|---|
| 1 // Copyright 2014 The Chromium Authors. All rights reserved. | 1 // Copyright 2014 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/accessibility/tree_generator.h" | 5 #include "ui/accessibility/tree_generator.h" |
| 6 | 6 |
| 7 #include "ui/accessibility/ax_enums.h" |
| 7 #include "ui/accessibility/ax_serializable_tree.h" | 8 #include "ui/accessibility/ax_serializable_tree.h" |
| 8 #include "ui/accessibility/ax_tree.h" | 9 #include "ui/accessibility/ax_tree.h" |
| 9 | 10 |
| 10 namespace ui { | 11 namespace ui { |
| 11 | 12 |
| 12 static int UniqueTreeCountForNodeCount(int node_count, | 13 static int UniqueTreeCountForNodeCount(int node_count, |
| 13 bool permutations) { | 14 bool permutations) { |
| 14 int unique_tree_count = 1; | 15 int unique_tree_count = 1; |
| 15 | 16 |
| 16 // (n-1)! for the possible trees. | 17 // (n-1)! for the possible trees. |
| (...skipping 86 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 103 int parent_index = (tree_index % i); | 104 int parent_index = (tree_index % i); |
| 104 tree_index /= i; | 105 tree_index /= i; |
| 105 update.nodes[parent_index].child_ids.push_back(permuted[i]); | 106 update.nodes[parent_index].child_ids.push_back(permuted[i]); |
| 106 } | 107 } |
| 107 | 108 |
| 108 // Unserialize the tree update into the destination tree. | 109 // Unserialize the tree update into the destination tree. |
| 109 CHECK(out_tree->Unserialize(update)) << out_tree->error(); | 110 CHECK(out_tree->Unserialize(update)) << out_tree->error(); |
| 110 }; | 111 }; |
| 111 | 112 |
| 112 } // namespace ui | 113 } // namespace ui |
| OLD | NEW |
|---|
Chromium Code Reviews
Issue 1996893002:
IWYU for ax_enums.h
Base URL: https://chromium.googlesource.com/chromium/src.git@master