Searched refs:node1 (Results 1 - 25 of 47) sorted by relevance

12

/external/chromium_org/chrome/browser/sync/test/integration/
H A Dsync_errors_test.cc31 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,
[all...]
/external/clang/test/SemaCXX/
H A Darrow-operator.cpp35 Node** node1; local
36 Line_Segment(node1->Location()); // expected-error {{not a structure or union}}
/external/chromium_org/tools/gyp/tools/
H A Dpretty_vcproj.py222 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/apache-xml/src/main/java/org/apache/xml/utils/
H A DDOM2Helper.java213 * 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 &lt;= 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 DDOMHelper.java188 * 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 &lt;= 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/v8/test/cctest/
H A Dtest-profile-generator.cc155 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, helpe
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/
H A Dcvlee.cpp105 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/v8/test/cctest/
H A Dtest-profile-generator.cc133 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, helpe
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...]
/external/chromium_org/tools/grit/grit/gather/
H A Dpolicy_json.py38 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/jmonkeyengine/engine/src/test/jme3test/bullet/
H A DTestPhysicsCar.java134 Node node1 = new Node("wheel 1 node");
136 node1.attachChild(wheels1);
139 vehicle.addWheel(node1, new Vector3f(-xOff, yOff, zOff),
166 vehicleNode.attachChild(node1);
H A DTestAttachDriver.java162 Node node1 = new Node("wheel 1 node");
164 node1.attachChild(wheels1);
167 vehicle.addWheel(node1, new Vector3f(-xOff, yOff, zOff),
194 vehicleNode.attachChild(node1);
/external/chromium/chrome/browser/sync/glue/
H A Dbookmark_model_associator.cc48 // Compares the two given nodes and returns whether node1 should appear
50 bool operator()(const BookmarkNode* node1, argument
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/
H A Dcvhistogram.cpp516 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
[all...]
/external/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h86 NodeItr node1, node2; member in class:PBQP::Graph::EdgeEntry
92 EdgeEntry(NodeItr node1, NodeItr node2, const Matrix &costs) argument
93 : node1(node1), node2(node2), costs(costs) {}
94 NodeItr getNode1() const { return node1; }
/external/chromium_org/chrome/browser/sync/glue/
H A Dbookmark_model_associator.cc64 // Compares the two given nodes and returns whether node1 should appear
66 bool operator()(const BookmarkNode* node1, argument
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/
H A Dxpath.c2834 * @node1: the first node
2843 xmlXPathCmpNodes(xmlNodePtr node1, xmlNodePtr node2) { argument
2849 if ((node1 == NULL) || (node2 == NULL))
2854 if (node1 == node2) /* trivial case */
2856 if (node1->type == XML_ATTRIBUTE_NODE) {
2858 attrNode1 = node1;
2859 node1 = node1->parent;
2866 if (node1 == node2) {
2884 if ((node1
2992 xmlXPathCmpNodesExt(xmlNodePtr node1, xmlNodePtr node2) argument
[all...]
/external/libxml2/
H A Dxpath.c2878 * @node1: the first node
2887 xmlXPathCmpNodes(xmlNodePtr node1, xmlNodePtr node2) { argument
2893 if ((node1 == NULL) || (node2 == NULL))
2898 if (node1 == node2) /* trivial case */
2900 if (node1->type == XML_ATTRIBUTE_NODE) {
2902 attrNode1 = node1;
2903 node1 = node1->parent;
2910 if (node1 == node2) {
2928 if ((node1
3036 xmlXPathCmpNodesExt(xmlNodePtr node1, xmlNodePtr node2) argument
[all...]
/external/chromium/chrome/browser/bookmarks/
H A Dbookmark_model_unittest.cc60 void Set(const BookmarkNode* node1, argument
64 this->node1 = node1;
70 void AssertEquals(const BookmarkNode* node1, argument
74 ASSERT_TRUE(this->node1 == node1);
80 const BookmarkNode* node1; member in struct:BookmarkModelTest::ObserverDetails
/external/apache-xml/src/main/java/org/apache/xpath/objects/
H A DXNodeSet.java496 int node1;
499 while (DTM.NULL != (node1 = list1.nextNode()))
501 XMLString s1 = getStringFromNode(node1);
/external/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp373 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/
H A Dbrowser_accessibility_manager.cc227 const AccessibilityNodeData& node1,
235 nodes.push_back(node1);
226 UpdateNodesForTesting( const AccessibilityNodeData& node1, const AccessibilityNodeData& node2 , const AccessibilityNodeData& node3 , const AccessibilityNodeData& node4 , const AccessibilityNodeData& node5 , const AccessibilityNodeData& node6 , const AccessibilityNodeData& node7 ) argument
/external/chromium_org/third_party/bintrees/bintrees/
H A Dctrees.c67 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/linux-tools-perf/
H A Dbuiltin-kmem.c208 int node1, node2; local
222 node1 = cpunode_map[cpu];
224 if (node1 != node2)
/external/chromium_org/third_party/libxml/src/include/libxml/
H A Dxpath.h447 xmlXPathCmpNodes (xmlNodePtr node1,
/external/libxml2/include/libxml/
H A Dxpath.h450 xmlXPathCmpNodes (xmlNodePtr node1,

Completed in 851 milliseconds

12