summaryrefslogtreecommitdiffstats
path: root/bitbake/lib/bb/__init__.py
diff options
context:
space:
mode:
authorRichard Purdie <richard@openedhand.com>2007-08-20 07:48:43 +0000
committerRichard Purdie <richard@openedhand.com>2007-08-20 07:48:43 +0000
commitd8bfa5c6eff1cff34895304a33be671fb141084e (patch)
tree8f63f2cad401f42f5dd30930b0f042aa9c5bdaf8 /bitbake/lib/bb/__init__.py
parente68823a20c6e3b629c947bc7e329e5ea71a9860c (diff)
downloadpoky-d8bfa5c6eff1cff34895304a33be671fb141084e.tar.gz
bitbake: Sync with 1.8.8 release
git-svn-id: https://svn.o-hand.com/repos/poky/trunk@2513 311d38ba-8fff-0310-9ca6-ca027cbcb966
Diffstat (limited to 'bitbake/lib/bb/__init__.py')
-rw-r--r--bitbake/lib/bb/__init__.py16
1 files changed, 13 insertions, 3 deletions
diff --git a/bitbake/lib/bb/__init__.py b/bitbake/lib/bb/__init__.py
index 585eec8875..77b1255c77 100644
--- a/bitbake/lib/bb/__init__.py
+++ b/bitbake/lib/bb/__init__.py
@@ -21,7 +21,7 @@
21# with this program; if not, write to the Free Software Foundation, Inc., 21# with this program; if not, write to the Free Software Foundation, Inc.,
22# 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. 22# 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
23 23
24__version__ = "1.8.7" 24__version__ = "1.8.9"
25 25
26__all__ = [ 26__all__ = [
27 27
@@ -1124,7 +1124,12 @@ class digraph:
1124 1124
1125 def allnodes(self): 1125 def allnodes(self):
1126 "returns all nodes in the dictionary" 1126 "returns all nodes in the dictionary"
1127 return self.dict.keys() 1127 keys = self.dict.keys()
1128 ret = []
1129 for key in keys:
1130 ret.append(key)
1131 ret.sort()
1132 return ret
1128 1133
1129 def firstzero(self): 1134 def firstzero(self):
1130 "returns first node with zero references, or NULL if no such node exists" 1135 "returns first node with zero references, or NULL if no such node exists"
@@ -1168,7 +1173,12 @@ class digraph:
1168 def getparents(self, item): 1173 def getparents(self, item):
1169 if not self.hasnode(item): 1174 if not self.hasnode(item):
1170 return [] 1175 return []
1171 return self.dict[item][1] 1176 parents = self.dict[item][1]
1177 ret = []
1178 for parent in parents:
1179 ret.append(parent)
1180 ret.sort()
1181 return ret
1172 1182
1173 def getchildren(self, item): 1183 def getchildren(self, item):
1174 if not self.hasnode(item): 1184 if not self.hasnode(item):