Quite Erroneous Debate?
> > Jakub is no longer a bug-wrangler, or a dev, he retired last month.
>
> Ah, good things still happen ? ;P
Jakub was very good at his job, but he does have an attitude problem.
Are you trying to emulate him, you are already halfway there?
Give the guy a break :P. When your having to deal with lots of noobs
being retarded telling you you're wrong on a daily basis when you know
otherwise, I guess most people get frustrated at it :P.
So lets not be bashing him, especially when hes not around to fend for
himself eh?
Imo, the cyclic dep problem could be solved as thus,
A depends B
B depends C||A
Where C is a minimalist subset of A required for building B, which is
only depended on if A is not present.
A is also a replacement for C.
So the flow would go like such.
Emerge A:
* depends on b
* A is missing, so depend on C
*emerges C*
*emerges B*
*removes C* <-- otherwise A & C containing the same files = headache
*emerges A*
Yes, indeed I agree that we could just do this by hand by changing a
USE flag, but we should at least be open to the idea of looking for a
way to automatically resolve the problem. Computers exist to make our
life easier, not the other way around :)
--
Kent
ruby -e '[1, 2, 4, 7, 0, 9, 5, 8, 3, 10, 11, 6, 12, 13].each{|x|
print "enNOSPicAMreil [EMAIL PROTECTED]"[(2*x)..(2*x+1)]}'
--
[EMAIL PROTECTED] mailing list
