* Finds the position of the first element in an ordered range that has a value greater than or equivalent to a specified value, * where the ordering

* Erases all the elements of a avl tree. */

* Return the number of specific elements in an avl tree */

* Destroy avl tree container auxiliary function. */

* Erase an element in an avl tree from specificed position. */

* Erase a range of element in an avl tree. */

* Find specific element. */

* Get minimum avlnode. */

* Tests if the first avl tree is greater than the second avl tree. */

* Calculate distance between two iterators. */

* Return an iterator to the first element that is equal to or greater than a specific element. */

* Rebalance the subtree and update the root height. */

* Test the type and compare function that saved in the avl tree container is same. */

* Return an iterator to the first element that is greater than a specific element. */

* Destroy data, the data type and basic_string element data type are same. */

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

* Initialize element with basic_string element type auxiliary function. */

* Compare two iterators for equality. */

exported function implementation section **/ * Create avl tree container auxiliary function. */

exported function implementation section **/ * Create hashtable container auxiliary function. */

exported function implementation section **/ * Create rb tree container auxiliary function. */

* Create vector container auxiliary function. */

* Move element range to deque begin. */

* Shrink deque at end. */

* Destroy data, the data type and hash_multiset element data type are same. */

exported function implementation section **/ * Obtain data from variable argument list, the data type and hash_multiset element data type are same. *

* Destroy data, the data type and hash_set element data type are same. */

exported function implementation section **/ * Obtain data from variable argument list, the data type and hash_set element data type are same. */

* Return the number of specific elements in an hashtable */

* Destroy hashtable container auxiliary function. */

* Test if an hashtable is empty. */

* Erase an element in an hashtable from specificed position. */

* Erase a range of element in an hashtable. */

* Find specific element. */

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

* Calculate distance between two iterators. */

* Resize. */

* Destroy data, the data type and list element data type are same. */

* _mongoc_gridfs_file_refresh_page: * * Refresh a GridFS file's underlying page. This recalculates the current * page number based on the fil

*-------------------------------------------------------------------------- * * _mongoc_topology_description_topology_has_server -- * * Retu

-------------------------------------------------------------------------- * * _mongoc_write_error_get_type -- * * Checks if the error or re

* Erases all the elements of an rb tree. */

* Return the number of specific elements in an rb tree */

* Destroy rb tree container auxiliary function. */

* Erase an element in an rb tree from specificed position. */

* Erase a range of element in an rb tree. */

* Find specific element. */

* Get minimum rbnode. */

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

* Calculate distance between two iterators. */

* Return an iterator to the first element that is equal to or greater than a specific element. */

* Test the type and compare function that saved in the rb tree container is same. */

* Return an iterator to the first element that is greater than a specific element. */

* Destroy data, the data type and slist element data type are same. */

* Destroy vector container auxiliary function. */

* Compare two iterators for equality. */