Function findEntityInLine

src/collision.cpp:1799–2223

-------------------------------------------------------------------------------*/

Entity* findEntityInLine( Entity* my, real_t x1, real_t y1, real_t angle, int entities, Entity* target, list_t* entityListToUse)
{
	Entity* result = NULL;
	node_t* node;
	real_t lowestDist = 9999;
	int quadrant = 0;

	while ( angle >= PI * 2 )
	{
		angle -= PI * 2;
	}
	while ( angle < 0 )
	{
		angle += PI * 2;
	}

	if ( !my )
	{
		return nullptr;
	}
	int originx = static_cast<int>(my->x) >> 4;
	int originy = static_cast<int>(my->y) >> 4;
	std::vector<list_t*> entLists; // stores the possible entities to look through depending on the quadrant.
	// start search from 1 tile behind facing direction in x/y position, extending to the edge of the map in the facing direction.

	if ( multiplayer == CLIENT )
	{
		entLists.push_back(map.entities); // default to old map.entities if client (if they ever call this function...)
	}

	Stat* myStats = my->getStats();

	if ( angle >= PI / 2 && angle < PI ) // -x, +y
	{
		quadrant = 1;
		/*messagePlayer(0, "drawing from x: %d - %d, y: %d- %d", 
			0,	std::min(static_cast<int>(map.width) - 1, originx + 1),
			std::max(0, originy - 1), map.height - 1);*/

		if ( multiplayer != CLIENT )
		{
			for ( int ix = std::min(static_cast<int>(map.width) - 1, originx + 1); ix >= 0; --ix )
			{
				for ( int iy = std::max(0, originy - 1); iy < map.height; ++iy )
				{
					entLists.push_back(&TileEntityList.gridEntities[ix][iy]);
				}
			}
		}
	}
	else if ( angle >= 0 && angle < PI / 2 ) // +x, +y
	{
		quadrant = 2;
		/*messagePlayer(0, "drawing from x: %d - %d, y: %d- %d",
			std::max(0, originx - 1), map.width - 1,
			std::max(0, originy - 1), map.height - 1);*/

		if ( multiplayer != CLIENT )