Re: can binary arithmetic guru help improve these "bitmasking" ops?

2015-02-23 Thread Dan Lentz
Actually, yes, your code is exactly what I was looking for. Your "countTrailingZeros" is what I'm calling "mask-offset". Very helpful, thank you. Although, I gotta say, I'm still gonna do it in Clojure. This is supposed to be programming for enjoyment! :) Best, Dan On Mon, Feb 23, 2015 at 8:39

Re: clj-uuid: time-based uuid now 350% faster than java.util.UUID/randomUUID

2015-03-04 Thread Dan Lentz
It is a fair point about guessability, though, in the sense that you might be able to mount a brute force attack to guess a time based UUID, but it would not be easy. You would need to guess an effectively random 59 bit number (the low order bits) and then step through all possible time stamps mil