HomeSort by relevance Sort by last modified time
    Searched refs:node1 (Results 1 - 25 of 27) sorted by null

1 2

  /external/clang/test/SemaCXX/
arrow-operator.cpp 35 Node** node1; local
36 Line_Segment(node1->Location()); // expected-error {{not a structure or union}}
  /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 &lt;= 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 &lt;= 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 159 ProfileNode* node1 = helper.Walk(&entry1); local
160 CHECK_NE(NULL, node1);
161 CHECK_EQ(0, node1->total_ticks());
162 CHECK_EQ(0, node1->self_ticks());
167 CHECK_NE(node1, node2);
174 CHECK_NE(node1, node3);
180 CHECK_EQ(node1, helper.Walk(&entry1));
183 CHECK_EQ(0, node1->total_ticks());
184 CHECK_EQ(0, node1->self_ticks());
195 CHECK_EQ(node1, helper.Walk(&entry1))
229 ProfileNode* node1 = helper.Walk(&entry1); local
307 ProfileNode* node1 = single_child_helper.Walk(&entry1); local
454 ProfileNode* node1 = token0_helper.Walk(&entry1); local
629 ProfileNode* node1 = top_down_test_helper.Walk(entry1); local
    [all...]
test-heap-profiler.cc 840 // -> node1
859 "node6.a.a.b = node6.b.a; // node1 -> node2\n"
860 "node6.b.a.a = node6.a.a; // node2 -> node1\n"
885 const v8::HeapGraphNode* node1 = local
887 CHECK_NE(NULL, node1);
889 CHECK_EQ(node6, node1->GetDominatorNode());
    [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...]
  /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);
proto.h 75 extern Node *node1(int, Node *);
  /external/llvm/include/llvm/CodeGen/PBQP/
Graph.h 82 NodeItr node1, node2; member in class:PBQP::Graph::EdgeEntry
87 EdgeEntry(NodeItr node1, NodeItr node2, const Matrix &costs)
88 : node1(node1), node2(node2), costs(costs) {}
89 NodeItr getNode1() const { return node1; }
  /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/libxml2/
xpath.c     [all...]
xpointer.c 207 * @node1: the first node
218 xmlXPtrCmpPoints(xmlNodePtr node1, int index1, xmlNodePtr node2, int index2) {
219 if ((node1 == NULL) || (node2 == NULL))
224 if (node1 == node2) {
231 return(xmlXPathCmpNodes(node1, node2));
    [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);
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/
DomUtilities.java 68 * @param node1 the first node to test
72 public static Node getCommonAncestor(Node node1, Node node2) {
74 Node current = node1;
  /sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/eclipse/adt/internal/editors/layout/gle2/
CanvasViewInfoTest.java 486 UiViewElementNode node1 = createNode(rootNode, "childNode1", false); local
488 MergeCookie cookie1 = new MergeCookie(node1);
517 Object cookie = (i % 2) == 0 ? node1 : node2;
538 UiViewElementNode node1 = createNode(rootNode, "childNode1", false); local
540 MergeCookie cookie1 = new MergeCookie(node1);
568 Object cookie = (i % 2) == 0 ? node1 : node2;
601 UiViewElementNode node1 = createNode(rootNode, "childNode1", false); local
604 ViewInfo childView1 = new ViewInfo("childView1", node1, 0, 20, 50, 40);
    [all...]
  /external/bluetooth/glib/gobject/
gboxed.c 77 const BoxedNode *node1 = p1, *node2 = p2; local
79 return G_BSEARCH_ARRAY_CMP (node1->type, node2->type);
gsignal.c 163 static gint handler_lists_cmp (gconstpointer node1,
173 static gint class_closures_cmp (gconstpointer node1,
175 static gint signal_key_cmp (gconstpointer node1,
357 class_closures_cmp (gconstpointer node1,
360 const ClassClosure *c1 = node1, *c2 = node2;
366 handler_lists_cmp (gconstpointer node1,
369 const HandlerList *hlist1 = node1, *hlist2 = node2;
756 signal_key_cmp (gconstpointer node1,
759 const SignalKey *key1 = node1, *key2 = node2;
    [all...]
  /external/libxml2/include/libxml/
xpath.h 447 xmlXPathCmpNodes (xmlNodePtr node1,
  /external/llvm/lib/CodeGen/
RegAllocPBQP.cpp 397 PBQP::Graph::NodeItr node1 = p->getNodeForVReg(dst); local
399 PBQP::Graph::EdgeItr edge = g.findEdge(node1, node2);
401 edge = g.addEdge(node1, node2, PBQP::Matrix(allowed1->size() + 1,
406 std::swap(node1, node2);
  /external/webkit/Source/ThirdParty/ANGLE/src/compiler/
intermediate.h 231 TIntermNode* node1; member in struct:TIntermNodePair
glslang.y     [all...]
Intermediate.cpp 596 return nodePair.node1;
601 TIntermSelection* node = new TIntermSelection(cond, nodePair.node1, nodePair.node2);
    [all...]
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/uimodel/
UiElementNode.java 755 * F.ex. "node1/node2" would find a child "node1" that contains a child "node2" and
    [all...]

Completed in 737 milliseconds

1 2