andioop@programming.dev to Programming Horror@programming.devEnglish · edit-22 years agoGod I wish there was an easier way to do thisprogramming.devexternal-linkmessage-square26fedilinkarrow-up14arrow-down10
arrow-up14arrow-down1external-linkGod I wish there was an easier way to do thisprogramming.devandioop@programming.dev to Programming Horror@programming.devEnglish · edit-22 years agomessage-square26fedilink
minus-squareMac@programming.devlinkfedilinkarrow-up1·edit-22 years agowho needs modulo when you can get less characters out of while (number > 1) { number -= 2; } return number; very efficient edit: or theres the trusty iseven api
minus-squareNullPointer@programming.devlinkfedilinkarrow-up1·2 years agohere is somewhat less: return (number % 2) == 0;
minus-squareMuchPineapples@lemmy.worldlinkfedilinkarrow-up1·edit-22 years agoThis is the way. Modulo takes too long to compute, bitwise compare should be a lot faster. return !(number & 0x1);
minus-squarerecursive_recursion [they/them]@programming.devlinkfedilinkEnglisharrow-up1·edit-22 years agooh shit yo this comment chain is pretty awesome, I learned a lot from this thanks!
who needs modulo when you can get less characters out of
while (number > 1) { number -= 2; } return number;very efficient
edit: or theres the trusty iseven api
here is somewhat less:
return (number % 2) == 0;return !(number & 1);This is the way. Modulo takes too long to compute, bitwise compare should be a lot faster.
return !(number & 0x1);oh shit yo
this comment chain is pretty awesome, I learned a lot from this thanks!