* Erases all the elements of an hashtable. */

* Return an iterator range that is equal to a specific element. */

* Get data value pointer referenced by iterator, but ignore char*. */

* Tests if the first rb tree is less than the second rb tree. */

* Test the type that saved in the list container and referenced by it_iter are same. */

* Swap the two node content and don't change the pointer. */

*-------------------------------------------------------------------------- * * _mongoc_topology_description_set_state -- * * Change the sta

* Destroy pair container auxiliary function. */

* Return an iterator range that is equal to a specific element. */

* Get data value pointer referenced by iterator, but ignore char*. */

* Tests if the first rb tree is less than the second rb tree. */

* Obtain data from variable argument slist, the data type and slist element data type are same. */

* Test the type that saved in the vector container and referenced by it_iter are same. */

* Test the type that saved in the vector container is same. */

This is an internal function. Its contract is to read a line from * a file into a dynamically allocated buffer, zeroing the trailing * newline if t

Removes the node from the list it's in, if any */

* Get basic_string capacity. */

* Replace elements in a basic_string at a specificed position with specificed sub value string. */

* Tests if a deque is empty. */

* Test the first deque is less than the second deque. */

=========================================================================== * Fill the window when the lookahead becomes insufficient. * Updates str

** Auxiliary function used by several library functions: check for ** an optional thread as function's first argument and set 'arg' with ** 1 if this

* ��ȡnalu������ * @param buff ������startcode(0001/001)��nalu */

* Tests if a list is empty. */

exported function implementation section **/ * Initialize an empty list container */

* Test the first list is less than the second list. */

** create a new collectable object (with given type and size) and link ** it to 'allgc' list. */

** set GCdebt to a new value keeping the value (totalbytes + GCdebt) ** invariant */

** beware: when using this function you probably need to check a GC ** barrier and invalidate the TM cache. */

** Main function for table assignment (invoking metamethods if needed). ** Compute 't[key] = val' */