/external/chromium_org/net/tools/tld_cleanup/ |
H A D | make_dafsa_unittest.py | 96 node1 = ( 'a', [ node2 ] ) 97 source = [ node1 ] 105 node1 = ( 'a', [ node2 ] ) 106 source = [ node1 ] 115 node1 = ( 'a', [ node2 ] ) 116 source = [ node1, node3 ] 123 node1 = None 125 self.assertEqual(make_dafsa.to_words(node1), words) 132 node1 = ( 'ab', [ None ] ) 134 self.assertEqual(make_dafsa.to_words(node1), word [all...] |
/external/chromium_org/mojo/public/tools/bindings/pylib/mojom_tests/parse/ |
H A D | ast_unittest.py | 50 node1 = ast.NodeBase(filename="hello.mojom", lineno=123) 52 self.assertEquals(node1, node2) 53 self.assertEquals(node2, node1) 56 self.assertFalse(node1 != node2) 57 self.assertFalse(node2 != node1) 61 self.assertEquals(node1.filename, "hello.mojom") 62 self.assertEquals(node1.lineno, 123) 69 self.assertNotEqual(node1, node3) 70 self.assertNotEqual(node3, node1) 72 self.assertFalse(node1 [all...] |
/external/chromium_org/tools/memory_inspector/memory_inspector/classification/ |
H A D | rules_unittest.py | 65 node1 = rt.children[0] 70 self.assertEqual(node1.name, '1') 71 self.assertEqual(node1.filters['mmap-file'], '/foo/1') 72 self.assertEqual(node1.filters['foo'], 'bar') 78 self.assertEqual(len(node1.children), 3) 79 self.assertEqual(node1.children[0].name, '1/1') 80 self.assertEqual(node1.children[1].name, '1/2') 81 self.assertEqual(node1.children[2].name, '1-other')
|
/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/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/tools/gyp/tools/ |
H A D | pretty_vcproj.py | 222 def SeekToNode(node1, child2): 234 for sub_node in node1.childNodes: 244 def MergeAttributes(node1, node2): 253 value1 = node1.getAttribute(name) 258 node1.setAttribute(name, ';'.join([value1, value2])) 261 node1.setAttribute(name, value2) 266 node1.removeAttribute(name) 269 def MergeProperties(node1, node2): 270 MergeAttributes(node1, node2) 272 child1 = SeekToNode(node1, child [all...] |
/external/chromium_org/components/enhanced_bookmarks/ |
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...] |
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());
|
/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/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;
|
H A D | ax_tree_source_ash.h | 42 virtual bool IsEqual(views::AXAuraObjWrapper* node1,
|
/external/opencv/cvaux/src/ |
H A D | cvlee.cpp | 105 CvVoronoiNodeInt* node1; member in struct:CvVoronoiSiteInt 116 CvVoronoiNodeInt* node1; member in struct:CvVoronoiEdgeInt 674 (this marked point is pEdge1->node1->node). 695 (this marked point is pEdge1->node1->node). 717 (this marked point is pEdge1->node1->node). 739 (this marked point is pEdge1->node1->node). 761 (this marked point is pEdge1->node1->node). 783 (this marked point is pEdge1->node1->node). 804 (this marked point is pEdge1->node1->node). 826 (this marked point is pEdge1->node1 [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/ui/accessibility/ |
H A D | ax_serializable_tree.cc | 50 virtual bool IsEqual(const AXNode* node1, 52 return node1 == node2;
|
H A D | ax_tree_source.h | 49 virtual bool IsEqual(AXNodeSource 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());
|
/external/chromium_org/tools/grit/grit/gather/ |
H A D | policy_json.py | 38 for node1 in placeholder.childNodes: 39 if (node1.nodeType == minidom.Node.TEXT_NODE): 40 text.append(node1.data) 41 elif (node1.nodeType == minidom.Node.ELEMENT_NODE and 42 node1.tagName == 'ex'): 43 for node2 in node1.childNodes:
|
/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/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/chromium_org/content/renderer/accessibility/ |
H A D | blink_ax_tree_source.h | 44 virtual bool IsEqual(blink::WebAXObject node1,
|
/external/chromium_org/third_party/WebKit/Source/core/testing/ |
H A D | PrivateScriptTest.js | 67 PrivateScriptTestPrototype.appendChild = function(node1, node2) { 68 node1.appendChild(node2);
|
/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...] |
/external/chromium_org/third_party/angle/src/compiler/translator/ |
H A D | Intermediate.cpp | 348 return nodePair.node1 ? setAggregateOperator( 349 nodePair.node1, EOpSequence, nodePair.node1->getLine()) : NULL; 359 cond, nodePair.node1, nodePair.node2);
|
/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;
|