utility.qh File Reference

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions
float	fsnap (float val, float fsize)
bool	location_isok (vector point, bool waterok, bool air_isok)
entity	pathlib_nodeatpoint (vector where)
float	tile_check_plus2 (entity this, vector where)

Function Documentation

fsnap()

float fsnap	(	float	val,
		float	fsize
	)

Definition at line 57 of file math.qh.

References ERASEABLE, and rint().

Referenced by pathlib_astar(), pathlib_flynode(), pathlib_nodeatpoint(), pathlib_swimnode(), pathlib_walknode(), and pathlib_wateroutnode().

{
    return rint(val / fsize) * fsize;
}

Here is the call graph for this function:

Here is the caller graph for this function:

location_isok()

bool location_isok	(	vector	point,
		bool	waterok,
		bool	air_isok
	)

Definition at line 7 of file utility.qc.

References CONTENT_EMPTY, CONTENT_SOLID, CONTENT_WATER, Q3SURFACEFLAG_SKY, and trace_dphitq3surfaceflags.

Referenced by beamsweep(), tile_check_cross(), tile_check_plus(), and tile_check_plus2().

{
    if(trace_dphitq3surfaceflags & Q3SURFACEFLAG_SKY)
        return false;

    int pc = pointcontents(point);
    int pc2 = pointcontents(point - '0 0 1');

    if(pc == CONTENT_EMPTY && pc2 == CONTENT_SOLID)
        return true;
    if(pc == CONTENT_EMPTY && pc2 == CONTENT_WATER && waterok)
        return true;
    if(pc == CONTENT_EMPTY && pc2 == CONTENT_EMPTY && air_isok)
        return true;
    if(pc == CONTENT_WATER && waterok)
        return true;
    return false;
}

Here is the caller graph for this function:

pathlib_nodeatpoint()

entity pathlib_nodeatpoint

(

vector

where

)

Definition at line 26 of file utility.qc.

References entity(), fsnap(), g_pathlib_nodes, IL_EACH, NULL, pathlib_gridsize, pathlib_searched_cnt, and vdist.

Referenced by pathlib_makenode_adaptive(), and pathlib_mknode().

{
    ++pathlib_searched_cnt;

    where.x = fsnap(where.x,pathlib_gridsize);
    where.y = fsnap(where.y,pathlib_gridsize);

    entity found = NULL; // TODO: using FOREACH_ENTITY_RADIUS here causes mutex loop warnings, this may need a proper fix!
    IL_EACH(g_pathlib_nodes, it.is_path_node && vdist(it.origin - where, <, pathlib_gridsize * 0.5),
    {
        found = it;
        break;
    });

    return found;
}

Here is the call graph for this function:

Here is the caller graph for this function:

tile_check_plus2()

float tile_check_plus2	(	entity	this,
		vector	where
	)

Definition at line 112 of file utility.qc.

References location_isok(), MOVE_WORLDONLY, pathlib_gridsize, pathlib_node_edgeflag_back, pathlib_node_edgeflag_backleft, pathlib_node_edgeflag_backright, pathlib_node_edgeflag_forward, pathlib_node_edgeflag_forwardleft, pathlib_node_edgeflag_forwardright, pathlib_node_edgeflag_left, pathlib_node_edgeflag_none, pathlib_node_edgeflag_right, PLIB_FORWARD, PLIB_RIGHT, tile_check_down, tile_check_up, trace_endpos, and vector().

Referenced by pathlib_expandnode_star().

{
    vector p;
    int j = 0, e = 0;

    vector f = PLIB_FORWARD * pathlib_gridsize;
    vector r = PLIB_RIGHT   * pathlib_gridsize;

//#define pathlib_node_edgeflag_left    2
//#define pathlib_node_edgeflag_right   4
//#define pathlib_node_edgeflag_forward 8
//#define pathlib_node_edgeflag_back    16

    // forward
    p = where + f;
    traceline(p+tile_check_up,p-tile_check_down,MOVE_WORLDONLY,this);
    if (location_isok(trace_endpos,1,0))
    {
       ++j;
       e |= pathlib_node_edgeflag_forward;
    }


    //left
    p = where - r;
    traceline(p+tile_check_up,p-tile_check_down,MOVE_WORLDONLY,this);
    if (location_isok(trace_endpos,1,0))
    {
       ++j;
       e |= pathlib_node_edgeflag_left;
    }


    // Right
    p = where + r;
    traceline(p+tile_check_up,p-tile_check_down,MOVE_WORLDONLY,this);
    if (location_isok(trace_endpos,1,0))
    {
       ++j;
       e |= pathlib_node_edgeflag_right;
    }

    //Back
    p = where - f;
    traceline(p+tile_check_up,p-tile_check_down,MOVE_WORLDONLY,this);
    if (location_isok(trace_endpos,1,0))
    {
       ++j;
       e |= pathlib_node_edgeflag_back;
    }

    // forward-right
    p = where + f + r;
    traceline(p + tile_check_up, p - tile_check_down, MOVE_WORLDONLY, this);
    if (location_isok(trace_endpos, 1, 0))
    {
       ++j;
       e |= pathlib_node_edgeflag_forwardright;
    }

    // Forward-left
    p = where + f - r;
    traceline(p + tile_check_up, p - tile_check_down, MOVE_WORLDONLY, this);
    if (location_isok(trace_endpos, 1, 0))
    {
       ++j;
       e |= pathlib_node_edgeflag_forwardleft;
    }

    // Back-right
    p = where - f + r;
    traceline(p + tile_check_up, p - tile_check_down, MOVE_WORLDONLY, this);
    if (location_isok(trace_endpos, 1 ,0))
    {
       ++j;
       e |= pathlib_node_edgeflag_backright;
    }

    //Back-left
    p = where - f - r;
    traceline(p + tile_check_up, p - tile_check_down, MOVE_WORLDONLY, this);
    if (location_isok(trace_endpos, 1, 0))
    {
       ++j;
       e |= pathlib_node_edgeflag_backleft;
    }


    if(j == 0)
        e = pathlib_node_edgeflag_none;

    return e;
}

Here is the call graph for this function:

Here is the caller graph for this function: