From: ticktock35 <ticktock35@e8e0d7a0-c8d9-11dd-a880-a1081c7ac358>
Date: Mon, 15 Dec 2008 05:34:28 +0000 (+0000)
Subject: opkg: Update TODO and remark that pkg_hash_fetch_best_installation_candidate
X-Git-Url: http://git.lede-project.org./?a=commitdiff_plain;h=ce7b04014d188c7b5d02ed6f7edda67cd1bffe63;p=project%2Fopkg-lede.git

opkg: Update TODO and remark that pkg_hash_fetch_best_installation_candidate
      is very slow and been called very often. This has a huge improve space.



git-svn-id: http://opkg.googlecode.com/svn/trunk@179 e8e0d7a0-c8d9-11dd-a880-a1081c7ac358
---

diff --git a/TODO b/TODO
index 97fc66c..2d0c156 100644
--- a/TODO
+++ b/TODO
@@ -54,3 +54,9 @@ Things to do for opkg, in a partial order:
 3.b) Clean up out of date comments. That really confusing
 
 4) refactorying opkg_install_pkg into more precise functions
+4.1) refactory upgrade list first
+4.2) Finding canditate is linear search O(P*PN) and is very slow (been called very frequently)
+      P provider
+      PN pkgs in a provider
+     It's can be O(P) if there we use hash table. 
+     It should be refacotry to a faster one.