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

1 2 3 4 5 6 7 8 9

  /frameworks/base/libs/hwui/tests/unit/
DamageAccumulatorTests.cpp 91 RenderNode node2; local
92 node2.animatorProperties().setLeftTopRightBottom(50, 50, 100, 100);
93 node2.animatorProperties().updateMatrix();
94 da.pushTransform(&node2);
112 RenderNode node2; local
113 node2.animatorProperties().setLeftTopRightBottom(50, 50, 100, 100);
114 node2.animatorProperties().setClipToBounds(false);
115 node2.animatorProperties().setRotationX(1.0f);
116 node2.animatorProperties().setRotationY(1.0f);
117 node2.animatorProperties().setRotation(20.0f)
    [all...]
  /external/libxml2/include/libxml/
debugXML.h 128 * @node2: a second node
137 xmlNodePtr node2);
148 xmlNodePtr node2);
153 xmlNodePtr node2);
158 xmlNodePtr node2);
163 xmlNodePtr node2);
171 xmlNodePtr node2);
176 xmlNodePtr node2);
181 xmlNodePtr node2);
188 xmlNodePtr node2);
    [all...]
  /external/snakeyaml/src/test/java/org/yaml/snakeyaml/composer/
ComposerImplTest.java 36 Node node2 = yaml.compose(new StringReader(data2)); local
37 assertNotNull(node2);
38 assertFalse(node.equals(node2));
  /frameworks/support/design/jvm-tests/src/android/support/design/widget/
DirectedAcyclicGraphTest.java 117 final TestNode node2 = new TestNode("2"); local
120 mGraph.addNode(node2);
124 mGraph.addEdge(node2, edge);
126 // Now assert the getOutgoingEdges returns a list which has 2 elements (node1 & node2)
131 assertTrue(outgoingEdges.contains(node2));
152 final TestNode node2 = new TestNode("2"); local
155 mGraph.addNode(node2);
164 assertFalse(mGraph.contains(node2));
171 final TestNode node2 = new TestNode("B"); local
177 mGraph.addNode(node2);
    [all...]
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
TreePatternParser.cs 145 object node2;
146 node2 = adaptor.Create(treeNodeType, text);
147 if (label != null && node2.GetType() == typeof(TreeWizard.TreePattern)) {
148 ((TreeWizard.TreePattern)node2).label = label;
150 if (arg != null && node2.GetType() == typeof(TreeWizard.TreePattern)) {
151 ((TreeWizard.TreePattern)node2).hasTextArg = true;
153 return node2;
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
TreePatternParser.cs 170 object node2;
171 node2 = adaptor.Create( treeNodeType, text );
172 if ( label != null && node2.GetType() == typeof( TreeWizard.TreePattern ) )
174 ( (TreeWizard.TreePattern)node2 ).label = label;
176 if ( arg != null && node2.GetType() == typeof( TreeWizard.TreePattern ) )
178 ( (TreeWizard.TreePattern)node2 ).hasTextArg = true;
180 return node2;
  /external/apache-xml/src/main/java/org/apache/xml/utils/
DOM2Helper.java 212 * Figure out whether node2 should be considered as being later
223 * @param node2 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)
237 int index2 = ((DOMOrder) node2).getUid();
246 return DOMHelper.isNodeAfter(node1, node2);
DOMHelper.java 187 * Figure out whether node2 should be considered as being later
198 * @param node2 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))
213 Node parent2 = getParentOfNode(node2);
219 isNodeAfter = isNodeAfterSibling(parent1, node1, node2);
263 Node startNode1 = node1, startNode2 = node2;
    [all...]
  /packages/apps/Nfc/nci/jni/
RouteDataSet.cpp 201 xmlNodePtr node2 = node1->xmlChildrenNode; local
202 while (node2) //loop all elements in <Route Type="SecElemSelectedRoutes" ...
204 if (xmlStrcmp(node2->name, (const xmlChar*) "Proto")==0)
205 importProtocolRoute (node2, mSecElemRouteDatabase);
206 else if (xmlStrcmp(node2->name, (const xmlChar*) "Tech")==0)
207 importTechnologyRoute (node2, mSecElemRouteDatabase);
208 node2 = node2->next;
214 xmlNodePtr node2 = node1->xmlChildrenNode; local
215 while (node2) //loop all elements in <Route Type="DefaultRoutes" ..
    [all...]
  /external/snakeyaml/src/test/java/org/yaml/snakeyaml/
YamlComposeTest.java 45 ScalarNode node2 = (ScalarNode) node.getValue().get(0).getValueNode(); local
46 assertEquals("56", node2.getValue());
  /external/opencv/cvaux/src/
