From a45d18552bec8164457998585c007b49cd360698 Mon Sep 17 00:00:00 2001
From: Bryan Schumaker <bjschuma@gmail.com>
Date: Wed, 10 Nov 2010 08:22:33 -0500
Subject: [PATCH] Find child id once

Rather than computing the child id for every iteration of walking
backwards, we do it once.
---
 libsaria/trees.py | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/libsaria/trees.py b/libsaria/trees.py
index 02d0bc11..6394f020 100644
--- a/libsaria/trees.py
+++ b/libsaria/trees.py
@@ -55,7 +55,8 @@ class DLTree(Tree):
 	def walk_backwards(self, child = None):
 		key = None
 		if child != None:
-			key = [item[0] for item in self.items() if id(item[1]) == id(child)]
+			idc = id(child)
+			key = [i[0] for i in self.items() if id(i[1]) == idc]
 			if self.parent == None:
 				return key
 		ret = self.parent.walk_backwards(self)