|
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. : 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. [2014-9-23. : 5:43 am] jjf28 -- fox heavily blocked use of futurama's "a taste of freedom" on youtube  [2014-9-23. : 5:31 am] O)FaRTy1billion[MM] -- I guess I could just do ((a | b) & HighMask) | ((a & b) & LowMask) ...[2014-9-23. : 5:30 am] O)FaRTy1billion[MM] -- xor is super complicated, and that's the one I was doing earlier. xD[2014-9-23. : 5:30 am] O)FaRTy1billion[MM] -- I just define a HighMask (10101010) and a LowMask (01010101), and then stuff like AND is easy because it's ((a & HighMask) | (b & HighMask)) | ((a & LowMask) & (b & LowMask))[2014-9-23. : 5:27 am] O)FaRTy1billion[MM] -- and the logic takes the high and low bit values of both expressions as the four paramaters. [2014-9-23. : 5:24 am] O)FaRTy1billion[MM] -- 4 trits per byte. 10 = -1, 00 = 0, 01 = 1. (11 is undefined)[2014-9-23. : 5:23 am] O)FaRTy1billion[MM] -- cool, with these new logic tables and whatever I can use this ternary as binary values instead of strings.  [2014-9-23. : 5:21 am] O)FaRTy1billion[MM] -- ... Apparently someone he knows actually did that to him.[2014-9-23. : 5:20 am] O)FaRTy1billion[MM] -- Should I change his facebook password and call of his friends a faggot?[2014-9-23. : 4:59 am] jjf28 -- DeathTableOffset ofc being 0x58A364 http://puu.sh/bxmYu/9eaa1c8a17.png[2014-9-23. : 4:57 am] jjf28 -- well since you learned the tables you get to understand even better than most[2014-9-23. : 4:55 am] sigsaucy -- when roy says something like "Memory at Death Table + 331548 is exactly 6" does the + sign mean addition or positivity? |
works again <3
<3
Jesus?