Searched refs:new_node (Results 1 - 25 of 29) sorted by relevance

12

/external/antlr/antlr-3.4/runtime/Ruby/test/unit/
H A Dtest-trees.rb163 r0 = new_node new_token(101)
164 r1 = new_node new_token(102)
166 r1.add_child(new_node new_token(103))
167 r2 = new_node new_token(106)
168 r2.add_child new_node( new_token 107 )
170 r0.add_child new_node( new_token 104 )
171 r0.add_child new_node( new_token 105 )
189 r0 = new_node new_token(101)
190 r1 = new_node new_token(102)
192 r1.add_child new_node( new_toke
306 def new_node(token) method in class:TestTreeNodeStream
450 def new_node(token) method in class:TestCommonTreeNodeStream
786 def new_node(token) method in class:TestCommonTree
[all...]
/external/oprofile/libdb/
H A Ddb_insert.c23 odb_index_t new_node; local
36 new_node = data->descr->current_size;
38 node = &data->node_base[new_node];
44 data->hash_base[index] = new_node;
/external/chromium/chrome/browser/ui/views/bookmarks/
H A Dbookmark_editor_view_unittest.cc265 const BookmarkNode* new_node = bb_node->GetChild(3); local
267 EXPECT_EQ(ASCIIToUTF16("new_a"), new_node->GetTitle());
268 EXPECT_TRUE(GURL(base_path() + "a") == new_node->GetURL());
285 const BookmarkNode* new_node = other_node->GetChild(0); local
287 EXPECT_EQ(ASCIIToUTF16("new_a"), new_node->GetTitle());
288 EXPECT_TRUE(GURL(base_path() + "a") == new_node->GetURL());
304 const BookmarkNode* new_node = other_node->GetChild(0); local
306 EXPECT_EQ(ASCIIToUTF16("new_a"), new_node->GetTitle());
326 const BookmarkNode* new_node = local
328 EXPECT_EQ(BookmarkNode::FOLDER, new_node
356 const BookmarkNode* new_node = model_->other_node()->GetChild(2); local
[all...]
H A Dbookmark_editor_view.cc460 EditorNode* new_node = new EditorNode(); local
461 new_node->set_title(
463 new_node->value = 0;
464 // new_node is now owned by parent.
465 tree_model_->Add(parent, new_node, parent->child_count());
466 return new_node;
/external/chromium/testing/gtest/samples/
H A Dsample3-inl.h118 QueueNode<E>* new_node = new QueueNode<E>(element); local
121 head_ = last_ = new_node;
124 last_->next_ = new_node;
125 last_ = new_node;
/external/gtest/samples/
H A Dsample3-inl.h118 QueueNode<E>* new_node = new QueueNode<E>(element); local
121 head_ = last_ = new_node;
124 last_->next_ = new_node;
125 last_ = new_node;
/external/protobuf/gtest/samples/
H A Dsample3-inl.h118 QueueNode<E> * new_node = new QueueNode<E>(element); local
121 head_ = last_ = new_node;
124 last_->next_ = new_node;
125 last_ = new_node;
/external/libsepol/src/
H A Dnode_record.c602 sepol_node_t *new_node = NULL; local
603 if (sepol_node_create(handle, &new_node) < 0)
607 new_node->addr = malloc(node->addr_sz);
608 new_node->mask = malloc(node->mask_sz);
609 if (!new_node->addr || !new_node->mask)
612 memcpy(new_node->addr, node->addr, node->addr_sz);
613 memcpy(new_node->mask, node->mask, node->mask_sz);
614 new_node->addr_sz = node->addr_sz;
615 new_node
[all...]
H A Dconditional.c143 cond_node_t *new_node; local
146 new_node = (cond_node_t *)malloc(sizeof(cond_node_t));
147 if (!new_node) {
150 memset(new_node, 0, sizeof(cond_node_t));
153 new_node->expr = cond_copy_expr(node->expr);
154 if (!new_node->expr) {
155 free(new_node);
158 new_node->cur_state = cond_evaluate_expr(p, new_node->expr);
159 new_node
[all...]
H A Dlink.c1492 cond_node_t *cur, *new_node = NULL, *tail; local
1500 new_node = (cond_node_t *) malloc(sizeof(cond_node_t));
1501 if (!new_node) {
1504 memset(new_node, 0, sizeof(cond_node_t));
1506 new_node->cur_state = cur->cur_state;
1507 new_node->expr = cond_copy_expr(cur->expr);
1508 if (!new_node->expr)
1511 for (cur_expr = new_node->expr; cur_expr != NULL;
1520 new_node->nbools = cur->nbools;
1526 new_node
[all...]
/external/chromium/sdch/open-vcdiff/src/gtest/src/
H A Dgtest-internal-inl.h239 ListNode<E> * new_node = new ListNode<E>(element); local
242 head_ = last_ = new_node;
245 last_->next_ = new_node;
246 last_ = new_node;
253 ListNode<E>* const new_node = new ListNode<E>(element); local
256 head_ = last_ = new_node;
259 new_node->next_ = head_;
260 head_ = new_node;
298 ListNode<E>* const new_node = new ListNode<E>(element); local
299 new_node
[all...]
/external/chromium/chrome/browser/ui/gtk/bookmarks/
H A Dbookmark_editor_gtk_unittest.cc283 const BookmarkNode* new_node = bb_node->GetChild(3); local
284 EXPECT_EQ(ASCIIToUTF16("new_a"), new_node->GetTitle());
285 EXPECT_TRUE(GURL(base_path() + "a") == new_node->GetURL());
304 const BookmarkNode* new_node = other_node->GetChild(0); local
306 EXPECT_EQ(ASCIIToUTF16("new_a"), new_node->GetTitle());
307 EXPECT_TRUE(GURL(base_path() + "a") == new_node->GetURL());
323 const BookmarkNode* new_node = other_node->GetChild(0); local
324 EXPECT_EQ(ASCIIToUTF16("new_a"), new_node->GetTitle());
/external/chromium/chrome/browser/bookmarks/
H A Dbookmark_model_unittest.cc189 const BookmarkNode* new_node = model.AddURL(root, 0, title, url); local
194 ASSERT_EQ(title, new_node->GetTitle());
195 ASSERT_TRUE(url == new_node->GetURL());
196 ASSERT_EQ(BookmarkNode::URL, new_node->type());
197 ASSERT_TRUE(new_node == model.GetMostRecentlyAddedNodeForURL(url));
199 EXPECT_TRUE(new_node->id() != root->id() &&
200 new_node->id() != model.other_node()->id());
207 const BookmarkNode* new_node = model.AddFolder(root, 0, title); local
212 ASSERT_EQ(title, new_node->GetTitle());
213 ASSERT_EQ(BookmarkNode::FOLDER, new_node
587 TestNode* new_node = local
[all...]
H A Dbookmark_model.cc383 BookmarkNode* new_node = new BookmarkNode(generate_next_node_id(), local
385 new_node->set_date_folder_modified(Time::Now());
386 new_node->set_title(title);
387 new_node->set_type(BookmarkNode::FOLDER);
389 return AddNode(AsMutable(parent), index, new_node, false);
415 BookmarkNode* new_node = new BookmarkNode(generate_next_node_id(), url); local
416 new_node->set_title(title);
417 new_node->set_date_added(creation_time);
418 new_node->set_type(BookmarkNode::URL);
423 nodes_ordered_by_url_set_.insert(new_node);
[all...]
/external/webkit/Source/JavaScriptCore/wtf/
H A DAVLTree.h154 inline handle subst(handle new_node);
919 AVLTree<Abstractor, maxDepth, BSet>::subst(handle new_node)
930 cmp = cmp_n_n(new_node, h);
940 set_lt(new_node, get_lt(h));
941 set_gt(new_node, get_gt(h));
942 set_bf(new_node, get_bf(h));
946 abs.root = new_node;
950 set_lt(parent, new_node);
952 set_gt(parent, new_node);
/external/valgrind/main/callgrind/
H A Dclo.c221 config_node *new_node; local
224 new_node = new_config(n->name, len);
226 nprev->next = new_node;
228 node->sub_node[ n->name[0]%NODE_DEGREE ] = new_node;
229 new_node->next = n->next;
231 new_node->sub_node[ n->name[len]%NODE_DEGREE ] = n;
242 /* this sub_node of new_node could already be set: chain! */
243 new_sub->next = new_node->sub_node[ name[0]%NODE_DEGREE ];
244 new_node->sub_node[ name[0]%NODE_DEGREE ] = new_sub;
/external/libvpx/vpx_mem/memory_manager/include/
H A Dcavl_impl.h802 L_SC AVL_HANDLE L_(subst)(L_(avl) *l_tree, AVL_HANDLE new_node)
815 cmp = AVL_COMPARE_NODE_NODE(new_node, h);
828 AVL_SET_LESS(new_node, AVL_GET_LESS(h, 0))
829 AVL_SET_GREATER(new_node, AVL_GET_GREATER(h, 0))
830 AVL_SET_BALANCE_FACTOR(new_node, AVL_GET_BALANCE_FACTOR(h))
834 l_tree->root = new_node;
839 AVL_SET_LESS(parent, new_node)
841 AVL_SET_GREATER(parent, new_node)
H A Dcavl_if.h106 L_SC AVL_HANDLE L_(subst)(L_(avl) *tree, AVL_HANDLE new_node); variable
/external/bison/src/
H A Dprint_graph.c177 new_node (&n);
H A Dvcg.h941 void new_node (node *n);
H A Dvcg.c133 new_node (&g->node);
138 new_node (node *n) function
/external/doclava/res/assets/templates/assets/
H A Ddoclava-developer-reference.js98 function new_node(me, mom, text, link, children_data, api_level) function
201 mom.children[i] = new_node(me, mom, node_data[0], node_data[1],
/external/v8/src/
H A Dspaces.cc1979 FreeListNode* new_node = FindNodeFor(size_in_bytes, &new_node_size); local
1980 if (new_node == NULL) return NULL;
1996 reinterpret_cast<Object**>(new_node->address())[i] = Smi::FromInt(0);
2006 ASSERT(!MarkCompactCollector::IsOnEvacuationCandidate(new_node));
2021 owner_->Free(new_node->address() + size_in_bytes + linear_size,
2023 owner_->SetTop(new_node->address() + size_in_bytes,
2024 new_node->address() + size_in_bytes + linear_size);
2028 owner_->SetTop(new_node->address() + size_in_bytes,
2029 new_node->address() + new_node_size);
2036 return new_node;
[all...]
H A Dliveedit-debugger.js689 function ProcessChildren(old_node, new_node) {
691 var new_children = new_node.children;
759 WhyFunctionExpectationsDiffer(old_node.info, new_node.info);
/external/opencv/ml/src/
H A Dmltree.cpp180 data_root = new_node( 0, sample_count, 0, 0 );
300 CV_CALL( data_root = new_node( 0, sample_count, 0, 0 ));
567 root = new_node( 0, 1, 0, 0 );
588 root = new_node( 0, count, 1, 0 );
801 CvDTreeNode* CvDTreeTrainData::new_node( CvDTreeNode* parent, int count, function in class:CvDTreeTrainData
2542 node->left = left = data->new_node( node, nl, new_buf_idx, node->offset );
2543 node->right = right = data->new_node( node, nr, new_buf_idx, node->offset +
3294 CV_CALL( node = data->new_node( parent, 0, 0, 0 ));

Completed in 596 milliseconds

12