* Michael Matz <matz@suse.de> [Feb 11. 2008 08:49]:
Hi,
the same problem as with dist upgrade also hits with zypper lu, it does a linear walk over all poolitems, for each calling the ByName iterator, which in turn also walks over the entire pool. Not So Clever, except if you want to test how the machine behaves with O(N^2) algorithms :)
Huh ? libzypp (the old one ;-)) created a couple of maps for the solver and should've used those.
What the SAT library can provide without much overhead is an index for a ByKindName filter (doesn't exist yet), so _that_ one could be made fast without taking many resources. Interestingly that happens to be the usecase of zypper too.
My current thinking (to be implemented during hackweek ...) is to separate different kinds into different repos. So the solver doesn't ever see kinds, but it needs the ability to restrict solving to a set of repos. Klaus --- SUSE LINUX Products GmbH, GF: Markus Rex, HRB 16746 (AG Nürnberg) -- To unsubscribe, e-mail: zypp-devel+unsubscribe@opensuse.org For additional commands, e-mail: zypp-devel+help@opensuse.org