| /bionic/libc/bionic/ |
| tdestroy.c | 25 node_t *root_node = (node_t *) root; local
26 if (root_node == NULL) return;
27 if (root_node->llink)
28 tdestroy(root_node->llink, destroy_func);
29 if (root_node->rlink)
30 tdestroy(root_node->rlink, destroy_func);
31 (*destroy_func)(root_node->key);
|
| /external/chromium/chrome/browser/ui/gtk/bookmarks/ |
| bookmark_tree_model.cc | 105 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/opencv/cv/src/ |
| _cvkdtree.hpp | 80 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/bookmarks/ |
| bookmark_model.h | 188 const BookmarkNode* root_node() { return &root_; } function in class:BookmarkModel
|
| /external/chromium/chrome/browser/ui/views/bookmarks/ |
| bookmark_editor_view.cc | 418 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/opencv/cxcore/src/ |
| cxpersistence.cpp | 1293 CvFileNode* root_node = (CvFileNode*)cvSeqPush( fs->roots, 0 ); local
2212 CvFileNode* root_node; local
[all...] |
