Necromunda Gang: %s

#include #include #include #include "necro.h" /* * $Header: /blue/homes/cowell/src/nec/RCS/main.c,v 1.1 1996/04/20 21:06:57 cowell Exp cowell $ * * main.c * Copyright Andy Cowell , all rights reserved. * * $Log: main.c,v $ * Revision 1.1 1996/04/20 21:06:57 cowell * Initial revision * * */ static char *rcsid = "$Id: main.c,v 1.1 1996/04/20 21:06:57 cowell Exp cowell $"; void build_html(struct _gang *g); void do_stats(struct _gang *g); static int gang_compare(struct _gang **x, struct _gang **y); static int reverse_gang_compare(struct _gang **x, struct _gang **y); extern struct _gang *root; int debug = 1; main(int argc, char **argv) { struct _gang *g; if (argc < 2) { printf("Usage: %s -h[tml] | -s[tats]\n", argv[0]); exit(-1); } yyparse(); if (!(strcmp("-h", argv[1]))) { /* We assume with the -h option that there was only 1 gang. */ build_html(root); } else if (!(strcmp("-s", argv[1]))) { /* We're getting several gangs and want to do statistics */ do_stats(root); } } void build_html(struct _gang *g) { struct _member *m; char *s; /* Print our HTML header, and start the body */ printf("\n\n"); printf("Necromunda Gang: %s\n", g->name); printf("\n\n"); printf("\n"); printf("\n", g->name); printf("\n"); printf("\n"); printf("\n\n\n"); printf("\n\n"); /* Formatting for printing the table stuff is horrible, sorry */ /* MAIN TABLE */ printf("\n"); printf("\n\n\n
\n\n\n"); /* MAIN TABLE */ printf("

\n\n\n"); /* Gang Rating table */ printf(" \n"); printf(" \n", g->rating); printf("

Rating:	%d

\n\n\n
\n\n\n"); /* Territory table */ /* Every gang has at least one territory */ printf(" \n"); printf(" \n"); printf(" \n", strtok(g->ttory, ",")); while ((s = strtok(((char *)NULL), ",")) != ((char *)NULL)) printf(" \n", s); printf("

Territory
%s
%s

\n\n\n
\n\n\n"); /* Stash and Hoard */ printf(" \n"); printf("

Stash
%d creds

\n\n\n
\n\n\n", g->stash); printf(" \n"); printf("

Hoard
"); if (g->hoard != ((char )NULL)) { printf(" %s \n", strtok(g->hoard, ",")); while ((s = strtok(((char )NULL), ",")) != ((char *)NULL)) printf(" %s \n", s); } printf("

\n\n"); /* Roster table */ printf(" \n"); printf(" \n", g->name); printf(" \n\n"); for (m=g->member; m!=((struct _member *)NULL); m=m->next) { printf(" \n", m->name, m->pos); printf(" \n"); printf(" \n\n", m->cost, m->exp); } printf("

%s

Name

Characteristics

Equipment, Skills & Injuries

Cost

Exp.

%s
%s

\n"); printf(" \n"); printf(" \n", m->m, m->ws, m->bs, m->s, m->t, m->w, m->i, m->a, m->ld); printf("

M	WS	BS	S	T	W	I	A	Ld
%d	%d	%d	%d	%d	%d	%d	%d	%d

%s\n", m->equipment); if (m->skills != ((char *)NULL)) printf("
%s\n", m->skills); if (m->injuries != ((char *)NULL)) printf("
%s\n", m->injuries); printf("

\n\n"); /* MAIN TABLE */ printf("

\n\n"); /* Footer */ printf("

\n"); printf("This page generated by "); printf("%s", progname); printf(", written by "); printf("Andy Cowell.\n"); printf("
\n"); printf("Thanks to "); printf(""); printf("Mark Shieh for the basis of the Netscape table format.\n"); printf("\n\n\n"); } static int gang_compare(struct _gang **x, struct _gang **y) { /* qsort will sort low to high */ return((*x)->rating - (*y)->rating); } static int reverse_gang_compare(struct _gang **x, struct _gang **y) { /* qsort will sort high to low */ return((*y)->rating - (*x)->rating); } static int reverse_member_compare(struct _member **x, struct _member **y) { /* qsort will sort high to low */ return((*y)->exp - (*x)->exp); } void do_stats(struct _gang *g) { struct _gang **gangs, *p; int gang_count, i; struct _member **members, *q; int member_count; /* First, let's sort our gang ratings */ /* How many gangs do we have? */ for (p=g, gang_count=0; p!=((struct _gang *)NULL); p=p->next, gang_count++); if (debug) printf("We have %d gangs.\n", gang_count); /* Copy pointers into gangs[] for sorting */ gangs = (struct _gang **)malloc(sizeof(struct _gang *) * gang_count); for (p=g, i=0; p!=((struct _gang *)NULL); p=p->next, i++) gangs[i] = p; /* Sort our gangs based on their ratings */ qsort(gangs, gang_count, sizeof(struct _gang *), reverse_gang_compare); for (i=0; iname, gangs[i]->rating); printf("\n\n"); /* Now, do similarly for their members, based on experience. */ /* How many members do we have? */ for (p=g, member_count=0; p!=((struct _gang *)NULL); p=p->next) for (q=p->member; q!=((struct _member *)NULL); q=q->next, member_count++); if (debug) printf("We have %d members.\n", member_count); /* Copy pointers into members[] for sorting */ members = (struct _member **)malloc(sizeof(struct _member *) * member_count); for (p=g, i=0; p!=((struct _gang *)NULL); p=p->next) for (q=p->member; q!=((struct _member *)NULL); q=q->next, i++) members[i] = q; /* Sort our members based on their ratings */ qsort(members, member_count, sizeof(struct _member *), reverse_member_compare); for (i=0; iname, members[i]->gang_name, members[i]->exp); printf("\n"); }