Your code: Code: (((coordinate >> 3) / 8) << 3) * 8 simpler: Code: (((coordinate >> 3) >> 3) << 3) << 3 simplest: Code: (coordinate >> 6) << 6 Divides by 64, then multiplies by 64, which clears the last 6 bits of coordinate, getting the highest number that is divisible by 64 that is less than or equal to coordinate. It's the same thing as Code: (coordinate / 64) * 64 and Code: coordinate & ~63 But multiply and divide by powers of 2 is much slower than bit shifting.
(((coordinate >> 3) / 8) << 3) * 8
(((coordinate >> 3) >> 3) << 3) << 3
(coordinate >> 6) << 6
(coordinate / 64) * 64
coordinate & ~63
skype?
lol.
I'm ok thanks. I have been on msn quite a bit. Everytime I'm on I never saw you online. I'm driving now anyway so won't be on msn that offen. When I'm on it be in the evenings for me. Talk soon!
Hello m8!
lol@your signature
Rs2d? Where can i find it;D
@ one of your threads(cbf to link) instead of a while look checking available() just use in.read() it will block the thread until data is received
Hehehe
Errr... Lol
Send an Instant Message to Deadly Uzi Using...
Registered Member
brb ridin da storm
I dunno, its fine I guess