File: cont.c

package info (click to toggle)
teg 0.9.2-2.1
  • links: PTS
  • area: main
  • in suites: woody
  • size: 5,232 kB
  • ctags: 2,372
  • sloc: ansic: 18,999; sh: 9,273; makefile: 589; yacc: 318; xml: 160
file content (57 lines) | stat: -rw-r--r-- 1,755 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
/*	$Id: cont.c,v 1.8 2001/10/01 03:31:42 riq Exp $	*/
/* Tenes Empanadas Graciela
 *
 * Copyright (C) 2000 Ricardo Quesada
 *
 * Author: Ricardo Calixto Quesada <rquesada@core-sdi.com>
 *
 * 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; only version 2 of the License
 *
 * 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.
 */
/**
 * @file cont.c
 */

#include "all.h"

CONT g_conts[] = {
	{ N_("South America"), CONTINENTE_AMERICASUR, CONT_AMERICASUR_CANT, 3 },
	{ N_("North America"), CONTINENTE_AMERICANORTE, CONT_AMERICANORTE_CANT, 5 },
	{ N_("Africa"), CONTINENTE_AFRICA, CONT_AFRICA_CANT, 3},
	{ N_("Oceania"), CONTINENTE_OCEANIA, CONT_OCEANIA_CANT, 2 },
	{ N_("Europe"), CONTINENTE_EUROPA, CONT_EUROPA_CANT, 5 },
	{ N_("Asia"), CONTINENTE_ASIA, CONT_ASIA_CANT, 7 },
};
#define NRCONTS ( sizeof(g_conts) /sizeof(g_conts[0]) )

/**
 * @fn int cont_tot( unsigned long  conts )
 * return the total armies that one must place in a continent
 * @param conts Continenet bit-or-wised
 * @return cantidad de fichas que hay que poner
 */
int cont_tot( unsigned long conts )
{
	int max;
	int i;

	max = 0;
	for(i=0;i<NRCONTS;i++) {
		if( conts & 1 ) {
			max += g_conts[i].fichas_x_cont;
		}
		conts >>= 1;
	}

	return max;
}