HomeSort by relevance Sort by last modified time
    Searched refs:next_element (Results 1 - 8 of 8) sorted by null

  /external/chromium-trace/catapult/third_party/html5lib-python/html5lib/treebuilders/
etree_lxml.py 74 next_element = element.getroot()
75 while next_element.getprevious() is not None:
76 next_element = next_element.getprevious()
77 while next_element is not None:
78 serializeElement(next_element, indent + 2)
79 next_element = next_element.getnext()
87 for next_element in element:
88 serializeElement(next_element, indent + 2
    [all...]
  /external/chromium-trace/catapult/third_party/beautifulsoup4/bs4/
element.py 194 self.previous_element.next_element = self
195 self.next_element = None
241 next_element = last_child.next_element
244 self.previous_element.next_element = next_element
245 if next_element is not None:
246 next_element.previous_element = self.previous_element
248 last_child.next_element = None
304 new_child.previous_element.next_element = new_chil
    [all...]
__init__.py 297 most_recent_element.next_element = o
346 self._most_recent_element.next_element = tag
testing.py 169 self.assertEqual(comment, foo.next_element)
254 self.assertEqual("p", soup.h2.string.next_element.name)
580 self.assertEqual("html", soup.contents[0].next_element.name)
  /external/chromium-trace/catapult/third_party/beautifulsoup4/bs4/builder/
_html5lib.py 223 # Determine what this tag's next_element will be once all the children
232 new_parents_last_descendant_next_element = new_parents_last_descendant.next_element
236 new_parents_last_descendant_next_element = new_parent_element.next_element
247 # Fix the last child's next_element and next_sibling
249 last_child.next_element = new_parents_last_descendant_next_element
256 # Now that this element has no children, change its .next_element.
258 element.next_element = final_next_element
  /external/chromium-trace/catapult/third_party/beautifulsoup4/bs4/tests/
test_tree.py 483 self.assertEqual(self.start.next_element, "One")
484 self.assertEqual(self.start.next_element.next_element['id'], "2")
488 self.assertEqual(last.next_element, None)
492 self.assertEqual(self.tree.next_element, None)
602 # Note the difference between next_sibling and next_element.
603 self.assertEqual(self.start.next_element['id'], '1.1')
815 self.assertEqual(new_text.previous_element.next_element, new_text)
816 self.assertEqual(new_text.next_element, None)
831 self.assertEqual(new_text.previous_element.next_element, new_text
    [all...]
  /art/runtime/base/
hash_set.h 324 T& next_element = ElementForIndex(next_index); local
326 if (emptyfn_.IsEmpty(next_element)) {
331 const size_t next_hash = hashfn_(next_element);
349 ElementForIndex(empty_index) = std::move(next_element);
  /external/v8/src/heap/
spaces.cc 606 MemoryChunk* next_element = next_chunk(); local
608 next_element->set_prev_chunk(prev_element);
609 prev_element->set_next_chunk(next_element);
    [all...]

Completed in 156 milliseconds