Ben Harris scripsit: > This problem can be > dodged by having bitwise-bit-count return the number of set bits mod0 > infinity, or more prosaically, by returning the number of set bits in > a non-negative argument, and _minus_ the number of clear bits in a > negative one.
I think this is a good idea for the reasons given, but the phrase "mod0 infinity" should not be used, as Scheme has no exact infinity. -- John Cowan http://www.ccil.org/~cowan [EMAIL PROTECTED] "After all, would you consider a man without honor wealthy, even if his Dinar laid end to end would reach from here to the Temple of Toplat?" "No, I wouldn't", the beggar replied. "Why is that?" the Master asked. "A Dinar doesn't go very far these days, Master. --Kehlog Albran Besides, the Temple of Toplat is across the street." The Profit _______________________________________________ r6rs-discuss mailing list [email protected] http://lists.r6rs.org/cgi-bin/mailman/listinfo/r6rs-discuss
