general modulo-question
Hi! I try to do some basic programming and got stuck with the modulo-operator an the problem how to shift any number n into the interval [b;e] with b < 0 and e > 0. My first approach was to calculate the spread of [b;e] by e - b and then to divide n by this spread. Unfortunately this just works for numbers that are already in [b;e] while other numbers smaller than b and greater than e are not shifted correctly. Has anybody programmed such calculation already and could give me a helping hint? Christian -- To UNSUBSCRIBE, email to [EMAIL PROTECTED] with a subject of "unsubscribe". Trouble? Contact [EMAIL PROTECTED]
Debian packages 1.4. Pretty please?
I really, really don't mean to be a pest, but PLEASE, could someone package up java 1.4.1 as a debian package, for use on deb stable? I asked this a month or two ago and was told that it would get taken care of by someone on the blackdown team (Juergen, I believe) very soon. Thanks, Avi Cherry -- To UNSUBSCRIBE, email to [EMAIL PROTECTED] with a subject of "unsubscribe". Trouble? Contact [EMAIL PROTECTED]
