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

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

Overloaded dereference operator so the iterator can masquerade as a pointer to a member */

Overloaded dereference operator so the iterator can masquerade as a pointer to a member */

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

Shifts both x and y */

Atomic set */

Two addresses may point to the same computer but be != because they have different IP's. */

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

For two triangles to be equal they must have the same vertices <I>in the same order</I>. That is, vertex[0] == vertex[0], etc. */

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

Returns true iff the values referenced by the handles are equivalent. */

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

Shifts both x and y */

Performs bounds checks in debug mode. [] are relative to the start of the file, not the current position. Seeks to the new position before

* member access, allows use of construct mat[r][c] */

Returns NULL if the object is not in the cache */

When System::malloc fails to allocate memory because the system is out of memory, it invokes this handler (if it is not NULL). The argument

Returns true if the intersection of the boxes is non-empty. */

Returns a pointer to the upper left pixel as Color3uint8. */

Returns a pointer to the upper left pixel as Color4uint8. */

Argument may be 0 or 1 */

Transforms the point into object space. Assumes that the rotation matrix is orthonormal. */

Transforms the point into world space. */

Remove the last element from the queue. The queue will never shrink in size. (A typical queue only uses popFront). */

Pops the last element and discards it without returning anything. Faster than pop. By default, does not shrink the underlying array.*/

Remove the next element from the head of the queue. The queue will never shrink in size. */

"The member function removes the last element of the controlled sequence, which must be non-empty." For compatibility with std::vector. */

Returns 2^x */