* @param v vehicle to check

 * @return true if in hangar

 */

{

	assert(v->type == VEH_AIRCRAFT);

	return v->vehstatus & VS_HIDDEN && IsHangarTile(v->tile);

 * @param v vehicle to check

 * @return true if in hangar and stopped

 */

{

	return IsAircraftInHangar(v) && v->vehstatus & VS_STOPPED;

}

	return &_bridge[i];

}

#endif /* BRIDGE_H */

#include <string>

#include <map>

class Driver {

public:

int UpdateCompanyRatingAndValue(Player *p, bool update);

VARDEF Subsidy _subsidies[MAX_PLAYERS];

void DeleteSubsidyWithTown(TownID index);

void DeleteSubsidyWithIndustry(IndustryID index);

void DeleteSubsidyWithStation(StationID index);

	                    //       kind of visual effect to generate for a vehicle (default, steam, diesel, electric).

	                    //       Same goes for the callback result, which atm is only used to check if a wagon is powered.

	byte shorten_factor;   ///< length on main map for this type is 8 - shorten_factor

	byte user_def_data;    ///< Property 0x25: "User-defined bit mask" Used only for (very few) NewGRF vehicles

};

 * @param  erl The renewlist for a given player.

 * @return The new renewlist for the player.

 */

/**

 * Retrieve the engine replacement in a given renewlist for an original engine type.

 * @param flags The calling command flags.

 * @return 0 on success, CMD_ERROR on failure.

 */

/**

 * Remove an engine replacement from a given renewlist.

 * @param flags The calling command flags.

 * @return 0 on success, CMD_ERROR on failure.

 */

/** When an engine is made buildable or is removed from being buildable, add/remove it from the build/autoreplace lists

 * @param type The type of engine

/* misc.cpp */

bool IsCustomName(StringID id);

void DeleteName(StringID id);

#define AllocateName(name, skip) RealAllocateName(name, skip, false)

StringID RealAllocateName(const char *name, byte skip, bool check_double);

void ResetObjectToPlace();

bool ScrollMainWindowToTile(TileIndex tile, bool instant = false);

bool ScrollMainWindowTo(int x, int y, bool instant = false);

typedef int32 CursorID;

struct Point {

};

struct Rect {

 * @pre IsTileType(t, MP_INDUSTRY)

 * @return the industry

 */

{

	return GetIndustry(GetIndustryIndex(t));

}

};

bool MxInitialize(uint rate);

void MxSetChannelRawSrc(MixerChannel *mc, int8 *mem, uint size, uint rate, uint flags);

void MxSetChannelVolume(MixerChannel *mc, uint left, uint right);

void MxActivateChannel(MixerChannel*);

void ChangeOwnershipOfPlayerItems(PlayerID old_player, PlayerID new_player);

void GetNameOfOwner(Owner owner, TileIndex tile);

void SetLocalPlayer(PlayerID new_player);

#define FOR_ALL_PLAYERS(p) for (p = _players; p != endof(_players); p++)

	return count;

}

{

	assert(IS_INSIDE_1D(i, PLAYER_FIRST, lengthof(_players)));

	return &_players[i];

 * @param p the player "in action"

 * @return The "best" railtype a player has available

 */

{

	if (HasRailtypeAvail(p, RAILTYPE_MAGLEV)) return RAILTYPE_MAGLEV;

	if (HasRailtypeAvail(p, RAILTYPE_MONO)) return RAILTYPE_MONO;

struct Queue;

struct InsSortNode {

	int priority;

	InsSortNode* next;

};

struct BinaryHeapNode {

	int priority;

};

	 * Pushes an element into the queue, at the appropriate place for the queue.

	 * Requires the queue pointer to be of an appropriate type, of course.

	 */

	/*

	 * Pops the first element from the queue. What exactly is the first element,

	 * is defined by the exact type of queue.

	 */

	/*

	 * Deletes the item from the queue. priority should be specified if

	 * known, which speeds up the deleting for some queue's. Should be -1

	 * if not known.

	 */

	/* Clears the queue, by removing all values from it. It's state is

	 * effectively reset. If free_items is true, each of the items cleared

	 * in this way are free()'d.

	 */

	/* Frees the queue, by reclaiming all memory allocated by it. After

	 * this it is no longer usable. If free_items is true, any remaining

	 * items are free()'d too.

	 */

	union {

		struct {

		} inssort;

		struct {

			uint max_size;

			uint size;

			uint blocks; ///< The amount of blocks for which space is reserved in elements

		} binaryheap;

	} data;

};

/* Initializes a inssort and allocates internal memory. There is no maximum

 * size */

/*

/** Initializes a binary heap and allocates internal memory for maximum of

 * max_size elements */

/*

struct HashNode {

	uint key1;

	uint key2;

};

/**

 * Generates a hash code from the given key pair. You should make sure that

typedef uint Hash_HashProc(uint key1, uint key2);

struct Hash {

	/* The hash function used */

	/* The amount of items in the hash */

	uint size;

	/* The number of buckets allocated */

	uint num_buckets;

	/* A pointer to an array of num_buckets buckets. */

	/* A pointer to an array of numbuckets booleans, which will be true if

	 * there are any Nodes in the bucket */

};

