* Creates an array of function property names from own enumerable properties * of `object`. * * @static * @since 0.1.0 * @mem

* Creates an array of function property names from own and inherited * enumerable properties of `object`. * * @static * @memberOf

* Checks if `path` is a direct property of `object`. * * @static * @since 0.1.0 * @memberOf _ * @category Object * @para

* Removes all key-value entries from the hash. * * @private * @name clear * @memberOf Hash

* Removes `key` and its value from the hash. * * @private * @name delete * @memberOf Hash * @param {Object} hash The hash to

* Gets the hash value for `key`. * * @private * @name get * @memberOf Hash * @param {string} key The key of the value to get.

* Checks if a hash value for `key` exists. * * @private * @name has * @memberOf Hash * @param {string} key The key of the ent

* Sets the hash `key` to `value`. * * @private * @name set * @memberOf Hash * @param {string} key The key of the value to set

* This method returns the first argument it receives. * * @static * @since 0.1.0 * @memberOf _ * @category Util * @param

! * Returns a value that can be used as identity for the container. If two * values have the same identity, they are guaranteed to be equal

! * Returns a value that can be used as identity for the container. If two * values have the same identity, they are guaranteed to be equal

! * Returns a value that can be used as identity for the container. If two * values have the same identity, they are guaranteed to be equal

! * Returns a value that can be used as identity for the container. If two * values have the same identity, they are guaranteed to be equal

* Checks if `n` is between `start` and up to, but not including, `end`. If * `end` is not specified, it's set to `start` with `start` then set to

* Gets all but the last element of `array`. * * @static * @memberOf _ * @since 0.1.0 * @category Array * @param {Array}

! * Inserts the association `value`. If the key is already in the map, it * replaces its association in the map. It may allocate memory an

! * Returns a table containing the `value`. * If there is an entry with its key is already, * it replaces this entry by `value`. *

! * Inserts `value` into the set, and does nothing if the value is already * there It may allocate memory and its complexity is *effectivel

! * Inserts `value` to the table. * If there is an entry with its key is already, * it replaces this entry by `value`. * It may al