Difference between revisions of "TRE STFFileType"

From SWGANH Wiki
Jump to: navigation, search
Line 5: Line 5:
 
It contains all the game's strings. During network communications the strings are identificated with: filename without extension + code + ansi string id.
 
It contains all the game's strings. During network communications the strings are identificated with: filename without extension + code + ansi string id.
 
}}
 
}}
Header:
 
 
{| class="wikitable"
 
{| class="wikitable"
 
|{{int}}
 
|{{int}}
Line 18: Line 17:
 
|{{int}}
 
|{{int}}
 
|items count
 
|items count
|}
+
|-
 
+
|{{beginlist}}||items list
{| class="wikitable"
+
|-
|{{list}}||items:
+
|}
+
 
+
{| class="wikitable"
+
 
|{{int}}
 
|{{int}}
 
|item index in the file (eg: 1, 2, 9, 3, 7, ...)
 
|item index in the file (eg: 1, 2, 9, 3, 7, ...)
Line 33: Line 28:
 
|{{u_string}}
 
|{{u_string}}
 
|4 bytes length + 2 bytes chars (eg: "hello world" is 11 digits long, 22 bytes total)
 
|4 bytes length + 2 bytes chars (eg: "hello world" is 11 digits long, 22 bytes total)
|}
+
|-
 
+
|{{endlist}}
{| class="wikitable"
+
|-
|{{list}}||item's string ids:
+
|{{beginlist}}||item's string ids:
|}
+
|-
 
+
{| class="wikitable"
+
 
|{{int}}
 
|{{int}}
 
|item index in the file matching one in previous list (eg: 1, 2, 9, 3, 7, ...)
 
|item index in the file matching one in previous list (eg: 1, 2, 9, 3, 7, ...)
Line 45: Line 38:
 
|{{a_string}}
 
|{{a_string}}
 
|4 bytes length + 1 byte chars (eg: "basic_answer" is 12 digits long, 12 bytes total)
 
|4 bytes length + 1 byte chars (eg: "basic_answer" is 12 digits long, 12 bytes total)
 +
|-
 +
|{{endlist}}
 
|}
 
|}

Revision as of 05:35, 22 March 2007

Understood at
75%


File Type: STF format

It contains all the game's strings. During network communications the strings are identificated with: filename without extension + code + ansi string id.


INT


STF file type header id (sequence: 0xCD 0xAB 0x00 0x00, value: 0x0000ABCD = 43981)
BYTE useless? flag (might be a boolean, seen so far: 0x01 and 0x00)
INT


next free index in file to add an item, always > items count (useless for us)
INT


items count
<{{{1}}} count={{{2}}}> items list
INT


item index in the file (eg: 1, 2, 9, 3, 7, ...)
INT


code (gesture?)
U_STRING 4 bytes length + 2 bytes chars (eg: "hello world" is 11 digits long, 22 bytes total)
<{{{1}}}/>
<{{{1}}} count={{{2}}}> item's string ids:
INT


item index in the file matching one in previous list (eg: 1, 2, 9, 3, 7, ...)
A_STRING 4 bytes length + 1 byte chars (eg: "basic_answer" is 12 digits long, 12 bytes total)
<{{{1}}}/>