Free Hero Mesh

Check-in [80dc8e429b]
Login
This is a mirror of the main repository for Free Hero Mesh. New tickets and changes will not be accepted at this mirror.
Overview
Comment:A change to the parsing of strings in a level table definition block.
Downloads: Tarball | ZIP archive | SQL archive
Timelines: family | ancestors | descendants | both | trunk
Files: files | file ages | folders
SHA1: 80dc8e429bd880a5e1b9afe890d3c035fc0e3e88
User & Date: user on 2022-04-29 05:04:49
Other Links: manifest | tags
Context
2022-04-30
23:18
Implement the one-based array operators. check-in: e895c451ce user: user tags: trunk
2022-04-29
05:04
A change to the parsing of strings in a level table definition block. check-in: 80dc8e429b user: user tags: trunk
2022-04-26
23:18
Ensure that undef_message is set when loading message numbers from the CLASS.DEF lump. check-in: e6ec7babc9 user: user tags: trunk
Changes

Modified function.c from [b17b014cc7] to [d6030e09ca].

1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306

1307
1308
1309
1310
1311
1312
1313
        while(*pt==10) pt++;
        break;
      case 30: // "\d"
        re:
        pp=pt=ll_find(pt,30);
        if(!pt) goto notfound;
        for(i=0;ps[i];i++) {
          if(ps[i]==':' || ps[i]==';' || ps[i]=='\\') break;
          if(ps[i]!=pt[i+1] && ps[i]!='?') {
            if(!pt[i]) goto notfound;
            pt+=i?:1;
            goto re;
          }

        }
        ps+=i+1;
        pt+=i+2;
        break;
      case '+':
        k=*ps++;
        if(k<31) return 64;







<





>







1294
1295
1296
1297
1298
1299
1300

1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
        while(*pt==10) pt++;
        break;
      case 30: // "\d"
        re:
        pp=pt=ll_find(pt,30);
        if(!pt) goto notfound;
        for(i=0;ps[i];i++) {

          if(ps[i]!=pt[i+1] && ps[i]!='?') {
            if(!pt[i]) goto notfound;
            pt+=i?:1;
            goto re;
          }
          if(ps[i]==':' || ps[i]==';' || ps[i]=='\\') break;
        }
        ps+=i+1;
        pt+=i+2;
        break;
      case '+':
        k=*ps++;
        if(k<31) return 64;