Clones a whole chain; */

Returns true if this object is in the set, otherwise returns false. O(1) time. */

Creates a strong pointer, which prevents the object from being garbage collected. The strong pointer may be NULL, which means that the un

----------------------------------------------------------------------------

Returns zero if the result is zero after decrement, non-zero otherwise.*/

----------------------------------------------------------------------------

----------------------------------------------------------------------------

@par All vertices are projected onto the xz-plane, so the y-values are ignored.

@par All points are projected onto the xz-plane, so the y-values are ignored.

Returns true of status is in progress.

Derives the square of the distance between the specified points on the xz-plane. @param[in] v1 A point. [(x, y, z)] @param[in] v2 A point. [(x, y, z

Scales the vector by the specified value. (@p v * @p t) @param[out] dest The result vector. [(x, y, z)] @param[in] v The vector to scale. [(x, y, z)

Sets the vector elements to the specified values. @param[out] dest The result vector. [(x, y, z)] @param[in] x The x-value of the vector. @param[in]

C++ STL style iterator method. Returns one after the last iterator element. */

Locate the cell and index within that cell containing v. Called by remove() and contains(). */

Returns the deepest node that completely contains bounds. */

Returns the deepest node that completely contains bounds. */

Recursively appends all handles and children's handles to the array. */

Recursively appends all handles and children's handles to the array. */

Returns the include flags for the filter. Any polygons that include one or more of these flags will be included in the operation.

@par Off-mesh connections are stored in the navigation mesh as special 2-vertex polygons with a single edge. At least one of the vertices is expected

Returns true if point is on the side the normal points to or is in the plane. */

Return the intersection of the two boxes */

True if there is non-zero area to the intersection between @a this and @a r. Note that two rectangles that are adjacent do not intersect becau

Note that q<SUP>-1</SUP> = q.conj() for a unit quaternion. @cite Dam99 page 13 */

A<SUP>-1</SUP> computed using the Gauss-Jordan algorithm, for square matrices. Run time is <I>O(R³)</I>, where <I>R</i> is the

Number of elements in the array. (Same as size; this is just here for convenience). */

----------------------------------------------------------------------------

Starting line of the input from which this token was parsed. Starts at 1. */

Busy waits until the lock is unlocked, then locks it exclusively. Returns true if the lock succeeded on the first try (indicating no

scalar B - this */

@par This method is optimized for small delta movement and a small number of polygons. If used for too great a distance, the result set will form an

Raise this quaternion to a power. For a rotation, this is the effect of rotating x times as much as the original quaterion. Note that

Removes k from the cache or does nothing if it is not currently in the cache.*/

Sets the exclude flags for the filter. @param[in] flags The new flags.

Used by makeNode to create fake handles for partitioning. */

Recommends that the table resize to anticipate at least this number of elements. */

option setters - use optional

A<SUP>T</SUP> */

Computes a floating point modulo; the result is t wrapped to the range [lo, hi). */

######################## MMapManager ########################

Deletes the children (but not the values) */

Does not initialize the fields */

NULL pointer; indicates that the G3D::Texture class should choose either RGBA8 or RGB8 depending on the presence of an alpha channel in the