/* Call these function to manipulate a hash */

/** Deletes the value with the specified key pair from the hash and returns

 * that value. Returns NULL when the value was not present. The value returned

 * is _not_ free()'d! */

/** Sets the value associated with the given key pair to the given value.

 * Returns the old value if the value was replaced, NULL when it was not yet present. */

/** Gets the value associated with the given key pair, or NULL when it is not

 * present. */

/* Call these function to create/destroy a hash */

/** Builds a new hash in an existing struct. Make sure that hash() always

 * returns a hash less than num_buckets! Call delete_hash after use */

/**

 * Deletes the hash and cleans up. Only cleans up memory allocated by new_Hash

 * & friends. If free is true, it will call free() on all the values that

 * are left in the hash.

 */

/**

 * Cleans the hash, but keeps the memory allocated

 */

/**

 * Gets the current size of the Hash

 */

#endif /* QUEUE_H */

}

{

	assert(v->type == VEH_ROAD);

	return v->u.road.state == 254;

}

{

	return IsRoadVehInDepot(v) && v->vehstatus & VS_STOPPED;

}

void RecalcShipStuff(Vehicle *v);

void GetShipSpriteSize(EngineID engine, uint &width, uint &height);

{

	assert(v->type == VEH_SHIP);

	return v->u.ship.state == 0x80;

}

{

	return IsShipInDepot(v) && v->vehstatus & VS_STOPPED;

}

struct DrawTileSprites {

	SpriteID ground_sprite;

	SpriteID ground_pal;

};

/**

	return (StationID)_m[t].m2;

}

{

	return GetStation(GetStationIndex(t));

}

 *             if NULL no boundary check is performed

 * @return a pointer to the terminating \0 in the destination buffer

 */

/** Scans the string for valid characters and if it finds invalid ones,

 * replaces them with a question mark '?' */

void strtolower(char *str);

/** Get the length of a string, within a limited buffer */

#define STRINGS_H

char *InlineString(char *buf, StringID string);

extern char _userstring[128];

struct OTTDThread;

void        OTTDExitThread();

#endif /* THREAD_H */

 * @param t the tile to get the town of

 * @return the town

 */

{

	return GetTown(GetTownIndex(t));

}

	 * @param v    the vehicle to use as 'storage' backend

	 * @return the memory that is 'allocated'

	 */

	/**

	 * 'Free' the memory allocated by the overriden new.

Vehicle *GetLastVehicleInChain(Vehicle *v);

Vehicle *GetPrevVehicleInChain(const Vehicle *v);

Vehicle *GetFirstVehicleInChain(const Vehicle *v);

bool IsEngineCountable(const Vehicle *v);

void DeleteVehicleChain(Vehicle *v);

void *VehicleFromPos(TileIndex tile, void *data, VehicleFromPosProc *proc);

};

struct GetNewVehiclePosResult {

	TileIndex old_tile;

	TileIndex new_tile;

};

/* returns true if staying in the same tile */

GetNewVehiclePosResult GetNewVehiclePos(const Vehicle *v);

#define BEGIN_ENUM_WAGONS(v) do {

DECLARE_OLD_POOL(Vehicle, Vehicle, 9, 125)

static inline void MaxZoomInOut(int how, Window *w)

{

}

void OffsetGroundSprite(int x, int y);

CommandCost RemoveTrainWaypoint(TileIndex tile, uint32 flags, bool justremove);

Station *ComposeWaypointStation(TileIndex tile);

void ShowRenameWaypointWindow(const Waypoint *cp);

void FixOldWaypoints();

void UpdateAllWaypointSigns();

void AfterLoadWaypoints();