C# Habbo structures

[Joopie]

https://github.com/EmGeneer/Updater

Here you go, but actually there is no code for the comparer atm. Its just a different version from the StructureWriter (ATM )

First thing is that you use "readInteger", "readString" etc, however, those method names can change very release! Such as the "readInteger". ;)

[Emerica]

First thing is that you use "readInteger", "readString" etc, however, those method names can change very release! Such as the "readInteger". ;)

I thought that the person who uses the program can use str + h to rename these strings..
But oke, I'll code a function which detects the names automatic

--------------------------------------------------
Edit:

I added the automatic detection for the function names :)

[Nasty35]

Your program is pretty good, I also did a similar one.
This is an example output: http://pastebin.com/1hTs7X74
Is programmed in Java

[Emerica]

I posted an updated version on GitHub. There is only one issue (Posted here: https://github.com/EmGeneer/Updater/issues)
The version on Git is more clean. Maybe someone can fix the duplicate error

[jordynegen11]

I'm going to setup a git in a few days / in a week, so everyone whos interessed can help. I'm going to work on this..



[522] is a MessageComposer, you can't get structure from it :D

thanks.

[Emerica]

Finally fixed the duplicate error. The structure finder seems to work without bugs now. I'll push the update now on Git.. :=)

[Stevehabbz]

Still don't know how to get Habbo_script.txt , I had download AS3 Sorcerer .

[jordynegen11]

Still don't know how to get Habbo_script.txt , I had download AS3 Sorcerer .

Just open it with AS3 sorcerer and: save everything to one file

[Emerica]

Later I'll set this on Git. I implemented the Levenshtein algorithm to compare the old structure with the new one.
And it compares the old parse method with the new one.
There is still a lot todo.

[Emily]

Later I'll set this on Git. I implemented the Levenshtein algorithm to compare the old structure with the new one.
And it compares the old parse method with the new one.
There is still a lot todo.

Is that algorithm accurate? Because that would help the retro community a lot since you don't really have to update headers yourself ^^ Then you just make an updater and poof: headers updated :)

[Emerica]

Is that algorithm accurate? Because that would help the retro community a lot since you don't really have to update headers yourself ^^ Then you just make an updater and poof: headers updated :)

http://en.wikipedia.org/wiki/Levenshtein_distance

It is an algorithm to get the difference count from two strings. So there is some work left you have to do yourself :)
But I'm working on this. I have some problems with comparing a whole method.

But in my tests it updates 3/4 headers :)

Here is an example for a structure like "S,S"
There is only one match with 0 difference, so this is the packet..

[Jamal7]

http://en.wikipedia.org/wiki/Levenshtein_distance

It is an algorithm to get the difference count from two strings. So there is some work left you have to do yourself :)
But I'm working on this. I have some problems with comparing a whole method.

But in my tests it updates 3/4 headers :)

Here is an example for a structure like "S,S"
There is only one match with 0 difference, so this is the packet..

Looks amazing :$

Maybe you could start an development thread for further update's? (Just an idea)

[Stevehabbz]

Just open it with AS3 sorcerer and: save everything to one file

Should I buy the licence ? .-.

- - - Updated - - -

Just open it with AS3 sorcerer and: save everything to one file

Should I buy the licence ? .-.

[Emily]

Should I buy the licence ? .-.

- - - Updated - - -



Should I buy the licence ? .-.

No, don't do it. I'll release the program + crack in a few mins.

[Stevehabbz]

No, don't do it. I'll release the program + crack in a few mins.

Thank :)