Bump to v4.2.0.

README.md

@@ -1,4 +1,4 @@
-# lodash-amd v4.0.1
+# lodash-amd v4.2.0
 
 The [lodash](https://lodash.com/) library exported as [AMD](https://github.com/amdjs/amdjs-api/wiki/AMD) modules.
 
@@ -27,4 +27,4 @@ require({
 });
 ```
 
-See the [package source](https://github.com/lodash/lodash/tree/4.0.1-amd) for more details.
+See the [package source](https://github.com/lodash/lodash/tree/4.2.0-amd) for more details.

_Hash.js

@@ -1,4 +1,4 @@
-define(['./nativeCreate'], function(nativeCreate) {
+define(['./_nativeCreate'], function(nativeCreate) {
 
   /** Used for built-in method references. */
   var objectProto = Object.prototype;

_LazyWrapper.js

@@ -1,4 +1,4 @@
-define(['./baseCreate', './baseLodash'], function(baseCreate, baseLodash) {
+define(['./_baseCreate', './_baseLodash'], function(baseCreate, baseLodash) {
 
   /** Used as references for the maximum length and index of an array. */
   var MAX_ARRAY_LENGTH = 4294967295;

_LodashWrapper.js

@@ -1,4 +1,4 @@
-define(['./baseCreate', './baseLodash'], function(baseCreate, baseLodash) {
+define(['./_baseCreate', './_baseLodash'], function(baseCreate, baseLodash) {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;

_Map.js

@@ -1,4 +1,4 @@
-define(['./getNative', './root'], function(getNative, root) {
+define(['./_getNative', './_root'], function(getNative, root) {
 
   /* Built-in method references that are verified to be native. */
   var Map = getNative(root, 'Map');

_MapCache.js

@@ -1,4 +1,4 @@
-define(['./mapClear', './mapDelete', './mapGet', './mapHas', './mapSet'], function(mapClear, mapDelete, mapGet, mapHas, mapSet) {
+define(['./_mapClear', './_mapDelete', './_mapGet', './_mapHas', './_mapSet'], function(mapClear, mapDelete, mapGet, mapHas, mapSet) {
 
   /**
    * Creates a map cache object to store key-value pairs.

_Reflect.js

@@ -1,4 +1,4 @@
-define(['./root'], function(root) {
+define(['./_root'], function(root) {
 
   /** Built-in value references. */
   var Reflect = root.Reflect;

_Set.js

@@ -1,4 +1,4 @@
-define(['./getNative', './root'], function(getNative, root) {
+define(['./_getNative', './_root'], function(getNative, root) {
 
   /* Built-in method references that are verified to be native. */
   var Set = getNative(root, 'Set');

_SetCache.js

@@ -1,4 +1,4 @@
-define(['./MapCache', './cachePush'], function(MapCache, cachePush) {
+define(['./_MapCache', './_cachePush'], function(MapCache, cachePush) {
 
   /**
    *

_Stack.js

@@ -1,4 +1,4 @@
-define(['./stackClear', './stackDelete', './stackGet', './stackHas', './stackSet'], function(stackClear, stackDelete, stackGet, stackHas, stackSet) {
+define(['./_stackClear', './_stackDelete', './_stackGet', './_stackHas', './_stackSet'], function(stackClear, stackDelete, stackGet, stackHas, stackSet) {
 
   /**
    * Creates a stack cache object to store key-value pairs.

_Symbol.js

@@ -1,4 +1,4 @@
-define(['./root'], function(root) {
+define(['./_root'], function(root) {
 
   /** Built-in value references. */
   var Symbol = root.Symbol;

_Uint8Array.js

@@ -1,4 +1,4 @@
-define(['./root'], function(root) {
+define(['./_root'], function(root) {
 
   /** Built-in value references. */
   var Uint8Array = root.Uint8Array;

_WeakMap.js

@@ -1,4 +1,4 @@
-define(['./getNative', './root'], function(getNative, root) {
+define(['./_getNative', './_root'], function(getNative, root) {
 
   /* Built-in method references that are verified to be native. */
   var WeakMap = getNative(root, 'WeakMap');

_apply.js

@@ -7,11 +7,11 @@ define([], function() {
    * @private
    * @param {Function} func The function to invoke.
    * @param {*} thisArg The `this` binding of `func`.
-   * @param {...*} [args] The arguments to invoke `func` with.
+   * @param {...*} args The arguments to invoke `func` with.
    * @returns {*} Returns the result of `func`.
    */
   function apply(func, thisArg, args) {
-    var length = args ? args.length : 0;
+    var length = args.length;
     switch (length) {
       case 0: return func.call(thisArg);
       case 1: return func.call(thisArg, args[0]);

_arrayAggregator.js

@@ -0,0 +1,25 @@
+define([], function() {
+
+  /**
+   * A specialized version of `baseAggregator` for arrays.
+   *
+   * @private
+   * @param {Array} array The array to iterate over.
+   * @param {Function} setter The function to set `accumulator` values.
+   * @param {Function} iteratee The iteratee to transform keys.
+   * @param {Object} accumulator The initial aggregated object.
+   * @returns {Function} Returns `accumulator`.
+   */
+  function arrayAggregator(array, setter, iteratee, accumulator) {
+    var index = -1,
+        length = array.length;
+
+    while (++index < length) {
+      var value = array[index];
+      setter(accumulator, value, iteratee(value), array);
+    }
+    return accumulator;
+  }
+
+  return arrayAggregator;
+});

_arrayIncludes.js

@@ -1,4 +1,4 @@
-define(['./baseIndexOf'], function(baseIndexOf) {
+define(['./_baseIndexOf'], function(baseIndexOf) {
 
   /**
    * A specialized version of `_.includes` for arrays without support for

_assignInDefaults.js

@@ -1,4 +1,4 @@
-define(['../eq'], function(eq) {
+define(['./eq'], function(eq) {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;

_assignMergeValue.js

@@ -1,4 +1,4 @@
-define(['../eq'], function(eq) {
+define(['./eq'], function(eq) {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;

_assignValue.js

@@ -1,4 +1,4 @@
-define(['../eq'], function(eq) {
+define(['./eq'], function(eq) {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;

_assocDelete.js

@@ -1,4 +1,4 @@
-define(['./assocIndexOf'], function(assocIndexOf) {
+define(['./_assocIndexOf'], function(assocIndexOf) {
 
   /** Used for built-in method references. */
   var arrayProto = Array.prototype;

_assocGet.js

@@ -1,4 +1,4 @@
-define(['./assocIndexOf'], function(assocIndexOf) {
+define(['./_assocIndexOf'], function(assocIndexOf) {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;

_assocHas.js

@@ -1,4 +1,4 @@
-define(['./assocIndexOf'], function(assocIndexOf) {
+define(['./_assocIndexOf'], function(assocIndexOf) {
 
   /**
    * Checks if an associative array value for `key` exists.

_assocIndexOf.js

@@ -1,4 +1,4 @@
-define(['../eq'], function(eq) {
+define(['./eq'], function(eq) {
 
   /**
    * Gets the index at which the first occurrence of `key` is found in `array`

_assocSet.js

@@ -1,4 +1,4 @@
-define(['./assocIndexOf'], function(assocIndexOf) {
+define(['./_assocIndexOf'], function(assocIndexOf) {
 
   /**
    * Sets the associative array `key` to `value`.

_baseAggregator.js

@@ -0,0 +1,22 @@
+define(['./_baseEach'], function(baseEach) {
+
+  /**
+   * Aggregates elements of `collection` on `accumulator` with keys transformed
+   * by `iteratee` and values set by `setter`.
+   *
+   * @private
+   * @param {Array|Object} collection The collection to iterate over.
+   * @param {Function} setter The function to set `accumulator` values.
+   * @param {Function} iteratee The iteratee to transform keys.
+   * @param {Object} accumulator The initial aggregated object.
+   * @returns {Function} Returns `accumulator`.
+   */
+  function baseAggregator(collection, setter, iteratee, accumulator) {
+    baseEach(collection, function(value, key, collection) {
+      setter(accumulator, value, iteratee(value), collection);
+    });
+    return accumulator;
+  }
+
+  return baseAggregator;
+});

_baseAssign.js

@@ -1,4 +1,4 @@
-define(['./copyObject', '../keys'], function(copyObject, keys) {
+define(['./_copyObject', './keys'], function(copyObject, keys) {
 
   /**
    * The base implementation of `_.assign` without support for multiple sources

_baseAt.js

@@ -1,4 +1,4 @@
-define(['../get'], function(get) {
+define(['./get'], function(get) {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;

_baseClone.js

@@ -1,4 +1,4 @@
-define(['./Stack', './arrayEach', './assignValue', './baseAssign', './baseForOwn', './copyArray', './copySymbols', './getTag', './initCloneArray', './initCloneByTag', './initCloneObject', '../isArray', './isHostObject', '../isObject'], function(Stack, arrayEach, assignValue, baseAssign, baseForOwn, copyArray, copySymbols, getTag, initCloneArray, initCloneByTag, initCloneObject, isArray, isHostObject, isObject) {
+define(['./_Stack', './_arrayEach', './_assignValue', './_baseAssign', './_baseForOwn', './_copyArray', './_copySymbols', './_getTag', './_initCloneArray', './_initCloneByTag', './_initCloneObject', './isArray', './_isHostObject', './isObject'], function(Stack, arrayEach, assignValue, baseAssign, baseForOwn, copyArray, copySymbols, getTag, initCloneArray, initCloneByTag, initCloneObject, isArray, isHostObject, isObject) {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;

_baseConforms.js

@@ -1,4 +1,4 @@
-define(['../keys'], function(keys) {
+define(['./keys'], function(keys) {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;

_baseCreate.js

@@ -1,4 +1,4 @@
-define(['../isObject'], function(isObject) {
+define(['./isObject'], function(isObject) {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;

_baseDifference.js

@@ -1,4 +1,4 @@
-define(['./SetCache', './arrayIncludes', './arrayIncludesWith', './arrayMap', './baseUnary', './cacheHas'], function(SetCache, arrayIncludes, arrayIncludesWith, arrayMap, baseUnary, cacheHas) {
+define(['./_SetCache', './_arrayIncludes', './_arrayIncludesWith', './_arrayMap', './_baseUnary', './_cacheHas'], function(SetCache, arrayIncludes, arrayIncludesWith, arrayMap, baseUnary, cacheHas) {
 
   /** Used as the size to enable large array optimizations. */
   var LARGE_ARRAY_SIZE = 200;

_baseEach.js

@@ -1,4 +1,4 @@
-define(['./baseForOwn', './createBaseEach'], function(baseForOwn, createBaseEach) {
+define(['./_baseForOwn', './_createBaseEach'], function(baseForOwn, createBaseEach) {
 
   /**
    * The base implementation of `_.forEach` without support for iteratee shorthands.

_baseEachRight.js

@@ -1,4 +1,4 @@
-define(['./baseForOwnRight', './createBaseEach'], function(baseForOwnRight, createBaseEach) {
+define(['./_baseForOwnRight', './_createBaseEach'], function(baseForOwnRight, createBaseEach) {
 
   /**
    * The base implementation of `_.forEachRight` without support for iteratee shorthands.

_baseEvery.js

@@ -1,4 +1,4 @@
-define(['./baseEach'], function(baseEach) {
+define(['./_baseEach'], function(baseEach) {
 
   /**
    * The base implementation of `_.every` without support for iteratee shorthands.

_baseFill.js

@@ -1,4 +1,4 @@
-define(['../toInteger', '../toLength'], function(toInteger, toLength) {
+define(['./toInteger', './toLength'], function(toInteger, toLength) {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;

_baseFilter.js

@@ -1,4 +1,4 @@
-define(['./baseEach'], function(baseEach) {
+define(['./_baseEach'], function(baseEach) {
 
   /**
    * The base implementation of `_.filter` without support for iteratee shorthands.

_baseFlatten.js

@@ -1,4 +1,4 @@
-define(['./arrayPush', '../isArguments', '../isArray', '../isArrayLikeObject'], function(arrayPush, isArguments, isArray, isArrayLikeObject) {
+define(['./_arrayPush', './isArguments', './isArray', './isArrayLikeObject'], function(arrayPush, isArguments, isArray, isArrayLikeObject) {
 
   /**
    * The base implementation of `_.flatten` with support for restricting flattening.

_baseFor.js

@@ -1,4 +1,4 @@
-define(['./createBaseFor'], function(createBaseFor) {
+define(['./_createBaseFor'], function(createBaseFor) {
 
   /**
    * The base implementation of `baseForIn` and `baseForOwn` which iterates

_baseForIn.js

@@ -1,4 +1,4 @@
-define(['./baseFor', '../keysIn'], function(baseFor, keysIn) {
+define(['./_baseFor', './keysIn'], function(baseFor, keysIn) {
 
   /**
    * The base implementation of `_.forIn` without support for iteratee shorthands.

_baseForOwn.js

@@ -1,4 +1,4 @@
-define(['./baseFor', '../keys'], function(baseFor, keys) {
+define(['./_baseFor', './keys'], function(baseFor, keys) {
 
   /**
    * The base implementation of `_.forOwn` without support for iteratee shorthands.

_baseForOwnRight.js

@@ -1,4 +1,4 @@
-define(['./baseForRight', '../keys'], function(baseForRight, keys) {
+define(['./_baseForRight', './keys'], function(baseForRight, keys) {
 
   /**
    * The base implementation of `_.forOwnRight` without support for iteratee shorthands.

_baseForRight.js

@@ -1,4 +1,4 @@
-define(['./createBaseFor'], function(createBaseFor) {
+define(['./_createBaseFor'], function(createBaseFor) {
 
   /**
    * This function is like `baseFor` except that it iterates over properties

_baseFunctions.js

@@ -1,4 +1,4 @@
-define(['./arrayFilter', '../isFunction'], function(arrayFilter, isFunction) {
+define(['./_arrayFilter', './isFunction'], function(arrayFilter, isFunction) {
 
   /**
    * The base implementation of `_.functions` which creates an array of

_baseGet.js

@@ -1,4 +1,4 @@
-define(['./baseToPath', './isKey'], function(baseToPath, isKey) {
+define(['./_baseToPath', './_isKey'], function(baseToPath, isKey) {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;

_baseIndexOf.js

@@ -1,4 +1,4 @@
-define(['./indexOfNaN'], function(indexOfNaN) {
+define(['./_indexOfNaN'], function(indexOfNaN) {
 
   /**
    * The base implementation of `_.indexOf` without `fromIndex` bounds checks.

_baseIntersection.js

@@ -1,4 +1,4 @@
-define(['./SetCache', './arrayIncludes', './arrayIncludesWith', './arrayMap', './baseUnary', './cacheHas'], function(SetCache, arrayIncludes, arrayIncludesWith, arrayMap, baseUnary, cacheHas) {
+define(['./_SetCache', './_arrayIncludes', './_arrayIncludesWith', './_arrayMap', './_baseUnary', './_cacheHas'], function(SetCache, arrayIncludes, arrayIncludesWith, arrayMap, baseUnary, cacheHas) {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;

_baseInverter.js

@@ -0,0 +1,22 @@
+define(['./_baseForOwn'], function(baseForOwn) {
+
+  /**
+   * The base implementation of `_.invert` and `_.invertBy` which inverts
+   * `object` with values transformed by `iteratee` and set by `setter`.
+   *
+   * @private
+   * @param {Object} object The object to iterate over.
+   * @param {Function} setter The function to set `accumulator` values.
+   * @param {Function} iteratee The iteratee to transform values.
+   * @param {Object} accumulator The initial inverted object.
+   * @returns {Function} Returns `accumulator`.
+   */
+  function baseInverter(object, setter, iteratee, accumulator) {
+    baseForOwn(object, function(value, key, object) {
+      setter(accumulator, iteratee(value), key, object);
+    });
+    return accumulator;
+  }
+
+  return baseInverter;
+});

_baseInvoke.js

@@ -1,4 +1,4 @@
-define(['./apply', './baseToPath', './isKey', '../last', './parent'], function(apply, baseToPath, isKey, last, parent) {
+define(['./_apply', './_baseToPath', './_isKey', './last', './_parent'], function(apply, baseToPath, isKey, last, parent) {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;

_baseIsEqual.js

@@ -1,4 +1,4 @@
-define(['./baseIsEqualDeep', '../isObject', '../isObjectLike'], function(baseIsEqualDeep, isObject, isObjectLike) {
+define(['./_baseIsEqualDeep', './isObject', './isObjectLike'], function(baseIsEqualDeep, isObject, isObjectLike) {
 
   /**
    * The base implementation of `_.isEqual` which supports partial comparisons

_baseIsEqualDeep.js

@@ -1,4 +1,4 @@
-define(['./Stack', './equalArrays', './equalByTag', './equalObjects', './getTag', '../isArray', './isHostObject', '../isTypedArray'], function(Stack, equalArrays, equalByTag, equalObjects, getTag, isArray, isHostObject, isTypedArray) {
+define(['./_Stack', './_equalArrays', './_equalByTag', './_equalObjects', './_getTag', './isArray', './_isHostObject', './isTypedArray'], function(Stack, equalArrays, equalByTag, equalObjects, getTag, isArray, isHostObject, isTypedArray) {
 
   /** Used to compose bitmasks for comparison styles. */
   var PARTIAL_COMPARE_FLAG = 2;

_baseIsMatch.js

@@ -1,4 +1,4 @@
-define(['./Stack', './baseIsEqual'], function(Stack, baseIsEqual) {
+define(['./_Stack', './_baseIsEqual'], function(Stack, baseIsEqual) {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;

_baseIteratee.js

@@ -1,4 +1,4 @@
-define(['./baseMatches', './baseMatchesProperty', '../identity', '../isArray', '../property'], function(baseMatches, baseMatchesProperty, identity, isArray, property) {
+define(['./_baseMatches', './_baseMatchesProperty', './identity', './isArray', './property'], function(baseMatches, baseMatchesProperty, identity, isArray, property) {
 
   /**
    * The base implementation of `_.iteratee`.

_baseKeysIn.js

@@ -1,4 +1,4 @@
-define(['./Reflect', './iteratorToArray'], function(Reflect, iteratorToArray) {
+define(['./_Reflect', './_iteratorToArray'], function(Reflect, iteratorToArray) {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;

_baseMap.js

@@ -1,4 +1,4 @@
-define(['./baseEach', '../isArrayLike'], function(baseEach, isArrayLike) {
+define(['./_baseEach', './isArrayLike'], function(baseEach, isArrayLike) {
 
   /**
    * The base implementation of `_.map` without support for iteratee shorthands.

_baseMatches.js

@@ -1,4 +1,4 @@
-define(['./baseIsMatch', './getMatchData'], function(baseIsMatch, getMatchData) {
+define(['./_baseIsMatch', './_getMatchData'], function(baseIsMatch, getMatchData) {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;

_baseMatchesProperty.js

@@ -1,4 +1,4 @@
-define(['./baseIsEqual', '../get', '../hasIn'], function(baseIsEqual, get, hasIn) {
+define(['./_baseIsEqual', './get', './hasIn'], function(baseIsEqual, get, hasIn) {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;

_baseMerge.js

@@ -1,4 +1,4 @@
-define(['./Stack', './arrayEach', './assignMergeValue', './baseMergeDeep', '../isArray', '../isObject', '../isTypedArray', '../keysIn'], function(Stack, arrayEach, assignMergeValue, baseMergeDeep, isArray, isObject, isTypedArray, keysIn) {
+define(['./_Stack', './_arrayEach', './_assignMergeValue', './_baseMergeDeep', './isArray', './isObject', './isTypedArray', './keysIn'], function(Stack, arrayEach, assignMergeValue, baseMergeDeep, isArray, isObject, isTypedArray, keysIn) {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;

_baseMergeDeep.js

@@ -1,4 +1,4 @@
-define(['./assignMergeValue', './baseClone', './copyArray', '../isArguments', '../isArray', '../isArrayLikeObject', '../isFunction', '../isObject', '../isPlainObject', '../isTypedArray', '../toPlainObject'], function(assignMergeValue, baseClone, copyArray, isArguments, isArray, isArrayLikeObject, isFunction, isObject, isPlainObject, isTypedArray, toPlainObject) {
+define(['./_assignMergeValue', './_baseClone', './_copyArray', './isArguments', './isArray', './isArrayLikeObject', './isFunction', './isObject', './isPlainObject', './isTypedArray', './toPlainObject'], function(assignMergeValue, baseClone, copyArray, isArguments, isArray, isArrayLikeObject, isFunction, isObject, isPlainObject, isTypedArray, toPlainObject) {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;
@@ -20,7 +20,7 @@ define(['./assignMergeValue', './baseClone', './copyArray', '../isArguments', '.
   function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {
     var objValue = object[key],
         srcValue = source[key],
-        stacked = stack.get(srcValue) || stack.get(objValue);
+        stacked = stack.get(srcValue);
 
     if (stacked) {
       assignMergeValue(object, key, stacked);
@@ -39,6 +39,7 @@ define(['./assignMergeValue', './baseClone', './copyArray', '../isArguments', '.
           newValue = copyArray(objValue);
         }
         else {
+          isCommon = false;
           newValue = baseClone(srcValue);
         }
       }
@@ -47,6 +48,7 @@ define(['./assignMergeValue', './baseClone', './copyArray', '../isArguments', '.
           newValue = toPlainObject(objValue);
         }
         else if (!isObject(objValue) || (srcIndex && isFunction(objValue))) {
+          isCommon = false;
           newValue = baseClone(srcValue);
         }
         else {

_baseOrderBy.js

@@ -1,4 +1,4 @@
-define(['./arrayMap', './baseIteratee', './baseMap', './baseSortBy', './compareMultiple'], function(arrayMap, baseIteratee, baseMap, baseSortBy, compareMultiple) {
+define(['./_arrayMap', './_baseIteratee', './_baseMap', './_baseSortBy', './_compareMultiple'], function(arrayMap, baseIteratee, baseMap, baseSortBy, compareMultiple) {
 
   /**
    * The base implementation of `_.orderBy` without param guards.

_basePick.js

@@ -1,4 +1,4 @@
-define(['./arrayReduce'], function(arrayReduce) {
+define(['./_arrayReduce'], function(arrayReduce) {
 
   /**
    * The base implementation of `_.pick` without support for individual

_basePickBy.js

@@ -1,4 +1,4 @@
-define(['./baseForIn'], function(baseForIn) {
+define(['./_baseForIn'], function(baseForIn) {
 
   /**
    * The base implementation of  `_.pickBy` without support for iteratee shorthands.

_basePropertyDeep.js

@@ -1,4 +1,4 @@
-define(['./baseGet'], function(baseGet) {
+define(['./_baseGet'], function(baseGet) {
 
   /**
    * A specialized version of `baseProperty` which supports deep paths.

_basePullAll.js

@@ -1,4 +1,4 @@
-define(['./basePullAllBy'], function(basePullAllBy) {
+define(['./_basePullAllBy'], function(basePullAllBy) {
 
   /**
    * The base implementation of `_.pullAll`.

_basePullAllBy.js

@@ -1,4 +1,4 @@
-define(['./arrayMap', './baseIndexOf'], function(arrayMap, baseIndexOf) {
+define(['./_arrayMap', './_baseIndexOf'], function(arrayMap, baseIndexOf) {
 
   /** Used for built-in method references. */
   var arrayProto = Array.prototype;

_basePullAt.js

@@ -1,4 +1,4 @@
-define(['./baseToPath', './isIndex', './isKey', '../last', './parent'], function(baseToPath, isIndex, isKey, last, parent) {
+define(['./_baseToPath', './_isIndex', './_isKey', './last', './_parent'], function(baseToPath, isIndex, isKey, last, parent) {
 
   /** Used for built-in method references. */
   var arrayProto = Array.prototype;

_baseSet.js

@@ -1,4 +1,4 @@
-define(['./assignValue', './baseToPath', './isIndex', './isKey', '../isObject'], function(assignValue, baseToPath, isIndex, isKey, isObject) {
+define(['./_assignValue', './_baseToPath', './_isIndex', './_isKey', './isObject'], function(assignValue, baseToPath, isIndex, isKey, isObject) {
 
   /** Used as a safe reference for `undefined` in pre-ES5 environments. */
   var undefined;

_baseSetData.js

@@ -1,4 +1,4 @@
-define(['../identity', './metaMap'], function(identity, metaMap) {
+define(['./identity', './_metaMap'], function(identity, metaMap) {
 
   /**
    * The base implementation of `setData` without support for hot loop detection.

_baseSome.js

@@ -1,4 +1,4 @@
-define(['./baseEach'], function(baseEach) {
+define(['./_baseEach'], function(baseEach) {
 
   /**
    * The base implementation of `_.some` without support for iteratee shorthands.

_baseSortedIndex.js

@@ -1,4 +1,4 @@
-define(['./baseSortedIndexBy', '../identity'], function(baseSortedIndexBy, identity) {
+define(['./_baseSortedIndexBy', './identity'], function(baseSortedIndexBy, identity) {
 
   /** Used as references for the maximum length and index of an array. */
   var MAX_ARRAY_LENGTH = 4294967295,

_baseSortedUniq.js

@@ -1,4 +1,4 @@
-define(['./baseSortedUniqBy'], function(baseSortedUniqBy) {
+define(['./_baseSortedUniqBy'], function(baseSortedUniqBy) {
 
   /**
    * The base implementation of `_.sortedUniq`.