cvlee.cpp 106 CvVoronoiNodeInt* node2; member in struct:CvVoronoiSiteInt
117 CvVoronoiNodeInt* node2; member in struct:CvVoronoiEdgeInt
    [all...]
  /external/selinux/libsemanage/src/
node_record.c 38 const semanage_node_t * node2)
41 return sepol_node_compare2(node, node2);
47 const semanage_node_t ** node2)
50 return sepol_node_compare2(*node, *node2);
node_internal.h 53 const semanage_node_t ** node2);
  /external/valgrind/include/
pub_tool_hashtable.h 75 typedef Word (*HT_Cmp_t) ( const void* node1, const void* node2 );
  /external/llvm/lib/Target/AArch64/
AArch64PBQPRegAlloc.cpp 175 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(Ra); local
180 &G.getNodeMetadata(node2).getAllowedRegs();
182 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2);
203 G.addEdge(node1, node2, std::move(costs));
207 if (G.getEdgeNode1Id(edge) == node2) {
208 std::swap(node1, node2);
274 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(r); local
276 &G.getNodeMetadata(node2).getAllowedRegs();
278 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2);
284 if (G.getEdgeNode1Id(edge) == node2) {
    [all...]
  /external/v8/test/unittests/interpreter/
bytecode-register-optimizer-unittest.cc 135 BytecodeNode node2(Bytecode::kReturn);
136 optimizer()->Write(&node2);
157 BytecodeNode node2(Bytecode::kReturn);
158 optimizer()->Write(&node2);
175 BytecodeNode node2(Bytecode::kCallJSRuntime, 0, temp0.ToOperand(), 1);
176 optimizer()->Write(&node2);
194 BytecodeNode node2(Bytecode::kMov, parameter.ToOperand(), temp1.ToOperand());
195 optimizer()->Write(&node2);
  /external/v8/tools/gyp/tools/
pretty_vcproj.py 244 def MergeAttributes(node1, node2):
246 if not node2.attributes:
249 for (name, value2) in node2.attributes.items():
269 def MergeProperties(node1, node2):
270 MergeAttributes(node1, node2)
271 for child2 in node2.childNodes:
  /external/snakeyaml/src/test/java/examples/jodatime/
JodaTimeFlowStylesTest.java 55 Node node2 = dumper2.represent(bean); local
56 assertEquals(node2.toString(), node1.toString());
59 List<Event> events2 = dumper2.serialize(node2);
  /external/v8/test/cctest/
test-profile-generator.cc 144 ProfileNode* node2 = helper.Walk(&entry1, &entry2); local
145 CHECK(node2);
146 CHECK_NE(node1, node2);
147 CHECK_EQ(0u, node2->self_ticks());
153 CHECK_NE(node2, node3);
158 CHECK_EQ(node2, helper.Walk(&entry1, &entry2));
161 CHECK_EQ(0u, node2->self_ticks());
172 CHECK_EQ(node2, helper.Walk(&entry1, &entry2));
221 ProfileNode* node2 = flat_helper.Walk(&entry1, &entry2); local
222 CHECK(node2);
392 ProfileNode* node2 = top_down_test_helper.Walk(entry1, entry1); local
    [all...]
  /external/v8/test/unittests/compiler/
state-values-utils-unittest.cc 141 Node* node2 = builder.GetNodeForValues( local
145 EXPECT_EQ(node1, node2);
  /external/selinux/libsemanage/include/semanage/
node_record.h 26 const semanage_node_t * node2);
  /external/selinux/libsepol/include/sepol/
node_record.h 24 const sepol_node_t * node2);
  /art/runtime/
profiler.h 72 bool operator()(StackTrieNode* node1, StackTrieNode* node2) const {
74 MethodReference mr2 = node2->GetMethod();
77 return node1->GetDexPC() < node2->GetDexPC();
  /ndk/sources/host-tools/nawk-20071023/
parse.c 60 Node *node2(int a, Node *b, Node *c) function
109 x = node2(a,b,c);
145 x = node2(a,b,c);
  /external/snakeyaml/src/test/java/org/pyyaml/
PyStructureTest.java 124 private void compareNodes(Node node1, Node node2) {
125 assertEquals(node1.getClass(), node2.getClass());
128 ScalarNode scalar2 = (ScalarNode) node2;
134 SequenceNode seq2 = (SequenceNode) node2;
144 MappingNode seq2 = (MappingNode) node2;

Completed in 1505 milliseconds

1 2 3 4 5 6 7 8 9