summaryrefslogtreecommitdiff
path: root/portato/helper.py
diff options
context:
space:
mode:
authorRené 'Necoro' Neumann <necoro@necoro.net>2008-06-26 22:37:56 +0200
committerRené 'Necoro' Neumann <necoro@necoro.net>2008-06-26 22:37:56 +0200
commitc10d60d57fc5c3f0eff217f216ce4f0a0897cb55 (patch)
tree6e7fc01369f1cd9e3a53cf092b4e5a7e50023e3b /portato/helper.py
parent1898e03577eac27a8e27561eda952647643ec69b (diff)
downloadportato-c10d60d57fc5c3f0eff217f216ce4f0a0897cb55.tar.gz
portato-c10d60d57fc5c3f0eff217f216ce4f0a0897cb55.tar.bz2
portato-c10d60d57fc5c3f0eff217f216ce4f0a0897cb55.zip
Removed '__find_resolved_unresolved' as it is quite useless.
Also removed the "find_packages::ws" and moved the content into "world" and "system" to prepare for exchangebility.
Diffstat (limited to 'portato/helper.py')
-rw-r--r--portato/helper.py2
1 files changed, 1 insertions, 1 deletions
diff --git a/portato/helper.py b/portato/helper.py
index 31e25d9..145716e 100644
--- a/portato/helper.py
+++ b/portato/helper.py
@@ -110,7 +110,6 @@ def unique_array(s):
"""Stolen from portage_utils:
lifted from python cookbook, credit: Tim Peters
Return a list of the elements in s in arbitrary order, sans duplicates"""
- n = len(s)
# assume all elements are hashable, if so, it's linear
try:
return list(set(s))
@@ -124,6 +123,7 @@ def unique_array(s):
except TypeError:
pass
else:
+ n = len(s)
assert n > 0
last = t[0]
lasti = i = 1