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

1 2 3 4 5

  /external/libxml2/doc/examples/
tree2.res 4 <node1>content of node 1</node1>
tree2.c 29 xmlNodePtr root_node = NULL, node = NULL, node1 = NULL;/* node pointers */ local
52 xmlNewChild(root_node, NULL, BAD_CAST "node1",
75 node1 = xmlNewText(BAD_CAST
77 xmlAddChild(node, node1);
88 node1 = xmlNewChild(node, NULL, BAD_CAST buff, NULL);
89 xmlNewProp(node1, BAD_CAST "odd", BAD_CAST((j % 2) ? "no" : "yes"));
  /frameworks/base/libs/hwui/tests/unit/
DamageAccumulatorTests.cpp 86 RenderNode node1; local
87 node1.animatorProperties().setLeftTopRightBottom(50, 50, 500, 500);
88 node1.animatorProperties().updateMatrix();
89 da.pushTransform(&node1);
106 RenderNode node1; local
107 node1.animatorProperties().setLeftTopRightBottom(50, 50, 500, 500);
108 node1.animatorProperties().setClipToBounds(true);
109 node1.animatorProperties().updateMatrix();
110 da.pushTransform(&node1);
  /external/apache-xml/src/main/java/org/apache/xml/utils/
DOMOrder.java 36 * -- that is, if node1.getUid()<node2.getUid(), node1 comes before
37 * node2, and if they're equal node1 and node2 are the same node. No
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);
  /frameworks/support/design/jvm-tests/src/android/support/design/widget/
DirectedAcyclicGraphTest.java 116 final TestNode node1 = new TestNode("1"); local
119 mGraph.addNode(node1);
123 mGraph.addEdge(node1, edge);
126 // Now assert the getOutgoingEdges returns a list which has 2 elements (node1 & node2)
130 assertTrue(outgoingEdges.contains(node1));
151 final TestNode node1 = new TestNode("1"); local
154 mGraph.addNode(node1);
163 assertFalse(mGraph.contains(node1));
170 final TestNode node1 = new TestNode("A"); local
176 mGraph.addNode(node1);
    [all...]
  /prebuilts/go/darwin-x86/src/runtime/
lfstack.go 15 if node1, _ := lfstackUnpack(new); node1 != node {
16 println("runtime: lfstackpush invalid packing: node=", node, " cnt=", hex(node.pushcnt), " packed=", hex(new), " -> node=", node1, "\n")
  /prebuilts/go/linux-x86/src/runtime/
lfstack.go 15 if node1, _ := lfstackUnpack(new); node1 != node {
16 println("runtime: lfstackpush invalid packing: node=", node, " cnt=", hex(node.pushcnt), " packed=", hex(new), " -> node=", node1, "\n")
  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/Gimpact/
btGImpactBvh.cpp 360 int node0 ,int node1, bool complete_primitive_tests)
365 boxset1->getNodeBound(node1,box1);
379 int node0, int node1, bool complete_primitive_tests)
386 node0,node1,complete_primitive_tests) ==false) return;//avoid colliding internal nodes
390 if(boxset1->isLeafNode(node1))
394 boxset0->getNodeData(node0),boxset1->getNodeData(node1));
405 node0,boxset1->getLeftNode(node1),false);
411 node0,boxset1->getRightNode(node1),false);
418 if(boxset1->isLeafNode(node1))
425 boxset0->getLeftNode(node0),node1,false)
    [all...]
btGImpactQuantizedBvh.cpp 389 int node0 ,int node1, bool complete_primitive_tests)
394 boxset1->getNodeBound(node1,box1);
408 int node0, int node1, bool complete_primitive_tests)
415 node0,node1,complete_primitive_tests) ==false) return;//avoid colliding internal nodes
419 if(boxset1->isLeafNode(node1))
423 boxset0->getNodeData(node0),boxset1->getNodeData(node1));
434 node0,boxset1->getLeftNode(node1),false);
440 node0,boxset1->getRightNode(node1),false);
447 if(boxset1->isLeafNode(node1))
454 boxset0->getLeftNode(node0),node1,false)
    [all...]
