Number of items in table.

override*/

Release lock

============================================================================= Basically Kabsch's algorithm but also allows the collection of points to

============================================================================ Face detection helpers ==================================================

The main internal landmark detection call (should not be used externally?)

Getting the closest view center based on orientation

============================================================================= Getting the closest view center based on orientation

Using the XYZ convention R = Rx * Ry * Rz, left-handed positive sign

override*/

_size in bytes

Maximum size to which array can grow without allocating more memory. Concurrent allocations are not included in the value.

Check the list for order violations

Remove all elements in the set */

Destroys local copies

Copy the set to two C arrays * @param indices pointer to a C array of indices * @param dist pointer to a C array of distances * @param

Allocate a new node with the given order key; used to allocate dummy nodes