Overview
| Comment: | Add a compile-time assertion that multi-character literals are implemented in a suitable way. |
|---|---|
| Downloads: | Tarball | ZIP archive | SQL archive |
| Timelines: | family | ancestors | descendants | both | trunk |
| Files: | files | file ages | folders |
| SHA1: |
6cb45f70ee11b9b00a7010b0573f82f1 |
| User & Date: | user on 2021-04-08 14:44:42 |
| Other Links: | manifest | tags |
Context
|
2021-04-08
| ||
| 21:25 | Change a comment in exec.c explaining another reason why finding loops in deferred movement might sometimes not find one, and why it doesn't matter in that case. check-in: a1dab8cccd user: user tags: trunk | |
| 14:44 | Add a compile-time assertion that multi-character literals are implemented in a suitable way. check-in: 6cb45f70ee user: user tags: trunk | |
|
2021-04-07
| ||
| 22:05 | Allow displaying help and level strings in the examine object menu. check-in: dc43d63bc6 user: user tags: trunk | |
Changes
Modified main.c from [3e8c9f68c8] to [9136db6a90].
1 | #if 0 | | | 1 2 3 4 5 6 7 8 9 |
#if 0
gcc ${CFLAGS:--s -O2} -o ${EXE:-~/bin/heromesh} -Wno-multichar main.c class.o picture.o bindings.o function.o exec.o game.o edit.o picedit.o smallxrm.o sqlite3.o `sdl-config --cflags --libs` -ldl -lpthread
exit
#endif
/*
This program is part of Free Hero Mesh and is public domain.
*/
|
| ︙ | ︙ | |||
23 24 25 26 27 28 29 30 31 32 33 34 35 36 |
#include "names.h"
#include "quarks.h"
#include "cursorshapes.h"
#include "heromesh.h"
typedef struct {
char a[(N_MESSAGES==sizeof(standard_message_names)/sizeof(*standard_message_names))?1:-9];
} ASSERTION;
static const char schema[]=
"BEGIN;"
"PRAGMA APPLICATION_ID(1296388936);"
"PRAGMA RECURSIVE_TRIGGERS(1);"
"CREATE TABLE IF NOT EXISTS `USERCACHEINDEX`(`ID` INTEGER PRIMARY KEY, `NAME` TEXT, `TIME` INT);"
| > | 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 |
#include "names.h"
#include "quarks.h"
#include "cursorshapes.h"
#include "heromesh.h"
typedef struct {
char a[(N_MESSAGES==sizeof(standard_message_names)/sizeof(*standard_message_names))?1:-9];
char b[('\1\0'*'x'+'\0\1'*'y'=='xy')?1:-9];
} ASSERTION;
static const char schema[]=
"BEGIN;"
"PRAGMA APPLICATION_ID(1296388936);"
"PRAGMA RECURSIVE_TRIGGERS(1);"
"CREATE TABLE IF NOT EXISTS `USERCACHEINDEX`(`ID` INTEGER PRIMARY KEY, `NAME` TEXT, `TIME` INT);"
|
| ︙ | ︙ |