/external/chromium_org/components/enhanced_bookmarks/ |
H A D | enhanced_bookmark_utils_unittest.cc | 40 const BookmarkNode* node1 = AddBookmark(bookmark_model.get(), "john hopkins"); local 50 CHECK(std::find(result.begin(), result.end(), node1) != result.end());
|
H A D | enhanced_bookmark_model_unittest.cc | 453 const BookmarkNode* node1 = bookmark_model_->AddURL( local 462 bookmark_model_->SetNodeMetaInfo(node1, "stars.id", "c_1"); 466 EXPECT_EQ("c_1", GetId(node1)); 474 EXPECT_EQ("", GetId(node1)); 477 EXPECT_EQ("c_1", GetOldId(node1)); 480 EXPECT_EQ("v2.0", GetVersion(node1)); 491 const BookmarkNode* node1 = local 499 EXPECT_EQ("c_1", GetId(node1)); 511 EXPECT_EQ("", GetId(node1)); 513 EXPECT_EQ("c_1", GetOldId(node1)); 522 const BookmarkNode* node1 = AddBookmark(); local 607 const BookmarkNode* node1 = AddFolder(); local 644 const BookmarkNode* node1 = AddBookmark(); local [all...] |
/external/chromium_org/extensions/browser/ |
H A D | content_hash_tree_unittest.cc | 32 std::string node1 = FakeSignatureWithSeed(1); local 33 nodes.push_back(node1); 34 EXPECT_EQ(node1, ComputeTreeHashRoot(nodes, 16)); 42 hash->Update(node1.data(), node1.size());
|
/external/apache-xml/src/main/java/org/apache/xml/utils/ |
H A D | DOM2Helper.java | 213 * in the document than node1, in Document Order as defined 222 * @param node1 DOM Node to perform position comparison on. 225 * @return false if node2 comes before node1, otherwise return true. 227 * <code>(node1.documentOrderPosition <= node2.documentOrderPosition)</code>. 229 public static boolean isNodeAfter(Node node1, Node node2) argument 234 if(node1 instanceof DOMOrder && node2 instanceof DOMOrder) 236 int index1 = ((DOMOrder) node1).getUid(); 246 return DOMHelper.isNodeAfter(node1, node2);
|
H A D | DOMHelper.java | 188 * in the document than node1, in Document Order as defined 197 * @param node1 DOM Node to perform position comparison on. 200 * @return false if node2 comes before node1, otherwise return true. 202 * <code>(node1.documentOrderPosition <= node2.documentOrderPosition)</code>. 204 public static boolean isNodeAfter(Node node1, Node node2) argument 206 if (node1 == node2 || isNodeTheSame(node1, node2)) 212 Node parent1 = getParentOfNode(node1); 219 isNodeAfter = isNodeAfterSibling(parent1, node1, node2); 263 Node startNode1 = node1, startNode 339 isNodeTheSame(Node node1, Node node2) argument [all...] |
/external/chromium_org/chrome/browser/sync/test/integration/ |
H A D | sync_errors_test.cc | 119 const BookmarkNode* node1 = AddFolder(0, 0, "title1"); local 120 SetTitle(0, node1, "new_title1"); 133 const BookmarkNode* node1 = AddFolder(0, 0, "title1"); local 134 SetTitle(0, node1, "new_title1"); 197 const BookmarkNode* node1 = AddFolder(0, 0, "title1"); local 198 SetTitle(0, node1, "new_title1"); 234 const BookmarkNode* node1 = AddFolder(0, 0, "title1"); local 235 SetTitle(0, node1, "new_title1");
|
/external/chromium_org/third_party/webrtc/modules/rtp_rtcp/source/ |
H A D | vp8_partition_aggregator_unittest.cc | 21 PartitionTreeNode* node1 = local 24 new PartitionTreeNode(node1, kVector, kNumPartitions, 17); 25 delete node1;
|
/external/chromium_org/v8/src/compiler/ |
H A D | graph-reducer-unittest.cc | 80 Node* node1 = graph()->NewNode(&OP1, node0); local 82 EXPECT_CALL(r, Reduce(node1)).WillOnce(Return(Reducer::Replace(node2))); 83 ReduceNode(node1, &r); 85 EXPECT_TRUE(node1->IsDead());
|
H A D | machine-operator-reducer-unittest.cc | 457 Node* node1 = graph()->NewNode(machine()->Word32Or(), shl, shr); local 458 Reduction reduction1 = Reduce(node1); 460 EXPECT_EQ(reduction1.replacement(), node1); 481 Node* node1 = graph()->NewNode(machine()->Word32Or(), shl, shr); local 482 Reduction reduction1 = Reduce(node1); 484 EXPECT_EQ(reduction1.replacement(), node1);
|
/external/chromium_org/v8/test/cctest/compiler/ |
H A D | test-js-constant-cache.cc | 242 Node* node1 = T.Constant(value); local 245 CHECK_EQ(node1, node2); 246 CHECK_EQ(node1, node3);
|
/external/clang/test/SemaCXX/ |
H A D | arrow-operator.cpp | 35 Node** node1; local 36 Line_Segment(node1->Location()); // expected-error {{not a structure or union}}
|
/external/chromium_org/chrome/browser/ui/ash/accessibility/ |
H A D | ax_tree_source_ash.cc | 78 bool AXTreeSourceAsh::IsEqual(AXAuraObjWrapper* node1, argument 80 if (!node1 || !node2) 83 return node1->GetID() == node2->GetID() && node1->GetID() != -1;
|
/external/chromium_org/components/bookmarks/browser/ |
H A D | bookmark_utils_unittest.cc | 79 const BookmarkNode* node1 = model->AddURL(model->other_node(), local 109 EXPECT_TRUE(nodes[1] == node1); 123 EXPECT_TRUE(nodes[0] == node1); 137 const BookmarkNode* node1 = model->AddURL(model->other_node(), local 154 EXPECT_TRUE(nodes[0] == node1); 173 const BookmarkNode* node1 = model->AddURL(model->other_node(), local 191 EXPECT_TRUE(nodes[0] == node1); 211 const BookmarkNode* node1 = model->AddURL(model->other_node(), local 231 EXPECT_TRUE(nodes[0] == node1); 242 EXPECT_TRUE(nodes[0] == node1); [all...] |
H A D | bookmark_model_unittest.cc | 115 void Set(const BookmarkNode* node1, argument 119 node1_ = node1; 125 void ExpectEquals(const BookmarkNode* node1, argument 129 EXPECT_EQ(node1_, node1);
|
/external/chromium_org/third_party/WebKit/Source/platform/fonts/ |
H A D | GlyphPageTreeNodeTest.cpp | 87 GlyphPageTreeNode* node1 = GlyphPageTreeNode::getRootChild(dataAtoC.get(), kPageNumber); local 88 GlyphPageTreeNode* node2 = node1->getChild(dataCtoE.get(), kPageNumber); 179 GlyphPageTreeNode* node1 = GlyphPageTreeNode::getRootChild(segmentedData1.get(), kPageNumber); local 180 GlyphPageTreeNode* node2 = node1->getChild(segmentedData2.get(), kPageNumber); 207 GlyphPageTreeNode* node1 = GlyphPageTreeNode::getRootChild(segmentedData.get(), kPageNumber); local 208 GlyphPageTreeNode* node2 = node1->getChild(dataBtoD.get(), kPageNumber);
|
/external/zopfli/src/zopfli/ |
H A D | katajainen.c | 149 Node* node1 = GetFreeNode(0, maxbits, pool); local 151 InitNode(leaves[1].weight, 2, 0, node1); 154 lists[i][1] = node1;
|
/external/chromium_org/content/browser/accessibility/ |
H A D | browser_accessibility_manager.cc | 15 const ui::AXNodeData& node1, 28 update.nodes.push_back(node1); 14 MakeAXTreeUpdate( const ui::AXNodeData& node1, const ui::AXNodeData& node2 , const ui::AXNodeData& node3 , const ui::AXNodeData& node4 , const ui::AXNodeData& node5 , const ui::AXNodeData& node6 , const ui::AXNodeData& node7 , const ui::AXNodeData& node8 , const ui::AXNodeData& node9 ) argument
|
/external/chromium_org/content/test/ |
H A D | layouttest_support.cc | 328 // Returns True if node1 < node2. 329 bool HistoryEntryCompareLess(HistoryEntry::HistoryNode* node1, argument 331 base::string16 target1 = node1->item().target();
|
/external/chromium_org/v8/test/cctest/ |
H A D | test-profile-generator.cc | 135 ProfileNode* node1 = helper.Walk(&entry1); local 136 CHECK_NE(NULL, node1); 137 CHECK_EQ(0, node1->self_ticks()); 142 CHECK_NE(node1, node2); 148 CHECK_NE(node1, node3); 153 CHECK_EQ(node1, helper.Walk(&entry1)); 156 CHECK_EQ(0, node1->self_ticks()); 165 CHECK_EQ(node1, helper.Walk(&entry1)); 194 ProfileNode* node1 = helper.Walk(&entry1); local 195 CHECK_NE(NULL, node1); 254 ProfileNode* node1 = single_child_helper.Walk(&entry1); local 445 ProfileNode* node1 = top_down_test_helper.Walk(entry1); local [all...] |
/external/chromium_org/chrome/browser/sync/glue/ |
H A D | bookmark_model_associator.cc | 72 // Compares the two given nodes and returns whether node1 should appear 74 bool operator()(const BookmarkNode* node1, argument 76 DCHECK(node1); 80 if (node1->is_folder() != node2->is_folder()) 81 return node1->is_folder(); 85 std::string title1 = base::UTF16ToUTF8(node1->GetTitle()); 97 return node1->url() < node2->url();
|
/external/chromium_org/content/renderer/accessibility/ |
H A D | blink_ax_tree_source.cc | 189 bool BlinkAXTreeSource::IsEqual(blink::WebAXObject node1, argument 191 return node1.equals(node2);
|
/external/chromium_org/third_party/bintrees/bintrees/ |
H A D | ctrees.c | 67 ct_swap_data(node_t *node1, node_t *node2) argument 70 tmp = KEY(node1); 71 KEY(node1) = KEY(node2); 73 tmp = VALUE(node1); 74 VALUE(node1) = VALUE(node2);
|
/external/llvm/lib/CodeGen/ |
H A D | RegAllocPBQP.cpp | 365 PBQPRAGraph::NodeId node1 = p->getNodeForVReg(dst); local 367 PBQPRAGraph::EdgeId edge = g.findEdge(node1, node2); 371 g.addEdge(node1, node2, costs); 374 std::swap(node1, node2);
|
/external/chromium_org/third_party/libxml/src/ |
H A D | xpointer.c | 207 * @node1: the first node 218 xmlXPtrCmpPoints(xmlNodePtr node1, int index1, xmlNodePtr node2, int index2) { argument 219 if ((node1 == NULL) || (node2 == NULL)) 224 if (node1 == node2) { 231 return(xmlXPathCmpNodes(node1, node2));
|
/external/libxml2/ |
H A D | xpointer.c | 207 * @node1: the first node 218 xmlXPtrCmpPoints(xmlNodePtr node1, int index1, xmlNodePtr node2, int index2) { argument 219 if ((node1 == NULL) || (node2 == NULL)) 224 if (node1 == node2) { 231 return(xmlXPathCmpNodes(node1, node2));
|