/*
Copyright (C) 1997-2001 Id Software, Inc.

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.

*/

// Created on 14.01.2004 by RST.
// $Id: server_static_t.java,v 1.1 2004-07-07 19:59:51 hzi Exp $

package jake2.server;

import jake2.*;
import jake2.client.*;
import jake2.game.*;
import jake2.qcommon.*;
import jake2.render.*;
import jake2.server.*;

import java.io.*;

public class server_static_t {
	public server_static_t() {
		for (int n = 0; n < Defines.MAX_CHALLENGES; n++) {
			challenges[n] = new challenge_t();
		}
	}

	boolean initialized; // sv_init has completed
	int realtime; // always increasing, no clamping, etc

	//char		mapcmd[MAX_TOKEN_CHARS];	// ie: *intro.cin+base
	String mapcmd = ""; // ie: *intro.cin+base 

	int spawncount; // incremented each server start
	// used to check late spawns

	client_t clients[]; // [maxclients->value];

	int num_client_entities; // maxclients->value*UPDATE_BACKUP*MAX_PACKET_ENTITIES
	int next_client_entities; // next client_entity to use
	entity_state_t client_entities[]; // [num_client_entities]

	int last_heartbeat;

	challenge_t challenges[] = new challenge_t[Defines.MAX_CHALLENGES]; // to prevent invalid IPs from connecting

	// serverrecord values
	RandomAccessFile demofile;
	sizebuf_t demo_multicast = new sizebuf_t();
	byte demo_multicast_buf[] = new byte[Defines.MAX_MSGLEN];
}