1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
|
// Copyright 2014 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef COMPONENTS_BOOKMARKS_TEST_BOOKMARK_TEST_HELPERS_H_
#define COMPONENTS_BOOKMARKS_TEST_BOOKMARK_TEST_HELPERS_H_
#include <string>
namespace bookmarks {
class BookmarkModel;
class BookmarkNode;
namespace test {
// Blocks until `model` finishes loading.
void WaitForBookmarkModelToLoad(BookmarkModel* model);
// Return the descendants of `node` as a string useful for verifying node
// modifications. The format of the resulting string is:
//
// result = node " " , { node " " }
// node = bookmark title | folder
// folder = folder title ":[ " { node " " } "]"
// bookmark title = (* string with no spaces *)
// folder title = (* string with no spaces *)
//
// Example: "a f1:[ b d c ] d f2:[ e f g ] h "
//
// (Logically, we should use `string16`s, but it's more convenient for test
// purposes to use (UTF-8) `std::string`s.)
std::string ModelStringFromNode(const BookmarkNode* node);
// Create and add the node hierarchy specified by `model_string` to the
// bookmark node given by `node`. The string has the same format as
// specified for ModelStringFromNode(). The new nodes added to `node`
// are appended to the end of node's existing subnodes, if any.
// `model` must be the model of which `node` is a member.
// NOTE: The string format is very rigid and easily broken if not followed
// exactly (since we're using a very simple parser).
void AddNodesFromModelString(BookmarkModel* model,
const BookmarkNode* node,
const std::string& model_string);
} // namespace test
} // namespace bookmarks
#endif // COMPONENTS_BOOKMARKS_TEST_BOOKMARK_TEST_HELPERS_H_
|