gim_box_set.h 507 SIMD_FORCE_INLINE void retrieve_node1_triangle(GUINT node1)
510 m_boxset1->getNodeTriangle(node1,m_tri1);
529 SIMD_FORCE_INLINE void retrieve_node1_info(GUINT node1)
531 if(node1 == current_node1) return;
532 m_boxset1->getNodeBound(node1,m_box1);
533 node1_is_leaf = m_boxset1->isLeafNode(node1);
535 current_node1 = node1;
538 SIMD_FORCE_INLINE bool node_collision(GUINT node0 ,GUINT node1)
541 retrieve_node1_info(node1);
563 retrieve_node1_triangle(node1);
592 GUINT node1 = stack_collisions.back().m_index2; 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/clang/test/SemaCXX/
arrow-operator.cpp 35 Node** node1; local
36 Line_Segment(node1->Location()); // expected-error {{not a structure or union}}
  /external/libweave/src/notification/
xml_node_unittest.cc 63 <node1 id="1"><node2 id="2"><node3 id="3"/></node2></node1>
143 node = node_->FindFirstChild("node1/node2/node3", false);
148 node = node_->FindFirstChild("node1/node2/node3", true);
190 children = node_->FindChildren("node1/node2/node3", false);
195 children = node_->FindChildren("node1/node2/node3", true);
  /external/v8/test/cctest/
test-profile-generator.cc 139 ProfileNode* node1 = helper.Walk(&entry1); local
140 CHECK(node1);
141 CHECK_EQ(0u, node1->self_ticks());
146 CHECK_NE(node1, node2);
152 CHECK_NE(node1, node3);
157 CHECK_EQ(node1, helper.Walk(&entry1));
160 CHECK_EQ(0u, node1->self_ticks());
169 CHECK_EQ(node1, helper.Walk(&entry1));
200 ProfileNode* node1 = single_child_helper.Walk(&entry1); local
201 CHECK(node1);
391 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...]
  /external/v8/test/unittests/compiler/
schedule-unittest.cc 107 Node* node1 = Node::New(zone(), 1, &kDummyOperator, 0, nullptr, false); local
108 EXPECT_EQ(nullptr, schedule.block(node1));
109 schedule.AddNode(start, node1);
110 EXPECT_EQ(start, schedule.block(node1));
111 EXPECT_THAT(*start, ElementsAre(node0, node1));
113 EXPECT_TRUE(schedule.SameBasicBlock(node0, node1));
state-values-utils-unittest.cc 139 Node* node1 = builder.GetNodeForValues( local
145 EXPECT_EQ(node1, node2);
  /external/snakeyaml/src/test/java/org/yaml/snakeyaml/
YamlComposeTest.java 43 ScalarNode node1 = (ScalarNode) node.getValue().get(0).getKeyNode(); local
44 assertEquals("abc", node1.getValue());
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/
cgraph.h 847 symtab_node node1 = (symtab_node) node->symbol.next; local
848 for (; node1; node1 = node1->symbol.next)
849 if (varpool_node *vnode1 = dyn_cast <varpool_node> (node1))
877 symtab_node node1 = (symtab_node) node->symbol.next; local
878 for (; node1; node1 = node1->symbol.next)
880 varpool_node *vnode1 = dyn_cast <varpool_node> (node1)
910 symtab_node node1 = (symtab_node) node->symbol.next; local
942 symtab_node node1 = (symtab_node) node->symbol.next; local
972 symtab_node node1 = (symtab_node) node->symbol.next; local
1013 symtab_node node1 = node->symbol.next; local
    [all...]
  /external/v8/src/compiler/
value-numbering-reducer.cc 96 // 1. We insert node1 with op1 and certain inputs at index i.
98 // 3. Some other reducer changes node1 to op2 and the inputs from node2.
100 // Now we are called again to reduce node1, and we would return NoChange
101 // in this case because we find node1 first, but what we should actually
  /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/snakeyaml/src/test/java/org/pyyaml/
PyStructureTest.java 124 private void compareNodes(Node node1, Node node2) {
125 assertEquals(node1.getClass(), node2.getClass());
126 if (node1 instanceof ScalarNode) {
127 ScalarNode scalar1 = (ScalarNode) node1;
132 if (node1 instanceof SequenceNode) {
133 SequenceNode seq1 = (SequenceNode) node1;
143 MappingNode seq1 = (MappingNode) node1;
  /external/llvm/lib/Target/AArch64/
AArch64PBQPRegAlloc.cpp 174 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); local
178 &G.getNodeMetadata(node1).getAllowedRegs();
182 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2);
203 G.addEdge(node1, node2, std::move(costs));
208 std::swap(node1, node2);
261 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); local
272 &G.getNodeMetadata(node1).getAllowedRegs();
278 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2);
285 std::swap(node1, node2);
  /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...]

Completed in 1176 milliseconds

1 2 3 4 5