Remove references to _.

This commit is contained in:
John-David Dalton
2017-01-09 17:38:33 -08:00
parent 65654f8f9e
commit 77cc37ba49
410 changed files with 875 additions and 1157 deletions

View File

@@ -1,5 +1,5 @@
/**
* A specialized version of `_.forEach` for arrays.
* A specialized version of `forEach` for arrays.
*
* @private
* @param {Array} [array] The array to iterate over.

View File

@@ -1,5 +1,5 @@
/**
* A specialized version of `_.forEachRight` for arrays.
* A specialized version of `forEachRight` for arrays.
*
* @private
* @param {Array} [array] The array to iterate over.

View File

@@ -1,5 +1,5 @@
/**
* A specialized version of `_.every` for arrays.
* A specialized version of `every` for arrays.
*
* @private
* @param {Array} [array] The array to iterate over.

View File

@@ -1,5 +1,5 @@
/**
* A specialized version of `_.filter` for arrays.
* A specialized version of `filter` for arrays.
*
* @private
* @param {Array} [array] The array to iterate over.

View File

@@ -1,7 +1,7 @@
import baseIndexOf from './_baseIndexOf.js';
/**
* A specialized version of `_.includes` for arrays without support for
* A specialized version of `includes` for arrays without support for
* specifying an index to search from.
*
* @private

View File

@@ -1,5 +1,5 @@
/**
* A specialized version of `_.map` for arrays.
* A specialized version of `map` for arrays.
*
* @private
* @param {Array} [array] The array to iterate over.

View File

@@ -1,5 +1,5 @@
/**
* A specialized version of `_.reduce` for arrays.
* A specialized version of `reduce` for arrays.
*
* @private
* @param {Array} [array] The array to iterate over.

View File

@@ -1,5 +1,5 @@
/**
* A specialized version of `_.reduceRight` for arrays.
* A specialized version of `reduceRight` for arrays.
*
* @private
* @param {Array} [array] The array to iterate over.

View File

@@ -1,7 +1,7 @@
import baseRandom from './_baseRandom.js';
/**
* A specialized version of `_.sample` for arrays.
* A specialized version of `sample` for arrays.
*
* @private
* @param {Array} array The array to sample.

View File

@@ -3,7 +3,7 @@ import copyArray from './_copyArray.js';
import shuffleSelf from './_shuffleSelf.js';
/**
* A specialized version of `_.sampleSize` for arrays.
* A specialized version of `sampleSize` for arrays.
*
* @private
* @param {Array} array The array to sample.

View File

@@ -2,7 +2,7 @@ import copyArray from './_copyArray.js';
import shuffleSelf from './_shuffleSelf.js';
/**
* A specialized version of `_.shuffle` for arrays.
* A specialized version of `shuffle` for arrays.
*
* @private
* @param {Array} array The array to shuffle.

View File

@@ -1,5 +1,5 @@
/**
* A specialized version of `_.some` for arrays.
* A specialized version of `some` for arrays.
*
* @private
* @param {Array} [array] The array to iterate over.

View File

@@ -2,7 +2,7 @@ import copyObject from './_copyObject.js';
import keys from './keys.js';
/**
* The base implementation of `_.assign` without support for multiple sources
* The base implementation of `assign` without support for multiple sources
* or `customizer` functions.
*
* @private

View File

@@ -2,7 +2,7 @@ import copyObject from './_copyObject.js';
import keysIn from './keysIn.js';
/**
* The base implementation of `_.assignIn` without support for multiple sources
* The base implementation of `assignIn` without support for multiple sources
* or `customizer` functions.
*
* @private

View File

@@ -1,7 +1,7 @@
import get from './get.js';
/**
* The base implementation of `_.at` without support for individual paths.
* The base implementation of `at` without support for individual paths.
*
* @private
* @param {Object} object The object to iterate over.

View File

@@ -1,5 +1,5 @@
/**
* The base implementation of `_.clamp` which doesn't coerce arguments.
* The base implementation of `clamp` which doesn't coerce arguments.
*
* @private
* @param {number} number The number to clamp.

View File

@@ -52,7 +52,7 @@ const uint8ClampedTag = '[object Uint8ClampedArray]';
const uint16Tag = '[object Uint16Array]';
const uint32Tag = '[object Uint32Array]';
/** Used to identify `toStringTag` values supported by `_.clone`. */
/** Used to identify `toStringTag` values supported by `clone`. */
const cloneableTags = {};
cloneableTags[argsTag] = cloneableTags[arrayTag] =
cloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =
@@ -69,7 +69,7 @@ cloneableTags[errorTag] = cloneableTags[funcTag] =
cloneableTags[weakMapTag] = false;
/**
* The base implementation of `_.clone` and `_.cloneDeep` which tracks
* The base implementation of `clone` and `cloneDeep` which tracks
* traversed objects.
*
* @private

View File

@@ -2,7 +2,7 @@ import baseConformsTo from './_baseConformsTo.js';
import keys from './keys.js';
/**
* The base implementation of `_.conforms` which doesn't clone `source`.
* The base implementation of `conforms` which doesn't clone `source`.
*
* @private
* @param {Object} source The object of property predicates to conform to.

View File

@@ -1,5 +1,5 @@
/**
* The base implementation of `_.conformsTo` which accepts `props` to check.
* The base implementation of `conformsTo` which accepts `props` to check.
*
* @private
* @param {Object} object The object to inspect.

View File

@@ -4,7 +4,7 @@ import isObject from './isObject.js';
const objectCreate = Object.create;
/**
* The base implementation of `_.create` without support for assigning
* The base implementation of `create` without support for assigning
* properties to the created object.
*
* @private

View File

@@ -2,7 +2,7 @@
const FUNC_ERROR_TEXT = 'Expected a function';
/**
* The base implementation of `_.delay` and `_.defer` which accepts `args`
* The base implementation of `delay` and `defer` which accepts `args`
* to provide to `func`.
*
* @private

View File

@@ -8,7 +8,7 @@ import cacheHas from './_cacheHas.js';
const LARGE_ARRAY_SIZE = 200;
/**
* The base implementation of methods like `_.difference` without support
* The base implementation of methods like `difference` without support
* for excluding multiple arrays.
*
* @private

View File

@@ -2,7 +2,7 @@ import baseForOwn from './_baseForOwn.js';
import createBaseEach from './_createBaseEach.js';
/**
* The base implementation of `_.forEach`.
* The base implementation of `forEach`.
*
* @private
* @param {Array|Object} collection The collection to iterate over.

View File

@@ -2,7 +2,7 @@ import baseForOwnRight from './_baseForOwnRight.js';
import createBaseEach from './_createBaseEach.js';
/**
* The base implementation of `_.forEachRight`.
* The base implementation of `forEachRight`.
*
* @private
* @param {Array|Object} collection The collection to iterate over.

View File

@@ -1,7 +1,7 @@
import baseEach from './_baseEach.js';
/**
* The base implementation of `_.every`.
* The base implementation of `every`.
*
* @private
* @param {Array|Object} collection The collection to iterate over.

View File

@@ -1,7 +1,7 @@
import isSymbol from './isSymbol.js';
/**
* The base implementation of methods like `_.max` and `_.min` which accepts a
* The base implementation of methods like `max` and `min` which accepts a
* `comparator` to determine the extremum value.
*
* @private

View File

@@ -2,7 +2,7 @@ import toInteger from './toInteger.js';
import toLength from './toLength.js';
/**
* The base implementation of `_.fill` without an iteratee call guard.
* The base implementation of `fill` without an iteratee call guard.
*
* @private
* @param {Array} array The array to fill.

View File

@@ -1,7 +1,7 @@
import baseEach from './_baseEach.js';
/**
* The base implementation of `_.filter`.
* The base implementation of `filter`.
*
* @private
* @param {Array|Object} collection The collection to iterate over.

View File

@@ -1,5 +1,5 @@
/**
* The base implementation of `_.findIndex` and `_.findLastIndex`.
* The base implementation of `findIndex` and `findLastIndex`.
*
* @private
* @param {Array} array The array to inspect.

View File

@@ -1,5 +1,5 @@
/**
* The base implementation of methods like `_.findKey` and `_.findLastKey`
* The base implementation of methods like `findKey` and `findLastKey`
* which iterates over `collection` using `eachFunc`.
*
* @private

View File

@@ -2,7 +2,7 @@ import arrayPush from './_arrayPush.js';
import isFlattenable from './_isFlattenable.js';
/**
* The base implementation of `_.flatten` with support for restricting flattening.
* The base implementation of `flatten` with support for restricting flattening.
*
* @private
* @param {Array} array The array to flatten.

View File

@@ -2,7 +2,7 @@ import baseFor from './_baseFor.js';
import keys from './keys.js';
/**
* The base implementation of `_.forOwn`.
* The base implementation of `forOwn`.
*
* @private
* @param {Object} object The object to iterate over.

View File

@@ -2,7 +2,7 @@ import baseForRight from './_baseForRight.js';
import keys from './keys.js';
/**
* The base implementation of `_.forOwnRight`.
* The base implementation of `forOwnRight`.
*
* @private
* @param {Object} object The object to iterate over.

View File

@@ -2,7 +2,7 @@ import arrayFilter from './_arrayFilter.js';
import isFunction from './isFunction.js';
/**
* The base implementation of `_.functions` which creates an array of
* The base implementation of `functions` which creates an array of
* `object` function property names filtered from `props`.
*
* @private

View File

@@ -2,7 +2,7 @@ import castPath from './_castPath.js';
import toKey from './_toKey.js';
/**
* The base implementation of `_.get` without support for default values.
* The base implementation of `get` without support for default values.
*
* @private
* @param {Object} object The object to query.

View File

@@ -1,5 +1,5 @@
/**
* The base implementation of `_.gt` which doesn't coerce arguments.
* The base implementation of `gt` which doesn't coerce arguments.
*
* @private
* @param {*} value The value to compare.

View File

@@ -5,7 +5,7 @@ const objectProto = Object.prototype;
const hasOwnProperty = objectProto.hasOwnProperty;
/**
* The base implementation of `_.has` without support for deep paths.
* The base implementation of `has` without support for deep paths.
*
* @private
* @param {Object} [object] The object to query.

View File

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

View File

@@ -3,7 +3,7 @@ const nativeMax = Math.max;
const nativeMin = Math.min;
/**
* The base implementation of `_.inRange` which doesn't coerce arguments.
* The base implementation of `inRange` which doesn't coerce arguments.
*
* @private
* @param {number} number The number to check.

View File

@@ -3,7 +3,7 @@ import baseIsNaN from './_baseIsNaN.js';
import strictIndexOf from './_strictIndexOf.js';
/**
* The base implementation of `_.indexOf` without `fromIndex` bounds checks.
* The base implementation of `indexOf` without `fromIndex` bounds checks.
*
* @private
* @param {Array} array The array to inspect.

View File

@@ -8,7 +8,7 @@ import cacheHas from './_cacheHas.js';
const nativeMin = Math.min;
/**
* The base implementation of methods like `_.intersection` that accepts an
* The base implementation of methods like `intersection` that accepts an
* array of arrays to inspect.
*
* @private

View File

@@ -1,7 +1,7 @@
import baseForOwn from './_baseForOwn.js';
/**
* The base implementation of `_.invert` and `_.invertBy` which inverts
* The base implementation of `invert` and `invertBy` which inverts
* `object` with values transformed by `iteratee` and set by `setter`.
*
* @private

View File

@@ -5,7 +5,7 @@ import parent from './_parent.js';
import toKey from './_toKey.js';
/**
* The base implementation of `_.invoke` without support for individual
* The base implementation of `invoke` without support for individual
* method arguments.
*
* @private

View File

@@ -5,7 +5,7 @@ import isObjectLike from './isObjectLike.js';
const argsTag = '[object Arguments]';
/**
* The base implementation of `_.isArguments`.
* The base implementation of `isArguments`.
*
* @private
* @param {*} value The value to check.

View File

@@ -4,7 +4,7 @@ import isObjectLike from './isObjectLike.js';
const arrayBufferTag = '[object ArrayBuffer]';
/**
* The base implementation of `_.isArrayBuffer` without Node.js optimizations.
* The base implementation of `isArrayBuffer` without Node.js optimizations.
*
* @private
* @param {*} value The value to check.

View File

@@ -5,7 +5,7 @@ import isObjectLike from './isObjectLike.js';
const dateTag = '[object Date]';
/**
* The base implementation of `_.isDate` without Node.js optimizations.
* The base implementation of `isDate` without Node.js optimizations.
*
* @private
* @param {*} value The value to check.

View File

@@ -2,7 +2,7 @@ import baseIsEqualDeep from './_baseIsEqualDeep.js';
import isObjectLike from './isObjectLike.js';
/**
* The base implementation of `_.isEqual` which supports partial comparisons
* The base implementation of `isEqual` which supports partial comparisons
* and tracks traversed objects.
*
* @private

View File

@@ -5,7 +5,7 @@ import isObjectLike from './isObjectLike.js';
const mapTag = '[object Map]';
/**
* The base implementation of `_.isMap` without Node.js optimizations.
* The base implementation of `isMap` without Node.js optimizations.
*
* @private
* @param {*} value The value to check.

View File

@@ -6,7 +6,7 @@ const COMPARE_PARTIAL_FLAG = 1;
const COMPARE_UNORDERED_FLAG = 2;
/**
* The base implementation of `_.isMatch`.
* The base implementation of `isMatch`.
*
* @private
* @param {Object} object The object to inspect.

View File

@@ -1,5 +1,5 @@
/**
* The base implementation of `_.isNaN` without support for number objects.
* The base implementation of `isNaN` without support for number objects.
*
* @private
* @param {*} value The value to check.

View File

@@ -30,7 +30,7 @@ const reIsNative = RegExp(`^${
}$`);
/**
* The base implementation of `_.isNative` without bad shim checks.
* The base implementation of `isNative` without bad shim checks.
*
* @private
* @param {*} value The value to check.

View File

@@ -5,7 +5,7 @@ import isObjectLike from './isObjectLike.js';
const regexpTag = '[object RegExp]';
/**
* The base implementation of `_.isRegExp` without Node.js optimizations.
* The base implementation of `isRegExp` without Node.js optimizations.
*
* @private
* @param {*} value The value to check.

View File

@@ -5,7 +5,7 @@ import isObjectLike from './isObjectLike.js';
const setTag = '[object Set]';
/**
* The base implementation of `_.isSet` without Node.js optimizations.
* The base implementation of `isSet` without Node.js optimizations.
*
* @private
* @param {*} value The value to check.

View File

@@ -46,7 +46,7 @@ typedArrayTags[setTag] = typedArrayTags[stringTag] =
typedArrayTags[weakMapTag] = false;
/**
* The base implementation of `_.isTypedArray` without Node.js optimizations.
* The base implementation of `isTypedArray` without Node.js optimizations.
*
* @private
* @param {*} value The value to check.

View File

@@ -8,7 +8,7 @@ const objectProto = Object.prototype;
const hasOwnProperty = objectProto.hasOwnProperty;
/**
* The base implementation of `_.keys` which doesn't treat sparse arrays as dense.
* The base implementation of `keys` which doesn't treat sparse arrays as dense.
*
* @private
* @param {Object} object The object to query.

View File

@@ -9,7 +9,7 @@ const objectProto = Object.prototype;
const hasOwnProperty = objectProto.hasOwnProperty;
/**
* The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.
* The base implementation of `keysIn` which doesn't treat sparse arrays as dense.
*
* @private
* @param {Object} object The object to query.

View File

@@ -1,5 +1,5 @@
/**
* The base implementation of `_.lt` which doesn't coerce arguments.
* The base implementation of `lt` which doesn't coerce arguments.
*
* @private
* @param {*} value The value to compare.

View File

@@ -2,7 +2,7 @@ import baseEach from './_baseEach.js';
import isArrayLike from './isArrayLike.js';
/**
* The base implementation of `_.map`.
* The base implementation of `map`.
*
* @private
* @param {Array|Object} collection The collection to iterate over.

View File

@@ -3,7 +3,7 @@ import getMatchData from './_getMatchData.js';
import matchesStrictComparable from './_matchesStrictComparable.js';
/**
* The base implementation of `_.matches` which doesn't clone `source`.
* The base implementation of `matches` which doesn't clone `source`.
*
* @private
* @param {Object} source The object of property values to match.

View File

@@ -11,7 +11,7 @@ const COMPARE_PARTIAL_FLAG = 1;
const COMPARE_UNORDERED_FLAG = 2;
/**
* The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.
* The base implementation of `matchesProperty` which doesn't clone `srcValue`.
*
* @private
* @param {string} path The path of the property to get.

View File

@@ -6,7 +6,7 @@ import isObject from './isObject.js';
import keysIn from './keysIn.js';
/**
* The base implementation of `_.merge` without support for multiple sources.
* The base implementation of `merge` without support for multiple sources.
*
* @private
* @param {Object} object The destination object.

View File

@@ -1,7 +1,7 @@
import isIndex from './_isIndex.js';
/**
* The base implementation of `_.nth` which doesn't coerce arguments.
* The base implementation of `nth` which doesn't coerce arguments.
*
* @private
* @param {Array} array The array to query.

View File

@@ -5,7 +5,7 @@ import compareMultiple from './_compareMultiple.js';
import identity from './identity.js';
/**
* The base implementation of `_.orderBy` without param guards.
* The base implementation of `orderBy` without param guards.
*
* @private
* @param {Array|Object} collection The collection to iterate over.

View File

@@ -2,7 +2,7 @@ import basePickBy from './_basePickBy.js';
import hasIn from './hasIn.js';
/**
* The base implementation of `_.pick` without support for individual
* The base implementation of `pick` without support for individual
* property identifiers.
*
* @private

View File

@@ -3,7 +3,7 @@ import baseSet from './_baseSet.js';
import castPath from './_castPath.js';
/**
* The base implementation of `_.pickBy`.
* The base implementation of `pickBy`.
*
* @private
* @param {Object} object The source object.

View File

@@ -1,5 +1,5 @@
/**
* The base implementation of `_.property` without support for deep paths.
* The base implementation of `property` without support for deep paths.
*
* @private
* @param {string} key The key of the property to get.

View File

@@ -1,5 +1,5 @@
/**
* The base implementation of `_.propertyOf` without support for deep paths.
* The base implementation of `propertyOf` without support for deep paths.
*
* @private
* @param {Object} object The object to query.

View File

@@ -10,7 +10,7 @@ const arrayProto = Array.prototype;
const splice = arrayProto.splice;
/**
* The base implementation of `_.pullAllBy`.
* The base implementation of `pullAllBy`.
*
* @private
* @param {Array} array The array to modify.

View File

@@ -8,7 +8,7 @@ const arrayProto = Array.prototype;
const splice = arrayProto.splice;
/**
* The base implementation of `_.pullAt` without support for individual
* The base implementation of `pullAt` without support for individual
* indexes or capturing the removed elements.
*
* @private

View File

@@ -3,7 +3,7 @@ const nativeFloor = Math.floor;
const nativeRandom = Math.random;
/**
* The base implementation of `_.random` without support for returning
* The base implementation of `random` without support for returning
* floating-point numbers.
*
* @private

View File

@@ -3,7 +3,7 @@ const nativeCeil = Math.ceil;
const nativeMax = Math.max;
/**
* The base implementation of `_.range` and `_.rangeRight` which doesn't
* The base implementation of `range` and `rangeRight` which doesn't
* coerce arguments.
*
* @private

View File

@@ -1,5 +1,5 @@
/**
* The base implementation of `_.reduce` and `_.reduceRight` which iterates
* The base implementation of `reduce` and `reduceRight` which iterates
* over `collection` using `eachFunc`.
*
* @private

View File

@@ -5,7 +5,7 @@ const MAX_SAFE_INTEGER = 9007199254740991;
const nativeFloor = Math.floor;
/**
* The base implementation of `_.repeat` which doesn't coerce arguments.
* The base implementation of `repeat` which doesn't coerce arguments.
*
* @private
* @param {string} string The string to repeat.

View File

@@ -2,7 +2,7 @@ import arraySample from './_arraySample.js';
import values from './values.js';
/**
* The base implementation of `_.sample`.
* The base implementation of `sample`.
*
* @private
* @param {Array|Object} collection The collection to sample.

View File

@@ -3,7 +3,7 @@ import shuffleSelf from './_shuffleSelf.js';
import values from './values.js';
/**
* The base implementation of `_.sampleSize` without param guards.
* The base implementation of `sampleSize` without param guards.
*
* @private
* @param {Array|Object} collection The collection to sample.

View File

@@ -5,7 +5,7 @@ import isObject from './isObject.js';
import toKey from './_toKey.js';
/**
* The base implementation of `_.set`.
* The base implementation of `set`.
*
* @private
* @param {Object} object The object to modify.

View File

@@ -2,7 +2,7 @@ import shuffleSelf from './_shuffleSelf.js';
import values from './values.js';
/**
* The base implementation of `_.shuffle`.
* The base implementation of `shuffle`.
*
* @private
* @param {Array|Object} collection The collection to shuffle.

View File

@@ -1,5 +1,5 @@
/**
* The base implementation of `_.slice` without an iteratee call guard.
* The base implementation of `slice` without an iteratee call guard.
*
* @private
* @param {Array} array The array to slice.

View File

@@ -1,7 +1,7 @@
import baseEach from './_baseEach.js';
/**
* The base implementation of `_.some`.
* The base implementation of `some`.
*
* @private
* @param {Array|Object} collection The collection to iterate over.

View File

@@ -1,5 +1,5 @@
/**
* The base implementation of `_.sortBy` which uses `comparer` to define the
* The base implementation of `sortBy` which uses `comparer` to define the
* sort order of `array` and replaces criteria objects with their corresponding
* values.
*

View File

@@ -7,7 +7,7 @@ const MAX_ARRAY_LENGTH = 4294967295;
const HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1;
/**
* The base implementation of `_.sortedIndex` and `_.sortedLastIndex` which
* The base implementation of `sortedIndex` and `sortedLastIndex` which
* performs a binary search of `array` to determine the index at which `value`
* should be inserted into `array` in order to maintain its sort order.
*

View File

@@ -8,7 +8,7 @@ const MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1;
const nativeFloor = Math.floor, nativeMin = Math.min;
/**
* The base implementation of `_.sortedIndexBy` and `_.sortedLastIndexBy`
* The base implementation of `sortedIndexBy` and `sortedLastIndexBy`
* which invokes `iteratee` for `value` and each element of `array` to compute
* their sort ranking. The iteratee is invoked with one argument; (value).
*

View File

@@ -1,7 +1,7 @@
import eq from './eq.js';
/**
* The base implementation of `_.sortedUniq` and `_.sortedUniqBy`.
* The base implementation of `sortedUniq` and `sortedUniqBy`.
*
* @private
* @param {Array} array The array to inspect.

View File

@@ -1,5 +1,5 @@
/**
* The base implementation of `_.sum` and `_.sumBy`.
* The base implementation of `sum` and `sumBy`.
*
* @private
* @param {Array} array The array to iterate over.

View File

@@ -1,5 +1,5 @@
/**
* The base implementation of `_.times` without support for max array length checks.
* The base implementation of `times` without support for max array length checks.
*
* @private
* @param {number} n The number of times to invoke `iteratee`.

View File

@@ -4,7 +4,7 @@ import isSymbol from './isSymbol.js';
const NAN = 0 / 0;
/**
* The base implementation of `_.toNumber` which doesn't ensure correct
* The base implementation of `toNumber` which doesn't ensure correct
* conversions of binary, hexadecimal, or octal string values.
*
* @private

View File

@@ -1,7 +1,7 @@
import arrayMap from './_arrayMap.js';
/**
* The base implementation of `_.toPairs` and `_.toPairsIn` which creates an array
* The base implementation of `toPairs` and `toPairsIn` which creates an array
* of key-value pairs for `object` corresponding to the property names of `props`.
*
* @private

View File

@@ -11,7 +11,7 @@ const symbolProto = Symbol ? Symbol.prototype : undefined;
const symbolToString = symbolProto ? symbolProto.toString : undefined;
/**
* The base implementation of `_.toString` which doesn't convert nullish
* The base implementation of `toString` which doesn't convert nullish
* values to empty strings.
*
* @private

View File

@@ -9,7 +9,7 @@ import setToArray from './_setToArray.js';
const LARGE_ARRAY_SIZE = 200;
/**
* The base implementation of `_.uniqBy`.
* The base implementation of `uniqBy`.
*
* @private
* @param {Array} array The array to inspect.

View File

@@ -4,7 +4,7 @@ import parent from './_parent.js';
import toKey from './_toKey.js';
/**
* The base implementation of `_.unset`.
* The base implementation of `unset`.
*
* @private
* @param {Object} object The object to modify.

View File

@@ -2,7 +2,7 @@ import baseGet from './_baseGet.js';
import baseSet from './_baseSet.js';
/**
* The base implementation of `_.update`.
* The base implementation of `update`.
*
* @private
* @param {Object} object The object to modify.

View File

@@ -1,7 +1,7 @@
import arrayMap from './_arrayMap.js';
/**
* The base implementation of `_.values` and `_.valuesIn` which creates an
* The base implementation of `values` and `valuesIn` which creates an
* array of `object` property values corresponding to the property names
* of `props`.
*

View File

@@ -1,7 +1,7 @@
import baseSlice from './_baseSlice.js';
/**
* The base implementation of methods like `_.dropWhile` and `_.takeWhile`.
* The base implementation of methods like `dropWhile` and `takeWhile`.
*
* @private
* @param {Array} array The array to query.

View File

@@ -3,7 +3,7 @@ import baseFlatten from './_baseFlatten.js';
import baseUniq from './_baseUniq.js';
/**
* The base implementation of methods like `_.xor` which accepts an array of
* The base implementation of methods like `xor` which accepts an array of
* arrays to inspect.
*
* @private

View File

@@ -1,5 +1,5 @@
/**
* This base implementation of `_.zipObject` which assigns values using `assignFunc`.
* This base implementation of `zipObject` which assigns values using `assignFunc`.
*
* @private
* @param {Array} props The property identifiers.

View File

@@ -1,7 +1,7 @@
import baseIndexOf from './_baseIndexOf.js';
/**
* Used by `_.trim` and `_.trimEnd` to get the index of the last string symbol
* Used by `trim` and `trimEnd` to get the index of the last string symbol
* that is not found in the character symbols.
*
* @private

View File

@@ -1,7 +1,7 @@
import baseIndexOf from './_baseIndexOf.js';
/**
* Used by `_.trim` and `_.trimStart` to get the index of the first string symbol
* Used by `trim` and `trimStart` to get the index of the first string symbol
* that is not found in the character symbols.
*
* @private

View File

@@ -1,7 +1,7 @@
import compareAscending from './_compareAscending.js';
/**
* Used by `_.orderBy` to compare multiple properties of a value to another
* Used by `orderBy` to compare multiple properties of a value to another
* and stable sort them.
*
* If `orders` is unspecified, all values are sorted in ascending order. Otherwise,

View File

@@ -3,7 +3,7 @@ const nativeMax = Math.max;
/**
* This function is like `composeArgs` except that the arguments composition
* is tailored for `_.partialRight`.
* is tailored for `partialRight`.
*
* @private
* @param {Array} args The provided arguments.

View File

@@ -3,7 +3,7 @@ import baseAggregator from './_baseAggregator.js';
import isArray from './isArray.js';
/**
* Creates a function like `_.groupBy`.
* Creates a function like `groupBy`.
*
* @private
* @param {Function} setter The function to set accumulator values.

Some files were not shown because too many files have changed in this diff Show More