algorithm-nearest-in-parent

Revision as of 01:44, 11 October 2010 by Xanthir (Talk | contribs)
(diff) ←Older revision | Current revision (diff) | Newer revision→ (diff)

Jump to: navigation, search

This algorithm will return all the elements in a DOM that meet the condition_test by checking each node in the parent hierarchy above the start_element on up. Once a result is found at any level of the parent hierarchy, we stop checking.

def nearest_in_parent(start_element, condition_test):
  p = start_element.parent
  while p:
    for c in p.children:
      if condition_test(c):
        return c
    p = p.parent
  return None
algorithm-nearest-in-parent was last modified: Wednesday, December 31st, 1969

Views