Import of Empire 4.2.12
This commit is contained in:
commit
d8b7fdfae1
817 changed files with 126589 additions and 0 deletions
66
src/lib/subs/cnumb.c
Normal file
66
src/lib/subs/cnumb.c
Normal file
|
@ -0,0 +1,66 @@
|
|||
/*
|
||||
* Empire - A multi-player, client/server Internet based war game.
|
||||
* Copyright (C) 1986-2000, Dave Pare, Jeff Bailey, Thomas Ruschak,
|
||||
* Ken Stevens, Steve McClure
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||
*
|
||||
* ---
|
||||
*
|
||||
* See the "LEGAL", "LICENSE", "CREDITS" and "README" files for all the
|
||||
* related information and legal notices. It is expected that any future
|
||||
* projects/authors will amend these files as needed.
|
||||
*
|
||||
* ---
|
||||
*
|
||||
* cnumb.c: Return country number give country name
|
||||
*
|
||||
* Known contributors to this file:
|
||||
*
|
||||
*/
|
||||
|
||||
#include "misc.h"
|
||||
#include "player.h"
|
||||
#include "nat.h"
|
||||
#include "file.h"
|
||||
#include "prototypes.h"
|
||||
|
||||
int
|
||||
cnumb(s_char *cntry)
|
||||
{
|
||||
register s_char *ncp;
|
||||
register s_char *cp;
|
||||
register struct natstr *natp;
|
||||
int bcount;
|
||||
natid best;
|
||||
natid cn;
|
||||
|
||||
bcount = 0;
|
||||
for (cn = 0; cn < MAXNOC; cn++) {
|
||||
if ((natp = getnatp(cn)) == 0)
|
||||
break;
|
||||
ncp = natp->nat_cnam;
|
||||
for (cp=cntry; *cp == *ncp; cp++, ncp++) {
|
||||
if (*cp == 0)
|
||||
return cn;
|
||||
}
|
||||
if (cp > cntry && *cp == 0) {
|
||||
best = cn;
|
||||
bcount++;
|
||||
}
|
||||
}
|
||||
/* can only have 1 match or not successful */
|
||||
return bcount == 1 ? (int) best : -1;
|
||||
}
|
Loading…
Add table
Add a link
Reference in a new issue