判断进程句柄是否具有 UI 访问权限

=========================================================================== * Initialize a new block. */

=========================================================================== * Set match_start to the longest match starting at the given string and

When we expand the contanier, we may need to expand the locks array, if the current locks array is smaller than the maximum size and also smaller than

Computes lhs * rhs / pow(2, 64) rounded to nearest with half-up tie breaking.

Returns an iterator to the beginning of the output range.

=========================================================================== * Restore the heap property by moving down the tree starting at node k,

Does a batch resize of the remaining data in old_buckets_. Assumes all the locks have already been taken.

Remove trailing zeros from n and return the number of zeros removed (float)

* Reserve enough space in the table for the given number of elements. If * the table can already hold that many elements, the function will shrink