Searched defs:root_node (Results 1 - 16 of 16) sorted by relevance

/external/chromium_org/ui/accessibility/
H A Dax_tree_unittest.cc46 AXNode* root_node = dst_tree.GetRoot(); local
47 ASSERT_TRUE(root_node != NULL);
48 EXPECT_EQ(root.id, root_node->id());
49 EXPECT_EQ(root.role, root_node->data().role);
51 ASSERT_EQ(2, root_node->child_count());
53 AXNode* button_node = root_node->ChildAtIndex(0);
57 AXNode* checkbox_node = root_node->ChildAtIndex(1);
/external/chromium_org/ui/oak/
H A Doak_tree_model.cc32 WindowNode* root_node = new WindowNode(GetNodeTitleForWindow(root), root); local
33 TreeOfWindows* tree = new TreeOfWindows(root_node);
34 AddChildWindows(root, root_node);
/external/chromium_org/cc/resources/
H A Dworker_pool_perftest.cc76 scoped_ptr<internal::GraphNode> root_node; local
78 root_node = make_scoped_ptr(new internal::GraphNode(root_task, 0u));
87 root_node.get(),
97 if (root_node)
98 graph.set(root_task, root_node.Pass());
/external/chromium_org/tools/cr/cr/
H A Dvisitor.py64 def root_node(self): member in class:Visitor
83 return self.root_node.Resolve(self, key, value)
/external/chromium/chrome/browser/ui/gtk/bookmarks/
H A Dbookmark_tree_model.cc105 const BookmarkNode* root_node = model->root_node(); local
106 for (int i = 0; i < root_node->child_count(); ++i) {
107 AddToTreeStoreAt(root_node->GetChild(i), selected_id, store, selected_iter,
179 const BookmarkNode* root_node = bb_model->root_node(); local
186 for (int j = 0; j < root_node->child_count(); ++j) {
187 const BookmarkNode* node = root_node->GetChild(j);
/external/chromium_org/chrome/browser/android/bookmarks/
H A Dpartner_bookmarks_shim.cc154 void PartnerBookmarksShim::SetPartnerBookmarksRoot(BookmarkNode* root_node) { argument
156 g_partner_model_keeper.Get().partner_bookmarks_root.reset(root_node);
/external/chromium_org/chrome/browser/bookmarks/
H A Dbookmark_utils.cc155 ui::TreeNodeIterator<const BookmarkNode> iterator(model->root_node(),
179 // only children of the root_node.
180 const BookmarkNode* root_node = model->root_node(); local
182 for (int i = 0; i < root_node->child_count(); ++i) {
183 const BookmarkNode* node = root_node->GetChild(i);
199 ui::TreeNodeIterator<const BookmarkNode> iterator(model->root_node());
230 ui::TreeNodeIterator<const BookmarkNode> iterator(model->root_node());
H A Dbookmark_model.h260 const BookmarkNode* root_node() { return &root_; } function in class:BookmarkModel
/external/chromium_org/chrome/browser/ui/gtk/bookmarks/
H A Dbookmark_tree_model.cc118 const BookmarkNode* root_node = model->root_node(); local
119 for (int i = 0; i < root_node->child_count(); ++i) {
120 const BookmarkNode* child = root_node->GetChild(i);
193 const BookmarkNode* root_node = bb_model->root_node(); local
200 for (int j = 0; j < root_node->child_count(); ++j) {
201 const BookmarkNode* node = root_node->GetChild(j);
/external/chromium/chrome/browser/bookmarks/
H A Dbookmark_model.h188 const BookmarkNode* root_node() { return &root_; } function in class:BookmarkModel
/external/chromium_org/components/policy/core/common/
H A Dschema.cc95 const SchemaNode* root_node() const { function in class:policy::Schema::InternalStorage
470 return Schema(storage, storage->root_node());
531 return Schema(storage, storage->root_node());
/external/opencv/cv/src/
H A D_cvkdtree.hpp80 int root_node; // index of root node, -1 if empty tree member in class:CvKDTree
238 : deref(_deref), root_node(-1) {
267 root_node = insert(first, last, ctor);
276 return remove(&root_node, p);
280 print(root_node);
392 if (root_node == -1)
395 // add root_node to bbf_node priority queue;
398 tmp_pq.push_back(bbf_node(root_node, 0));
452 find_ortho_range(root_node, bounds_min, bounds_max, inbounds);
/external/chromium/chrome/browser/ui/views/bookmarks/
H A Dbookmark_editor_view.cc418 EditorNode* root_node = CreateRootNode(); local
419 tree_model_.reset(new EditorTreeModel(root_node));
485 EditorNode* root_node = new EditorNode(std::wstring(), 0); local
486 const BookmarkNode* bb_root_node = bb_model_->root_node();
487 CreateNodes(bb_root_node, root_node);
488 DCHECK(root_node->child_count() == 2);
491 return root_node;
553 bb_model_->root_node(), tree_model_->GetRoot(), parent, &new_parent);
/external/chromium_org/chrome/browser/ui/views/bookmarks/
H A Dbookmark_editor_view.cc411 EditorNode* root_node = CreateRootNode(); local
412 tree_model_.reset(new EditorTreeModel(root_node));
485 EditorNode* root_node = new EditorNode(base::string16(), 0); local
486 const BookmarkNode* bb_root_node = bb_model_->root_node();
487 CreateNodes(bb_root_node, root_node);
488 DCHECK(root_node->child_count() >= 2 && root_node->child_count() <= 3);
491 if (root_node->child_count() == 3)
493 return root_node;
557 bb_model_->root_node(), tree_model
[all...]
/external/chromium_org/chrome/browser/sync/test/integration/
H A Dbookmarks_helper.cc134 ui::TreeNodeIterator<const BookmarkNode> iterator(model->root_node());
335 ui::TreeNodeIterator<const BookmarkNode> iterator_a(model_a->root_node());
336 ui::TreeNodeIterator<const BookmarkNode> iterator_b(model_b->root_node());
361 while (walker != foreign_model->root_node()) {
367 walker = bookmarks_helper::GetVerifierBookmarkModel()->root_node();
581 const BookmarkNode* root_node = GetVerifierBookmarkModel()->root_node(); local
582 for (int i = 0; i < root_node->child_count(); ++i) {
583 const BookmarkNode* permanent_node = root_node->GetChild(i);
663 GetBookmarkModel(profile)->root_node());
[all...]
/external/opencv/cxcore/src/
H A Dcxpersistence.cpp1293 CvFileNode* root_node = (CvFileNode*)cvSeqPush( fs->roots, 0 ); local
1295 CV_CALL( ptr = icvYMLParseValue( fs, ptr, root_node, CV_NODE_NONE, 0 ));
1296 if( !CV_NODE_IS_COLLECTION(root_node->tag) )
2212 CvFileNode* root_node; local
2218 root_node = (CvFileNode*)cvSeqPush( fs->roots, 0 );
2219 CV_CALL( ptr = icvXMLParseValue( fs, ptr, root_node, CV_NODE_NONE ));

Completed in 2836 milliseconds