Landon Curt Noll
09750f8899
Congratulations to: * 2024/anders - Prize in sound coding - layered music generator * 2024/burton - Prize in pentagrammatology - wordle hard mode solver * 2024/cable1 - Prize in bot talk - LLM inference engine * 2024/cable2 - Prize in murky waters - salmon recipe * 2024/carlini - Prize in perfect timing - Intel 4004 emulation * 2024/codemeow - Prize in tray planting - bonsai generator * 2024/endoh1 - Prize in patient pointillism - slow ray tracer in CPP * 2024/endoh2 - Prize in solid body physics - rotating rigid body simulation * 2024/ferguson1 - Prize in diabolical logistics - Oregon trail pact with the devil * 2024/ferguson2 - Prize in yil-tas - Navajo code talker translator * 2024/howe - Nice accent eh-ward - mini vi * 2024/kramer - Prize in linguistic arithmetic - natural language numerical calculator * 2024/kurdyukov1 - Prize in phased periodicity - phase of the Moon * 2024/kurdyukov2 - Prize in art restoration - JPEG artifact removal * 2024/kurdyukov3 - Prize in virtual quietus - gaming VM and doom * 2024/kurdyukov4 - Prize in embiggening - encode without literals * 2024/maffiodo - Prize in creative interpretation - Jav\*script interpreter * 2024/mills - Prize in ℤ₃ - Infocom v3 story interpreter * 2024/stedolan - Best one liner - icon from MD5 * 2024/straadt - Prize in imitative rebooting - OpenRISC CPU and Linux * 2024/tmarrec - Prize in cyclonic coding - 3D tornado simulation * 2024/tompng - Prize in quasi bijection - vortex encryptor decryptor * 2024/weaver - Sur prize - rickroll Ran `make update` to perform the above. new file: 2024/burton/.entry.json
67 lines
2.0 KiB
C
67 lines
2.0 KiB
C
/*
|
|
* very similar to bytecount.c but it doesn't print out the location of each
|
|
* byte AND it also parses the file WITHOUT caring about the NUL bytes (how does
|
|
* that work?).
|
|
*
|
|
* Note that this one does not have an option to specify which file is to be
|
|
* read and it shouldn't need one at the late stage (at the time of writing
|
|
* there was only one file - then I added the ASCII only one and then later
|
|
* changed out the data.src to be data.scrnshot.src and made data.src wider in
|
|
* text).
|
|
*/
|
|
#include <string.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
int main(void)
|
|
{
|
|
FILE *fp = fopen("data.src", "r");
|
|
char *p = NULL;
|
|
size_t len = 0;
|
|
char *buf = NULL;
|
|
size_t i = 0, j = 0, k = 0;
|
|
|
|
/*
|
|
* the question I had to determine the answer to is if getdelim() will stop
|
|
* at the NUL byte. I feared it would but my fear was ungrounded. It
|
|
* actually read up to the EOF!
|
|
*/
|
|
if (fp == NULL)
|
|
{
|
|
fprintf(stderr, "couldn't open data file\n");
|
|
exit(1);
|
|
}
|
|
|
|
/*
|
|
* as I already knew that getdelim(3) would read up to the EOF even with NUL
|
|
* bytes in the file, I wanted to make sure the algorithm would work okay.
|
|
* It's not exactly the algorithm I use as in the game I have to print only
|
|
* a single string, not every string in the single char *. The algorithm
|
|
* here is pretty simple to understand but it was important in testing.
|
|
*
|
|
* It simply prints out each string in the source data file but of course
|
|
* the game itself prints the flat char *y which is the contents of the data
|
|
* file itself.
|
|
*/
|
|
if (getdelim(&buf, &len, EOF, fp) != -1)
|
|
{
|
|
p = buf;
|
|
while (i < len)
|
|
{
|
|
j = strlen(p);
|
|
k = 0;
|
|
while (k < j)
|
|
{
|
|
putchar(*(p+k));
|
|
++k;
|
|
}
|
|
i += j + 1;
|
|
p += j + 1;
|
|
}
|
|
}
|
|
|
|
free(buf);
|
|
buf = NULL;
|
|
fclose(fp);
|
|
fp = NULL;
|
|
}
|