OLD | NEW |
1 // Copyright (c) 2010 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 #ifndef CHROME_TEST_MODEL_TEST_UTILS_H_ | 5 #ifndef CHROME_TEST_BASE_MODEL_TEST_UTILS_H_ |
6 #define CHROME_TEST_MODEL_TEST_UTILS_H_ | 6 #define CHROME_TEST_BASE_MODEL_TEST_UTILS_H_ |
7 #pragma once | 7 #pragma once |
8 | 8 |
9 #include <string> | 9 #include <string> |
10 | 10 |
11 class BookmarkModel; | 11 class BookmarkModel; |
12 class BookmarkNode; | 12 class BookmarkNode; |
13 | 13 |
14 namespace model_test_utils { | 14 namespace model_test_utils { |
15 | 15 |
16 // Return the descendants of |node| as a string useful for verifying node | 16 // Return the descendants of |node| as a string useful for verifying node |
(...skipping 17 matching lines...) Expand all Loading... |
34 // are appended to the end of node's existing subnodes, if any. | 34 // are appended to the end of node's existing subnodes, if any. |
35 // |model| must be the model of which |node| is a member. | 35 // |model| must be the model of which |node| is a member. |
36 // NOTE: The string format is very rigid and easily broken if not followed | 36 // NOTE: The string format is very rigid and easily broken if not followed |
37 // exactly (since we're using a very simple parser). | 37 // exactly (since we're using a very simple parser). |
38 void AddNodesFromModelString(BookmarkModel& model, | 38 void AddNodesFromModelString(BookmarkModel& model, |
39 const BookmarkNode* node, | 39 const BookmarkNode* node, |
40 const std::string& model_string); | 40 const std::string& model_string); |
41 | 41 |
42 } // namespace model_test_utils | 42 } // namespace model_test_utils |
43 | 43 |
44 #endif // CHROME_TEST_MODEL_TEST_UTILS_H_ | 44 #endif // CHROME_TEST_BASE_MODEL_TEST_UTILS_H_ |
OLD | NEW |