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.
Original issue reported on code.google.com by paul.betafive on 1 Feb 2014 at 2:44
Original issue reported on code.google.com by
paul.betafive
on 1 Feb 2014 at 2:44