! * Removes the key `k` from the k. Does nothing if the key is not * associated in the map. It may allocate memory and its complexity is

! * Returns a table without entries with given key `k`. If the key is not * present it returns `*this`. It may allocate * memory and it

! * Removes the `value` from the set, doing nothing if the value is not in * the set. It may allocate memory and its complexity is *effecti

! * Removes table entry by given key `k` if there is any. It may allocate * memory and its complexity is *effectively* @f$ O(1) @f$. */

! * Returns a set without `value`. If the `value` is not in the * set it returns the same set. It may allocate memory and its * compl

* Converts the characters "&", "<", ">", '"', "'", and "\`" in `string` to * their corresponding HTML entities. * * **Note:** No other

* Escapes the `RegExp` special characters "^", "$", "\", ".", "*", "+", * "?", "(", ")", "[", "]", "{", "}", and "|" in `string`. * * @

* Used by `_.template` to escape characters for inclusion in compiled string literals. * * @private * @param {string} chr The matched charact

* Determines if more clones should be queued or if cycling should stop.

* Checks if `predicate` returns truthy for **all** elements of `collection`. * Iteration is stopped once `predicate` returns falsey. The predicat

* Fills elements of `array` with `value` from `start` up to, but not * including, `end`. * * **Note:** This method mutates `array`.

* An `Array#filter` like method. * * @name filter * @memberOf Benchmark.Suite * @param {Function|string} callback The function/ali

! * Returns a pointer to the value associated with the key `k`. If * the key is not contained in the map, a `nullptr` is returned. * I

! * Returns a pointer to the value associated with the key `k`. * If there is no entry with such a key in the table, * a `nullptr` is r

! * Returns a pointer to the value if `value` is contained in the * set, or nullptr otherwise. * It does not allocate memory and its co

! * Returns a pointer to the value associated with the key `k`. * If there is no entry with such a key in the table, * a `nullptr` is r

! * Returns a pointer to the value if `value` is contained in the * set, or nullptr otherwise. * It does not allocate memory and its co

* This method is like `_.find` except that it returns the index of the first * element `predicate` returns truthy for instead of the element itse

* This method is like `_.find` except that it returns the key of the first * element `predicate` returns truthy for instead of the element itself

* This method is like `_.findIndex` except that it iterates over elements * of `collection` from right to left. * * @static * @mem

* This method is like `_.findKey` except that it iterates over elements of * a collection in the opposite order. * * @static * @me

* Creates a flattened array of values by running each element in `collection` * thru `iteratee` and flattening the mapped results. The iteratee i

* This method is like `_.flatMap` except that it recursively flattens the * mapped results. * * @static * @memberOf _ * @sinc

* This method is like `_.flatMap` except that it recursively flattens the * mapped results up to `depth` times. * * @static * @mem

* Flattens `array` a single level deep. * * @static * @memberOf _ * @since 0.1.0 * @category Array * @param {Array} arra

* Recursively flattens `array`. * * @static * @memberOf _ * @since 3.0.0 * @category Array * @param {Array} array The ar

* Recursively flatten `array` up to `depth` times. * * @static * @memberOf _ * @since 4.4.0 * @category Array * @param {

! * Default constructor. It creates a flex_vector of `size() == 0`. * It does not allocate memory and its complexity is @f$ O(1) @f$.

! * Default constructor. It creates a flex_vector of `size() == 0`. It * does not allocate memory and its complexity is @f$ O(1) @f$.

* Creates a function that invokes `func` with arguments reversed. * * @static * @memberOf _ * @since 4.0.0 * @category Functi

* Iterates over elements of `collection` and invokes `iteratee` for each element. * The iteratee is invoked with three arguments: (value, index|k

* This method is like `_.forEach` except that it iterates over elements of * `collection` from right to left. * * @static * @membe

* Iterates over own and inherited enumerable string keyed properties of an * object and invokes `iteratee` for each property. The iteratee is inv

* This method is like `_.forIn` except that it iterates over properties of * `object` in the opposite order. * * @static * @member

* Iterates over own enumerable string keyed properties of an object and * invokes `iteratee` for each property. The iteratee is invoked with thre

* This method is like `_.forOwn` except that it iterates over properties of * `object` in the opposite order. * * @static * @membe

* The inverse of `_.toPairs`; this method returns an object composed * from key-value `pairs`. * * @static * @memberOf _ * @s