neauoire
/
parade
mirror of https://git.sr.ht/~rabbits/parade
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Reduce max size

This commit is contained in:
Devine Lu Linvega 2020-09-16 19:55:54 -07:00
parent 44ec0c4122
commit 3826987861
2 changed files with 18 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
NOTES
View File

@ -16,3 +16,18 @@ answer(&parade, "warp to the library");
answer(&parade, "become the ghost");
answer(&parade, "use the bat");
/* world export */
answer(&parade, "create box1");
answer(&parade, "create box2");
answer(&parade, "create box3");
answer(&parade, "take box1");
answer(&parade, "take box2");
answer(&parade, "enter box3");
answer(&parade, "note example note");
answer(&parade, "note example program");
answer(&parade, "warp to box2");
answer(&parade, "note example note");
answer(&parade, "note example program");
answer(&parade, "save");

7
main.c
View File

@ -1,10 +1,10 @@
#include <stdio.h>
#define NAMELEN 16
#define TEXTLEN 512
#define TEXTLEN 256
typedef struct Vessel {
int id;
char id;
struct Vessel* owner;
struct Vessel* parent;
char name[NAMELEN];
@ -393,9 +393,8 @@ int
save(Parade* p)
{
int i;
char body[1024];
for(i = 0; i < p->len; ++i) {
printf("%-4d %-4d %-4d %-16s %s | %s\n",
printf("%02x%02x%02x %-16s %s | %s\n",
p->vessels[i].id,
p->vessels[i].owner->id,
p->vessels[i].parent->id,