** Use scanner's table to cache position of constants in constant list ** and try to reuse constants */

* Converts elements from a specified range into a heap in which the first element is for which a sorting criterion may be specified with a binary pred

* Removes the largest element from the front of a heap to the next-to-last position in the range and then forms a new heap from the remaining elements

* Compare the sub basic_string and the sub value string. */

* Compare two sub basic_strings. */

* bson_iter_key_unsafe: * @iter: A bson_iter_t. * * Similar to bson_iter_key() but performs no integrity checking. * * Returns: A string that sho

* bson_iter_utf8_len_unsafe: * @iter: a bson_iter_t. * * Returns the length of a string currently pointed to by @iter. This performs * no validati

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

Forced write to disk */

* Initialize hash_map container with user define compare function. */

** increment line number and skips newline sequence (any of ** \n, \r, \n\r, or \r\n) */

** tells whether a key or value can be cleared from a weak ** table. Non-collectable objects are never removed from weak ** tables. Strings behave as

* Removes an element in list from specificed position. */

** main search function */

** returns current 'pc' and marks it as a jump target (to avoid wrong ** optimizations with consecutive instructions not in the same basic block). */

* returns 0 if dynamic entry (arg and len are filled) * returns -1 if failure * returns nonzero token index if actually static token */

** returns the 'main' position of an element in a table (that is, the index ** of its hash value) */