27
edits
Contest data structure (Generation III): Difference between revisions
Contest data structure (Generation III) (view source)
Revision as of 20:03, 28 December 2009
, 28 December 2009Added fingerprint
(Created page to describe contest moves' jam/appeal points storage.) |
m (Added fingerprint) |
||
| Line 28: | Line 28: | ||
Unlike most other structures which use the move's ID as the key for this array, this array of structures uses the move's contest description ID as its index. | Unlike most other structures which use the move's ID as the key for this array, this array of structures uses the move's contest description ID as its index. | ||
==Fingerprint== | |||
Since this array uses the move's contest description ID as it's index, we chose to display the corresponding description after each structure. | |||
<pre> | |||
00 28 00 00 // "A highly appealing move!" | |||
00 3c 00 00 // "After this move, the user is more easily startled!" | |||
00 50 00 00 // "Makes a great appeal, but allows no more to the end!" | |||
00 1e 00 00 // "Can be repeatedly used without boring the JUDGE!" | |||
01 14 00 00 // "Can avoid being startled by others once!" | |||
01 0a 00 00 // "Can avoid being startled!" | |||
01 1e 00 00 // "Can avoid being startled by others a little!" | |||
01 1e 00 00 // "After this move, the user is less likely to be startled!" | |||
... | |||
</pre> | |||
==See also== | ==See also== | ||