Update security policy

Signed-off-by: tison <wander4096@gmail.com>

.commitlintrc.js

@@ -0,0 +1,29 @@
+'use strict';
+
+module.exports = {
+  extends: [
+    '@commitlint/config-conventional', // scoped packages are not prefixed
+  ],
+  rules: {
+    'type-enum': [
+      2,
+      'always',
+      [
+        'build',
+        'chore',
+        'ci',
+        'docs',
+        'feat',
+        'fix',
+        'perf',
+        'proposal',
+        'refactor',
+        'release',
+        'revert',
+        'style',
+        'test',
+        'wip',
+      ],
+    ],
+  },
+};

.editorconfig

@@ -0,0 +1,12 @@
+# This file is for unifying the coding style for different editors and IDEs
+# editorconfig.org
+
+root = true
+
+[*]
+charset = utf-8
+end_of_line = lf
+indent_size = 2
+indent_style = space
+insert_final_newline = true
+trim_trailing_whitespace = true

.eslintignore

@@ -0,0 +1,5 @@
+coverage/
+coverage-merged/
+dist/
+node_modules/
+types/

.eslintrc

@@ -0,0 +1,99 @@
+{
+  "extends": ["airbnb-base", "prettier"],
+  "root": true,
+  "env": {
+    "amd": true,
+    "browser": true,
+    "es6": true,
+    "jest": true,
+    "node": true
+  },
+  "globals": {
+    "BigInt": "readonly",
+    "BigInt64Array": "readonly",
+    "BigUint64Array": "readonly",
+    "globalThis": "readonly"
+  },
+  "parserOptions": {
+    "ecmaVersion": 2020,
+    "sourceType": "module"
+  },
+  "plugins": [
+    "prettier"
+  ],
+  "rules": {
+    "prettier/prettier": "error",
+    // Overridden
+    "camelcase": ["error", { "properties": "never", "allow": [ "W[0-9]+_"] }],
+    "import/extensions": "off",
+    "no-eval": "off",
+    "no-self-compare": "off",
+    "one-var": ["error", "never"],
+    // @TODO: Fix the following rules progressively.
+    "arrow-body-style": "warn",
+    "prefer-arrow-callback": "warn",
+    "prefer-object-spread": "off",
+    "max-classes-per-file": "off",
+    "dot-notation": "off",
+    "object-shorthand": "off",
+    "no-param-reassign": "off",
+    "no-cond-assign": "off",
+    "prefer-destructuring": "off",
+    "func-names": "off",
+    "no-nested-ternary": "off",
+    "no-plusplus": "off",
+    "strict": "off",
+    "no-restricted-syntax": "off",
+    "import/no-mutable-exports": "off",
+    "guard-for-in": "off",
+    "import/prefer-default-export": "off",
+    "prefer-rest-params": "off",
+    "prefer-spread": "off",
+    "no-lonely-if": "off",
+    "no-prototype-builtins": "off",
+    "no-continue": "off",
+    "no-shadow": "off",
+    // Rules up for discussion.
+    "no-multi-assign": "off",
+    "new-cap": "off"
+  },
+  "overrides": [
+    {
+      "files": ["**/*.ts"],
+      "parserOptions": {
+         "project": "./tsconfig.json"
+      },
+      "extends": [
+        "airbnb-typescript/base",
+        "prettier"
+      ],
+      "plugins": ["@typescript-eslint"],
+      "rules": {
+        "@typescript-eslint/no-unused-vars": [
+          "warn",
+          {
+            "vars": "all",
+            "args": "after-used",
+            "ignoreRestSiblings": true,
+            "argsIgnorePattern": "^_" // For tsc compatibility.
+          }
+        ],
+        "comma-dangle": "off",
+        "implicit-arrow-linebreak": "off", // Conflicts with prettier.
+        "import/extensions": "off",
+        "import/prefer-default-export": "off",
+        "operator-linebreak": "off",
+        "object-curly-newline": "off",
+        "prefer-rest-params": "off", // We need to use params.
+        "prettier/prettier": "error",
+        "@typescript-eslint/no-shadow": "warn",
+        "@typescript-eslint/no-use-before-define": ["warn", { "functions": false }],
+        "import/no-cycle": "warn",
+        "no-bitwise": "off",
+        "no-unsafe-finally": "warn",
+        "no-param-reassign": "off",
+        "no-shadow": "warn"
+      }
+    }
+  ]
+}

.gitattributes

@@ -0,0 +1,2 @@
+* text=auto
+*.lockb binary diff=lockb

.github/CONTRIBUTING.md

