Rename wrongly named author/winner handles

There were many files renamed in this commit and I hope I got all the
references to the old names changed to the new names. To explain this
commit there were some older entries that had the wrong directory name:
not the surname but something else.

Very possibly there are other directories that need to be renamed and I
am actually aware of one right now but since it's in 2005 (which is
close to being worked on) I am not changing that now but just noting it:
2005/anon should be changed to 2005/anonymous (unless there's a very
good reason I am unaware of). But like I said since 2005 will be worked
on soon I have not touched it.

The Makefiles, .gitignore, the all/summary.txt, years.html and
winners.html files as well as the directories and the files under the
renamed directories have all been updated.

This is a rather big update and it might be that there are conflicts. If
so I will fix them. I will have to update 2005/anon later on to try and
prevent this from happening but very possibly there will be conflicts
here. It's also possible I missed some changes in years.html and/or
winners.html and/or summary/all.txt but I think I got them all. These
should be verified later on.
This commit is contained in:
Cody Boone Ferguson committed 2023-03-14 05:06:16 -07:00
1 parent 9e540136d1
commit ad04d21fda
52 files changed
+163 -162

No files matched your search

+6 -6
View File
@@ -1,5 +1,5 @@
baruch/baruch
cmills/cmills
mills/mills
dds/dds
dg/dg
jaw/atob
@@ -10,9 +10,9 @@ scjones/scjones
stig/o
stig/o.c
tbr/tbr
theorem/fibonacci
theorem/fibonacci.c
theorem/sorter
theorem/sorter.c
theorem/theorem
mariano/fibonacci
mariano/fibonacci.c
mariano/sorter
mariano/sorter.c
mariano/mariano
westley/westley
+1 -1
View File
@@ -53,7 +53,7 @@ include ../var.mk
# IOCCC winners
###############
#
WINNERS= baruch cmills dds dg jaw pjr scjones stig tbr theorem westley
WINNERS= baruch dds dg jaw mariano mills pjr scjones stig tbr westley
YEAR= 1990
-1
View File
@@ -1 +0,0 @@
cmills
@@ -1,5 +1,5 @@
fibonacci
fibonacci.c
mariano
sorter
sorter.c
theorem
@@ -1,6 +1,6 @@
#!/usr/bin/env make
#
# IOCCC 1990 winning entry - theorem
# IOCCC 1990 winning entry - mariano
################################################################################
#
@@ -165,7 +165,7 @@ endif
# Special flags for this entry
##############################
#
ENTRY= theorem
ENTRY= mariano
PROG= ${ENTRY}
#
OBJ= ${PROG}.o
@@ -191,13 +191,13 @@ ${PROG}: ${PROG}.c
${CC} ${CFLAGS} $< -o $@ ${LIBS}
sorter.c: ${PROG} ${PROG}.c
-./theorem -r 0 0 0 0 < theorem.c > sorter.c
-./mariano -r 0 0 0 0 < mariano.c > sorter.c
sorter: sorter.c
${CC} ${CFLAGS} sorter.c -o $@
fibonacci.c: sorter ${PROG}.c
-./sorter 0 0 0 0 < theorem.c > fibonacci.c
-./sorter 0 0 0 0 < mariano.c > fibonacci.c
fibonacci: fibonacci.c
${CC} ${CFLAGS} fibonacci.c -o $@
@@ -19,7 +19,7 @@ systems with this entry.
## To run:
./theorem expression x1 x2 h y1
./mariano expression x1 x2 h y1
where:
@@ -32,7 +32,7 @@ where:
## Try:
./theorem y 0 1 0.1 1
./mariano y 0 1 0.1 1
@@ -41,7 +41,7 @@ where:
The program's source implements four functions, all from the
same source file!
When you compile theorem.c as is and run with 5 args, it numerically
When you compile mariano.c as is and run with 5 args, it numerically
solves the equation y'=f(x,y), with a step size of h, over the interval
x=[x1,x2], with the initial condition of y(x1)=y1.
@@ -56,14 +56,14 @@ left to right. (i.e., parenthesis aren't supported).
Try running the program with the following args:
./theorem y 0 1 0.1 1
./theorem 1/x 1 2 0.1 0
./theorem 'x^2/y+x' 0 1 0.1 6
./mariano y 0 1 0.1 1
./mariano 1/x 1 2 0.1 0
./mariano 'x^2/y+x' 0 1 0.1 6
But wait, there is more! You also get, free of charge, a
reversing filter! Try:
./theorem -r 0 0 0 0 < theorem.c > sorter.c
./mariano -r 0 0 0 0 < mariano.c > sorter.c
Still not impressed? The author throws in for free, a
sort program! Try:
@@ -75,12 +75,12 @@ This program is safe for home use as well. The author has
included a safety feature in case you misplace the original
program source:
./sorter -r 0 0 0 0 < sorter.c > theorem_bkp.c
./sorter -r 0 0 0 0 < sorter.c > mariano_bkp.c
And finally, as a special offer to users of this entry,
the author provides a Fibonacci sequence generator! Try:
./sorter 0 0 0 0 < theorem.c > fibonacci.c
./sorter 0 0 0 0 < mariano.c > fibonacci.c
cc fibonacci.c -o fibonacci
./fibonacci 1 1
./fibonacci 2 1
@@ -21,7 +21,7 @@ if(R=='/')*g/=u;
if(R=='^')P(g,*g,u);
C
w(g,R,u)float*g,u;char R;
/**/{int b,f;A=atoi(*++a);b=atoi(*++a);while((f=A+b)<15000){printf("%d\n",f);A=b;b=f;}}
/**/{int b,f;A=atoi(++a);b=atoi(++a);while((f=A+b)<15000){printf("%d\n",f);A=b;b=f;}}
main(A,a)int A;char*a[];
o o
if(!strcmp(*++a,"-r"))S();
+1
View File
@@ -0,0 +1 @@
mills
+2 -2
View File
@@ -1,6 +1,6 @@
#!/usr/bin/env make
#
# IOCCC 1990 winning entry - cmills
# IOCCC 1990 winning entry - mills
################################################################################
#
@@ -163,7 +163,7 @@ endif
# Special flags for this entry
##############################
#
ENTRY= cmills
ENTRY= mills
PROG= ${ENTRY}
#
OBJ= ${PROG}.o
@@ -12,14 +12,14 @@
### To run
./cmills [starting_cash]
./mills [starting_cash]
NOTE: we used a patch from Yusuke Endoh to get this to work in modern systems
(it resulted in a bus error otherwise). Thank you Yusuke for your assistance!
### Try:
./cmills 5000
./mills 5000
NOTE: this program uses `gets()` so you will likely get a warning under modern
@@ -29,7 +29,7 @@ systems.
Compile notes:
cc -DM=500 -DN=52 -DX="srand((int)time(0L))" -DV=void -o cmills cmills.c
cc -DM=500 -DN=52 -DX="srand((int)time(0L))" -DV=void -o mills mills.c
-DM=<max bet allowed>
-DN=<52 * number of decks used>
File renamed without changes.