From TODO list in opkg source tree: pkg_hash_fetch_best_installation_candidate() is linear search O(P*PN) and is slow (frequently called). P provider PN pkgs in a provider It can be O(P) if a hash table is used. This is part of a bigger class of questions about performance. At some point we need to review the algorithms which use a pkg_vec and see if we can improve them without greatly increasing the memory usage. This is a long-term consideration and not something we need to do immediately. Originally reported by paul.betafive, Feb 1, 2014 -----------------------------------------------------------------------------
Closing this bug, because it is an old issue and isn't specific to any particular performance issue or codepath. We have other bugs on the backlog which target performance issues that are actually impacting users. But this bug's closure shouldn't dissuade anyone from filing a performance bug about a particular workflow or codepath.