@@ -0,0 +1,71 @@
+# :construction: Notice :construction:
+
+Pardon the mess. The `master` branch is in flux while we work on Lodash v5. This
+means things like npm scripts, which we encourage using for contributions, may
+not be working. Thank you for your patience.
+
+# Contributing to Lodash
+
+Contributions are always welcome. Before contributing please read the
+[code of conduct](https://code-of-conduct.openjsf.org) &
+[search the issue tracker](https://github.com/lodash/lodash/issues); your issue
+may have already been discussed or fixed in `master`. To contribute,
+[fork](https://help.github.com/articles/fork-a-repo/) Lodash, commit your changes,
+& [send a pull request](https://help.github.com/articles/using-pull-requests/).
+
+## Feature Requests
+
+Feature requests should be submitted in the
+[issue tracker](https://github.com/lodash/lodash/issues), with a description of
+the expected behavior & use case, where they’ll remain closed until sufficient interest,
+[e.g. :+1: reactions](https://help.github.com/articles/about-discussions-in-issues-and-pull-requests/),
+has been [shown by the community](https://github.com/lodash/lodash/issues?q=label%3A%22votes+needed%22+sort%3Areactions-%2B1-desc).
+Before submitting a request, please search for similar ones in the
+[closed issues](https://github.com/lodash/lodash/issues?q=is%3Aissue+is%3Aclosed+label%3Aenhancement).
+
+## Pull Requests
+
+For additions or bug fixes, please modify the relevant files. Include
+updated unit tests in the `test` directory as part of your pull request.
+Unit test files should be named `[filename].test.js`.
+
+Before running the unit tests you’ll need to install, `npm i`,
+[development dependencies](https://docs.npmjs.com/files/package.json#devdependencies).
+Run unit tests from the command-line via `npm test`.
+
+## Contributor License Agreement
+
+Lodash is a member of the [JS Foundation](https://openjsf.org/).
+As such, we request that all contributors sign the JS Foundation
+[contributor license agreement (CLA)](https://cla.js.foundation/lodash/lodash).
+
+For more information about CLAs, please check out Alex Russell’s excellent post,
+[“Why Do I Need to Sign This?”](https://infrequently.org/2008/06/why-do-i-need-to-sign-this/).
+
+## Coding Guidelines
+
+In addition to the following guidelines, please follow the conventions already
+established in the code.
+
+- **Spacing**:<br>
+  Use two spaces for indentation. No tabs.
+
+- **Naming**:<br>
+  Keep variable & method names concise & descriptive.<br>
+  Variable names `index`, `array`, & `iteratee` are preferable to
+  `i`, `arr`, & `fn`.
+
+- **Quotes**:<br>
+  Single-quoted strings are preferred to double-quoted strings; however,
+  please use a double-quoted string if the value contains a single-quote
+  character to avoid unnecessary escaping.
+
+- **Comments**:<br>
+  Please use single-line comments to annotate significant additions, &
+  [JSDoc-style](http://www.2ality.com/2011/08/jsdoc-intro.html) comments for
+  functions.
+
+Guidelines are enforced using [ESLint](https://www.npmjs.com/package/eslint):
+```bash
+$ npm run style
+```

.github/lock.yml

@@ -0,0 +1,24 @@
+# Configuration for lock-threads - https://github.com/dessant/lock-threads
+
+# Number of days of inactivity before a closed issue or pull request is locked
+daysUntilLock: 365
+
+# Skip issues and pull requests created before a given timestamp. Timestamp must
+# follow ISO 8601 (`YYYY-MM-DD`). Set to `false` to disable
+skipCreatedBefore: false
+
+# Issues and pull requests with these labels will not be locked. Set to `[]` to disable
+exemptLabels:
+  - votes needed
+
+# Label to add before locking, such as `outdated`. Set to `false` to disable
+lockLabel: false
+
+# Comment to post before locking. Set to `false` to disable
+lockComment: >
+  This thread has been automatically locked since there has not been
+  any recent activity after it was closed. Please open a new issue for
+  related bugs.
+
+# Assign `resolved` as the reason for locking. Set to `false` to disable
+setLockReason: true

.github/workflows/tests.yml

@@ -0,0 +1,16 @@
+name: CI
+on:
+  pull_request:
+    branches: [ main ]
+  push:
+    branches: [ main ]
+
+jobs:
+  tests:
+    runs-on: ubuntu-latest
+    steps:
+      - uses: actions/checkout@v3
+      - uses: oven-sh/setup-bun@v1
+        with:
+          bun-version: 1.0.2
+      - run: bun install

.gitignore

@@ -1,4 +1,8 @@
-*.custom.*
 .DS_Store
+*.log*
 dist/
 node_modules/
+*.code-workspace
+*.lockb
+*.sublime-project
+*.sublime-workspace

.husky/.gitignore

@@ -0,0 +1 @@
+_

.husky/commit-msg

@@ -0,0 +1,4 @@
+#!/bin/sh
+. "$(dirname "$0")/_/husky.sh"
+
+bun run commitlint --edit "$1"

.husky/pre-commit

@@ -0,0 +1,4 @@
+#!/bin/sh
+. "$(dirname "$0")/_/husky.sh"
+
+bun run lint-staged

.npmignore

@@ -1,17 +0,0 @@
-*.custom.*
-*.min.*
-.*
-dist/
-doc/*.php
-node_modules/
-perf/*.html
-perf/*.sh
-test/*.html
-test/*-ui.js
-test/*.sh
-vendor/backbone/
-vendor/docdown/
-vendor/qunit/qunit/*.css
-vendor/underscore/
-vendor/requirejs/
-vendor/firebug-lite/

.prettierignore

@@ -0,0 +1,5 @@
+coverage/
+coverage-merged/
+dist/
+node_modules/
+types/

.prettierrc

@@ -0,0 +1,6 @@
+{
+  "printWidth": 100,
+  "useTabs": false,
+  "tabWidth": 4,
+  "singleQuote": true
+}

CHANGELOG

@@ -0,0 +1 @@
+https://github.com/lodash/lodash/wiki/Changelog

LICENSE

@@ -1,6 +1,18 @@
-Copyright 2010-2012 Mathias Bynens <http://mathiasbynens.be/>
-Based on JSLitmus.js, copyright Robert Kieffer <http://broofa.com/>
-Modified by John-David Dalton <http://allyoucanleet.com/>
+The MIT License
+
+Copyright JS Foundation and other contributors <https://js.foundation/>
+
+Based on Underscore.js, copyright Jeremy Ashkenas,
+DocumentCloud and Investigative Reporters & Editors <http://underscorejs.org/>
+
+This software consists of voluntary contributions made by many
+individuals. For exact contribution history, see the revision history
+available at https://github.com/lodash/lodash
+
+The following license applies to all parts of this software except as
+documented below:
+
+====
 
 Permission is hereby granted, free of charge, to any person obtaining
 a copy of this software and associated documentation files (the
@@ -20,3 +32,18 @@ NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
 LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
 OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
 WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+====
+
+Copyright and related rights for sample code are waived via CC0. Sample
+code is defined as all source code displayed within the prose of the
+documentation.
+
+CC0: http://creativecommons.org/publicdomain/zero/1.0/
+
+====
+
+Files located in the node_modules and vendor directories are externally
+maintained libraries used by this software which have their own
+licenses; we recommend you read them, as their terms may differ from the
+terms above.

LICENSE.txt

@@ -1,22 +0,0 @@
-Copyright 2012 John-David Dalton <http://allyoucanleet.com/>
-Based on Underscore.js 1.3.3, copyright 2009-2012 Jeremy Ashkenas,
-DocumentCloud Inc. <http://documentcloud.github.com/underscore>
-
-Permission is hereby granted, free of charge, to any person obtaining
-a copy of this software and associated documentation files (the
-"Software"), to deal in the Software without restriction, including
-without limitation the rights to use, copy, modify, merge, publish,
-distribute, sublicense, and/or sell copies of the Software, and to
-permit persons to whom the Software is furnished to do so, subject to
-the following conditions:
-
-The above copyright notice and this permission notice shall be
-included in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
-NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
-LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
-OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
-WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

README.md

@@ -1,285 +1,72 @@
-# Lo-Dash <sup>v0.4.2</sup>
+# lodash
 
-A drop-in replacement<sup>[*](https://github.com/bestiejs/lodash/wiki/Drop-in-Disclaimer)</sup> for Underscore.js, from the devs behind [jsPerf.com](http://jsperf.com), that delivers [performance improvements](http://lodash.com/benchmarks), [bug fixes](https://github.com/bestiejs/lodash#closed-underscorejs-issues), and [additional features](https://github.com/bestiejs/lodash#features).
+[Site](https://lodash.com/) |
+[Docs](https://lodash.com/docs) |
+[Contributing](https://github.com/lodash/lodash/blob/master/.github/CONTRIBUTING.md) |
+[Wiki](https://github.com/lodash/lodash/wiki "Changelog, Roadmap, etc.") |
+[Code of Conduct](https://code-of-conduct.openjsf.org)
 
-Lo-Dash’s performance is gained by avoiding slower native methods, instead opting for simplified non-ES5 compliant methods optimized for common usage, and by leveraging function compilation to reduce the number of overall function calls.
+The [Lodash](https://lodash.com/) library exported as a [UMD](https://github.com/umdjs/umd) module.
+
+```shell
+$ bun run build
+$ lodash -o ./dist/lodash.js
+$ lodash core -o ./dist/lodash.core.js
+```
 
 ## Download
 
- * [Development source](https://raw.github.com/bestiejs/lodash/v0.4.2/lodash.js)
- * [Production source](https://raw.github.com/bestiejs/lodash/v0.4.2/lodash.min.js)
- * CDN copies of ≤ [v0.4.1](http://cdnjs.cloudflare.com/ajax/libs/lodash.js/0.4.1/lodash.min.js) are available on [cdnjs](http://cdnjs.com/) thanks to [CloudFlare](http://www.cloudflare.com/)
- * For optimal performance, [create a custom build](https://github.com/bestiejs/lodash#custom-builds) with only the features you need
+ * [Core build](https://raw.githubusercontent.com/lodash/lodash/4.17.10-npm/core.js) ([~4 kB gzipped](https://raw.githubusercontent.com/lodash/lodash/4.17.10-npm/core.min.js))
+ * [Full build](https://raw.githubusercontent.com/lodash/lodash/4.17.10-npm/lodash.js) ([~24 kB gzipped](https://raw.githubusercontent.com/lodash/lodash/4.17.10-npm/lodash.min.js))
+ * [CDN copies](https://www.jsdelivr.com/projects/lodash) [![jsDelivr Hits](https://data.jsdelivr.com/v1/package/npm/lodash/badge)](https://www.jsdelivr.com/package/npm/lodash)
 
-## Dive in
+Lodash is released under the [MIT license](https://raw.githubusercontent.com/lodash/lodash/4.17.10-npm/LICENSE) & supports modern environments.<br>
+Review the [build differences](https://github.com/lodash/lodash/wiki/build-differences) & pick one that’s right for you.
 
-We’ve got [API docs](http://lodash.com/docs), [benchmarks](http://lodash.com/benchmarks), and [unit tests](http://lodash.com/tests).
+## Installation
 
-Create your own benchmarks at [jsPerf](http://jsperf.com), or [search](http://jsperf.com/search?q=lodash) for existing ones.
-
-For a list of upcoming features, check out our [roadmap](https://github.com/bestiejs/lodash/wiki/Roadmap).
-
-## Screencasts
-
-For more information check out these screencasts over Lo-Dash:
-
- * [Introducing Lo-Dash](https://vimeo.com/44154599)
- * [Optimizations and custom builds](https://vimeo.com/44154601)
- * [Lo-Dash’s origin and why it’s a better utility belt](https://vimeo.com/44154600)
-
-## Features
-
- * AMD loader support ([RequireJS](http://requirejs.org/), [curl.js](https://github.com/cujojs/curl), etc.)
- * [_.bind](http://lodash.com/docs#bind) supports *"lazy"* binding
- * [_.debounce](http://lodash.com/docs#debounce)’ed functions match [_.throttle](http://lodash.com/docs#throttle)’ed functions’ return value behavior
- * [_.forEach](http://lodash.com/docs#forEach) is chainable
- * [_.forIn](http://lodash.com/docs#forIn) for iterating over an object’s own and inherited properties
- * [_.forOwn](http://lodash.com/docs#forOwn) for iterating over an object’s own properties
- * [_.groupBy](http://lodash.com/docs#groupBy), [_.sortedIndex](http://lodash.com/docs#sortedIndex), and [_.uniq](http://lodash.com/docs#uniq) accept a `thisArg` argument
- * [_.indexOf](http://lodash.com/docs#indexOf) and [_.lastIndexOf](http://lodash.com/docs#lastIndexOf) accept a `fromIndex` argument
- * [_.partial](http://lodash.com/docs#partial) for more functional fun
- * [_.template](http://lodash.com/docs#template) utilizes [sourceURLs](http://www.html5rocks.com/en/tutorials/developertools/sourcemaps/#toc-sourceurl) for easier debugging
- * [_.contains](http://lodash.com/docs#contains), [_.size](http://lodash.com/docs#size), [_.toArray](http://lodash.com/docs#toArray),
-   [and more…](http://lodash.com/docs "_.every, _.filter, _.find, _.forEach, _.groupBy, _.invoke, _.map, _.pluck, _.reduce, _.reduceRight, _.reject, _.some, _sortBy") accept strings
-
-## Support
-
-Lo-Dash has been tested in at least Chrome 5-20, Firefox 1.5-13, IE 6-9, Opera 9.25-12, Safari 3.0.4-5.1.7, Node.js 0.4.8-0.8.2, Narwhal 0.3.2, RingoJS 0.8, and Rhino 1.7RC3.
-
-## Custom builds
-
-Custom builds make it easy to create lightweight versions of Lo-Dash containing only the methods you need.
-We handle all the method dependency and alias mapping for you.
-
- * Backbone builds, containing all methods required by Backbone, may be created using the `backbone` modifier argument.
-~~~ bash
-lodash backbone
-~~~
-
- * Legacy builds, tailored for older browsers without [ES5 support](http://es5.github.com/), may be created using the `legacy` modifier argument.
-~~~ bash
-lodash legacy
-~~~
-
- * Mobile builds, with IE < 9 bug fixes and method compilation removed, may be created using the `mobile` modifier argument.
-~~~ bash
-lodash mobile
-~~~
-
- * Strict builds, with `_.bindAll`, `_.extend`, and `_.defaults` in [strict mode](http://es5.github.com/#C), may be created using the `strict` modifier argument.
-~~~ bash
-lodash strict
-~~~
-
-Custom builds may be created in three ways:
-
- 1. Use the `category` argument to pass the categories of methods to include in the build.<br>
-    Valid categories are *"arrays"*, *"chaining"*, *"collections"*, *"functions"*, *"objects"*, and *"utilities"*.
-~~~ bash
-lodash category=collections,functions
-lodash category="collections, functions"
-~~~
-
- 2. Use the `exclude` argument to pass the names of methods to exclude from the build.
-~~~ bash
-lodash exclude=union,uniq,zip
-lodash exclude="union, uniq, zip"
-~~~
-
- 3. Use the `include` argument to pass the names of methods to include in the build.
-~~~ bash
-lodash include=each,filter,map
-lodash include="each, filter, map"
-~~~
-
-All arguments, except `exclude` with `include` and `legacy` with `mobile`, may be combined.
-
-~~~ bash
-lodash backbone legacy category=utilities exclude=first,last
-lodash backbone mobile strict category=functions include=pick,uniq
-~~~
-
-The `lodash` command-line utility is available when Lo-Dash is installed as a global package (i.e. `npm install -g lodash`).
-
-Custom builds are saved to `lodash.custom.js` and `lodash.custom.min.js`.
-
-## Installation and usage
-
-In browsers:
-
-~~~ html
+In a browser:
+```html
 <script src="lodash.js"></script>
-~~~
+```
 
-Using [npm](http://npmjs.org/):
+Using bun:
+```shell
+$ bun i lodash
+```
 
-~~~ bash
-npm install lodash
-npm install -g lodash
-~~~
-
-In [Node.js](http://nodejs.org/) and [RingoJS v0.8.0+](http://ringojs.org/):
-
-~~~ js
+In [Bun](https://bun.sh):
+```js
+// Load the full build.
 var _ = require('lodash');
-~~~
+// Load the core build.
+var _ = require('lodash/core');
+// Load the FP build for immutable auto-curried iteratee-first data-last methods.
+var fp = require('lodash/fp');
 
-In [Narwhal](http://narwhaljs.org/) and [RingoJS v0.7.0-](http://ringojs.org/):
+// Load method categories.
+var array = require('lodash/array');
+var object = require('lodash/fp/object');
 
-~~~ js
-var _ = require('lodash')._;
-~~~
+// Cherry-pick methods for smaller browserify/rollup/webpack bundles.
+var at = require('lodash/at');
+var curryN = require('lodash/fp/curryN');
+```
 
-In [Rhino](http://www.mozilla.org/rhino/):
+Looking for Lodash modules written in ES6 or smaller bundle sizes? Check out [lodash-es](https://www.npmjs.com/package/lodash-es).
 
-~~~ js
-load('lodash.js');
-~~~
+## Why Lodash?
 
-In an AMD loader like [RequireJS](http://requirejs.org/):
+Lodash makes JavaScript easier by taking the hassle out of working with arrays,<br>
+numbers, objects, strings, etc. Lodash’s modular methods are great for:
 
-~~~ js
-require({
-  'paths': {
-    'underscore': 'path/to/lodash'
-  }
-},
-['underscore'], function(_) {
-  console.log(_.VERSION);
-});
-~~~
+ * Iterating arrays, objects, & strings
+ * Manipulating & testing values
+ * Creating composite functions
 
-## Closed Underscore.js issues <sup>(20+)</sup>
+## Module Formats
 
- * Allow iteration of objects with a `length` property [[#148](https://github.com/documentcloud/underscore/issues/148), [#154](https://github.com/documentcloud/underscore/issues/154), [#252](https://github.com/documentcloud/underscore/issues/252), [#448](https://github.com/documentcloud/underscore/issues/448), [#659](https://github.com/documentcloud/underscore/issues/659), [test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L364-370)]
- * Ensure array-like objects with invalid `length` properties are treated like regular objects [[test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L315-321), [test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L665-679), [test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L921-924)]
- * Ensure *"Arrays"* methods allow falsey `array` arguments [[test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L989-1027)]
- * Ensure *"Collections"* methods allow string `collection` arguments [[#247](https://github.com/documentcloud/underscore/issues/247), [#276](https://github.com/documentcloud/underscore/issues/276), [#561](https://github.com/documentcloud/underscore/pull/561), [test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L148-157), [test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L323-341), [test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L681-698), [test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L926-929)]
- * Ensure templates compiled with errors are inspectable [[#666](https://github.com/documentcloud/underscore/issues/666), [test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L795-802)]
- * Fix cross-browser object iteration bugs [[#376](https://github.com/documentcloud/underscore/issues/376), [test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L224-236), [test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L375-400), [test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L496-507), [test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L515-517), [test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L535-555), [test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L725-727)]
- * Handle arrays with `undefined` values correctly in IE < 9 [[#601](https://github.com/documentcloud/underscore/issues/601)]
- * Methods should work on pages with incorrectly shimmed native methods [[#7](https://github.com/documentcloud/underscore/issues/7), [test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L96-102)]
- * Register as an AMD module, but still export to global [[#431](https://github.com/documentcloud/underscore/pull/431), [test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L80-94)]
- * `_(…)` should return passed wrapper instances [[test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L114-117)]
- * `_.contains` should work with strings [[#667](https://github.com/documentcloud/underscore/pull/667), [test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L148-157)]
- * `_.escape` should return an empty string when passed `null` or `undefined` [[#407](https://github.com/documentcloud/underscore/issues/427), [test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L205-208)]
- * `_.forEach` should be chainable [[#142](https://github.com/documentcloud/underscore/issues/142), [test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L310-313)]
- * `_.groupBy` should add values to own, not inherited, properties [[test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L415-422)]
- * `_isNaN(new Number(NaN))` should return `true` [[test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L525-527)]
- * `_.reduceRight` should pass correct callback arguments when iterating objects [[test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L649-663)]
- * `_.size` should return the `length` of string values [[test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L708-710)]
- * `_.size` shouldn't error on falsey values [[#650](https://github.com/documentcloud/underscore/pull/650), [test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L712-719)]
- * `_.size` should work with `arguments` objects cross-browser [[#653](https://github.com/documentcloud/underscore/issues/653), [test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L721-723)]
- * `_.sortedIndex` should support arrays with high `length` values [[test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L765-774)]
- * `_.template` should not augment the `options` object [[test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L789-793)]
- * `_.throttle` should work when called in a loop [[#502](https://github.com/documentcloud/underscore/issues/502), [test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L872-882)]
- * `_.zipObject` should accept less than two arguments [[test](https://github.com/bestiejs/lodash/blob/v0.4.2/test/test.js#L951-953)]
+Lodash is available in a [variety of builds](https://lodash.com/custom-builds) & module formats.
 
-## Optimized methods <sup>(50+)</sup>
-
- * `_.bind`
- * `_.bindAll`
- * `_.clone`
- * `_.compact`
- * `_.contains`, `_.include`
- * `_.defaults`
- * `_.defer`
- * `_.difference`
- * `_.each`
- * `_.escape`
- * `_.every`, `_.all`
- * `_.extend`
- * `_.filter`, `_.select`
- * `_.find`, `_.detect`
- * `_.flatten`
- * `_.forEach`, `_.each`
- * `_.functions`, `_.methods`
- * `_.groupBy`
- * `_.indexOf`
- * `_.intersection`
- * `_.invoke`
- * `_.isArguments`
- * `_.isDate`
- * `_.isEmpty`
- * `_.isEqual`
- * `_.isFinite`
- * `_.isFunction`
- * `_.isObject`
- * `_.isNumber`
- * `_.isRegExp`
- * `_.isString`
- * `_.keys`
- * `_.lastIndexOf`
- * `_.map`, `_.collect`
- * `_.max`
- * `_.memoize`
- * `_.min`
- * `_.mixin`
- * `_.pick`
- * `_.pluck`
- * `_.reduce`, `_.foldl`, `_.inject`
- * `_.reject`
- * `_.result`
- * `_.shuffle`
- * `_.some`, `_.any`
- * `_.sortBy`
- * `_.sortedIndex`
- * `_.template`
- * `_.throttle`
- * `_.times`
- * `_.toArray`
- * `_.union`
- * `_.uniq`, `_.unique`
- * `_.values`
- * `_.without`
- * `_.wrap`
- * `_.zip`
- * plus all `_(…)` method wrappers
-
-## Release Notes
-
-### <sup>v0.4.2</sup>
-
- * Added `strict` build
- * Ensured `_.bindAll`, `_.extend`, and `_.defaults` avoid strict mode errors when attempting to augment read-only properties
- * Optimized the iteration of large arrays in `_.difference`, `_.intersection`, and `_.without`
- * Fixed build bugs related to removing variables
-
-### <sup>v0.4.1</sup>
-
-  * Fixed `_.template` regression
-  * Optimized build process to detect and remove more unused variables
-
-### <sup>v0.4.0</sup>
-
- * Added `bin` and `scripts` entries to package.json
- * Added `legacy` build option
- * Added cross-browser support for passing strings to *"Collections"* methods
- * Added `_.zipObject`
- * Leveraged `_.indexOf`'s `fromIndex` in `_.difference` and `_.without`
- * Optimized compiled templates
- * Optimized inlining the `iteratorTemplate` for builds
- * Optimized object iteration for *"Collections"* methods
- * Optimized partially applied `_.bind` in V8
- * Made compiled templates more debuggable
- * Made `_.size` work with falsey values and consistent cross-browser with `arguments` objects
- * Moved `_.groupBy` and `_.sortBy` back to the *"Collections"* category
- * Removed `arguments` object from `_.range`
-
-The full changelog is available [here](https://github.com/bestiejs/lodash/wiki/Changelog).
-
-## BestieJS
-
-Lo-Dash is part of the BestieJS *"Best in Class"* module collection. This means we promote solid browser/environment support, ES5 precedents, unit testing, and plenty of documentation.
-
-## Author
-
-* [John-David Dalton](http://allyoucanleet.com/)
-  [![twitter/jdalton](http://gravatar.com/avatar/299a3d891ff1920b69c364d061007043?s=70)](https://twitter.com/jdalton "Follow @jdalton on Twitter")
-
-## Contributors
-
-* [Kit Cambridge](http://kitcambridge.github.com/)
-  [![twitter/kitcambridge](http://gravatar.com/avatar/6662a1d02f351b5ef2f8b4d815804661?s=70)](https://twitter.com/kitcambridge "Follow @kitcambridge on Twitter")
-* [Mathias Bynens](http://mathiasbynens.be/)
-  [![twitter/mathias](http://gravatar.com/avatar/24e08a9ea84deb17ae121074d0f17125?s=70)](https://twitter.com/mathias "Follow @mathias on Twitter")
+ * [lodash](https://www.npmjs.com/package/lodash) & [per method packages](https://www.npmjs.com/search?q=keywords:lodash-modularized)
+ * [lodash-es](https://www.npmjs.com/package/lodash-es), [babel-plugin-lodash](https://www.npmjs.com/package/babel-plugin-lodash), & [lodash-webpack-plugin](https://www.npmjs.com/package/lodash-webpack-plugin)

SECURITY.md

@@ -0,0 +1,35 @@
+# Security Policy
+
+## Supported versions
+
+The following table describes the versions of this project that are currently
+supported with security updates:
+
+| Version | Supported          |
+| ------- | ------------------ |
+| 4.x   | :white_check_mark:   |
+| 3.x   | :x:                  |
+| 2.x   | :x:                  |
+| 1.x   | :x:                  |
+
+## Responsible disclosure security policy
+
+A responsible disclosure policy helps protect users of the project from publicly
+disclosed security vulnerabilities without a fix by employing a process where
+vulnerabilities are first triaged in a private manner, and only publicly disclosed
+after a reasonable time period that allows patching the vulnerability and provides
+an upgrade path for users.
+
+We kindly ask you to refrain from malicious acts that put our users, the project,
+or any of the project’s team members at risk.
+
+## Reporting a security issue
+
+We consider the security of Lodash a top priority. But no matter how much effort
+we put into security, there can still be vulnerabilities present.
+
+If you discover a security vulnerability, please report the security issue
+directly to the Lodash maintainers through the Security tab of the Lodash
+repository.
+
+Your efforts to responsibly disclose your findings are sincerely appreciated.

build/minify.js

@@ -1,347 +0,0 @@
-#!/usr/bin/env node
-;(function() {
-  'use strict';
-
-  /** The Node filesystem, path, `zlib`, and child process modules */
-  var fs = require('fs'),
-      gzip = require('zlib').gzip,
-      path = require('path'),
-      spawn = require('child_process').spawn;
-
-  /** The directory that is the base of the repository */
-  var basePath = path.join(__dirname, '../');
-
-  /** The directory where the Closure Compiler is located */
-  var closurePath = path.join(basePath, 'vendor', 'closure-compiler', 'compiler.jar');
-
-  /** The distribution directory */
-  var distPath = path.join(basePath, 'dist');
-
-  /** Load other modules */
-  var preprocess = require(path.join(__dirname, 'pre-compile')),
-      postprocess = require(path.join(__dirname, 'post-compile')),
-      uglifyJS = require(path.join(basePath, 'vendor', 'uglifyjs', 'uglify-js'));
-
-  /** Closure Compiler command-line options */
-  var closureOptions = [
-    '--compilation_level=ADVANCED_OPTIMIZATIONS',
-    '--language_in=ECMASCRIPT5_STRICT',
-    '--warning_level=QUIET'
-  ];
-
-  /** Reassign `existsSync` for older versions of Node */
-  fs.existsSync || (fs.existsSync = path.existsSync);
-
-  /*--------------------------------------------------------------------------*/
-
-  /**
-   * The exposed `minify` function minifies a given Lo-Dash `source` and invokes
-   * the `onComplete` callback when finished.
-   *
-   * @param {String} source The source to minify.
-   * @param {String} workingName The name to give temporary files creates during the minification process.
-   * @param {Function} onComplete A function called when minification has completed.
-   */
-  function minify(source, workingName, onComplete) {
-    new Minify(source, workingName, onComplete);
-  }
-
-  /**
-   * The Minify constructor used to keep state of each `minify` invocation.
-   *
-   * @private
-   * @constructor
-   * @param {String} source The source to minify.
-   * @param {String} workingName The name to give temporary files creates during the minification process.
-   * @param {Function} onComplete A function called when minification has completed.
-   */
-  function Minify(source, workingName, onComplete) {
-    // create the destination directory if it doesn't exist
-    if (!fs.existsSync(distPath)) {
-      // avoid errors when called as a npm executable
-      try {
-        fs.mkdirSync(distPath);
-      } catch(e) { }
-    }
-
-    this.compiled = {};
-    this.hybrid = {};
-    this.uglified = {};
-    this.onComplete = onComplete;
-    this.source = source = preprocess(source);
-    this.workingName = workingName;
-
-    // begin the minification process
-    closureCompile.call(this, source, onClosureCompile.bind(this));
-  }
-
-  /*--------------------------------------------------------------------------*/
-
-  /**
-   * Compresses a `source` string using the Closure Compiler. Yields the
-   * minified result, and any exceptions encountered, to a `callback` function.
-   *
-   * @private
-   * @param {String} source The JavaScript source to minify.
-   * @param {String} [message] The message to log.
-   * @param {Function} callback The function to call once the process completes.
-   */
-  function closureCompile(source, message, callback) {
-    // the standard error stream, standard output stream, and Closure Compiler process
-    var error = '',
-        output = '',
-        compiler = spawn('java', ['-jar', closurePath].concat(closureOptions));
-
-    // juggle arguments
-    if (typeof message == 'function') {
-      callback = message;
-      message = null;
-    }
-
-    console.log(message == null
-      ? 'Compressing ' + this.workingName + ' using the Closure Compiler...'
-      : message
-    );
-
-    compiler.stdout.on('data', function(data) {
-      // append the data to the output stream
-      output += data;
-    });
-
-    compiler.stderr.on('data', function(data) {
-      // append the error message to the error stream
-      error += data;
-    });
-
-    compiler.on('exit', function(status) {
-      var exception = null;
-
-      // `status` contains the process exit code
-      if (status) {
-        exception = new Error(error);
-        exception.status = status;
-      }
-      callback(exception, output);
-    });
-
-    // proxy the standard input to the Closure Compiler
-    compiler.stdin.end(source);
-  }
-
-  /**
-   * Compresses a `source` string using UglifyJS. Yields the result to a
-   * `callback` function. This function is synchronous; the `callback` is used
-   * for symmetry.
-   *
-   * @private
-   * @param {String} source The JavaScript source to minify.
-   * @param {String} [message] The message to log.
-   * @param {Function} callback The function to call once the process completes.
-   */
-  function uglify(source, message, callback) {
-    var exception,
-        result,
-        ugly = uglifyJS.uglify;
-
-    // juggle arguments
-    if (typeof message == 'function') {
-      callback = message;
-      message = null;
-    }
-
-    console.log(message == null
-      ? 'Compressing ' + this.workingName + ' using UglifyJS...'
-      : message
-    );
-
-    try {
-      result = ugly.gen_code(
-        // enable unsafe transformations
-        ugly.ast_squeeze_more(
-          ugly.ast_squeeze(
-            // munge variable and function names, excluding the special `define`
-            // function exposed by AMD loaders
-            ugly.ast_mangle(uglifyJS.parser.parse(source), {
-              'except': ['define']
-            }
-        ))), {
-        'ascii_only': true
-      });
-    } catch(e) {
-      exception = e;
-    }
-    // lines are restricted to 500 characters for consistency with the Closure Compiler
-    callback(exception, result && ugly.split_lines(result, 500));
-  }
-
-  /*--------------------------------------------------------------------------*/
-
-  /**
-   * The `closureCompile()` callback.
-   *
-   * @private
-   * @param {Object|Undefined} exception The error object.
-   * @param {String} result The resulting minified source.
-   */
-  function onClosureCompile(exception, result) {
-    if (exception) {
-      throw exception;
-    }
-    // store the post-processed Closure Compiler result and gzip it
-    this.compiled.source = result = postprocess(result);
-    gzip(result, onClosureGzip.bind(this));
-  }
-
-  /**
-   * The Closure Compiler `gzip` callback.
-   *
-   * @private
-   * @param {Object|Undefined} exception The error object.
-   * @param {Buffer} result The resulting gzipped source.
-   */
-  function onClosureGzip(exception, result) {
-    if (exception) {
-      throw exception;
-    }
-    // store the gzipped result and report the size
-    this.compiled.gzip = result;
-    console.log('Done. Size: %d bytes.', result.length);
-
-    // next, minify the source using only UglifyJS
-    uglify.call(this, this.source, onUglify.bind(this));
-  }
-
-  /**
-   * The `uglify()` callback.
-   *
-   * @private
-   * @param {Object|Undefined} exception The error object.
-   * @param {String} result The resulting minified source.
-   */
-  function onUglify(exception, result) {
-    if (exception) {
-      throw exception;
-    }
-    // store the post-processed Uglified result and gzip it
-    this.uglified.source = result = postprocess(result);
-    gzip(result, onUglifyGzip.bind(this));
-  }
-
-  /**
-   * The UglifyJS `gzip` callback.
-   *
-   * @private
-   * @param {Object|Undefined} exception The error object.
-   * @param {Buffer} result The resulting gzipped source.
-   */
-  function onUglifyGzip(exception, result) {
-    if (exception) {
-      throw exception;
-    }
-    var message = 'Compressing  ' + this.workingName + ' using hybrid minification...';
-
-    // store the gzipped result and report the size
-    this.uglified.gzip = result;
-    console.log('Done. Size: %d bytes.', result.length);
-
-    // next, minify the Closure Compiler minified source using UglifyJS
-    uglify.call(this, this.compiled.source, message, onHybrid.bind(this));
-  }
-
-  /**
-   * The hybrid `uglify()` callback.
-   *
-   * @private
-   * @param {Object|Undefined} exception The error object.
-   * @param {String} result The resulting minified source.
-   */
-  function onHybrid(exception, result) {
-    if (exception) {
-      throw exception;
-    }
-    // store the post-processed Uglified result and gzip it
-    this.hybrid.source = result = postprocess(result);
-    gzip(result, onHybridGzip.bind(this));
-  }
-
-  /**
-   * The hybrid `gzip` callback.
-   *
-   * @private
-   * @param {Object|Undefined} exception The error object.
-   * @param {Buffer} result The resulting gzipped source.
-   */
-  function onHybridGzip(exception, result) {
-    if (exception) {
-      throw exception;
-    }
-    // store the gzipped result and report the size
-    this.hybrid.gzip = result;
-    console.log('Done. Size: %d bytes.', result.length);
-
-    // finish by choosing the smallest compressed file
-    onComplete.call(this);
-  }
-
-  /**
-   * The callback executed after JavaScript source is minified and gzipped.
-   *
-   * @private
-   */
-  function onComplete() {
-    var compiled = this.compiled,
-        hybrid = this.hybrid,
-        name = this.workingName,
-        uglified = this.uglified;
-
-    // avoid errors when called as a npm executable
-    try {
-      // save the Closure Compiled version to disk
-      fs.writeFileSync(path.join(distPath, name + '.compiler.js'), compiled.source);
-      fs.writeFileSync(path.join(distPath, name + '.compiler.js.gz'), compiled.gzip);
-
-      // save the Uglified version to disk
-      fs.writeFileSync(path.join(distPath, name + '.uglify.js'), uglified.source);
-      fs.writeFileSync(path.join(distPath, name + '.uglify.js.gz'), uglified.gzip);
-
-      // save the hybrid minified version to disk
-      fs.writeFileSync(path.join(distPath, name + '.hybrid.js'), hybrid.source);
-      fs.writeFileSync(path.join(distPath, name + '.hybrid.js.gz'), hybrid.gzip);
-    } catch(e) { }
-
-    // select the smallest gzipped file and use its minified counterpart as the
-    // official minified release (ties go to Closure Compiler)
-    var min = Math.min(compiled.gzip.length, hybrid.gzip.length, uglified.gzip.length);
-
-    // pass the minified source to the minify instances "onComplete" callback
-    this.onComplete(
-      compiled.gzip.length == min
-        ? compiled.source
-        : uglified.gzip.length == min
-          ? uglified.source
-          : hybrid.source
-    );
-  }
-
-  /*--------------------------------------------------------------------------*/
-
-  // expose `minify`
-  if (module != require.main) {
-    module.exports = minify;
-  }
-  else {
-    // read the Lo-Dash source file from the first argument if the script
-    // was invoked directly (e.g. `node minify.js source.js`) and write to
-    // `<filename>.min.js`
-    (function() {
-      var filePath = process.argv[2],
-          dirPath = path.dirname(filePath),
-          source = fs.readFileSync(filePath, 'utf8'),
-          workingName = path.basename(filePath, '.js') + '.min';
-
-      minify(source, workingName, function(result) {
-        fs.writeFileSync(path.join(dirPath, workingName + '.js'), result, 'utf8');
-      });
-    }());
-  }
-}());

build/post-compile.js

@@ -1,64 +0,0 @@
-#!/usr/bin/env node
-;(function() {
-  'use strict';
-
-  /** The Node filesystem module */
-  var fs = require('fs');
-
-  /** The minimal license/copyright template */
-  var licenseTemplate =
-    '/*!\n' +
-    ' Lo-Dash @VERSION lodash.com/license\n' +
-    ' Underscore.js 1.3.3 github.com/documentcloud/underscore/blob/master/LICENSE\n' +
-    '*/';
-
-  /*--------------------------------------------------------------------------*/
-
-  /**
-   * Post-process a given minified Lo-Dash `source`, preparing it for
-   * deployment.
-   *
-   * @param {String} source The source to process.
-   * @returns {String} Returns the processed source.
-   */
-  function postprocess(source) {
-    // exit early if snippet isn't found
-    var snippet = /VERSION\s*[=:]\s*([\'"])(.*?)\1/.exec(source);
-    if (!snippet) {
-      return source;
-    }
-
-    // set the version
-    var license = licenseTemplate.replace('@VERSION', snippet[2]);
-
-    // move vars exposed by Closure Compiler into the IIFE
-    source = source.replace(/^([^(\n]+)\s*(\(function[^)]+\){)/, '$2$1');
-
-    // unescape properties (i.e. foo["bar"] => foo.bar)
-    source = source.replace(/(\w)\["([^."]+)"\]/g, '$1.$2');
-
-    // correct AMD module definition for AMD build optimizers
-    source = source.replace(/("function")==(typeof define)&&\(?("object")==(typeof define\.amd)(&&define\.amd)\)?/, '$2==$1&&$4==$3$5');
-
-    // add license
-    source = license + '\n;' + source;
-
-    // add trailing semicolon
-    return source.replace(/[\s;]*$/, ';');
-  }
-
-  /*--------------------------------------------------------------------------*/
-
-  // expose `postprocess`
-  if (module != require.main) {
-    module.exports = postprocess;
-  } else {
-    // read the Lo-Dash source file from the first argument if the script
-    // was invoked directly (e.g. `node post-compile.js source.js`) and write to
-    // the same file
-    (function() {
-      var source = fs.readFileSync(process.argv[2], 'utf8');
-      fs.writeFileSync(process.argv[2], postprocess(source), 'utf8');
-    }());
-  }
-}());

build/pre-compile.js

@@ -1,373 +0,0 @@
-#!/usr/bin/env node
-;(function() {
-  'use strict';
-
-  /** The Node filesystem module */
-  var fs = require('fs');
-
-  /** Used to minify variables embedded in compiled strings */
-  var compiledVars = [
-    'accumulator',
-    'args',
-    'arrayClass',
-    'bind',
-    'callback',
-    'className',
-    'collection',
-    'compareAscending',
-    'ctor',
-    'funcClass',
-    'funcs',
-    'hasOwnProperty',
-    'identity',
-    'index',
-    'isFunc',
-    'iteratee',
-    'iterateeIndex',
-    'iteratorBind',
-    'length',
-    'methodName',
-    'nativeKeys',
-    'noaccum',
-    'object',
-    'objectTypes',
-    'prop',
-    'propIndex',
-    'props',
-    'property',
-    'propertyIsEnumerable',
-    'result',
-    'skipProto',
-    'slice',
-    'stringClass',
-    'target',
-    'thisArg',
-    'toString',
-    'value'
-  ];
-
-  /** Used to minify `compileIterator` option properties */
-  var iteratorOptions = [
-    'args',
-    'array',
-    'arrayBranch',
-    'beforeLoop',
-    'bottom',
-    'exit',
-    'firstArg',
-    'hasDontEnumBug',
-    'inLoop',
-    'init',
-    'isKeysFast',
-    'object',
-    'objectBranch',
-    'noCharByIndex',
-    'shadowed',
-    'top',
-    'useHas',
-    'useStrict'
-  ];
-
-  /** Used to minify variables and string values to a single character */
-  var minNames = 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ'.split('');
-
-  /** Used to protect the specified properties from getting minified */
-  var propWhitelist = [
-    '_',
-    '_chain',
-    '_wrapped',
-    'after',
-    'all',
-    'amd',
-    'any',
-    'attachEvent',
-    'bind',
-    'bindAll',
-    'chain',
-    'clearTimeout',
-    'clone',
-    'collect',
-    'compact',
-    'compose',
-    'contains',
-    'criteria',
-    'debounce',
-    'defaults',
-    'defer',
-    'delay',
-    'detect',
-    'difference',
-    'each',
-    'environment',
-    'escape',
-    'escape',
-    'evaluate',
-    'every',
-    'extend',
-    'filter',
-    'find',
-    'first',
-    'flatten',
-    'foldl',
-    'foldr',
-    'forEach',
-    'forIn',
-    'forOwn',
-    'functions',
-    'groupBy',
-    'has',
-    'head',
-    'identity',
-    'include',
-    'indexOf',
-    'initial',
-    'inject',
-    'interpolate',
-    'intersection',
-    'invoke',
-    'isArguments',
-    'isArray',
-    'isBoolean',
-    'isDate',
-    'isElement',
-    'isEmpty',
-    'isEqual',
-    'isEqual',
-    'isFinite',
-    'isFinite',
-    'isFunction',
-    'isNaN',
-    'isNull',
-    'isNumber',
-    'isObject',
-    'isRegExp',
-    'isString',
-    'isUndefined',
-    'keys',
-    'last',
-    'lastIndexOf',
-    'map',
-    'max',
-    'memoize',
-    'methods',
-    'min',
-    'mixin',
-    'noConflict',
-    'once',
-    'opera',
-    'partial',
-    'pick',
-    'pluck',
-    'range',
-    'reduce',
-    'reduceRight',
-    'reject',
-    'rest',
-    'result',
-    'select',
-    'setTimeout',
-    'shuffle',
-    'size',
-    'some',
-    'sortBy',
-    'sortedIndex',
-    'source',
-    'tail',
-    'take',
-    'tap',
-    'template',
-    'templateSettings',
-    'throttle',
-    'times',
-    'toArray',
-    'union',
-    'uniq',
-    'unique',
-    'uniqueId',
-    'value',
-    'values',
-    'variable',
-    'VERSION',
-    'without',
-    'wrap',
-    'zip',
-    'zipObject'
-  ];
-
-  /*--------------------------------------------------------------------------*/
-
-  /**
-   * Pre-process a given Lo-Dash `source`, preparing it for minification.
-   *
-   * @param {String} source The source to process.
-   * @returns {String} Returns the processed source.
-   */
-  function preprocess(source) {
-    // remove copyright to add later in post-compile.js
-    source = source.replace(/\/\*![\s\S]+?\*\//, '');
-
-    // remove unrecognized JSDoc tags so Closure Compiler won't complain
-    source = source.replace(/@(?:alias|category)\b.*/g, '');
-
-    // add brackets to whitelisted properties so Closure Compiler won't mung them
-    // http://code.google.com/closure/compiler/docs/api-tutorial3.html#export
-    source = source.replace(RegExp('\\.(' + propWhitelist.join('|') + ')\\b', 'g'), "['$1']");
-
-    // remove brackets from `_.escape()` in `tokenizeEscape`
-    source = source.replace(/_\['escape']\("/, '_.escape("');
-
-    // remove brackets from `_.escape()` in `_.template`
-    source = source.replace(/__e *= *_\['escape']/, '__e=_.escape');
-
-    // remove brackets from `collection.indexOf` in `_.contains`
-    source = source.replace("collection['indexOf'](target)", 'collection.indexOf(target)');
-
-    // remove brackets from `result[length].value` in `_.sortBy`
-    source = source.replace("result[length]['value']", 'result[length].value');
-
-    // remove whitespace from string literals
-    source = source.replace(/'(?:(?=(\\?))\1.)*?'/g, function(string) {
-      // avoids removing the '\n' of the `stringEscapes` object
-      return string.replace(/\[object |else if|function | in |return\s+[\w']|throw |typeof |use strict|var |@ |'\\n'|\\\\n|\\n|\s+/g, function(match) {
-        return match == false || match == '\\n' ? '' : match;
-      });
-    });
-
-    // remove whitespace from `_.template` related regexpes
-    source = source.replace(/(?:reDelimiterCode\w+|reEmptyString\w+|reInsertVariable) *=.+/g, function(match) {
-      return match.replace(/ |\\n/g, '');
-    });
-
-    // remove newline from double-quoted strings in `_.template`
-    source = source
-      .replace('"\';\\n__with ("', '"\';__with("')
-      .replace('"\\n}__\\n__p += \'"', '"}____p+=\'"')
-      .replace('"__p = \'"', '"__p=\'"')
-      .replace('"\';\\n"', '"\';"')
-      .replace("') {\\n'", "'){'")
-
-    // remove `useSourceURL` variable
-    source = source.replace(/(?:\n +\/\*[^*]*\*+(?:[^\/][^*]*\*+)*\/)?\n *try *\{(?:\s*\/\/.*\n)* *var useSourceURL[\s\S]+?catch[^}]+}\n/, '');
-
-    // remove debug sourceURL use in `_.template`
-    source = source.replace(/(?:\s*\/\/.*\n)* *if *\(useSourceURL[^}]+}/, '');
-
-    // minify internal properties used by `_.sortBy`
-    (function() {
-      var properties = ['criteria', 'value'],
-          snippets = source.match(/( +)(?:function compareAscending|var sortBy)\b[\s\S]+?\n\1}/g);
-
-      if (!snippets) {
-        return;
-      }
-      snippets.forEach(function(snippet) {
-        var modified = snippet,
-            isSortBy = /var sortBy\b/.test(modified),
-            isInlined = !/\bcreateIterator\b/.test(modified);
-
-        // minify properties
-        properties.forEach(function(property, index) {
-          // add quotes around properties in the inlined `_.sortBy` of the mobile
-          // build so Closure Compiler won't mung them
-          if (isSortBy && isInlined) {
-            modified = modified
-              .replace(RegExp('\\.' + property + '\\b', 'g'), "['" + minNames[index] + "']")
-              .replace(RegExp('\\b' + property + ' *:', 'g'), "'" + minNames[index] + "':");
-          }
-          modified = modified.replace(RegExp('\\b' + property + '\\b', 'g'), minNames[index]);
-        });
-        // replace with modified snippet
-        source = source.replace(snippet, modified);
-      });
-    }());
-
-    // minify all compilable snippets
-    var snippets = source.match(
-      RegExp([
-        // match the `iteratorTemplate`
-        '( +)var iteratorTemplate\\b[\\s\\S]+?\\n\\1}',
-        // match methods created by `createIterator` calls
-        'createIterator\\((?:{|[a-zA-Z]+)[\\s\\S]+?\\);\\n',
-        // match variables storing `createIterator` options
-        '( +)var [a-zA-Z]+IteratorOptions\\b[\\s\\S]+?\\n\\2}',
-        // match the the `createIterator` function
-        '( +)function createIterator\\b[\\s\\S]+?\\n\\3}'
-      ].join('|'), 'g')
-    );
-
-    // exit early if no compilable snippets
-    if (!snippets) {
-      return source;
-    }
-
-    snippets.forEach(function(snippet, index) {
-      var isCreateIterator = /function createIterator\b/.test(snippet),
-          isIteratorTemplate = /var iteratorTemplate\b/.test(snippet),
-          modified = snippet;
-
-      // add brackets to whitelisted properties so Closure Compiler won't mung them
-      modified = modified.replace(RegExp('\\.(' + iteratorOptions.join('|') + ')\\b', 'g'), "['$1']");
-
-      if (isCreateIterator) {
-        // replace with modified snippet early and clip snippet to the `factory`
-        // call so other arguments aren't minified
-        source = source.replace(snippet, modified);
-        snippet = modified = modified.replace(/factory\([\s\S]+$/, '');
-      }
-
-      // minify snippet variables / arguments
-      compiledVars.forEach(function(variable, index) {
-        // ensure properties in compiled strings aren't minified
-        modified = modified.replace(RegExp('([^.]\\b)' + variable + '\\b(?!\' *[\\]:])', 'g'), '$1' + minNames[index]);
-
-        // correct `typeof x == 'object'`
-        if (variable == 'object') {
-          modified = modified.replace(RegExp("(typeof [^']+')" + minNames[index] + "'", 'g'), "$1object'");
-        }
-      });
-
-      // minify `createIterator` option property names
-      iteratorOptions.forEach(function(property, index) {
-        if (isIteratorTemplate) {
-          // minify property names as interpolated template variables
-          modified = modified.replace(RegExp('\\b' + property + '\\b', 'g'), minNames[index]);
-        }
-        else {
-          if (property == 'array' || property == 'object') {
-            // minify "array" and "object" sub property names
-            modified = modified.replace(RegExp("'" + property + "'( *[\\]:])", 'g'), "'" + minNames[index] + "'$1");
-          }
-          else {
-            // minify property name strings
-            modified = modified.replace(RegExp("'" + property + "'", 'g'), "'" + minNames[index] + "'");
-            // minify property names in regexps and accessors
-            if (isCreateIterator) {
-              modified = modified.replace(RegExp('([\\.|/])' + property + '\\b' , 'g'), '$1' + minNames[index]);
-            }
-          }
-        }
-      });
-
-      // replace with modified snippet
-      source = source.replace(snippet, modified);
-    });
-
-    return source;
-  }
-
-  /*--------------------------------------------------------------------------*/
-
-  // expose `preprocess`
-  if (module != require.main) {
-    module.exports = preprocess;
-  }
-  else {
-    // read the Lo-Dash source file from the first argument if the script
-    // was invoked directly (e.g. `node pre-compile.js source.js`) and write to
-    // the same file
-    (function() {
-      var source = fs.readFileSync(process.argv[2], 'utf8');
-      fs.writeFileSync(process.argv[2], preprocess(source), 'utf8');
-    }());
-  }
-}());

bunfig.toml

@@ -0,0 +1,2 @@
+[install.lockfile]
+print = "yarn"

doc/parse.php

@@ -1,35 +0,0 @@
-<?php
-
-  // cleanup requested filepath
-  $file = isset($_GET['f']) ? $_GET['f'] : 'lodash';
-  $file = preg_replace('#(\.*[\/])+#', '', $file);
-  $file .= preg_match('/\.[a-z]+$/', $file) ? '' : '.js';
-
-  // output filename
-  if (isset($_GET['o'])) {
-    $output = $_GET['o'];
-  } else if (isset($_SERVER['argv'][1])) {
-    $output = $_SERVER['argv'][1];
-  } else {
-    $output = basename($file);
-  }
-
-  /*--------------------------------------------------------------------------*/
-
-  require('../vendor/docdown/docdown.php');
-
-  // generate Markdown
-  $markdown = docdown(array(
-    'path' => '../' . $file,
-    'title' => 'Lo-Dash <sup>v0.4.2</sup>',
-    'url'  => 'https://github.com/bestiejs/lodash/blob/master/lodash.js'
-  ));
-
-  // save to a .md file
-  file_put_contents($output . '.md', $markdown);
-
-  // print
-  header('Content-Type: text/plain;charset=utf-8');
-  echo $markdown . PHP_EOL;
-
-?>

lodash.min.js

@@ -1,35 +0,0 @@
-/*!
- Lo-Dash 0.4.2 lodash.com/license
- Underscore.js 1.3.3 github.com/documentcloud/underscore/blob/master/LICENSE
-*/
-;(function(e,t){"use strict";function s(e){return new o(e)}function o(e){if(e&&e._wrapped)return e;this._wrapped=e}function u(e,t,n){t||(t=0);var r=e.length,i=r-t>=(n||30),s=i?{}:e;if(i)for(var o=t-1;++o<r;)n=e[o]+"",(Y.call(s,n)?s[n]:s[n]=[]).push(e[o]);return function(e){if(i){var n=e+"";return Y.call(s,n)&&-1<E(s[n],e)}return-1<E(s,e,t)}}function a(){for(var e,t,n,s=-1,o=arguments.length,u={e:"",f:"",j:"",p:"",c:{d:""},m:{d:""}};++s<o;)for(t in e=arguments[s],e)n=(n=e[t])==r?"":n,/d|i/.test(t)?
-("string"==typeof n&&(n={b:n,l:n}),u.c[t]=n.b,u.m[t]=n.l):u[t]=n;e=u.a,t=/^[^,]+/.exec(e)[0],u.g=t,u.h=mt,u.k=wt,u.o=J,u.q=u.q!==i,u.r=u.r!==i,"n"in u||(u.n=yt),u.f||(u.f="if(!"+t+")return D");if("g"!=t||!u.c.i)u.c=r;t="",u.r&&(t+="'use strict';"),t+="var n,p="+u.g+",D",u.j&&(t+="="+u.j),t+=";"+u.f+";"+u.p+";",u.c&&(t+="var s=p.length;n=-1;",u.m&&(t+="if(s===s>>>0){"),u.n&&(t+="if(J.call(p)==G){p=p.split('')}"),t+=u.c.d+";while(++n<s){"+u.c.i+"}",u.m&&(t+="}"));if(u.m){u.c&&(t+="else{"),u.h||(t+="var E=typeof p=='function'&&C.call(p,'prototype');"
-),u.k&&u.q?t+="var A=u(p),z=-1,s=A.length;"+u.m.d+";while(++z<s){n=A[z];if(!(E&&n=='prototype')){"+u.m.i+"}}":(t+=u.m.d+";for(n in p){",u.h?(u.q&&(t+="if(l.call(p,n)){"),t+=u.m.i+";",u.q&&(t+="}")):(t+="if(!(E&&n=='prototype')",u.q&&(t+="&&l.call(p,n)"),t+="){"+u.m.i+"}"),t+="}");if(u.h){t+="var i=p.constructor;";for(n=0;7>n;n++)t+="n='"+u.o[n]+"';if(","constructor"==u.o[n]&&(t+="!(i&&i.prototype===p)&&"),t+="l.call(p,n)){"+u.m.i+"}"}u.c&&(t+="}")}return t+=u.e+";return D",Function("c,d,h,j,l,m,r,x,u,C,F,G,J"
-,"return function("+e+"){"+t+"}")(ut,C,f,lt,Y,L,p,St,ot,et,tt,pt,nt)}function f(e,n){return e=e.a,n=n.a,e===t?1:n===t?-1:e<n?-1:e>n?1:0}function l(e,t){return Q[t]}function c(e){return"\\"+xt[e]}function h(e){return Et[e]}function p(e,t){return function(n,r,i){return e.call(t,n,r,i)}}function d(){}function v(e,t){if(I.test(t))return"<e%-"+t+"%>";var n=Q.length;return Q[n]="'+__e("+t+")+'",K+n}function m(e,t,n,r){return e=Q.length,t?Q[e]="';"+t+";__p+='":n?Q[e]="'+__e("+n+")+'":r&&(Q[e]="'+((__t=("+
-r+"))==null?'':__t)+'"),K+e}function g(e,t){if(I.test(t))return"<e%="+t+"%>";var n=Q.length;return Q[n]="'+((__t=("+t+"))==null?'':__t)+'",K+n}function y(e,t,n,r){if(!e)return n;var i=e.length,s=3>arguments.length;r&&(t=p(t,r));if(i===i>>>0){var o=yt&&nt.call(e)==pt?e.split(""):e;for(i&&s&&(n=o[--i]);i--;)n=t(n,o[i],i,e);return n}o=Zt(e);for((i=o.length)&&s&&(n=e[o[--i]]);i--;)s=o[i],n=t(n,e[s],s,e);return n}function b(e,t,n){if(e)return t==r||n?e[0]:tt.call(e,0,t)}function w(e,t){var n=[];if(!e)
-return n;for(var r,i=-1,s=e.length;++i<s;)r=e[i],Gt(r)?Z.apply(n,t?r:w(r)):n.push(r);return n}function E(e,t,n){if(!e)return-1;var r=-1,i=e.length;if(n){if("number"!=typeof n)return r=T(e,t),e[r]===t?r:-1;r=(0>n?Math.max(0,i+n):n)-1}for(;++r<i;)if(e[r]===t)return r;return-1}function S(e,t,n){var r=-Infinity,i=r;if(!e)return i;var s=-1,o=e.length;if(!t){for(;++s<o;)e[s]>i&&(i=e[s]);return i}for(n&&(t=p(t,n));++s<o;)n=t(e[s],s,e),n>r&&(r=n,i=e[s]);return i}function x(e,t,n){return e?tt.call(e,t==r||
-n?1:t):[]}function T(e,t,n,r){if(!e)return 0;var i=0,s=e.length;if(n){r&&(n=C(n,r));for(t=n(t);i<s;)r=i+s>>>1,n(e[r])<t?i=r+1:s=r}else for(;i<s;)r=i+s>>>1,e[r]<t?i=r+1:s=r;return i}function N(e,t,n,r){var s=[];if(!e)return s;var o=-1,u=e.length,a=[];"function"==typeof t&&(r=n,n=t,t=i);for(n?r&&(n=p(n,r)):n=L;++o<u;)if(r=n(e[o],o,e),t?!o||a[a.length-1]!==r:0>E(a,r))a.push(r),s.push(e[o]);return s}function C(e,t){function n(){var o=arguments,u=t;return i||(e=t[r]),s.length&&(o=o.length?G.apply(s,o)
-:s),this instanceof n?(d.prototype=e.prototype,u=new d,(o=e.apply(u,o))&&St[typeof o]?o:u):e.apply(u,o)}var r,i=nt.call(e)==lt;if(i){if(bt||rt&&2<arguments.length)return rt.call.apply(rt,arguments)}else r=t,t=e;var s=tt.call(arguments,2);return n}function k(e,t,s){s||(s=[]);if(e===t)return 0!==e||1/e==1/t;if(e==r||t==r)return e===t;e._chain&&(e=e._wrapped),t._chain&&(t=t._wrapped);if(e.isEqual&&nt.call(e.isEqual)==lt)return e.isEqual(t);if(t.isEqual&&nt.call(t.isEqual)==lt)return t.isEqual(e);var o=
-nt.call(e);if(o!=nt.call(t))return i;switch(o){case pt:return e==""+t;case ct:return e!=+e?t!=+t:0==e?1/e==1/t:e==+t;case at:case ft:return+e==+t;case ht:return e.source==t.source&&e.global==t.global&&e.multiline==t.multiline&&e.ignoreCase==t.ignoreCase}if("object"!=typeof e||"object"!=typeof t)return i;for(var u=s.length;u--;)if(s[u]==e)return n;var u=-1,a=n,f=0;s.push(e);if(o==ut){if(f=e.length,a=f==t.length)for(;f--&&(a=k(e[f],t[f],s)););}else{if("constructor"in e!="constructor"in t||e.constructor!=
-t.constructor)return i;for(var l in e)if(Y.call(e,l)&&(f++,!(a=Y.call(t,l)&&k(e[l],t[l],s))))break;if(a){for(l in t)if(Y.call(t,l)&&!(f--))break;a=!f}if(a&&mt)for(;7>++u&&(l=J[u],!Y.call(e,l)||!!(a=Y.call(t,l)&&k(e[l],t[l],s))););}return s.pop(),a}function L(e){return e}function A(e){Bt(Qt(e),function(t){var r=s[t]=e[t];o.prototype[t]=function(){var e=[this._wrapped];return arguments.length&&Z.apply(e,arguments),e=r.apply(s,e),this._chain&&(e=new o(e),e._chain=n),e}})}var n=!0,r=null,i=!1,O,M,_,D
-,P="object"==typeof exports&&exports&&("object"==typeof global&&global&&global==global.global&&(e=global),exports),H=Array.prototype,B=Object.prototype,j=0,F=e._,I=/[-+=!~*%&^<>|{(\/]|\[\D|\b(?:delete|in|instanceof|new|typeof|void)\b/,q=/\b__p\+='';/g,R=/\b(__p\+=)''\+/g,U=/(__e\(.*?\)|\b__t\))\+'';/g,z=/(?:__e|__t=)\(\s*(?![\d\s"']|this\.)/g,W=RegExp("^"+(B.valueOf+"").replace(/[.*+?^=!:${}()|[\]\/\\]/g,"\\$&").replace(/valueOf|for [^\]]+/g,".+?")+"$"),X=/__token__(\d+)/g,V=/[&<"']/g,$=/['\n\r\t\u2028\u2029\\]/g
-,J="constructor hasOwnProperty isPrototypeOf propertyIsEnumerable toLocaleString toString valueOf".split(" "),K="__token__",Q=[],G=H.concat,Y=B.hasOwnProperty,Z=H.push,et=B.propertyIsEnumerable,tt=H.slice,nt=B.toString,rt=W.test(rt=tt.bind)&&rt,it=W.test(it=Array.isArray)&&it,st=e.isFinite,ot=W.test(ot=Object.keys)&&ot,ut="[object Array]",at="[object Boolean]",ft="[object Date]",lt="[object Function]",ct="[object Number]",ht="[object RegExp]",pt="[object String]",dt=e.clearTimeout,vt=e.setTimeout
-,mt=!et.call({valueOf:0},"valueOf"),gt="x"!=tt.call("x")[0],yt="xx"!="x"[0]+Object("x")[0],bt=rt&&/\n|Opera/.test(rt+nt.call(e.opera)),wt=ot&&/^.+$|true/.test(ot+!!e.attachEvent),Et={"&":"&amp;","<":"&lt;",'"':"&quot;","'":"&#x27;"},St={"boolean":i,"function":n,object:n,number:i,string:i,"undefined":i},xt={"\\":"\\","'":"'","\n":"n","\r":"r","	":"t","\u2028":"u2028","\u2029":"u2029"};s.templateSettings={escape:/<%-([\s\S]+?)%>/g,evaluate:/<%([\s\S]+?)%>/g,interpolate:/<%=([\s\S]+?)%>/g,variable:"obj"
-};var Tt={a:"g,e,I",j:"g",p:"if(!e){e=m}else if(I)e=r(e,I)",i:"e(p[n],n,g)"},Nt={j:"true",i:"if(!e(p[n],n,g))return!D"},Ct={q:i,r:i,a:"w",j:"w",p:"for(var q=1,s=arguments.length;q<s;q++){p=arguments[q];"+(mt?"if(p){":""),i:"D[n]=p[n]",e:(mt?"}":"")+"}"},kt={j:"[]",i:"e(p[n],n,g)&&D.push(p[n])"},Lt={p:"if(I)e=r(e,I)"},At={i:{l:Tt.i}},Ot={j:"",f:"if(!g)return[]",d:{b:"D=Array(s)",l:"D="+(wt?"Array(s)":"[]")},i:{b:"D[n]=e(p[n],n,g)",l:"D"+(wt?"[z]=":".push")+"(e(p[n],n,g))"}},Mt=a({a:"w",f:"if(!(w&&x[typeof w]))throw TypeError()"
-,j:"[]",i:"D.push(n)"}),_t=a({a:"g,H",j:"false",n:i,d:{b:"if(J.call(p)==G)return g.indexOf(H)>-1"},i:"if(p[n]===H)return true"}),Dt=a(Tt,Nt),Pt=a(Tt,kt),Ht=a(Tt,Lt,{j:"",i:"if(e(p[n],n,g))return p[n]"}),Bt=a(Tt,Lt),jt=a(Tt,{j:"{}",p:"var y,o=typeof e=='function';if(o&&I)e=r(e,I)",i:"y=o?e(p[n],n,g):p[n][e];(l.call(D,y)?D[y]:D[y]=[]).push(p[n])"}),Ft=a(Ot,{a:"g,t",p:"var b=F.call(arguments,2),o=typeof t=='function'",i:{b:"D[n]=(o?t:p[n][t]).apply(p[n],b)",l:"D"+(wt?"[z]=":".push")+"((o?t:p[n][t]).apply(p[n],b))"
-}}),It=a(Tt,Ot),qt=a(Ot,{a:"g,B",i:{b:"D[n]=p[n][B]",l:"D"+(wt?"[z]=":".push")+"(p[n][B])"}}),Rt=a({a:"g,e,a,I",j:"a",p:"var v=arguments.length<3;if(I)e=r(e,I)",d:{b:"if(v)D=g[++n]"},i:{b:"D=e(D,p[n],n,g)",l:"D=v?(v=false,p[n]):e(D,p[n],n,g)"}}),Ut=a(Tt,kt,{i:"!"+kt.i}),zt=a(Tt,Nt,{j:"false",i:Nt.i.replace("!","")}),Wt=a(Tt,Ot,{p:"if(typeof e=='string'){var y=e;e=function(g){return g[y]}}else if(I)e=r(e,I)",i:{b:"D[n]={a:e(p[n],n,g),b:p[n]}",l:"D"+(wt?"[z]=":".push")+"({a:e(p[n],n,g),b:p[n]})"},e
-:"D.sort(h);s=D.length;while(s--){D[s]=D[s].b}"}),Xt=a({q:i,r:i,a:"w",j:"w",p:"var k=arguments,s=k.length;if(s>1){for(var n=1;n<s;n++)D[k[n]]=d(D[k[n]],D);return D}",i:"if(J.call(D[n])==j)D[n]=d(D[n],D)"}),Vt=a(Ct,{i:"if(D[n]==null)"+Ct.i}),$t=a(Ct),Jt=a(Tt,Lt,At,{q:i}),Kt=a(Tt,Lt,At),Qt=a({q:i,a:"w",j:"[]",i:"if(J.call(p[n])==j)D.push(n)",e:"D.sort()"});Bt({Arguments:"[object Arguments]",Date:ft,Function:lt,Number:ct,RegExp:ht,String:pt},function(e,t){s["is"+t]=function(t){return nt.call(t)==e}}
-),s.isArguments(arguments)||(s.isArguments=function(e){return!!e&&!!Y.call(e,"callee")});var Gt=it||function(e){return nt.call(e)==ut},Yt=a({a:"K",j:"true",p:"var f=J.call(K);if(f==c||f==G)return!K.length",i:{l:"return false"}}),Zt=ot?function(e){return"function"==typeof e&&et.call(e,"prototype")?Mt(e):ot(e)}:Mt,en=a({a:"w",j:"[]",i:"D.push(p[n])"});s.VERSION="0.4.2",s.after=function(e,t){return 1>e?t():function(){if(1>--e)return t.apply(this,arguments)}},s.bind=C,s.bindAll=Xt,s.chain=function(e)
-{return e=new o(e),e._chain=n,e},s.clone=function(e){return e&&St[typeof e]?Gt(e)?e.slice():$t({},e):e},s.compact=function(e){var t=[];if(!e)return t;for(var n=-1,r=e.length;++n<r;)e[n]&&t.push(e[n]);return t},s.compose=function(){var e=arguments;return function(){for(var t=arguments,n=e.length;n--;)t=[e[n].apply(this,t)];return t[0]}},s.contains=_t,s.debounce=function(e,t,n){function i(){a=r,n||e.apply(u,s)}var s,o,u,a;return function(){var r=n&&!a;return s=arguments,u=this,dt(a),a=vt(i,t),r&&(o=
-e.apply(u,s)),o}},s.defaults=Vt,s.defer=function(e){var n=tt.call(arguments,1);return vt(function(){return e.apply(t,n)},1)},s.delay=function(e,n){var r=tt.call(arguments,2);return vt(function(){return e.apply(t,r)},n)},s.difference=function(e){var t=[];if(!e)return t;for(var n=-1,r=e.length,i=G.apply(t,arguments),i=u(i,r);++n<r;)i(e[n])||t.push(e[n]);return t},s.escape=function(e){return e==r?"":(e+"").replace(V,h)},s.every=Dt,s.extend=$t,s.filter=Pt,s.find=Ht,s.first=b,s.flatten=w,s.forEach=Bt,
-s.forIn=Jt,s.forOwn=Kt,s.functions=Qt,s.groupBy=jt,s.has=function(e,t){return Y.call(e,t)},s.identity=L,s.indexOf=E,s.initial=function(e,t,n){return e?tt.call(e,0,-(t==r||n?1:t)):[]},s.intersection=function(e){var t=[];if(!e)return t;for(var n,r=-1,i=e.length,s=tt.call(arguments,1),o=[];++r<i;)n=e[r],0>E(t,n)&&Dt(s,function(e,t){return(o[t]||(o[t]=u(e)))(n)})&&t.push(n);return t},s.invoke=Ft,s.isArray=Gt,s.isBoolean=function(e){return e===n||e===i||nt.call(e)==at},s.isElement=function(e){return!!
-e&&1==e.nodeType},s.isEmpty=Yt,s.isEqual=k,s.isFinite=function(e){return st(e)&&nt.call(e)==ct},s.isNaN=function(e){return nt.call(e)==ct&&e!=+e},s.isNull=function(e){return e===r},s.isObject=function(e){return e&&St[typeof e]},s.isUndefined=function(e){return e===t},s.keys=Zt,s.last=function(e,t,n){if(e){var i=e.length;return t==r||n?e[i-1]:tt.call(e,-t||i)}},s.lastIndexOf=function(e,t,n){if(!e)return-1;var r=e.length;for(n&&"number"==typeof n&&(r=(0>n?Math.max(0,r+n):Math.min(n,r-1))+1);r--;)if(
-e[r]===t)return r;return-1},s.map=It,s.max=S,s.memoize=function(e,t){var n={};return function(){var r=t?t.apply(this,arguments):arguments[0];return Y.call(n,r)?n[r]:n[r]=e.apply(this,arguments)}},s.min=function(e,t,n){var r=Infinity,i=r;if(!e)return i;var s=-1,o=e.length;if(!t){for(;++s<o;)e[s]<i&&(i=e[s]);return i}for(n&&(t=p(t,n));++s<o;)n=t(e[s],s,e),n<r&&(r=n,i=e[s]);return i},s.mixin=A,s.noConflict=function(){return e._=F,this},s.once=function(e){var t,r=i;return function(){return r?t:(r=n,t=
-e.apply(this,arguments))}},s.partial=function(e){var t=tt.call(arguments,1),n=t.length;return function(){var r;return r=arguments,r.length&&(t.length=n,Z.apply(t,r)),r=1==t.length?e.call(this,t[0]):e.apply(this,t),t.length=n,r}},s.pick=function(e){for(var t,n=0,r=G.apply(H,arguments),i=r.length,s={};++n<i;)t=r[n],t in e&&(s[t]=e[t]);return s},s.pluck=qt,s.range=function(e,t,n){n||(n=1),t==r&&(t=e||0,e=0);for(var i=-1,t=Math.max(0,Math.ceil((t-e)/n)),s=Array(t);++i<t;)s[i]=e,e+=n;return s},s.reduce=
-Rt,s.reduceRight=y,s.reject=Ut,s.rest=x,s.result=function(e,t){if(!e)return r;var n=e[t];return nt.call(n)==lt?e[t]():n},s.shuffle=function(e){if(!e)return[];for(var t,n=-1,r=e.length,i=Array(r);++n<r;)t=Math.floor(Math.random()*(n+1)),i[n]=i[t],i[t]=e[n];return i},s.size=function(e){if(!e)return 0;var t=e.length;return t===t>>>0?e.length:Zt(e).length},s.some=zt,s.sortBy=Wt,s.sortedIndex=T,s.tap=function(e,t){return t(e),e},s.template=function(e,t,n){n||(n={});var i,o;i=n.escape;var u=n.evaluate,
-a=n.interpolate,f=s.templateSettings,n=n.variable;i==r&&(i=f.escape),u==r&&(u=f.evaluate),a==r&&(a=f.interpolate),i&&(e=e.replace(i,v)),a&&(e=e.replace(a,g)),u!=O&&(O=u,D=RegExp((u?u.source:"($^)")+"|<e%-([\\s\\S]+?)%>|<e%=([\\s\\S]+?)%>","g")),i=Q.length,e=e.replace(D,m),i=i!=Q.length,e="__p += '"+e.replace($,c).replace(X,l)+"';",Q.length=0,n||(n=f.variable||M||"obj",i?e="with("+n+"){"+e+"}":(n!=M&&(M=n,_=RegExp("(\\(\\s*)"+n+"\\."+n+"\\b","g")),e=e.replace(z,"$&"+n+".").replace(_,"$1__d"))),e=(
-i?e.replace(q,""):e).replace(R,"$1").replace(U,"$1;"),e="function("+n+"){"+n+"||("+n+"={});var __t,__p='',__e=_.escape"+(i?",__j=Array.prototype.join;function print(){__p+=__j.call(arguments,'')}":",__d="+n+"."+n+"||"+n+";")+e+"return __p}";try{o=Function("_","return "+e)(s)}catch(h){o=function(){throw h}}return t?o(t):(o.source=e,o)},s.throttle=function(e,t){function n(){a=new Date,u=r,e.apply(o,i)}var i,s,o,u,a=0;return function(){var r=new Date,f=t-(r-a);return i=arguments,o=this,0>=f?(a=r,s=e
-.apply(o,i)):u||(u=vt(n,f)),s}},s.times=function(e,t,n){var r=-1;if(n)for(;++r<e;)t.call(n,r);else for(;++r<e;)t(r)},s.toArray=function(e){if(!e)return[];if(e.toArray&&nt.call(e.toArray)==lt)return e.toArray();var t=e.length;return t===t>>>0?(gt?nt.call(e)==pt:"string"==typeof e)?e.split(""):tt.call(e):en(e)},s.union=function(){for(var e=-1,t=[],n=G.apply(t,arguments),r=n.length;++e<r;)0>E(t,n[e])&&t.push(n[e]);return t},s.uniq=N,s.uniqueId=function(e){var t=j++;return e?e+t:t},s.values=en,s.without=
-function(e){var t=[];if(!e)return t;for(var n=-1,r=e.length,i=u(arguments,1,20);++n<r;)i(e[n])||t.push(e[n]);return t},s.wrap=function(e,t){return function(){var n=[e];return arguments.length&&Z.apply(n,arguments),t.apply(this,n)}},s.zip=function(e){if(!e)return[];for(var t=-1,n=S(qt(arguments,"length")),r=Array(n);++t<n;)r[t]=qt(arguments,t);return r},s.zipObject=function(e,t){if(!e)return{};var n=-1,r=e.length,i={};for(t||(t=[]);++n<r;)i[e[n]]=t[n];return i},s.all=Dt,s.any=zt,s.collect=It,s.detect=
-Ht,s.each=Bt,s.foldl=Rt,s.foldr=y,s.head=b,s.include=_t,s.inject=Rt,s.methods=Qt,s.select=Pt,s.tail=x,s.take=b,s.unique=N,o.prototype=s.prototype,A(s),o.prototype.chain=function(){return this._chain=n,this},o.prototype.value=function(){return this._wrapped},Bt("pop push reverse shift sort splice unshift".split(" "),function(e){var t=H[e];o.prototype[e]=function(){var e=this._wrapped;return t.apply(e,arguments),e.length===0&&delete e[0],this._chain&&(e=new o(e),e._chain=n),e}}),Bt(["concat","join"
-,"slice"],function(e){var t=H[e];o.prototype[e]=function(){var e=t.apply(this._wrapped,arguments);return this._chain&&(e=new o(e),e._chain=n),e}}),typeof define=="function"&&typeof define.amd=="object"&&define.amd?(e._=s,define(function(){return s})):P?"object"==typeof module&&module&&module.s==P?(module.s=s)._=s:P._=s:e._=s})(this);

package.json

@@ -1,49 +1,50 @@
 {
   "name": "lodash",
-  "version": "0.4.2",
-  "description": "A drop-in replacement for Underscore.js that delivers performance improvements, bug fixes, and additional features.",
-  "homepage": "http://lodash.com",
-  "main": "lodash",
-  "keywords": [
-    "browser",
-    "client",
-    "functional",
-    "performance",
-    "server",
-    "speed",
-    "util"
-  ],
-  "licenses": [
-    {
-      "type": "MIT",
-      "url": "http://lodash.com/license"
-    }
-  ],
-  "author": {
-    "name": "John-David Dalton",
-    "email": "john@fusejs.com",
-    "web": "http://allyoucanleet.com/"
-  },
-  "bugs": {
-    "url": "https://github.com/bestiejs/lodash/issues"
-  },
-  "repository": {
-    "type": "git",
-    "url": "https://github.com/bestiejs/lodash.git"
-  },
-  "bin": {
-    "lodash": "./build.js"
-  },
-  "directories": {
-    "doc": "./doc",
-    "test": "./test"
-  },
-  "engines": [
-    "node",
-    "rhino"
-  ],
+  "version": "5.0.0",
+  "license": "MIT",
+  "private": true,
+  "main": "dist/lodash.js",
+  "sideEffects": false,
   "scripts": {
-    "build": "node build",
-    "test": "node test/test"
-  }
+    "prepare": "husky install",
+    "lint": "eslint ./src/**/*.ts"
+  },
+  "devDependencies": {
+    "@commitlint/cli": "17.7.1",
+    "@commitlint/config-conventional": "17.7.0",
+    "@types/eslint": "8.44.2",
+    "@types/jest": "29.5.5",
+    "@typescript-eslint/eslint-plugin": "6.7.0",
+    "@typescript-eslint/parser": "6.7.0",
+    "eslint": "8.49.0",
+    "eslint-config-airbnb-base": "15.0.0",
+    "eslint-config-airbnb-typescript": "17.1.0",
+    "eslint-config-prettier": "9.0.0",
+    "eslint-plugin-import": "2.28.1",
+    "eslint-plugin-prettier": "5.0.0",
+    "husky": "8.0.3",
+    "lint-staged": "14.0.1",
+    "lodash": "4.17.21",
+    "prettier": "3.0.3"
+  },
+  "lint-staged": {
+    "src/**/*.{ts}": [
+      "eslint --fix"
+    ]
+  },
+  "husky": {
+    "hooks": {
+      "pre-commit": "lint-staged",
+      "commit-msg": "bun run commitlint --edit $1"
+    }
+  },
+  "engines": {
+    "node": "^18.17.1",
+    "yarn": "^1.22.19"
+  },
+  "volta": {
+    "node": "18.17.1",
+    "yarn": "1.22.19"
+  },
+  "engineStrict": true
 }

perf/index.html

@@ -1,57 +0,0 @@
-<!doctype html>
-<html lang="en">
-	<head>
-		<meta charset="utf-8">
-		<title>Lo-Dash Performance Suite</title>
-		<style>
-			html, body {
-				margin: 0;
-				padding: 0;
-				height: 100%;
-			}
-			applet {
-				position: absolute;
-				left: -9999em;
-			}
-		</style>
-	</head>
-	<body>
-		<script src="../lodash.min.js"></script>
-		<script>
-			var lodash = _.noConflict();
-		</script>
-		<script src="../vendor/underscore/underscore.js"></script>
-		<script src="../vendor/platform.js/platform.js"></script>
-		<script src="../vendor/benchmark.js/benchmark.js"></script>
-		<script src="../vendor/firebug-lite/src/firebug-lite-debug.js"></script>
-		<script src="perf.js"></script>
-		<script>
-			(function() {
-				var useApplet = !/[?&]nojava=true(?:&|$)/.test(location.search);
-
-				function init() {
-					var fbUI = document.getElementById('FirebugUI'),
-					    fbDoc = fbUI && (fbDoc = fbUI.contentWindow || fbUI.contentDocument).document || fbDoc,
-					    fbCommandLine = fbDoc && fbDoc.getElementById('fbCommandLine');
-
-					if (!fbCommandLine) {
-						return setTimeout(init, 15);
-					}
-					fbUI.style.height = fbDoc.body.style.height = fbDoc.documentElement.style.height = '100%';
-
-					// give applet time to initialize
-					lodash.delay(run, useApplet ? 500 : 15);
-				}
-
-				if (useApplet) {
-					// using innerHTML avoids an alert in some versions of IE6
-					var div = document.createElement('div');
-					div.innerHTML = '<applet code=nano archive="../vendor/benchmark.js/nano.jar">';
-					document.body.insertBefore(div.lastChild, document.body.firstChild);
-				}
-
-				window.onload = init;
-			}());
-		</script>
-	</body>
-</html>

perf/run-perf.sh

@@ -1,9 +0,0 @@
-cd "$(dirname "$0")"
-for cmd in node narwhal ringo rhino; do
-	echo ""
-	echo "Running performance suite in $cmd..."
-	$cmd perf.js
-done
-echo ""
-echo "Running performance suite in a browser..."
-open index.html

src/.eslintrc.cjs

@@ -0,0 +1,18 @@
+'use strict';
+
+const path = require('node:path');
+
+module.exports = {
+    overrides: [
+        {
+            files: ['**/*.{ts}'],
+            rules: {
+                'import/no-extraneous-dependencies': [
+                    'error',
+                    // Use package.json from both this package folder and root.
+                    { packageDir: [__dirname, path.join(__dirname, '../')] },
+                ],
+            },
+        },
+    ],
+};

src/.internal/Hash.ts

@@ -0,0 +1,88 @@
+/** Used to stand-in for `undefined` hash values. */
+const HASH_UNDEFINED = '__lodash_hash_undefined__'
+
+class Hash {
+
+  /**
+   * Creates a hash object.
+   *
+   * @private
+   * @constructor
+   * @param {Array} [entries] The key-value pairs to cache.
+   */
+  constructor(entries) {
+    let index = -1
+    const length = entries == null ? 0 : entries.length
+
+    this.clear()
+    while (++index < length) {
+      const entry = entries[index]
+      this.set(entry[0], entry[1])
+    }
+  }
+
+  /**
+   * Removes all key-value entries from the hash.
+   *
+   * @memberOf Hash
+   */
+  clear() {
+    this.__data__ = Object.create(null)
+    this.size = 0
+  }
+
+  /**
+   * Removes `key` and its value from the hash.
+   *
+   * @memberOf Hash
+   * @param {string} key The key of the value to remove.
+   * @returns {boolean} Returns `true` if the entry was removed, else `false`.
+   */
+  delete(key) {
+    const result = this.has(key) && delete this.__data__[key]
+    this.size -= result ? 1 : 0
+    return result
+  }
+
+  /**
+   * Gets the hash value for `key`.
+   *
+   * @memberOf Hash
+   * @param {string} key The key of the value to get.
+   * @returns {*} Returns the entry value.
+   */
+  get(key) {
+    const data = this.__data__
+    const result = data[key]
+    return result === HASH_UNDEFINED ? undefined : result
+  }
+
+  /**
+   * Checks if a hash value for `key` exists.
+   *
+   * @memberOf Hash
+   * @param {string} key The key of the entry to check.
+   * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+   */
+  has(key) {
+    const data = this.__data__
+    return data[key] !== undefined
+  }
+
+  /**
+   * Sets the hash `key` to `value`.
+   *
+   * @memberOf Hash
+   * @param {string} key The key of the value to set.
+   * @param {*} value The value to set.
+   * @returns {Object} Returns the hash instance.
+   */
+  set(key, value) {
+    const data = this.__data__
+    this.size += this.has(key) ? 0 : 1
+    data[key] = value === undefined ? HASH_UNDEFINED : value
+    return this
+  }
+}
+
+export default Hash

src/.internal/ListCache.ts

@@ -0,0 +1,103 @@
+import assocIndexOf from './assocIndexOf.js'
+
+class ListCache {
+
+  /**
+   * Creates an list cache object.
+   *
+   * @private
+   * @constructor
+   * @param {Array} [entries] The key-value pairs to cache.
+   */
+  constructor(entries) {
+    let index = -1
+    const length = entries == null ? 0 : entries.length
+
+    this.clear()
+    while (++index < length) {
+      const entry = entries[index]
+      this.set(entry[0], entry[1])
+    }
+  }
+
+  /**
+   * Removes all key-value entries from the list cache.
+   *
+   * @memberOf ListCache
+   */
+  clear() {
+    this.__data__ = []
+    this.size = 0
+  }
+
+  /**
+   * Removes `key` and its value from the list cache.
+   *
+   * @memberOf ListCache
+   * @param {string} key The key of the value to remove.
+   * @returns {boolean} Returns `true` if the entry was removed, else `false`.
+   */
+  delete(key) {
+    const data = this.__data__
+    const index = assocIndexOf(data, key)
+
+    if (index < 0) {
+      return false
+    }
+    const lastIndex = data.length - 1
+    if (index === lastIndex) {
+      data.pop()
+    } else {
+      data.splice(index, 1)
+    }
+    --this.size
+    return true
+  }
+
+  /**
+   * Gets the list cache value for `key`.
+   *
+   * @memberOf ListCache
+   * @param {string} key The key of the value to get.
+   * @returns {*} Returns the entry value.
+   */
+  get(key) {
+    const data = this.__data__
+    const index = assocIndexOf(data, key)
+    return index < 0 ? undefined : data[index][1]
+  }
+
+  /**
+   * Checks if a list cache value for `key` exists.
+   *
+   * @memberOf ListCache
+   * @param {string} key The key of the entry to check.
+   * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+   */
+  has(key) {
+    return assocIndexOf(this.__data__, key) > -1
+  }
+
+  /**
+   * Sets the list cache `key` to `value`.
+   *
+   * @memberOf ListCache
+   * @param {string} key The key of the value to set.
+   * @param {*} value The value to set.
+   * @returns {Object} Returns the list cache instance.
+   */
+  set(key, value) {
+    const data = this.__data__
+    const index = assocIndexOf(data, key)
+
+    if (index < 0) {
+      ++this.size
+      data.push([key, value])
+    } else {
+      data[index][1] = value
+    }
+    return this
+  }
+}
+
+export default ListCache

src/.internal/MapCache.ts

@@ -0,0 +1,120 @@
+
+import Hash from './Hash.js'
+
+/**
+ * Gets the data for `map`.
+ *
+ * @private
+ * @param {Object} map The map to query.
+ * @param {string} key The reference key.
+ * @returns {*} Returns the map data.
+ */
+function getMapData({ __data__ }, key) {
+  const data = __data__
+  return isKeyable(key)
+    ? data[typeof key === 'string' ? 'string' : 'hash']
+    : data.map
+}
+
+/**
+ * Checks if `value` is suitable for use as unique object key.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is suitable, else `false`.
+ */
+function isKeyable(value) {
+  const type = typeof value
+  return (type === 'string' || type === 'number' || type === 'symbol' || type === 'boolean')
+    ? (value !== '__proto__')
+    : (value === null)
+}
+
+class MapCache {
+
+  /**
+   * Creates a map cache object to store key-value pairs.
+   *
+   * @private
+   * @constructor
+   * @param {Array} [entries] The key-value pairs to cache.
+   */
+  constructor(entries) {
+    let index = -1
+    const length = entries == null ? 0 : entries.length
+
+    this.clear()
+    while (++index < length) {
+      const entry = entries[index]
+      this.set(entry[0], entry[1])
+    }
+  }
+
+  /**
+   * Removes all key-value entries from the map.
+   *
+   * @memberOf MapCache
+   */
+  clear() {
+    this.size = 0
+    this.__data__ = {
+      'hash': new Hash,
+      'map': new Map,
+      'string': new Hash
+    }
+  }
+
+  /**
+   * Removes `key` and its value from the map.
+   *
+   * @memberOf MapCache
+   * @param {string} key The key of the value to remove.
+   * @returns {boolean} Returns `true` if the entry was removed, else `false`.
+   */
+  delete(key) {
+    const result = getMapData(this, key)['delete'](key)
+    this.size -= result ? 1 : 0
+    return result
+  }
+
+  /**
+   * Gets the map value for `key`.
+   *
+   * @memberOf MapCache
+   * @param {string} key The key of the value to get.
+   * @returns {*} Returns the entry value.
+   */
+  get(key) {
+    return getMapData(this, key).get(key)
+  }
+
+  /**
+   * Checks if a map value for `key` exists.
+   *
+   * @memberOf MapCache
+   * @param {string} key The key of the entry to check.
+   * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+   */
+  has(key) {
+    return getMapData(this, key).has(key)
+  }
+
+  /**
+   * Sets the map `key` to `value`.
+   *
+   * @memberOf MapCache
+   * @param {string} key The key of the value to set.
+   * @param {*} value The value to set.
+   * @returns {Object} Returns the map cache instance.
+   */
+  set(key, value) {
+    const data = getMapData(this, key)
+    const size = data.size
+
+    data.set(key, value)
+    this.size += data.size === size ? 0 : 1
+    return this
+  }
+}
+
+export default MapCache

src/.internal/SetCache.ts

@@ -0,0 +1,52 @@
+import MapCache from './MapCache.js'
+
+/** Used to stand-in for `undefined` hash values. */
+const HASH_UNDEFINED = '__lodash_hash_undefined__'
+
+class SetCache {
+
+  /**
+   * Creates an array cache object to store unique values.
+   *
+   * @private
+   * @constructor
+   * @param {Array} [values] The values to cache.
+   */
+  constructor(values) {
+    let index = -1
+    const length = values == null ? 0 : values.length
+
+    this.__data__ = new MapCache
+    while (++index < length) {
+      this.add(values[index])
+    }
+  }
+
+  /**
+   * Adds `value` to the array cache.
+   *
+   * @memberOf SetCache
+   * @alias push
+   * @param {*} value The value to cache.
+   * @returns {Object} Returns the cache instance.
+   */
+  add(value) {
+    this.__data__.set(value, HASH_UNDEFINED)
+    return this
+  }
+
+  /**
+   * Checks if `value` is in the array cache.
+   *
+   * @memberOf SetCache
+   * @param {*} value The value to search for.
+   * @returns {boolean} Returns `true` if `value` is found, else `false`.
+   */
+  has(value) {
+    return this.__data__.has(value)
+  }
+}
+
+SetCache.prototype.push = SetCache.prototype.add
+
+export default SetCache

src/.internal/Stack.ts

@@ -0,0 +1,93 @@
+import ListCache from './ListCache.js'
+import MapCache from './MapCache.js'
+
+/** Used as the size to enable large array optimizations. */
+const LARGE_ARRAY_SIZE = 200
+
+class Stack {
+
+  /**
+   * Creates a stack cache object to store key-value pairs.
+   *
+   * @private
+   * @constructor
+   * @param {Array} [entries] The key-value pairs to cache.
+   */
+  constructor(entries) {
+    const data = this.__data__ = new ListCache(entries)
+    this.size = data.size
+  }
+
+  /**
+   * Removes all key-value entries from the stack.
+   *
+   * @memberOf Stack
+   */
+  clear() {
+    this.__data__ = new ListCache
+    this.size = 0
+  }
+
+  /**
+   * Removes `key` and its value from the stack.
+   *
+   * @memberOf Stack
+   * @param {string} key The key of the value to remove.
+   * @returns {boolean} Returns `true` if the entry was removed, else `false`.
+   */
+  delete(key) {
+    const data = this.__data__
+    const result = data['delete'](key)
+
+    this.size = data.size
+    return result
+  }
+
+  /**
+   * Gets the stack value for `key`.
+   *
+   * @memberOf Stack
+   * @param {string} key The key of the value to get.
+   * @returns {*} Returns the entry value.
+   */
+  get(key) {
+    return this.__data__.get(key)
+  }
+
+  /**
+   * Checks if a stack value for `key` exists.
+   *
+   * @memberOf Stack
+   * @param {string} key The key of the entry to check.
+   * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+   */
+  has(key) {
+    return this.__data__.has(key)
+  }
+
+  /**
+   * Sets the stack `key` to `value`.
+   *
+   * @memberOf Stack
+   * @param {string} key The key of the value to set.
+   * @param {*} value The value to set.
+   * @returns {Object} Returns the stack cache instance.
+   */
+  set(key, value) {
+    let data = this.__data__
+    if (data instanceof ListCache) {
+      const pairs = data.__data__
+      if (pairs.length < LARGE_ARRAY_SIZE - 1) {
+        pairs.push([key, value])
+        this.size = ++data.size
+        return this
+      }
+      data = this.__data__ = new MapCache(pairs)
+    }
+    data.set(key, value)
+    this.size = data.size
+    return this
+  }
+}
+
+export default Stack

src/.internal/addMapEntry.ts

@@ -0,0 +1,15 @@
+/**
+ * Adds the key-value `pair` to `map`.
+ *
+ * @private
+ * @param {Object} map The map to modify.
+ * @param {Array} pair The key-value pair to add.
+ * @returns {Object} Returns `map`.
+ */
+function addMapEntry(map, pair) {
+  // Don't return `map.set` because it's not chainable in IE 11.
+  map.set(pair[0], pair[1])
+  return map
+}
+
+export default addMapEntry

src/.internal/addSetEntry.ts

@@ -0,0 +1,15 @@
+/**
+ * Adds `value` to `set`.
+ *
+ * @private
+ * @param {Object} set The set to modify.
+ * @param {*} value The value to add.
+ * @returns {Object} Returns `set`.
+ */
+function addSetEntry(set, value) {
+  // Don't return `set.add` because it's not chainable in IE 11.
+  set.add(value)
+  return set
+}
+
+export default addSetEntry

src/.internal/arrayEach.ts

@@ -0,0 +1,21 @@
+/**
+ * A specialized version of `forEach` for arrays.
+ *
+ * @private
+ * @param {Array} [array] The array to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @returns {Array} Returns `array`.
+ */
+function arrayEach(array, iteratee) {
+  let index = -1
+  const length = array.length
+
+  while (++index < length) {
+    if (iteratee(array[index], index, array) === false) {
+      break
+    }
+  }
+  return array
+}
+
+export default arrayEach

src/.internal/arrayEachRight.ts

@@ -0,0 +1,20 @@
+/**
+ * A specialized version of `forEachRight` for arrays.
+ *
+ * @private
+ * @param {Array} [array] The array to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @returns {Array} Returns `array`.
+ */
+function arrayEachRight(array, iteratee) {
+  let length = array == null ? 0 : array.length
+
+  while (length--) {
+    if (iteratee(array[length], length, array) === false) {
+      break
+    }
+  }
+  return array
+}
+
+export default arrayEachRight

src/.internal/arrayIncludes.ts

@@ -0,0 +1,17 @@
+import baseIndexOf from './baseIndexOf.js'
+
+/**
+ * A specialized version of `includes` for arrays without support for
+ * specifying an index to search from.
+ *
+ * @private
+ * @param {Array} [array] The array to inspect.
+ * @param {*} target The value to search for.
+ * @returns {boolean} Returns `true` if `target` is found, else `false`.
+ */
+function arrayIncludes(array, value) {
+  const length = array == null ? 0 : array.length
+  return !!length && baseIndexOf(array, value, 0) > -1
+}
+
+export default arrayIncludes

src/.internal/arrayIncludesWith.ts

@@ -0,0 +1,23 @@
+/**
+ * This function is like `arrayIncludes` except that it accepts a comparator.
+ *
+ * @private
+ * @param {Array} [array] The array to inspect.
+ * @param {*} target The value to search for.
+ * @param {Function} comparator The comparator invoked per element.
+ * @returns {boolean} Returns `true` if `target` is found, else `false`.
+ */
+function arrayIncludesWith(array, target, comparator) {
+  if (array == null) {
+    return false
+  }
+
+  for (const value of array) {
+    if (comparator(target, value)) {
+      return true
+    }
+  }
+  return false
+}
+
+export default arrayIncludesWith

src/.internal/arrayLikeKeys.ts

@@ -0,0 +1,43 @@
+import isArguments from '../isArguments.js'
+import isBuffer from '../isBuffer.js'
+import isIndex from './isIndex.js'
+import isTypedArray from '../isTypedArray.js'
+
+/** Used to check objects for own properties. */
+const hasOwnProperty = Object.prototype.hasOwnProperty
+
+/**
+ * Creates an array of the enumerable property names of the array-like `value`.
+ *
+ * @private
+ * @param {*} value The value to query.
+ * @param {boolean} inherited Specify returning inherited property names.
+ * @returns {Array} Returns the array of property names.
+ */
+function arrayLikeKeys(value, inherited) {
+  const isArr = Array.isArray(value)
+  const isArg = !isArr && isArguments(value)
+  const isBuff = !isArr && !isArg && isBuffer(value)
+  const isType = !isArr && !isArg && !isBuff && isTypedArray(value)
+  const skipIndexes = isArr || isArg || isBuff || isType
+  const length = value.length
+  const result = new Array(skipIndexes ? length : 0)
+  let index = skipIndexes ? -1 : length
+  while (++index < length) {
+    result[index] = `${index}`
+  }
+  for (const key in value) {
+    if ((inherited || hasOwnProperty.call(value, key)) &&
+        !(skipIndexes && (
+        // Safari 9 has enumerable `arguments.length` in strict mode.
+          (key === 'length' ||
+           // Skip index properties.
+           isIndex(key, length))
+        ))) {
+      result.push(key)
+    }
+  }
+  return result
+}
+
+export default arrayLikeKeys

src/.internal/arrayReduce.ts

@@ -0,0 +1,25 @@
+/**
+ * A specialized version of `reduce` for arrays.
+ *
+ * @private
+ * @param {Array} [array] The array to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @param {*} [accumulator] The initial value.
+ * @param {boolean} [initAccum] Specify using the first element of `array` as
+ *  the initial value.
+ * @returns {*} Returns the accumulated value.
+ */
+function arrayReduce(array, iteratee, accumulator, initAccum) {
+  let index = -1
+  const length = array == null ? 0 : array.length
+
+  if (initAccum && length) {
+    accumulator = array[++index]
+  }
+  while (++index < length) {
+    accumulator = iteratee(accumulator, array[index], index, array)
+  }
+  return accumulator
+}
+
+export default arrayReduce

src/.internal/arrayReduceRight.ts

@@ -0,0 +1,23 @@
+/**
+ * A specialized version of `reduceRight` for arrays.
+ *
+ * @private
+ * @param {Array} [array] The array to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @param {*} [accumulator] The initial value.
+ * @param {boolean} [initAccum] Specify using the last element of `array` as
+ *  the initial value.
+ * @returns {*} Returns the accumulated value.
+ */
+function arrayReduceRight(array, iteratee, accumulator, initAccum) {
+  let length = array == null ? 0 : array.length
+  if (initAccum && length) {
+    accumulator = array[--length]
+  }
+  while (length--) {
+    accumulator = iteratee(accumulator, array[length], length, array)
+  }
+  return accumulator
+}
+
+export default arrayReduceRight

src/.internal/asciiSize.ts

@@ -0,0 +1,12 @@
+/**
+ * Gets the size of an ASCII `string`.
+ *
+ * @private
+ * @param {string} string The string inspect.
+ * @returns {number} Returns the string size.
+ */
+function asciiSize({ length }) {
+  return length
+}
+
+export default asciiSize

src/.internal/asciiToArray.ts

@@ -0,0 +1,12 @@
+/**
+ * Converts an ASCII `string` to an array.
+ *
+ * @private
+ * @param {string} string The string to convert.
+ * @returns {Array} Returns the converted array.
+ */
+function asciiToArray(string) {
+  return string.split('')
+}
+
+export default asciiToArray

src/.internal/assignMergeValue.ts

@@ -0,0 +1,20 @@
+import baseAssignValue from './baseAssignValue.js'
+import eq from '../eq.js'
+
+/**
+ * This function is like `assignValue` except that it doesn't assign
+ * `undefined` values.
+ *
+ * @private
+ * @param {Object} object The object to modify.
+ * @param {string} key The key of the property to assign.
+ * @param {*} value The value to assign.
+ */
+function assignMergeValue(object, key, value) {
+  if ((value !== undefined && !eq(object[key], value)) ||
+      (value === undefined && !(key in object))) {
+    baseAssignValue(object, key, value)
+  }
+}
+
+export default assignMergeValue

src/.internal/assignValue.ts

@@ -0,0 +1,27 @@
+import baseAssignValue from './baseAssignValue.js'
+import eq from '../eq.js'
+
+/** Used to check objects for own properties. */
+const hasOwnProperty = Object.prototype.hasOwnProperty
+
+/**
+ * Assigns `value` to `key` of `object` if the existing value is not equivalent.
+ *
+ * @private
+ * @param {Object} object The object to modify.
+ * @param {string} key The key of the property to assign.
+ * @param {*} value The value to assign.
+ */
+function assignValue(object, key, value) {
+  const objValue = object[key]
+
+  if (!(hasOwnProperty.call(object, key) && eq(objValue, value))) {
+    if (value !== 0 || (1 / value) === (1 / objValue)) {
+      baseAssignValue(object, key, value)
+    }
+  } else if (value === undefined && !(key in object)) {
+    baseAssignValue(object, key, value)
+  }
+}
+
+export default assignValue

src/.internal/assocIndexOf.ts

@@ -0,0 +1,21 @@
+import eq from '../eq.js'
+
+/**
+ * Gets the index at which the `key` is found in `array` of key-value pairs.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {*} key The key to search for.
+ * @returns {number} Returns the index of the matched value, else `-1`.
+ */
+function assocIndexOf(array, key) {
+  let { length } = array
+  while (length--) {
+    if (eq(array[length][0], key)) {
+      return length
+    }
+  }
+  return -1
+}
+
+export default assocIndexOf

src/.internal/baseAssignValue.ts

@@ -0,0 +1,23 @@
+/**
+ * The base implementation of `assignValue` and `assignMergeValue` without
+ * value checks.
+ *
+ * @private
+ * @param {Object} object The object to modify.
+ * @param {string} key The key of the property to assign.
+ * @param {*} value The value to assign.
+ */
+function baseAssignValue(object, key, value) {
+  if (key === '__proto__') {
+    Object.defineProperty(object, key, {
+      'configurable': true,
+      'enumerable': true,
+      'value': value,
+      'writable': true
+    })
+  } else {
+    object[key] = value
+  }
+}
+
+export default baseAssignValue

src/.internal/baseAt.ts

@@ -0,0 +1,23 @@
+import get from '../get.js'
+
+/**
+ * The base implementation of `at` without support for individual paths.
+ *
+ * @private
+ * @param {Object} object The object to iterate over.
+ * @param {string[]} paths The property paths to pick.
+ * @returns {Array} Returns the picked elements.
+ */
+function baseAt(object, paths) {
+  let index = -1
+  const length = paths.length
+  const result = new Array(length)
+  const skip = object == null
+
+  while (++index < length) {
+    result[index] = skip ? undefined : get(object, paths[index])
+  }
+  return result
+}
+
+export default baseAt

src/.internal/baseClone.ts

@@ -0,0 +1,241 @@
+import Stack from './Stack.js'
+import arrayEach from './arrayEach.js'
+import assignValue from './assignValue.js'
+import cloneBuffer from './cloneBuffer.js'
+import copyArray from './copyArray.js'
+import copyObject from './copyObject.js'
+import cloneArrayBuffer from './cloneArrayBuffer.js'
+import cloneDataView from './cloneDataView.js'
+import cloneRegExp from './cloneRegExp.js'
+import cloneSymbol from './cloneSymbol.js'
+import cloneTypedArray from './cloneTypedArray.js'
+import copySymbols from './copySymbols.js'
+import copySymbolsIn from './copySymbolsIn.js'
+import getAllKeys from './getAllKeys.js'
+import getAllKeysIn from './getAllKeysIn.js'
+import getTag from './getTag.js'
+import initCloneObject from './initCloneObject.js'
+import isBuffer from '../isBuffer.js'
+import isObject from '../isObject.js'
+import isTypedArray from '../isTypedArray.js'
+import keys from '../keys.js'
+import keysIn from '../keysIn.js'
+
+/** Used to compose bitmasks for cloning. */
+const CLONE_DEEP_FLAG = 1
+const CLONE_FLAT_FLAG = 2
+const CLONE_SYMBOLS_FLAG = 4
+
+/** `Object#toString` result references. */
+const argsTag = '[object Arguments]'
+const arrayTag = '[object Array]'
+const boolTag = '[object Boolean]'
+const dateTag = '[object Date]'
+const errorTag = '[object Error]'
+const mapTag = '[object Map]'
+const numberTag = '[object Number]'
+const objectTag = '[object Object]'
+const regexpTag = '[object RegExp]'
+const setTag = '[object Set]'
+const stringTag = '[object String]'
+const symbolTag = '[object Symbol]'
+const weakMapTag = '[object WeakMap]'
+
+const arrayBufferTag = '[object ArrayBuffer]'
+const dataViewTag = '[object DataView]'
+const float32Tag = '[object Float32Array]'
+const float64Tag = '[object Float64Array]'
+const int8Tag = '[object Int8Array]'
+const int16Tag = '[object Int16Array]'
+const int32Tag = '[object Int32Array]'
+const uint8Tag = '[object Uint8Array]'
+const uint8ClampedTag = '[object Uint8ClampedArray]'
+const uint16Tag = '[object Uint16Array]'
+const uint32Tag = '[object Uint32Array]'
+
+/** Used to identify `toStringTag` values supported by `clone`. */
+const cloneableTags = {}
+cloneableTags[argsTag] = cloneableTags[arrayTag] =
+cloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =
+cloneableTags[boolTag] = cloneableTags[dateTag] =
+cloneableTags[float32Tag] = cloneableTags[float64Tag] =
+cloneableTags[int8Tag] = cloneableTags[int16Tag] =
+cloneableTags[int32Tag] = cloneableTags[mapTag] =
+cloneableTags[numberTag] = cloneableTags[objectTag] =
+cloneableTags[regexpTag] = cloneableTags[setTag] =
+cloneableTags[stringTag] = cloneableTags[symbolTag] =
+cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =
+cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true
+cloneableTags[errorTag] = cloneableTags[weakMapTag] = false
+
+/** Used to check objects for own properties. */
+const hasOwnProperty = Object.prototype.hasOwnProperty
+
+/**
+ * Initializes an object clone based on its `toStringTag`.
+ *
+ * **Note:** This function only supports cloning values with tags of
+ * `Boolean`, `Date`, `Error`, `Map`, `Number`, `RegExp`, `Set`, or `String`.
+ *
+ * @private
+ * @param {Object} object The object to clone.
+ * @param {string} tag The `toStringTag` of the object to clone.
+ * @param {boolean} [isDeep] Specify a deep clone.
+ * @returns {Object} Returns the initialized clone.
+ */
+function initCloneByTag(object, tag, isDeep) {
+  const Ctor = object.constructor
+  switch (tag) {
+    case arrayBufferTag:
+      return cloneArrayBuffer(object)
+
+    case boolTag:
+    case dateTag:
+      return new Ctor(+object)
+
+    case dataViewTag:
+      return cloneDataView(object, isDeep)
+
+    case float32Tag: case float64Tag:
+    case int8Tag: case int16Tag: case int32Tag:
+    case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:
+      return cloneTypedArray(object, isDeep)
+
+    case mapTag:
+      return new Ctor
+
+    case numberTag:
+    case stringTag:
+      return new Ctor(object)
+
+    case regexpTag:
+      return cloneRegExp(object)
+
+    case setTag:
+      return new Ctor
+
+    case symbolTag:
+      return cloneSymbol(object)
+  }
+}
+
+/**
+ * Initializes an array clone.
+ *
+ * @private
+ * @param {Array} array The array to clone.
+ * @returns {Array} Returns the initialized clone.
+ */
+function initCloneArray(array) {
+  const { length } = array
+  const result = new array.constructor(length)
+
+  // Add properties assigned by `RegExp#exec`.
+  if (length && typeof array[0] === 'string' && hasOwnProperty.call(array, 'index')) {
+    result.index = array.index
+    result.input = array.input
+  }
+  return result
+}
+
+/**
+ * The base implementation of `clone` and `cloneDeep` which tracks
+ * traversed objects.
+ *
+ * @private
+ * @param {*} value The value to clone.
+ * @param {number} bitmask The bitmask flags.
+ *  1 - Deep clone
+ *  2 - Flatten inherited properties
+ *  4 - Clone symbols
+ * @param {Function} [customizer] The function to customize cloning.
+ * @param {string} [key] The key of `value`.
+ * @param {Object} [object] The parent object of `value`.
+ * @param {Object} [stack] Tracks traversed objects and their clone counterparts.
+ * @returns {*} Returns the cloned value.
+ */
+function baseClone(value, bitmask, customizer, key, object, stack) {
+  let result
+  const isDeep = bitmask & CLONE_DEEP_FLAG
+  const isFlat = bitmask & CLONE_FLAT_FLAG
+  const isFull = bitmask & CLONE_SYMBOLS_FLAG
+
+  if (customizer) {
+    result = object ? customizer(value, key, object, stack) : customizer(value)
+  }
+  if (result !== undefined) {
+    return result
+  }
+  if (!isObject(value)) {
+    return value
+  }
+  const isArr = Array.isArray(value)
+  const tag = getTag(value)
+  if (isArr) {
+    result = initCloneArray(value)
+    if (!isDeep) {
+      return copyArray(value, result)
+    }
+  } else {
+    const isFunc = typeof value === 'function'
+
+    if (isBuffer(value)) {
+      return cloneBuffer(value, isDeep)
+    }
+    if (tag === objectTag || tag === argsTag || (isFunc && !object)) {
+      result = (isFlat || isFunc) ? {} : initCloneObject(value)
+      if (!isDeep) {
+        return isFlat
+          ? copySymbolsIn(value, copyObject(value, keysIn(value), result))
+          : copySymbols(value, Object.assign(result, value))
+      }
+    } else {
+      if (isFunc || !cloneableTags[tag]) {
+        return object ? value : {}
+      }
+      result = initCloneByTag(value, tag, isDeep)
+    }
+  }
+  // Check for circular references and return its corresponding clone.
+  stack || (stack = new Stack)
+  const stacked = stack.get(value)
+  if (stacked) {
+    return stacked
+  }
+  stack.set(value, result)
+
+  if (tag === mapTag) {
+    value.forEach((subValue, key) => {
+      result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack))
+    })
+    return result
+  }
+
+  if (tag === setTag) {
+    value.forEach((subValue) => {
+      result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack))
+    })
+    return result
+  }
+
+  if (isTypedArray(value)) {
+    return result
+  }
+
+  const keysFunc = isFull
+    ? (isFlat ? getAllKeysIn : getAllKeys)
+    : (isFlat ? keysIn : keys)
+
+  const props = isArr ? undefined : keysFunc(value)
+  arrayEach(props || value, (subValue, key) => {
+    if (props) {
+      key = subValue
+      subValue = value[key]
+    }
+    // Recursively populate clone (susceptible to call stack limits).
+    assignValue(result, key, baseClone(subValue, bitmask, customizer, key, value, stack))
+  })
+  return result
+}
+
+export default baseClone

src/.internal/baseConforms.ts

@@ -0,0 +1,16 @@
+import baseConformsTo from './baseConformsTo.js'
+import keys from '../keys.js'
+
+/**
+ * The base implementation of `conforms` which doesn't clone `source`.
+ *
+ * @private
+ * @param {Object} source The object of property predicates to conform to.
+ * @returns {Function} Returns the new spec function.
+ */
+function baseConforms(source) {
+  const props = keys(source)
+  return (object) => baseConformsTo(object, source, props)
+}
+
+export default baseConforms

src/.internal/baseConformsTo.ts

@@ -0,0 +1,27 @@
+/**
+ * The base implementation of `conformsTo` which accepts `props` to check.
+ *
+ * @private
+ * @param {Object} object The object to inspect.
+ * @param {Object} source The object of property predicates to conform to.
+ * @returns {boolean} Returns `true` if `object` conforms, else `false`.
+ */
+function baseConformsTo(object, source, props) {
+  let length = props.length
+  if (object == null) {
+    return !length
+  }
+  object = Object(object)
+  while (length--) {
+    const key = props[length]
+    const predicate = source[key]
+    const value = object[key]
+
+    if ((value === undefined && !(key in object)) || !predicate(value)) {
+      return false
+    }
+  }
+  return true
+}
+
+export default baseConformsTo

src/.internal/baseDifference.ts

@@ -0,0 +1,63 @@
+import SetCache from './SetCache.js'
+import arrayIncludes from './arrayIncludes.js'
+import arrayIncludesWith from './arrayIncludesWith.js'
+import map from '../map.js'
+import cacheHas from './cacheHas.js'
+
+/** Used as the size to enable large array optimizations. */
+const LARGE_ARRAY_SIZE = 200
+
+/**
+ * The base implementation of methods like `difference` without support
+ * for excluding multiple arrays.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {Array} values The values to exclude.
+ * @param {Function} [iteratee] The iteratee invoked per element.
+ * @param {Function} [comparator] The comparator invoked per element.
+ * @returns {Array} Returns the new array of filtered values.
+ */
+function baseDifference(array, values, iteratee, comparator) {
+  let includes = arrayIncludes
+  let isCommon = true
+  const result = []
+  const valuesLength = values.length
+
+  if (!array.length) {
+    return result
+  }
+  if (iteratee) {
+    values = map(values, (value) => iteratee(value))
+  }
+  if (comparator) {
+    includes = arrayIncludesWith
+    isCommon = false
+  }
+  else if (values.length >= LARGE_ARRAY_SIZE) {
+    includes = cacheHas
+    isCommon = false
+    values = new SetCache(values)
+  }
+  outer:
+  for (let value of array) {
+    const computed = iteratee == null ? value : iteratee(value)
+
+    value = (comparator || value !== 0) ? value : 0
+    if (isCommon && computed === computed) {
+      let valuesIndex = valuesLength
+      while (valuesIndex--) {
+        if (values[valuesIndex] === computed) {
+          continue outer
+        }
+      }
+      result.push(value)
+    }
+    else if (!includes(values, computed, comparator)) {
+      result.push(value)
+    }
+  }
+  return result
+}
+
+export default baseDifference

src/.internal/baseEach.ts

@@ -0,0 +1,31 @@
+import baseForOwn from './baseForOwn.js'
+import isArrayLike from '../isArrayLike.js'
+
+/**
+ * The base implementation of `forEach`.
+ *
+ * @private
+ * @param {Array|Object} collection The collection to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @returns {Array|Object} Returns `collection`.
+ */
+function baseEach(collection, iteratee) {
+  if (collection == null) {
+    return collection
+  }
+  if (!isArrayLike(collection)) {
+    return baseForOwn(collection, iteratee)
+  }
+  const length = collection.length
+  const iterable = Object(collection)
+  let index = -1
+
+  while (++index < length) {
+    if (iteratee(iterable[index], index, iterable) === false) {
+      break
+    }
+  }
+  return collection
+}
+
+export default baseEach

src/.internal/baseEachRight.ts

@@ -0,0 +1,30 @@
+import baseForOwnRight from './baseForOwnRight.js'
+import isArrayLike from '../isArrayLike.js'
+
+/**
+ * The base implementation of `forEachRight`.
+ *
+ * @private
+ * @param {Array|Object} collection The collection to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @returns {Array|Object} Returns `collection`.
+ */
+function baseEachRight(collection, iteratee) {
+  if (collection == null) {
+    return collection
+  }
+  if (!isArrayLike(collection)) {
+    return baseForOwnRight(collection, iteratee)
+  }
+  const iterable = Object(collection)
+  let length = collection.length
+
+  while (length--) {
+    if (iteratee(iterable[length], length, iterable) === false) {
+      break
+    }
+  }
+  return collection
+}
+
+export default baseEachRight

src/.internal/baseFindIndex.ts

@@ -0,0 +1,23 @@
+/**
+ * The base implementation of `findIndex` and `findLastIndex`.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {Function} predicate The function invoked per iteration.
+ * @param {number} fromIndex The index to search from.
+ * @param {boolean} [fromRight] Specify iterating from right to left.
+ * @returns {number} Returns the index of the matched value, else `-1`.
+ */
+function baseFindIndex(array, predicate, fromIndex, fromRight) {
+  const { length } = array
+  let index = fromIndex + (fromRight ? 1 : -1)
+
+  while ((fromRight ? index-- : ++index < length)) {
+    if (predicate(array[index], index, array)) {
+      return index
+    }
+  }
+  return -1
+}
+
+export default baseFindIndex

src/.internal/baseFindKey.ts

@@ -0,0 +1,22 @@
+/**
+ * The base implementation of methods like `findKey` and `findLastKey`
+ * which iterates over `collection` using `eachFunc`.
+ *
+ * @private
+ * @param {Array|Object} collection The collection to inspect.
+ * @param {Function} predicate The function invoked per iteration.
+ * @param {Function} eachFunc The function to iterate over `collection`.
+ * @returns {*} Returns the found element or its key, else `undefined`.
+ */
+function baseFindKey(collection, predicate, eachFunc) {
+  let result
+  eachFunc(collection, (value, key, collection) => {
+    if (predicate(value, key, collection)) {
+      result = key
+      return false
+    }
+  })
+  return result
+}
+
+export default baseFindKey

src/.internal/baseFlatten.ts

@@ -0,0 +1,37 @@
+import isFlattenable from './isFlattenable.js'
+
+/**
+ * The base implementation of `flatten` with support for restricting flattening.
+ *
+ * @private
+ * @param {Array} array The array to flatten.
+ * @param {number} depth The maximum recursion depth.
+ * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.
+ * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.
+ * @param {Array} [result=[]] The initial result value.
+ * @returns {Array} Returns the new flattened array.
+ */
+function baseFlatten(array, depth, predicate, isStrict, result) {
+  predicate || (predicate = isFlattenable)
+  result || (result = [])
+
+  if (array == null) {
+    return result
+  }
+
+  for (const value of array) {
+    if (depth > 0 && predicate(value)) {
+      if (depth > 1) {
+        // Recursively flatten arrays (susceptible to call stack limits).
+        baseFlatten(value, depth - 1, predicate, isStrict, result)
+      } else {
+        result.push(...value)
+      }
+    } else if (!isStrict) {
+      result[result.length] = value
+    }
+  }
+  return result
+}
+
+export default baseFlatten

src/.internal/baseFor.ts

@@ -0,0 +1,27 @@
+/**
+ * The base implementation of `baseForOwn` which iterates over `object`
+ * properties returned by `keysFunc` and invokes `iteratee` for each property.
+ * Iteratee functions may exit iteration early by explicitly returning `false`.
+ *
+ * @private
+ * @param {Object} object The object to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @param {Function} keysFunc The function to get the keys of `object`.
+ * @returns {Object} Returns `object`.
+ */
+function baseFor(object, iteratee, keysFunc) {
+  const iterable = Object(object)
+  const props = keysFunc(object)
+  let { length } = props
+  let index = -1
+
+  while (length--) {
+    const key = props[++index]
+    if (iteratee(iterable[key], key, iterable) === false) {
+      break
+    }
+  }
+  return object
+}
+
+export default baseFor

src/.internal/baseForOwn.ts

@@ -0,0 +1,16 @@
+import baseFor from './baseFor.js'
+import keys from '../keys.js'
+
+/**
+ * The base implementation of `forOwn`.
+ *
+ * @private
+ * @param {Object} object The object to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @returns {Object} Returns `object`.
+ */
+function baseForOwn(object, iteratee) {
+  return object && baseFor(object, iteratee, keys)
+}
+
+export default baseForOwn

src/.internal/baseForOwnRight.ts

@@ -0,0 +1,16 @@
+import baseForRight from './baseForRight.js'
+import keys from '../keys.js'
+
+/**
+ * The base implementation of `forOwnRight`.
+ *
+ * @private
+ * @param {Object} object The object to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @returns {Object} Returns `object`.
+ */
+function baseForOwnRight(object, iteratee) {
+  return object && baseForRight(object, iteratee, keys)
+}
+
+export default baseForOwnRight

src/.internal/baseForRight.ts

@@ -0,0 +1,25 @@
+/**
+ * This function is like `baseFor` except that it iterates over properties
+ * in the opposite order.
+ *
+ * @private
+ * @param {Object} object The object to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @param {Function} keysFunc The function to get the keys of `object`.
+ * @returns {Object} Returns `object`.
+ */
+function baseForRight(object, iteratee, keysFunc) {
+  const iterable = Object(object)
+  const props = keysFunc(object)
+  let { length } = props
+
+  while (length--) {
+    const key = props[length]
+    if (iteratee(iterable[key], key, iterable) === false) {
+      break
+    }
+  }
+  return object
+}
+
+export default baseForRight

src/.internal/baseGet.ts

@@ -0,0 +1,24 @@
+import castPath from './castPath.js'
+import toKey from './toKey.js'
+
+/**
+ * The base implementation of `get` without support for default values.
+ *
+ * @private
+ * @param {Object} object The object to query.
+ * @param {Array|string} path The path of the property to get.
+ * @returns {*} Returns the resolved value.
+ */
+function baseGet(object, path) {
+  path = castPath(path, object)
+
+  let index = 0
+  const length = path.length
+
+  while (object != null && index < length) {
+    object = object[toKey(path[index++])]
+  }
+  return (index && index === length) ? object : undefined
+}
+
+export default baseGet

src/.internal/baseInRange.ts

@@ -0,0 +1,14 @@
+/**
+ * The base implementation of `inRange` which doesn't coerce arguments.
+ *
+ * @private
+ * @param {number} number The number to check.
+ * @param {number} start The start of the range.
+ * @param {number} end The end of the range.
+ * @returns {boolean} Returns `true` if `number` is in the range, else `false`.
+ */
+function baseInRange(number, start, end) {
+  return number >= Math.min(start, end) && number < Math.max(start, end)
+}
+
+export default baseInRange

src/.internal/baseIndexOf.ts

@@ -0,0 +1,20 @@
+import baseFindIndex from './baseFindIndex.js'
+import baseIsNaN from './baseIsNaN.js'
+import strictIndexOf from './strictIndexOf.js'
+
+/**
+ * The base implementation of `indexOf` without `fromIndex` bounds checks.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {*} value The value to search for.
+ * @param {number} fromIndex The index to search from.
+ * @returns {number} Returns the index of the matched value, else `-1`.
+ */
+function baseIndexOf(array, value, fromIndex) {
+  return value === value
+    ? strictIndexOf(array, value, fromIndex)
+    : baseFindIndex(array, baseIsNaN, fromIndex)
+}
+
+export default baseIndexOf

src/.internal/baseIndexOfWith.ts

@@ -0,0 +1,23 @@
+/**
+ * This function is like `baseIndexOf` except that it accepts a comparator.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {*} value The value to search for.
+ * @param {number} fromIndex The index to search from.
+ * @param {Function} comparator The comparator invoked per element.
+ * @returns {number} Returns the index of the matched value, else `-1`.
+ */
+function baseIndexOfWith(array, value, fromIndex, comparator) {
+  let index = fromIndex - 1
+  const { length } = array
+
+  while (++index < length) {
+    if (comparator(array[index], value)) {
+      return index
+    }
+  }
+  return -1
+}
+
+export default baseIndexOfWith

src/.internal/baseIntersection.ts

@@ -0,0 +1,72 @@
+import SetCache from './SetCache.js'
+import arrayIncludes from './arrayIncludes.js'
+import arrayIncludesWith from './arrayIncludesWith.js'
+import map from '../map.js'
+import cacheHas from './cacheHas.js'
+
+/**
+ * The base implementation of methods like `intersection` that accepts an
+ * array of arrays to inspect.
+ *
+ * @private
+ * @param {Array} arrays The arrays to inspect.
+ * @param {Function} [iteratee] The iteratee invoked per element.
+ * @param {Function} [comparator] The comparator invoked per element.
+ * @returns {Array} Returns the new array of shared values.
+ */
+function baseIntersection(arrays, iteratee, comparator) {
+  const includes = comparator ? arrayIncludesWith : arrayIncludes
+  const length = arrays[0].length
+  const othLength = arrays.length
+  const caches = new Array(othLength)
+  const result = []
+
+  let array
+  let maxLength = Infinity
+  let othIndex = othLength
+
+  while (othIndex--) {
+    array = arrays[othIndex]
+    if (othIndex && iteratee) {
+      array = map(array, (value) => iteratee(value))
+    }
+    maxLength = Math.min(array.length, maxLength)
+    caches[othIndex] = !comparator && (iteratee || (length >= 120 && array.length >= 120))
+      ? new SetCache(othIndex && array)
+      : undefined
+  }
+  array = arrays[0]
+
+  let index = -1
+  const seen = caches[0]
+
+  outer:
+  while (++index < length && result.length < maxLength) {
+    let value = array[index]
+    const computed = iteratee ? iteratee(value) : value
+
+    value = (comparator || value !== 0) ? value : 0
+    if (!(seen
+      ? cacheHas(seen, computed)
+      : includes(result, computed, comparator)
+    )) {
+      othIndex = othLength
+      while (--othIndex) {
+        const cache = caches[othIndex]
+        if (!(cache
+          ? cacheHas(cache, computed)
+          : includes(arrays[othIndex], computed, comparator))
+        ) {
+          continue outer
+        }
+      }
+      if (seen) {
+        seen.push(computed)
+      }
+      result.push(value)
+    }
+  }
+  return result
+}
+
+export default baseIntersection

src/.internal/baseIsEqual.ts

@@ -0,0 +1,28 @@
+import baseIsEqualDeep from './baseIsEqualDeep.js'
+import isObjectLike from '../isObjectLike.js'
+
+/**
+ * The base implementation of `isEqual` which supports partial comparisons
+ * and tracks traversed objects.
+ *
+ * @private
+ * @param {*} value The value to compare.
+ * @param {*} other The other value to compare.
+ * @param {boolean} bitmask The bitmask flags.
+ *  1 - Unordered comparison
+ *  2 - Partial comparison
+ * @param {Function} [customizer] The function to customize comparisons.
+ * @param {Object} [stack] Tracks traversed `value` and `other` objects.
+ * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
+ */
+function baseIsEqual(value, other, bitmask, customizer, stack) {
+  if (value === other) {
+    return true
+  }
+  if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {
+    return value !== value && other !== other
+  }
+  return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack)
+}
+
+export default baseIsEqual

src/.internal/baseIsEqualDeep.ts

@@ -0,0 +1,79 @@
+import Stack from './Stack.js'
+import equalArrays from './equalArrays.js'
+import equalByTag from './equalByTag.js'
+import equalObjects from './equalObjects.js'
+import getTag from './getTag.js'
+import isBuffer from '../isBuffer.js'
+import isTypedArray from '../isTypedArray.js'
+
+/** Used to compose bitmasks for value comparisons. */
+const COMPARE_PARTIAL_FLAG = 1
+
+/** `Object#toString` result references. */
+const argsTag = '[object Arguments]'
+const arrayTag = '[object Array]'
+const objectTag = '[object Object]'
+
+/** Used to check objects for own properties. */
+const hasOwnProperty = Object.prototype.hasOwnProperty
+
+/**
+ * A specialized version of `baseIsEqual` for arrays and objects which performs
+ * deep comparisons and tracks traversed objects enabling objects with circular
+ * references to be compared.
+ *
+ * @private
+ * @param {Object} object The object to compare.
+ * @param {Object} other The other object to compare.
+ * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
+ * @param {Function} customizer The function to customize comparisons.
+ * @param {Function} equalFunc The function to determine equivalents of values.
+ * @param {Object} [stack] Tracks traversed `object` and `other` objects.
+ * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
+ */
+function baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {
+  let objIsArr = Array.isArray(object)
+  const othIsArr = Array.isArray(other)
+  let objTag = objIsArr ? arrayTag : getTag(object)
+  let othTag = othIsArr ? arrayTag : getTag(other)
+
+  objTag = objTag === argsTag ? objectTag : objTag
+  othTag = othTag === argsTag ? objectTag : othTag
+
+  let objIsObj = objTag === objectTag
+  const othIsObj = othTag === objectTag
+  const isSameTag = objTag === othTag
+
+  if (isSameTag && isBuffer(object)) {
+    if (!isBuffer(other)) {
+      return false
+    }
+    objIsArr = true
+    objIsObj = false
+  }
+  if (isSameTag && !objIsObj) {
+    stack || (stack = new Stack)
+    return (objIsArr || isTypedArray(object))
+      ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)
+      : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack)
+  }
+  if (!(bitmask & COMPARE_PARTIAL_FLAG)) {
+    const objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__')
+    const othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__')
+
+    if (objIsWrapped || othIsWrapped) {
+      const objUnwrapped = objIsWrapped ? object.value() : object
+      const othUnwrapped = othIsWrapped ? other.value() : other
+
+      stack || (stack = new Stack)
+      return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack)
+    }
+  }
+  if (!isSameTag) {
+    return false
+  }
+  stack || (stack = new Stack)
+  return equalObjects(object, other, bitmask, customizer, equalFunc, stack)
+}
+
+export default baseIsEqualDeep

src/.internal/baseIsMatch.ts

@@ -0,0 +1,64 @@
+import Stack from './Stack.js'
+import baseIsEqual from './baseIsEqual.js'
+
+/** Used to compose bitmasks for value comparisons. */
+const COMPARE_PARTIAL_FLAG = 1
+const COMPARE_UNORDERED_FLAG = 2
+
+/**
+ * The base implementation of `isMatch`.
+ *
+ * @private
+ * @param {Object} object The object to inspect.
+ * @param {Object} source The object of property values to match.
+ * @param {Array} matchData The property names, values, and compare flags to match.
+ * @param {Function} [customizer] The function to customize comparisons.
+ * @returns {boolean} Returns `true` if `object` is a match, else `false`.
+ */
+function baseIsMatch(object, source, matchData, customizer) {
+  let index = matchData.length
+  const length = index
+  const noCustomizer = !customizer
+
+  if (object == null) {
+    return !length
+  }
+  let data
+  let result
+  object = Object(object)
+  while (index--) {
+    data = matchData[index]
+    if ((noCustomizer && data[2])
+      ? data[1] !== object[data[0]]
+      : !(data[0] in object)
+    ) {
+      return false
+    }
+  }
+  while (++index < length) {
+    data = matchData[index]
+    const key = data[0]
+    const objValue = object[key]
+    const srcValue = data[1]
+
+    if (noCustomizer && data[2]) {
+      if (objValue === undefined && !(key in object)) {
+        return false
+      }
+    } else {
+      const stack = new Stack
+      if (customizer) {
+        result = customizer(objValue, srcValue, key, object, source, stack)
+      }
+      if (!(result === undefined
+        ? baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG, customizer, stack)
+        : result
+      )) {
+        return false
+      }
+    }
+  }
+  return true
+}
+
+export default baseIsMatch

src/.internal/baseIsNaN.ts

@@ -0,0 +1,12 @@
+/**
+ * The base implementation of `isNaN` without support for number objects.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.
+ */
+function baseIsNaN(value) {
+  return value !== value
+}
+
+export default baseIsNaN

src/.internal/baseMatches.ts

@@ -0,0 +1,20 @@
+import baseIsMatch from './baseIsMatch.js'
+import getMatchData from './getMatchData.js'
+import matchesStrictComparable from './matchesStrictComparable.js'
+
+/**
+ * The base implementation of `matches` which doesn't clone `source`.
+ *
+ * @private
+ * @param {Object} source The object of property values to match.
+ * @returns {Function} Returns the new spec function.
+ */
+function baseMatches(source) {
+  const matchData = getMatchData(source)
+  if (matchData.length === 1 && matchData[0][2]) {
+    return matchesStrictComparable(matchData[0][0], matchData[0][1])
+  }
+  return (object) => object === source || baseIsMatch(object, source, matchData)
+}
+
+export default baseMatches

src/.internal/baseMatchesProperty.ts

@@ -0,0 +1,33 @@
+import baseIsEqual from './baseIsEqual.js'
+import get from '../get.js'
+import hasIn from '../hasIn.js'
+import isKey from './isKey.js'
+import isStrictComparable from './isStrictComparable.js'
+import matchesStrictComparable from './matchesStrictComparable.js'
+import toKey from './toKey.js'
+
+/** Used to compose bitmasks for value comparisons. */
+const COMPARE_PARTIAL_FLAG = 1
+const COMPARE_UNORDERED_FLAG = 2
+
+/**
+ * The base implementation of `matchesProperty` which doesn't clone `srcValue`.
+ *
+ * @private
+ * @param {string} path The path of the property to get.
+ * @param {*} srcValue The value to match.
+ * @returns {Function} Returns the new spec function.
+ */
+function baseMatchesProperty(path, srcValue) {
+  if (isKey(path) && isStrictComparable(srcValue)) {
+    return matchesStrictComparable(toKey(path), srcValue)
+  }
+  return (object) => {
+    const objValue = get(object, path)
+    return (objValue === undefined && objValue === srcValue)
+      ? hasIn(object, path)
+      : baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG)
+  }
+}
+
+export default baseMatchesProperty

src/.internal/baseMerge.ts

@@ -0,0 +1,41 @@
+import Stack from './Stack.js'
+import assignMergeValue from './assignMergeValue.js'
+import baseFor from './baseFor.js'
+import baseMergeDeep from './baseMergeDeep.js'
+import isObject from '../isObject.js'
+import keysIn from '../keysIn.js'
+
+/**
+ * The base implementation of `merge` without support for multiple sources.
+ *
+ * @private
+ * @param {Object} object The destination object.
+ * @param {Object} source The source object.
+ * @param {number} srcIndex The index of `source`.
+ * @param {Function} [customizer] The function to customize merged values.
+ * @param {Object} [stack] Tracks traversed source values and their merged
+ *  counterparts.
+ */
+function baseMerge(object, source, srcIndex, customizer, stack) {
+  if (object === source) {
+    return
+  }
+  baseFor(source, (srcValue, key) => {
+    if (isObject(srcValue)) {
+      stack || (stack = new Stack)
+      baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack)
+    }
+    else {
+      let newValue = customizer
+        ? customizer(object[key], srcValue, `${key}`, object, source, stack)
+        : undefined
+
+      if (newValue === undefined) {
+        newValue = srcValue
+      }
+      assignMergeValue(object, key, newValue)
+    }
+  }, keysIn)
+}
+
+export default baseMerge

src/.internal/baseMergeDeep.ts

@@ -0,0 +1,91 @@
+import assignMergeValue from './assignMergeValue.js'
+import cloneBuffer from './cloneBuffer.js'
+import cloneTypedArray from './cloneTypedArray.js'
+import copyArray from './copyArray.js'
+import initCloneObject from './initCloneObject.js'
+import isArguments from '../isArguments.js'
+import isArrayLikeObject from '../isArrayLikeObject.js'
+import isBuffer from '../isBuffer.js'
+import isObject from '../isObject.js'
+import isPlainObject from '../isPlainObject.js'
+import isTypedArray from '../isTypedArray.js'
+import toPlainObject from '../toPlainObject.js'
+
+/**
+ * A specialized version of `baseMerge` for arrays and objects which performs
+ * deep merges and tracks traversed objects enabling objects with circular
+ * references to be merged.
+ *
+ * @private
+ * @param {Object} object The destination object.
+ * @param {Object} source The source object.
+ * @param {string} key The key of the value to merge.
+ * @param {number} srcIndex The index of `source`.
+ * @param {Function} mergeFunc The function to merge values.
+ * @param {Function} [customizer] The function to customize assigned values.
+ * @param {Object} [stack] Tracks traversed source values and their merged
+ *  counterparts.
+ */
+function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {
+  const objValue = object[key]
+  const srcValue = source[key]
+  const stacked = stack.get(srcValue)
+
+  if (stacked) {
+    assignMergeValue(object, key, stacked)
+    return
+  }
+  let newValue = customizer
+    ? customizer(objValue, srcValue, `${key}`, object, source, stack)
+    : undefined
+
+  let isCommon = newValue === undefined
+
+  if (isCommon) {
+    const isArr = Array.isArray(srcValue)
+    const isBuff = !isArr && isBuffer(srcValue)
+    const isTyped = !isArr && !isBuff && isTypedArray(srcValue)
+
+    newValue = srcValue
+    if (isArr || isBuff || isTyped) {
+      if (Array.isArray(objValue)) {
+        newValue = objValue
+      }
+      else if (isArrayLikeObject(objValue)) {
+        newValue = copyArray(objValue)
+      }
+      else if (isBuff) {
+        isCommon = false
+        newValue = cloneBuffer(srcValue, true)
+      }
+      else if (isTyped) {
+        isCommon = false
+        newValue = cloneTypedArray(srcValue, true)
+      }
+      else {
+        newValue = []
+      }
+    }
+    else if (isPlainObject(srcValue) || isArguments(srcValue)) {
+      newValue = objValue
+      if (isArguments(objValue)) {
+        newValue = toPlainObject(objValue)
+      }
+      else if (typeof objValue === 'function' || !isObject(objValue)) {
+        newValue = initCloneObject(srcValue)
+      }
+    }
+    else {
+      isCommon = false
+    }
+  }
+  if (isCommon) {
+    // Recursively merge objects and arrays (susceptible to call stack limits).
+    stack.set(srcValue, newValue)
+    mergeFunc(newValue, srcValue, srcIndex, customizer, stack)
+    stack['delete'](srcValue)
+  }
+  assignMergeValue(object, key, newValue)
+}
+
+export default baseMergeDeep

src/.internal/baseOrderBy.ts

@@ -0,0 +1,49 @@
+import baseEach from './baseEach.js'
+import baseSortBy from './baseSortBy.js'
+import baseGet from './baseGet.js'
+import compareMultiple from './compareMultiple.js'
+import isArrayLike from '../isArrayLike.js'
+
+const identity = (value) => value
+
+/**
+ * The base implementation of `orderBy` without param guards.
+ *
+ * @private
+ * @param {Array|Object} collection The collection to iterate over.
+ * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.
+ * @param {string[]} orders The sort orders of `iteratees`.
+ * @returns {Array} Returns the new sorted array.
+ */
+function baseOrderBy(collection, iteratees, orders) {
+  if (iteratees.length) {
+    iteratees = iteratees.map((iteratee) => {
+      if (Array.isArray(iteratee)) {
+        return (value) => baseGet(value, iteratee.length === 1 ? iteratee[0] : iteratee)
+      }
+
+      return iteratee
+    })
+  } else {
+    iteratees = [identity]
+  }
+
+  let criteriaIndex = -1
+  let eachIndex = -1
+
+  const result = isArrayLike(collection) ? new Array(collection.length) : []
+
+  baseEach(collection, (value) => {
+    const criteria = iteratees.map((iteratee) => iteratee(value))
+
+    result[++eachIndex] = {
+      criteria,
+      index: ++criteriaIndex,
+      value
+    }
+  })
+
+  return baseSortBy(result, (object, other) => compareMultiple(object, other, orders))
+}
+
+export default baseOrderBy

src/.internal/basePick.ts

@@ -0,0 +1,17 @@
+import basePickBy from './basePickBy.js'
+import hasIn from '../hasIn.js'
+
+/**
+ * The base implementation of `pick` without support for individual
+ * property identifiers.
+ *
+ * @private
+ * @param {Object} object The source object.
+ * @param {string[]} paths The property paths to pick.
+ * @returns {Object} Returns the new object.
+ */
+function basePick(object, paths) {
+  return basePickBy(object, paths, (value, path) => hasIn(object, path))
+}
+
+export default basePick

src/.internal/basePickBy.ts

@@ -0,0 +1,29 @@
+import baseGet from './baseGet.js'
+import baseSet from './baseSet.js'
+import castPath from './castPath.js'
+
+/**
+ * The base implementation of `pickBy`.
+ *
+ * @private
+ * @param {Object} object The source object.
+ * @param {string[]} paths The property paths to pick.
+ * @param {Function} predicate The function invoked per property.
+ * @returns {Object} Returns the new object.
+ */
+function basePickBy(object, paths, predicate) {
+  let index = -1
+  const length = paths.length
+  const result = {}
+
+  while (++index < length) {
+    const path = paths[index]
+    const value = baseGet(object, path)
+    if (predicate(value, path)) {
+      baseSet(result, castPath(path, object), value)
+    }
+  }
+  return result
+}
+
+export default basePickBy

src/.internal/baseProperty.ts

@@ -0,0 +1,12 @@
+/**
+ * The base implementation of `property` without support for deep paths.
+ *
+ * @private
+ * @param {string} key The key of the property to get.
+ * @returns {Function} Returns the new accessor function.
+ */
+function baseProperty(key) {
+  return (object) => object == null ? undefined : object[key]
+}
+
+export default baseProperty

src/.internal/basePropertyDeep.ts

@@ -0,0 +1,14 @@
+import baseGet from './baseGet.js'
+
+/**
+ * A specialized version of `baseProperty` which supports deep paths.
+ *
+ * @private
+ * @param {Array|string} path The path of the property to get.
+ * @returns {Function} Returns the new accessor function.
+ */
+function basePropertyDeep(path) {
+  return (object) => baseGet(object, path)
+}
+
+export default basePropertyDeep

src/.internal/basePropertyOf.ts

@@ -0,0 +1,12 @@
+/**
+ * The base implementation of `propertyOf` without support for deep paths.
+ *
+ * @private
+ * @param {Object} object The object to query.
+ * @returns {Function} Returns the new accessor function.
+ */
+function basePropertyOf(object) {
+  return (key) => object == null ? undefined : object[key]
+}
+
+export default basePropertyOf

src/.internal/basePullAll.ts

@@ -0,0 +1,44 @@
+import map from '../map.js'
+import baseIndexOf from './baseIndexOf.js'
+import baseIndexOfWith from './baseIndexOfWith.js'
+import copyArray from './copyArray.js'
+
+/**
+ * The base implementation of `pullAllBy`.
+ *
+ * @private
+ * @param {Array} array The array to modify.
+ * @param {Array} values The values to remove.
+ * @param {Function} [iteratee] The iteratee invoked per element.
+ * @param {Function} [comparator] The comparator invoked per element.
+ * @returns {Array} Returns `array`.
+ */
+function basePullAll(array, values, iteratee, comparator) {
+  const indexOf = comparator ? baseIndexOfWith : baseIndexOf
+  const length = values.length
+
+  let index = -1
+  let seen = array
+
+  if (array === values) {
+    values = copyArray(values)
+  }
+  if (iteratee) {
+    seen = map(array, (value) => iteratee(value))
+  }
+  while (++index < length) {
+    let fromIndex = 0
+    const value = values[index]
+    const computed = iteratee ? iteratee(value) : value
+
+    while ((fromIndex = indexOf(seen, computed, fromIndex, comparator)) > -1) {
+      if (seen !== array) {
+        seen.splice(fromIndex, 1)
+      }
+      array.splice(fromIndex, 1)
+    }
+  }
+  return array
+}
+
+export default basePullAll

src/.internal/basePullAt.ts

@@ -0,0 +1,32 @@
+import baseUnset from './baseUnset.js'
+import isIndex from './isIndex.js'
+
+/**
+ * The base implementation of `pullAt` without support for individual
+ * indexes or capturing the removed elements.
+ *
+ * @private
+ * @param {Array} array The array to modify.
+ * @param {number[]} indexes The indexes of elements to remove.
+ * @returns {Array} Returns `array`.
+ */
+function basePullAt(array, indexes) {
+  let length = array ? indexes.length : 0
+  const lastIndex = length - 1
+
+  while (length--) {
+    let previous
+    const index = indexes[length]
+    if (length === lastIndex || index !== previous) {
+      previous = index
+      if (isIndex(index)) {
+        array.splice(index, 1)
+      } else {
+        baseUnset(array, index)
+      }
+    }
+  }
+  return array
+}
+
+export default basePullAt

src/.internal/baseRange.ts

@@ -0,0 +1,24 @@
+/**
+ * The base implementation of `range` and `rangeRight` which doesn't
+ * coerce arguments.
+ *
+ * @private
+ * @param {number} start The start of the range.
+ * @param {number} end The end of the range.
+ * @param {number} step The value to increment or decrement by.
+ * @param {boolean} [fromRight] Specify iterating from right to left.
+ * @returns {Array} Returns the range of numbers.
+ */
+function baseRange(start, end, step, fromRight) {
+  let index = -1
+  let length = Math.max(Math.ceil((end - start) / (step || 1)), 0)
+  const result = new Array(length)
+
+  while (length--) {
+    result[fromRight ? length : ++index] = start
+    start += step
+  }
+  return result
+}
+
+export default baseRange

src/.internal/baseReduce.ts

@@ -0,0 +1,23 @@
+/**
+ * The base implementation of `reduce` and `reduceRight` which iterates
+ * over `collection` using `eachFunc`.
+ *
+ * @private
+ * @param {Array|Object} collection The collection to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @param {*} accumulator The initial value.
+ * @param {boolean} initAccum Specify using the first or last element of
+ *  `collection` as the initial value.
+ * @param {Function} eachFunc The function to iterate over `collection`.
+ * @returns {*} Returns the accumulated value.
+ */
+function baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {
+  eachFunc(collection, (value, index, collection) => {
+    accumulator = initAccum
+      ? (initAccum = false, value)
+      : iteratee(accumulator, value, index, collection)
+  })
+  return accumulator
+}
+
+export default baseReduce

src/.internal/baseSet.ts

@@ -0,0 +1,48 @@
+import assignValue from './assignValue.js'
+import castPath from './castPath.js'
+import isIndex from './isIndex.js'
+import isObject from '../isObject.js'
+import toKey from './toKey.js'
+
+/**
+ * The base implementation of `set`.
+ *
+ * @private
+ * @param {Object} object The object to modify.
+ * @param {Array|string} path The path of the property to set.
+ * @param {*} value The value to set.
+ * @param {Function} [customizer] The function to customize path creation.
+ * @returns {Object} Returns `object`.
+ */
+function baseSet(object, path, value, customizer) {
+  if (!isObject(object)) {
+    return object
+  }
+  path = castPath(path, object)
+
+  const length = path.length
+  const lastIndex = length - 1
+
+  let index = -1
+  let nested = object
+
+  while (nested != null && ++index < length) {
+    const key = toKey(path[index])
+    let newValue = value
+
+    if (index !== lastIndex) {
+      const objValue = nested[key]
+      newValue = customizer ? customizer(objValue, key, nested) : undefined
+      if (newValue === undefined) {
+        newValue = isObject(objValue)
+          ? objValue
+          : (isIndex(path[index + 1]) ? [] : {})
+      }
+    }
+    assignValue(nested, key, newValue)
+    nested = nested[key]
+  }
+  return object
+}
+
+export default baseSet

src/.internal/baseSortBy.ts

@@ -0,0 +1,21 @@
+/**
+ * The base implementation of `sortBy` which uses `comparer` to define the
+ * sort order of `array` and replaces criteria objects with their corresponding
+ * values.
+ *
+ * @private
+ * @param {Array} array The array to sort.
+ * @param {Function} comparer The function to define sort order.
+ * @returns {Array} Returns `array`.
+ */
+function baseSortBy(array, comparer) {
+  let { length } = array
+
+  array.sort(comparer)
+  while (length--) {
+    array[length] = array[length].value
+  }
+  return array
+}
+
+export default baseSortBy

src/.internal/baseSortedIndex.ts

@@ -0,0 +1,40 @@
+import baseSortedIndexBy from './baseSortedIndexBy.js'
+import isSymbol from '../isSymbol.js'
+
+/** Used as references for the maximum length and index of an array. */
+const MAX_ARRAY_LENGTH = 4294967295
+const HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1
+
+/**
+ * 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.
+ *
+ * @private
+ * @param {Array} array The sorted array to inspect.
+ * @param {*} value The value to evaluate.
+ * @param {boolean} [retHighest] Specify returning the highest qualified index.
+ * @returns {number} Returns the index at which `value` should be inserted
+ *  into `array`.
+ */
+function baseSortedIndex(array, value, retHighest) {
+  let low = 0
+  let high = array == null ? low : array.length
+
+  if (typeof value === 'number' && value === value && high <= HALF_MAX_ARRAY_LENGTH) {
+    while (low < high) {
+      const mid = (low + high) >>> 1
+      const computed = array[mid]
+      if (computed !== null && !isSymbol(computed) &&
+          (retHighest ? (computed <= value) : (computed < value))) {
+        low = mid + 1
+      } else {
+        high = mid
+      }
+    }
+    return high
+  }
+  return baseSortedIndexBy(array, value, (value) => value, retHighest)
+}
+
+export default baseSortedIndex

src/.internal/baseSortedIndexBy.ts

@@ -0,0 +1,65 @@
+import isSymbol from '../isSymbol.js'
+
+/** Used as references for the maximum length and index of an array. */
+const MAX_ARRAY_LENGTH = 4294967295
+const MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1
+
+/**
+ * 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).
+ *
+ * @private
+ * @param {Array} array The sorted array to inspect.
+ * @param {*} value The value to evaluate.
+ * @param {Function} iteratee The iteratee invoked per element.
+ * @param {boolean} [retHighest] Specify returning the highest qualified index.
+ * @returns {number} Returns the index at which `value` should be inserted
+ *  into `array`.
+ */
+function baseSortedIndexBy(array, value, iteratee, retHighest) {
+  let low = 0
+  let high = array == null ? 0 : array.length
+  if (high === 0) {
+    return 0
+  }
+
+  value = iteratee(value)
+
+  const valIsNaN = value !== value
+  const valIsNull = value === null
+  const valIsSymbol = isSymbol(value)
+  const valIsUndefined = value === undefined
+
+  while (low < high) {
+    let setLow
+    const mid = Math.floor((low + high) / 2)
+    const computed = iteratee(array[mid])
+    const othIsDefined = computed !== undefined
+    const othIsNull = computed === null
+    const othIsReflexive = computed === computed
+    const othIsSymbol = isSymbol(computed)
+
+    if (valIsNaN) {
+      setLow = retHighest || othIsReflexive
+    } else if (valIsUndefined) {
+      setLow = othIsReflexive && (retHighest || othIsDefined)
+    } else if (valIsNull) {
+      setLow = othIsReflexive && othIsDefined && (retHighest || !othIsNull)
+    } else if (valIsSymbol) {
+      setLow = othIsReflexive && othIsDefined && !othIsNull && (retHighest || !othIsSymbol)
+    } else if (othIsNull || othIsSymbol) {
+      setLow = false
+    } else {
+      setLow = retHighest ? (computed <= value) : (computed < value)
+    }
+    if (setLow) {
+      low = mid + 1
+    } else {
+      high = mid
+    }
+  }
+  return Math.min(high, MAX_ARRAY_INDEX)
+}
+
+export default baseSortedIndexBy

src/.internal/baseSortedUniq.ts

@@ -0,0 +1,29 @@
+import eq from '../eq.js'
+
+/**
+ * The base implementation of `sortedUniq` and `sortedUniqBy`.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {Function} [iteratee] The iteratee invoked per element.
+ * @returns {Array} Returns the new duplicate free array.
+ */
+function baseSortedUniq(array, iteratee) {
+  let seen
+  let index = -1
+  let resIndex = 0
+
+  const { length } = array
+  const result = []
+
+  while (++index < length) {
+    const value = array[index], computed = iteratee ? iteratee(value) : value
+    if (!index || !eq(computed, seen)) {
+      seen = computed
+      result[resIndex++] = value === 0 ? 0 : value
+    }
+  }
+  return result
+}
+
+export default baseSortedUniq

src/.internal/baseSum.ts

@@ -0,0 +1,21 @@
+/**
+ * The base implementation of `sum` and `sumBy`.
+ *
+ * @private
+ * @param {Array} array The array to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @returns {number} Returns the sum.
+ */
+function baseSum(array, iteratee) {
+  let result
+
+  for (const value of array) {
+    const current = iteratee(value)
+    if (current !== undefined) {
+      result = result === undefined ? current : (result + current)
+    }
+  }
+  return result
+}
+
+export default baseSum

src/.internal/baseToNumber.ts

@@ -0,0 +1,24 @@
+import isSymbol from '../isSymbol.js'
+
+/** Used as references for various `Number` constants. */
+const NAN = 0 / 0
+
+/**
+ * The base implementation of `toNumber` which doesn't ensure correct
+ * conversions of binary, hexadecimal, or octal string values.
+ *
+ * @private
+ * @param {*} value The value to process.
+ * @returns {number} Returns the number.
+ */
+function baseToNumber(value) {
+  if (typeof value === 'number') {
+    return value
+  }
+  if (isSymbol(value)) {
+    return NAN
+  }
+  return +value
+}
+
+export default baseToNumber

src/.internal/baseToString.ts

@@ -0,0 +1,33 @@
+import isSymbol from '../isSymbol.js'
+
+/** Used as references for various `Number` constants. */
+const INFINITY = 1 / 0
+
+/** Used to convert symbols to primitives and strings. */
+const symbolToString = Symbol.prototype.toString
+
+/**
+ * The base implementation of `toString` which doesn't convert nullish
+ * values to empty strings.
+ *
+ * @private
+ * @param {*} value The value to process.
+ * @returns {string} Returns the string.
+ */
+function baseToString(value) {
+  // Exit early for strings to avoid a performance hit in some environments.
+  if (typeof value === 'string') {
+    return value
+  }
+  if (Array.isArray(value)) {
+    // Recursively convert values (susceptible to call stack limits).
+    return `${value.map(baseToString)}`
+  }
+  if (isSymbol(value)) {
+    return symbolToString ? symbolToString.call(value) : ''
+  }
+  const result = `${value}`
+  return (result === '0' && (1 / value) === -INFINITY) ? '-0' : result
+}
+
+export default baseToString

src/.internal/baseUniq.ts

@@ -0,0 +1,73 @@
+import SetCache from './SetCache.js'
+import arrayIncludes from './arrayIncludes.js'
+import arrayIncludesWith from './arrayIncludesWith.js'
+import cacheHas from './cacheHas.js'
+import createSet from './createSet.js'
+import setToArray from './setToArray.js'
+
+/** Used as the size to enable large array optimizations. */
+const LARGE_ARRAY_SIZE = 200
+
+/**
+ * The base implementation of `uniqBy`.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {Function} [iteratee] The iteratee invoked per element.
+ * @param {Function} [comparator] The comparator invoked per element.
+ * @returns {Array} Returns the new duplicate free array.
+ */
+function baseUniq(array, iteratee, comparator) {
+  let index = -1
+  let includes = arrayIncludes
+  let isCommon = true
+
+  const { length } = array
+  const result = []
+  let seen = result
+
+  if (comparator) {
+    isCommon = false
+    includes = arrayIncludesWith
+  }
+  else if (length >= LARGE_ARRAY_SIZE) {
+    const set = iteratee ? null : createSet(array)
+    if (set) {
+      return setToArray(set)
+    }
+    isCommon = false
+    includes = cacheHas
+    seen = new SetCache
+  }
+  else {
+    seen = iteratee ? [] : result
+  }
+  outer:
+  while (++index < length) {
+    let value = array[index]
+    const computed = iteratee ? iteratee(value) : value
+
+    value = (comparator || value !== 0) ? value : 0
+    if (isCommon && computed === computed) {
+      let seenIndex = seen.length
+      while (seenIndex--) {
+        if (seen[seenIndex] === computed) {
+          continue outer
+        }
+      }
+      if (iteratee) {
+        seen.push(computed)
+      }
+      result.push(value)
+    }
+    else if (!includes(seen, computed, comparator)) {
+      if (seen !== result) {
+        seen.push(computed)
+      }
+      result.push(value)
+    }
+  }
+  return result
+}
+
+export default baseUniq