algorithm-nearest-in-parent - Revision history

Xanthir: Algorithm was very badly coded.

2010-10-11T01:44:45Z

Algorithm was very badly coded.

← Older revision		Revision as of 01:44, 11 October 2010
Line 5:		Line 5:
	p = start_element.parent		p = start_element.parent
	while p:		while p:
	~~as = []~~		for c in p.children:
	for c in ~~ordered_depth_first_element_iter(~~p):
	if condition_test(c):		if condition_test(c):
	~~as.append(~~c)		return c

	~~if as:~~
	~~return as~~

	p = p.parent		p = p.parent

	return None		return None
	</nowiki></pre>		</nowiki></pre>

Brian: Reverted edits by LimonOrc4t (Talk) to last version by Tantek

2008-12-20T21:16:51Z

Reverted edits by LimonOrc4t (Talk) to last version by Tantek

← Older revision		Revision as of 21:16, 20 December 2008
Line 1:		Line 1:
	~~taerrelgetra~~
	This algorithm will return all the elements in a DOM that meet the <code>condition_test</code> by checking each node in the parent hierarchy above the <code>start_element</code> on up. Once a result is found at any level of the parent hierarchy, we stop checking.		This algorithm will return all the elements in a DOM that meet the <code>condition_test</code> by checking each node in the parent hierarchy above the <code>start_element</code> on up. Once a result is found at any level of the parent hierarchy, we stop checking.

LimonOrc4t: liraccvie

2008-12-19T17:58:39Z

liraccvie

← Older revision		Revision as of 17:58, 19 December 2008
Line 1:		Line 1:
			taerrelgetra
	This algorithm will return all the elements in a DOM that meet the <code>condition_test</code> by checking each node in the parent hierarchy above the <code>start_element</code> on up. Once a result is found at any level of the parent hierarchy, we stop checking.		This algorithm will return all the elements in a DOM that meet the <code>condition_test</code> by checking each node in the parent hierarchy above the <code>start_element</code> on up. Once a result is found at any level of the parent hierarchy, we stop checking.

Tantek: rm categories per how-to-play #16, please do not add MediaWiki Categories in general.

2007-09-02T06:28:02Z

rm categories per how-to-play #16, please do not add MediaWiki Categories in general.

← Older revision		Revision as of 06:28, 2 September 2007
Line 17:		Line 17:
	return None		return None
	</nowiki></pre>		</nowiki></pre>

	~~[[Category:Tools]]~~

CarlaHufstedler: added category

2007-09-01T16:43:12Z

added category

← Older revision		Revision as of 16:43, 1 September 2007
Line 17:		Line 17:
	return None		return None
	</nowiki></pre>		</nowiki></pre>

			[[Category:Tools]]

RyanKing: fixing formatting

2007-06-06T19:27:09Z

fixing formatting

← Older revision		Revision as of 19:27, 6 June 2007
Line 16:		Line 16:

	return None		return None
	</nowiki~~></noprri~~></pre>		</nowiki></pre>

DavidJanes at 10:45, 28 February 2006

2006-02-28T10:45:22Z

New page

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

<pre><nowiki>
def nearest_in_parent(start_element, condition_test):
p = start_element.parent
while p:
as = []
for c in ordered_depth_first_element_iter(p):
if condition_test(c):
as.append(c)

if as:
return as

p = p.parent

return None
</nowiki></noprri></pre>