Members in Shoutbox
None.
Shoutbox Search
Shoutbox Commands
/w [name] > Whisper
/r > Reply to last whisper /me > Marks as action Shoutbox Information
Moderators may delete any and all shouts at will.
|
Global Shoutbox
Please log in to shout.
[2014-9-23. : 11:37 am] Jack -- I press right alt key to change between the keyboards, you need to set your active keyboard to Korean (Microsoft IME) I think[2014-9-23. : 11:36 am] Jack -- korean uses an alphabet like english, just instead of g it's ㅎ and so on[2014-9-23. : 11:36 am] Oh_Man -- oh wait them combos arent even the language, it's just wat their language looks like once it's converted XD[2014-9-23. : 11:33 am] Jack -- I've learned enough to get by in melee games but UMS is harder, they start yelling at you to do stuff sometimes[2014-9-23. : 9:53 am] Generalpie -- Since I've allocated more RAM to Minecraft, Photoshop was allocated more RAM too[2014-9-23. : 9:21 am] *Generalpie slumps head on desk*[2014-9-23. : 9:02 am] O)FaRTy1billion[MM] -- But when they do depend on each other, it gets confusing (like the logic tables I was asking about earlier) and requires shifting: return (( (a&b) | ((a&b)>>1) ) & LOWMASK) | ( ( (a&b<<1) | (b&a<<1) ) & HIGHMASK ); -- which is the logic for my multiplication table (-1*-1=1, 1*1=1, 1*-1=-1, -1*1=-1, 0*x=0, x*0=0)[2014-9-23. : 8:59 am] O)FaRTy1billion[MM] -- Oh, and every operation has two results, a high value and a low value (also masked with HIGHMASK and LOWMASK). AND an OR just happen to be easy in that the high values and low values are independent of eachother [2014-9-23. : 8:55 am] O)FaRTy1billion[MM] -- So every operation basically becomes a binary operation with 4 inputs: a&HM, a&LM, b&HM, and b&LM. HM being 10, LM being 01 for every pair (0xAAAAAAAA and 0x55555555 are the defines in my program xD)[2014-9-23. : 8:52 am] O)FaRTy1billion[MM] -- like AND is return ((a & b) & LOWMASK) | ((a | b) & HIGHMASK);[2014-9-23. : 8:51 am] O)FaRTy1billion[MM] -- So now instead of comparing strings and characters I just do a sequence of specific binary operations and shifts.[2014-9-23. : 8:50 am] O)FaRTy1billion[MM] -- cool, implemented the binary-encoded-ternary thing to my program and my logic is sound. [2014-9-23. : 6:20 am] O)FaRTy1billion[MM] -- I wonder if I could find a way to make them unsigned, so that T would be double the maximum.[2014-9-23. : 6:19 am] O)FaRTy1billion[MM] -- so a byte will have a range of -40 to 40, short is -3280 to 3280, and int is -21523360 to 21523360, and a long int is ... something insane. xD[2014-9-23. : 5:59 am] O)FaRTy1billion[MM] -- xD Testing my code with the '11' undefined value, I get fun results![2014-9-23. : 5:47 am] jjf28 -- perhaps I should write a review just to claim it's part of a review :lollaw:[2014-9-23. : 5:45 am] jjf28 -- they managed to link up that exact episode with my video without watching it, I was mildly impressed[2014-9-23. : 5:43 am] jjf28 -- i'm trying to upload the flag eating clip with nixon going "kill him, kill the traitor!", not watch the ep. |