/external/chromium_org/tools/grit/grit/gather/ |
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/chrome/browser/sync/test/integration/ |
sync_errors_test.cc | 31 const BookmarkNode* node1 = AddFolder(0, 0, L"title1"); local 32 SetTitle(0, node1, L"new_title1"); 45 const BookmarkNode* node1 = AddFolder(0, 0, L"title1"); local 46 SetTitle(0, node1, L"new_title1"); 60 const BookmarkNode* node1 = AddFolder(0, 0, L"title1"); local 61 SetTitle(0, node1, L"new_title1"); 119 const BookmarkNode* node1 = AddFolder(0, 0, L"title1"); local 120 SetTitle(0, node1, L"new_title1"); 191 const BookmarkNode* node1 = AddFolder(0, 0, L"title1"); local 192 SetTitle(0, node1, L"new_title1") [all...] |
/external/clang/test/SemaCXX/ |
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/ |
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, child2 [all...] |
/external/apache-xml/src/main/java/org/apache/xml/utils/ |
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) 234 if(node1 instanceof DOMOrder && node2 instanceof DOMOrder) 236 int index1 = ((DOMOrder) node1).getUid(); 246 return DOMHelper.isNodeAfter(node1, node2);
|
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) 206 if (node1 == node2 || isNodeTheSame(node1, node2)) 212 Node parent1 = getParentOfNode(node1); 219 isNodeAfter = isNodeAfterSibling(parent1, node1, node2); 263 Node startNode1 = node1, startNode2 = node2 [all...] |
/external/v8/test/cctest/ |
test-profile-generator.cc | 155 ProfileNode* node1 = helper.Walk(&entry1); local 156 CHECK_NE(NULL, node1); 157 CHECK_EQ(0, node1->total_ticks()); 158 CHECK_EQ(0, node1->self_ticks()); 163 CHECK_NE(node1, node2); 170 CHECK_NE(node1, node3); 176 CHECK_EQ(node1, helper.Walk(&entry1)); 179 CHECK_EQ(0, node1->total_ticks()); 180 CHECK_EQ(0, node1->self_ticks()); 191 CHECK_EQ(node1, helper.Walk(&entry1)) 225 ProfileNode* node1 = helper.Walk(&entry1); local 303 ProfileNode* node1 = single_child_helper.Walk(&entry1); local 450 ProfileNode* node1 = token0_helper.Walk(&entry1); local 626 ProfileNode* node1 = top_down_test_helper.Walk(entry1); local [all...] |
/external/opencv/cvaux/src/ |
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). [all...] |
/external/chromium_org/v8/test/cctest/ |
test-profile-generator.cc | 133 ProfileNode* node1 = helper.Walk(&entry1); local 134 CHECK_NE(NULL, node1); 135 CHECK_EQ(0, node1->total_ticks()); 136 CHECK_EQ(0, node1->self_ticks()); 141 CHECK_NE(node1, node2); 148 CHECK_NE(node1, node3); 154 CHECK_EQ(node1, helper.Walk(&entry1)); 157 CHECK_EQ(0, node1->total_ticks()); 158 CHECK_EQ(0, node1->self_ticks()); 169 CHECK_EQ(node1, helper.Walk(&entry1)) 200 ProfileNode* node1 = helper.Walk(&entry1); local 277 ProfileNode* node1 = single_child_helper.Walk(&entry1); local 492 ProfileNode* node1 = top_down_test_helper.Walk(entry1); local [all...] |
/packages/apps/Nfc/nci/jni/ |
RouteDataSet.cpp | 171 xmlNodePtr node1; local 184 node1 = xmlDocGetRootElement (doc); 185 if (node1 == NULL) 190 ALOGD ("%s: root=%s", fn, node1->name); 192 node1 = node1->xmlChildrenNode; 193 while (node1) //loop through all elements in <Routes ... 195 if (xmlStrcmp(node1->name, (const xmlChar*) "Route")==0) 197 xmlChar* value = xmlGetProp (node1, (const xmlChar*) "Type"); 201 xmlNodePtr node2 = node1->xmlChildrenNode [all...] |
/cts/tests/tests/renderscript/src/android/renderscript/cts/ |
ScriptGroupTest.java | 204 ScriptC_scriptgroup node1, node2, node3, node4, node5, compare; local 205 node1 = new ScriptC_scriptgroup(mRS); 220 node1.set_memset_toValue(1); 221 node1.forEach_memset(in1); 222 node1.set_memset_toValue(2); 223 node1.forEach_memset(in2); 225 node1.set_arith_operation(2); 234 node1.set_arith_value(5); 239 b.addKernel(node1.getKernelID_arith()); 245 b.addConnection(connect, node1.getKernelID_arith(), node2.getKernelID_arith()) [all...] |
/external/jmonkeyengine/engine/src/test/jme3test/bullet/ |
TestPhysicsCar.java | 134 Node node1 = new Node("wheel 1 node"); local 136 node1.attachChild(wheels1); 139 vehicle.addWheel(node1, new Vector3f(-xOff, yOff, zOff), 166 vehicleNode.attachChild(node1);
|
TestAttachDriver.java | 162 Node node1 = new Node("wheel 1 node"); local 164 node1.attachChild(wheels1); 167 vehicle.addWheel(node1, new Vector3f(-xOff, yOff, zOff), 194 vehicleNode.attachChild(node1);
|
/ndk/sources/host-tools/nawk-20071023/ |
parse.c | 50 Node *node1(int a, Node *b) function 100 x = node1(a,b); 136 x = node1(a,b); 174 x = node1(0, (Node *) a);
|
/external/chromium/chrome/browser/sync/glue/ |
bookmark_model_associator.cc | 48 // Compares the two given nodes and returns whether node1 should appear 50 bool operator()(const BookmarkNode* node1, 52 DCHECK(node1); 56 if (node1->is_folder() != node2->is_folder()) 57 return node1->is_folder(); 59 int result = node1->GetTitle().compare(node2->GetTitle()); 63 return node1->GetURL() < node2->GetURL();
|
/external/opencv/cv/src/ |
cvhistogram.cpp | 516 CvSparseNode *node1, *node2; local 527 for( node1 = cvInitSparseMatIterator( mat1, &iterator ); 528 node1 != 0; node1 = cvGetNextSparseNode( &iterator )) 530 double v1 = *(float*)CV_NODE_VAL(mat1,node1); 531 uchar* node2_data = cvPtrND( mat2, CV_NODE_IDX(mat1,node1), 0, 0, &node1->hashval ); 559 for( node1 = cvInitSparseMatIterator( mat1, &iterator ); 560 node1 != 0; node1 = cvGetNextSparseNode( &iterator ) [all...] |
/external/llvm/include/llvm/CodeGen/PBQP/ |
Graph.h | 86 NodeItr node1, node2; member in class:PBQP::Graph::EdgeEntry 92 EdgeEntry(NodeItr node1, NodeItr node2, const Matrix &costs) 93 : node1(node1), node2(node2), costs(costs) {} 94 NodeItr getNode1() const { return node1; }
|
/external/chromium_org/chrome/browser/sync/glue/ |
bookmark_model_associator.cc | 64 // Compares the two given nodes and returns whether node1 should appear 66 bool operator()(const BookmarkNode* node1, 68 DCHECK(node1); 72 if (node1->is_folder() != node2->is_folder()) 73 return node1->is_folder(); 75 int result = node1->GetTitle().compare(node2->GetTitle()); 79 return node1->url() < node2->url();
|
/external/chromium_org/third_party/libxml/src/ |
xpath.c | [all...] |
/external/libxml2/ |
xpath.c | [all...] |
/external/chromium/chrome/browser/bookmarks/ |
bookmark_model_unittest.cc | 60 void Set(const BookmarkNode* node1, 64 this->node1 = node1; 70 void AssertEquals(const BookmarkNode* node1, 74 ASSERT_TRUE(this->node1 == node1); 80 const BookmarkNode* node1; member in struct:BookmarkModelTest::ObserverDetails [all...] |
/external/apache-xml/src/main/java/org/apache/xpath/objects/ |
XNodeSet.java | 496 int node1; local 499 while (DTM.NULL != (node1 = list1.nextNode())) 501 XMLString s1 = getStringFromNode(node1);
|
/external/llvm/lib/CodeGen/ |
RegAllocPBQP.cpp | 373 PBQP::Graph::NodeItr node1 = p->getNodeForVReg(dst); local 375 PBQP::Graph::EdgeItr edge = g.findEdge(node1, node2); 377 edge = g.addEdge(node1, node2, PBQP::Matrix(allowed1->size() + 1, 382 std::swap(node1, node2);
|
/external/chromium_org/content/browser/accessibility/ |
browser_accessibility_manager.cc | 227 const AccessibilityNodeData& node1, 235 nodes.push_back(node1);
|
/sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
CanvasViewInfoTest.java | 487 UiViewElementNode node1 = createNode(rootNode, "childNode1", false); local 489 MergeCookie cookie1 = new MergeCookie(node1); 518 Object cookie = (i % 2) == 0 ? node1 : node2; 539 UiViewElementNode node1 = createNode(rootNode, "childNode1", false); local 541 MergeCookie cookie1 = new MergeCookie(node1); 569 Object cookie = (i % 2) == 0 ? node1 : node2; 602 UiViewElementNode node1 = createNode(rootNode, "childNode1", false); local 605 ViewInfo childView1 = new ViewInfo("childView1", node1, 0, 20, 50, 40); [all...] |