Jeremy Bertenshaw wrote:

> By 'unable to fulfil each others dependencies' i'm saying that rpm was unable to 
>figure out from the list of rpms given to it (*) that they will cover all the 
>dependencies, as a side thought, surely this has to be a non-trivial programming 
>issue as the size of the list of rpm's increases.

While I wouldn't call it trivial, it certainly is not a very difficult
programming problem, if you know the right approach to use.

Do a degree in Computer Science, we'll show you how to do it :-)

Cheers,
-- 
Carl Cerecke, Assistant Lecturer|email:      [EMAIL PROTECTED]
Department of Computer Science, |Phone:      +64 3 364 2987 ext. 7859 
University of Canterbury,       |Fax:        +64 3 364 2569           
Private Bag 4800,               |http://www.cosc.canterbury.ac.nz/~cdc
Christchurch, New Zealand.      |

Reply via email to