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

1 2 3 4

  /external/chromium_org/net/tools/tld_cleanup/
make_dafsa_unittest.py 96 node1 = ( 'a', [ node2 ] )
97 source = [ node1 ]
105 node1 = ( 'a', [ node2 ] )
106 source = [ node1 ]
115 node1 = ( 'a', [ node2 ] )
116 source = [ node1, node3 ]
123 node1 = None
125 self.assertEqual(make_dafsa.to_words(node1), words)
132 node1 = ( 'ab', [ None ] )
134 self.assertEqual(make_dafsa.to_words(node1), words
    [all...]
  /external/chromium_org/tools/memory_inspector/memory_inspector/classification/
rules_unittest.py 65 node1 = rt.children[0]
70 self.assertEqual(node1.name, '1')
71 self.assertEqual(node1.filters['mmap-file'], '/foo/1')
72 self.assertEqual(node1.filters['foo'], 'bar')
78 self.assertEqual(len(node1.children), 3)
79 self.assertEqual(node1.children[0].name, '1/1')
80 self.assertEqual(node1.children[1].name, '1/2')
81 self.assertEqual(node1.children[2].name, '1-other')
  /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/extensions/browser/
content_hash_tree_unittest.cc 32 std::string node1 = FakeSignatureWithSeed(1); local
33 nodes.push_back(node1);
34 EXPECT_EQ(node1, ComputeTreeHashRoot(nodes, 16));
42 hash->Update(node1.data(), node1.size());
  /external/chromium_org/chrome/browser/sync/test/integration/
sync_errors_test.cc 94 const BookmarkNode* node1 = AddFolder(0, 0, "title1"); local
95 SetTitle(0, node1, "new_title1");
108 const BookmarkNode* node1 = AddFolder(0, 0, "title1"); local
109 SetTitle(0, node1, "new_title1");
172 const BookmarkNode* node1 = AddFolder(0, 0, "title1"); local
173 SetTitle(0, node1, "new_title1");
209 const BookmarkNode* node1 = AddFolder(0, 0, "title1"); local
210 SetTitle(0, node1, "new_title1");
  /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 &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/chromium_org/chrome/browser/ui/ash/accessibility/
ax_tree_source_ash.cc 78 bool AXTreeSourceAsh::IsEqual(AXAuraObjWrapper* node1,
80 if (!node1 || !node2)
83 return node1->GetID() == node2->GetID() && node1->GetID() != -1;
ax_tree_source_ash.h 42 virtual bool IsEqual(views::AXAuraObjWrapper* node1,
  /external/chromium_org/ui/accessibility/
ax_tree_source.h 49 virtual bool IsEqual(AXNodeSource node1,
ax_serializable_tree.cc 50 virtual bool IsEqual(const AXNode* node1,
52 return node1 == node2;
  /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...]
  /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...]
  /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 202 ScriptC_scriptgroup node1, node2, node3, node4, node5, compare; local
203 node1 = new ScriptC_scriptgroup(mRS);
218 node1.set_memset_toValue(1);
219 node1.forEach_memset(in1);
220 node1.set_memset_toValue(2);
221 node1.forEach_memset(in2);
223 node1.set_arith_operation(2);
232 node1.set_arith_value(5);
237 b.addKernel(node1.getKernelID_arith());
243 b.addConnection(connect, node1.getKernelID_arith(), node2.getKernelID_arith())
    [all...]
  /external/chromium_org/content/renderer/accessibility/
blink_ax_tree_source.h 37 virtual bool IsEqual(blink::WebAXObject node1,
  /external/chromium_org/v8/test/cctest/
test-profile-generator.cc 135 ProfileNode* node1 = helper.Walk(&entry1); local
136 CHECK_NE(NULL, node1);
137 CHECK_EQ(0, node1->self_ticks());
142 CHECK_NE(node1, node2);
148 CHECK_NE(node1, node3);
153 CHECK_EQ(node1, helper.Walk(&entry1));
156 CHECK_EQ(0, node1->self_ticks());
165 CHECK_EQ(node1, helper.Walk(&entry1));
194 ProfileNode* node1 = helper.Walk(&entry1); local
195 CHECK_NE(NULL, node1);
254 ProfileNode* node1 = single_child_helper.Walk(&entry1); local
445 ProfileNode* node1 = top_down_test_helper.Walk(entry1); local
    [all...]
  /external/chromium_org/third_party/WebKit/Source/platform/fonts/
GlyphPageTreeNodeTest.cpp 87 GlyphPageTreeNode* node1 = GlyphPageTreeNode::getRootChild(dataAtoC.get(), kPageNumber); local
88 GlyphPageTreeNode* node2 = node1->getChild(dataCtoE.get(), kPageNumber);
179 GlyphPageTreeNode* node1 = GlyphPageTreeNode::getRootChild(segmentedData1.get(), kPageNumber); local
180 GlyphPageTreeNode* node2 = node1->getChild(segmentedData2.get(), kPageNumber);
207 GlyphPageTreeNode* node1 = GlyphPageTreeNode::getRootChild(segmentedData.get(), kPageNumber); local
208 GlyphPageTreeNode* node2 = node1->getChild(dataBtoD.get(), kPageNumber);
  /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_org/components/bookmarks/browser/
bookmark_utils_unittest.cc 79 const BookmarkNode* node1 = model->AddURL(model->other_node(), local
109 EXPECT_TRUE(nodes[1] == node1);
123 EXPECT_TRUE(nodes[0] == node1);
137 const BookmarkNode* node1 = model->AddURL(model->other_node(), local
154 EXPECT_TRUE(nodes[0] == node1);
173 const BookmarkNode* node1 = model->AddURL(model->other_node(), local
191 EXPECT_TRUE(nodes[0] == node1);
211 const BookmarkNode* node1 = model->AddURL(model->other_node(), local
231 EXPECT_TRUE(nodes[0] == node1);
242 EXPECT_TRUE(nodes[0] == node1);
    [all...]
  /external/chromium_org/mojo/services/public/cpp/view_manager/tests/
view_manager_unittest.cc 455 Node* node1 = Node::Create(window_manager()); local
456 window_manager()->GetRoots().front()->AddChild(node1);
457 ViewManager* embedded = Embed(window_manager(), node1);
471 node1->AddChild(node21);
728 Node* node1 = Node::Create(window_manager()); local
729 window_manager()->GetRoots().front()->AddChild(node1);
732 ViewManager* embedded1 = Embed(window_manager(), node1);
745 Node* node1 = Node::Create(window_manager()); local
746 window_manager()->GetRoots().front()->AddChild(node1);
749 node1->AddChild(node11)
    [all...]
  /art/runtime/
profiler.h 72 bool operator()(StackTrieNode* node1, StackTrieNode* node2) const {
73 MethodReference mr1 = node1->GetMethod();
77 return node1->GetDexPC() < node2->GetDexPC();
  /external/chromium_org/third_party/webrtc/modules/rtp_rtcp/source/
vp8_partition_aggregator_unittest.cc 21 PartitionTreeNode* node1 = local
24 new PartitionTreeNode(node1, kVector, kNumPartitions, 17);
25 delete node1;

Completed in 1554 milliseconds

1 2 3 4