| 08-04-2007, 12:43 AM | #1 |
Well, a few months ago I decided I didn't like any of the existing save/loads, so I set out to make my own. 3 completely failed attempts, and over 40 hours spent later, I'm nearing completion. All thats left(planned) is security saves, error logs, and fixing the overload problem(it can't handle too much without hitting op limit). So, I would like to get some pre-release feedback from you experienced coders. SaveInteger(value, name, minimum, maximum, code) Value - The value which is being saved, the part which changes. Name - The name of the save. Minimum - How low the the value can go. Maximum - How high the value can go. Code - Name of the code your saving to. ASLinit must be called at init and All values must also be saved once at Init(their value does not matter) after ASLinit(). Suggestions welcome. And aside from some special cases I haven't covered yet(such as the same binary being repeated more than 12 times), I am certain this save/load has reached maximum efficiency in terms of compression. |
| 08-04-2007, 01:24 AM | #2 |
What happened to groups of six? |
| 08-04-2007, 01:34 AM | #3 |
What? Do you mean binary? It uses 5 as a base but automatically supports 6 and 7. |
| 08-04-2007, 01:39 AM | #4 |
| 08-04-2007, 02:28 AM | #5 |
Oh, I made a system for finding the 6 string, but never got the right one. This needs the 5 string only anyway. The code you gave was a 6 string? |
| 08-04-2007, 03:05 AM | #6 |
Yes, 6. They are trivial to generate out to 13, and not difficult past that. I'm glad you reminded me of it, I have some IRL use for this. I have no idea how your system works. You'll have to explain it. |
| 08-04-2007, 03:44 AM | #7 |
I'm glad you found a use for it :D Its a secret ![]() Nah, it takes values, determines how much binary each value needs, converts it to binary, stitches the binary together, and converts it to code. |
| 08-05-2007, 09:49 PM | #8 |
Not much feedback ![]() |
