Reply to Re: Before...
If you don't have an account, just leave the password field blank.
@redink1
After examining SimonK's super-var file, all I can conclude is that he hasn't made a dmod for quite some time, because he's busy optimizing fuel injection control software for long-range rocket engines...
@SlipDink
After examining the idea about turning numbers into binary representation, well, that has some shortcomings. Since the largest 32 bit int value is 2.147.483.647, or written alphabetically twobillionandonehundredthousendandfortysevenmillionsfourhundredandeightythreethousandssixhundredandfortyseven (fun fact, we use long scale number naming system in my country, so the translation would be different)... Ugh, where was I...?
Oh, right!
Since that number holds 10 digits, our binary representation would also hold the maximum of 10 digits, because it's technically (not to mention literally) still an integer.
The only reasonable thing to do, is to make an algorithm that will count up to certain point, and extract that exact point. Say we have a number 12 (1100 in binary), and some function in DinkC, dinknary(), where if you plug in... say... 3, it'll get what's on position 3 (duh)...[1101].
However, I don't see the point bothering with this, since changing the number will dramatically change its binary form... unless you need just static boolean values stored in one number...
That being said (and written, mind ya), I'm still curious about what you've come up with.
After examining SimonK's super-var file, all I can conclude is that he hasn't made a dmod for quite some time, because he's busy optimizing fuel injection control software for long-range rocket engines...
@SlipDink
After examining the idea about turning numbers into binary representation, well, that has some shortcomings. Since the largest 32 bit int value is 2.147.483.647, or written alphabetically twobillionandonehundredthousendandfortysevenmillionsfourhundredandeightythreethousandssixhundredandfortyseven (fun fact, we use long scale number naming system in my country, so the translation would be different)... Ugh, where was I...?
Oh, right!
Since that number holds 10 digits, our binary representation would also hold the maximum of 10 digits, because it's technically (not to mention literally) still an integer.
The only reasonable thing to do, is to make an algorithm that will count up to certain point, and extract that exact point. Say we have a number 12 (1100 in binary), and some function in DinkC, dinknary(), where if you plug in... say... 3, it'll get what's on position 3 (duh)...[1101].
However, I don't see the point bothering with this, since changing the number will dramatically change its binary form... unless you need just static boolean values stored in one number...
That being said (and written, mind ya), I'm still curious about what you've come up with.
