* Aborts the benchmark without recording times. * * @memberOf Benchmark * @returns {Object} The benchmark instance.

* Aborts all benchmarks in the suite. * * @name abort * @memberOf Benchmark.Suite * @returns {Object} The suite instance.

* Adds a test to the benchmark suite. * * @memberOf Benchmark.Suite * @param {string} name A name to identify the benchmark. * @pa

* Adds the key-value `pair` to `map`. * * @private * @param {Object} map The map to modify. * @param {Array} pair The key-value pair to ad

* Adds `value` to `set`. * * @private * @param {Object} set The set to modify. * @param {*} value The value to add. * @returns {Object}

* The opposite of `_.before`; this method creates a function that invokes * `func` once it's called `n` or more times. * * @static

GC_n is permitted to be 0. The C++ standard says nothing about what the return value is when GC_n == 0.

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

* A specialized version of `baseAggregator` for arrays. * * @private * @param {Array} [array] The array to iterate over. * @param {Functio

* A specialized version of `_.forEachRight` for arrays without support for * iteratee shorthands. * * @private * @param {Array} [array] Th

* A specialized version of `_.every` for arrays without support for * iteratee shorthands. * * @private * @param {Array} [array] The array

* This function is like `arrayIncludes` except that it accepts a comparator. * * @private * @param {Array} [array] The array to search. *

* A specialized version of `_.reduceRight` for arrays without support for * iteratee shorthands. * * @private * @param {Array} [array] The

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

* Used by `_.defaults` to customize its `_.assignIn` use. * * @private * @param {*} objValue The destination value. * @param {*} s

! * Returns a `const` reference to the element at position * `index`. It throws an `std::out_of_range` exception when @f$ * index \geq

! * Returns a `const` reference to the element at position * `index`. It throws an `std::out_of_range` exception when @f$ * index \geq

! * Returns a `const` reference to the element at position * `index`. It throws an `std::out_of_range` exception when @f$ * index \geq

! * Returns a `const` reference to the element at position * `index`. It throws an `std::out_of_range` exception when @f$ * index \geq

! * Returns a `const` reference to the element at position * `index`. It throws an `std::out_of_range` exception when @f$ * index \geq

* Aggregates elements of `collection` on `accumulator` with keys transformed * by `iteratee` and values set by `setter`. * * @private

* The base implementation of `_.every` without support for iteratee shorthands. * * @private * @param {Array|Object} collection The col

* The base implementation of `_.filter` without support for iteratee shorthands. * * @private * @param {Array|Object} collection The co

* The base implementation of `getTag`. * * @private * @param {*} value The value to query. * @returns {string} Returns the `toStri

* The base implementation of `_.gt` which doesn't coerce arguments. * * @private * @param {*} value The value to compare. * @param

* The base implementation of `_.hasIn` without support for deep paths. * * @private * @param {Object} [object] The object to query.

* This function is like `baseIndexOf` except that it accepts a comparator. * * @private * @param {Array} array The array to search. * @par

* The base implementation of `_.isArrayBuffer` without Node.js optimizations. * * @private * @param {*} value The value to check.

* The base implementation of `_.isDate` without Node.js optimizations. * * @private * @param {*} value The value to check. * @retu

* The base implementation of `_.isMap` without Node.js optimizations. * * @private * @param {*} value The value to check. * @retur

* The base implementation of `_.isNaN` without support for number objects. * * @private * @param {*} value The value to check. * @returns

* The base implementation of `_.isRegExp` without Node.js optimizations. * * @private * @param {*} value The value to check. * @re

* The base implementation of `_.isSet` without Node.js optimizations. * * @private * @param {*} value The value to check. * @retur

* The base implementation of `_.isTypedArray` without Node.js optimizations. * * @private * @param {*} value The value to check. *

* The function whose prototype chain sequence wrappers inherit from. * * @private

* The base implementation of `_.lt` which doesn't coerce arguments. * * @private * @param {*} value The value to compare. * @param

* The base implementation of `_.reduce` and `_.reduceRight`, without support * for iteratee shorthands, which iterates over `collection` using `eac

* The base implementation of `_.some` without support for iteratee shorthands. * * @private * @param {Array|Object} collection The coll

! * Returns an iterator pointing at the first element of the * collection. It does not allocate memory and its complexity is * @f$ O(1)