[ { "path": ".editorconfig", "content": "# EditorConfig helps developers define and maintain consistent\n# coding styles between different editors and IDEs\n# editorconfig.org\n\nroot = true\n\n\n[*]\n\nindent_style = space\nindent_size = 2\ncharset = utf-8\ninsert_final_newline = true\ntrim_trailing_whitespace = true\n\n[**/package.json]\nindent_size = 2\n" }, { "path": ".eslintrc", "content": "{\n \"env\": {\n \"browser\": true,\n \"node\": true,\n \"amd\": true\n },\n \"parserOptions\": {\n \"ecmaVersion\": 3\n }\n}\n" }, { "path": ".github/FUNDING.yml", "content": "tidelift: \"npm/underscore\"\npatreon: juliangonggrijp\ngithub: [jgonggrijp]\n" }, { "path": ".github/config/codeql.yml", "content": "paths:\n - 'modules/**'\n - 'test/**'\n - 'test-treeshake/**'\n - 'rollup*.js'\n - 'index.html'\n" }, { "path": ".github/workflows/codeql-analysis.yml", "content": "# For most projects, this workflow file will not need changing; you simply need\n# to commit it to your repository.\n#\n# You may wish to alter this file to override the set of languages analyzed,\n# or to provide custom queries or build logic.\n#\n# ******** NOTE ********\n# We have attempted to detect the languages in your repository. Please check\n# the `language` matrix defined below to confirm you have the correct set of\n# supported CodeQL languages.\n#\nname: \"CodeQL\"\n\non:\n push:\n branches: [ master ]\n pull_request:\n # The branches below must be a subset of the branches above\n branches: [ master ]\n paths:\n - 'modules/**'\n - 'test/**'\n - 'test-treeshake/**'\n - 'rollup*.js'\n - 'index.html'\n schedule:\n - cron: '16 8 * * 3'\n\njobs:\n analyze:\n name: Analyze\n runs-on: ubuntu-latest\n permissions:\n actions: read\n contents: read\n security-events: write\n\n strategy:\n fail-fast: false\n matrix:\n language: [ 'javascript' ]\n # CodeQL supports [ 'cpp', 'csharp', 'go', 'java', 'javascript', 'python', 'ruby' ]\n # Learn more about CodeQL language support at\n # https://codeql.github.com/docs/codeql-overview/supported-languages-and-frameworks/\n\n steps:\n - name: Checkout repository\n uses: actions/checkout@v4\n\n # Initializes the CodeQL tools for scanning.\n - name: Initialize CodeQL\n uses: github/codeql-action/init@v3\n with:\n languages: ${{ matrix.language }}\n # If you wish to specify custom queries, you can do so here or in a config file.\n # By default, queries listed here will override any specified in a config file.\n # Prefix the list here with \"+\" to use these queries and those in the config file.\n # queries: ./path/to/local/query, your-org/your-repo/queries@main\n config-file: ./.github/config/codeql.yml\n\n # Autobuild attempts to build any compiled languages (C/C++, C#, or Java).\n # If this step fails, then you should remove it and run the build manually (see below)\n - name: Autobuild\n uses: github/codeql-action/autobuild@v3\n\n # ℹ️ Command-line programs to run using the OS shell.\n # 📚 https://docs.github.com/en/actions/using-workflows/workflow-syntax-for-github-actions\n\n # ✏️ If the Autobuild fails above, remove it and uncomment the following three lines\n # and modify them (or add more) to build your code if your project\n # uses a compiled language\n\n #- run: |\n # make bootstrap\n # make release\n\n - name: Perform CodeQL Analysis\n uses: github/codeql-action/analyze@v3\n" }, { "path": ".gitignore", "content": "raw\nnode_modules\n*.log\n*.idea\n*.swp\nnyc_output\ncoverage\ntest-treeshake/*-umd.js\namd\ncjs\n/underscore-node-*-pre*\n" }, { "path": ".travis.yml", "content": "language: node_js\nsudo: false\njobs:\n include:\n - node_js: 8\n env:\n - DOWNGRADE=true\n - EXTRA=false\n - node_js: 12\n env:\n - DOWNGRADE=false\n - EXTRA=false\n - node_js: 16\n env:\n - DOWNGRADE=false\n - EXTRA=true\nbefore_install:\n - \"[ $EXTRA = false ] || npm install -g karma-cli\"\nbefore_script:\n - \"[ $EXTRA = false ] || npm install karma-sauce-launcher\"\n - \"[ $DOWNGRADE = false ] || npm install rollup@1\"\nscript:\n - \"[ $EXTRA = false ] || npm run lint\"\n - npm run prepare-tests\n - \"[ $EXTRA = false ] || npm run build-umd\"\n - \"[ $EXTRA = false ] || npm run build-esm\"\n - \"[ $EXTRA = false ] || npm run doc\"\n - \"[ $EXTRA = true ] || npm run test-node\"\n - \"[ $EXTRA = false ] || npm run coveralls\"\n - \"[ $EXTRA = false ] || npm run test-browser\"\n - \"[ $EXTRA = false ] || karma start karma.conf-sauce.js\"\nnotifications:\n email: false\nenv:\n global:\n - NPM_CONFIG_PROGRESS=\"false\"\n - secure: bDZSBQfqr21hCayjcZ20IxrV6+XGhxQPFIfwWqEKLrF93Gu8LLVjZRxXE/mE8I8N4Z5WtDNb4ZHrm/TTzmcPa5MuHgIxEdknQCncobH8oimwc83SHwEPk6okeNKl39VlCjvvnmoe/V/KpnknuYn3Rqghtl/Uv9KLpCwskwjTtcw=\n - secure: SRECgXuwcZTcD3GVxTS2bYNgRyye4vq6BLrV2PH9FyNenowsKQR2EwlC/dppc1Q8NWMgv79J/R96q9JOFh+mEH9L5dlBb2yhnGH8amVeM/ChAJHT/F8YktKM453uVpz5fR00QcCQDDUOx6Pvx374ID0OKNpWKAkQBWA9mPTsLnE=\n" }, { "path": "CNAME", "content": "underscorejs.org\n" }, { "path": "CODE_OF_CONDUCT.md", "content": "# Contributor Covenant Code of Conduct\n\n## Our Pledge\n\nIn the interest of fostering an open and welcoming environment, we as\ncontributors and maintainers pledge to making participation in our project and\nour community a harassment-free experience for everyone, regardless of age, body\nsize, disability, ethnicity, gender identity and expression, level of experience,\nnationality, personal appearance, race, religion, or sexual identity and\norientation.\n\n## Our Standards\n\nExamples of behavior that contributes to creating a positive environment\ninclude:\n\n* Using welcoming and inclusive language\n* Being respectful of differing viewpoints and experiences\n* Gracefully accepting constructive criticism\n* Focusing on what is best for the community\n* Showing empathy towards other community members\n\nExamples of unacceptable behavior by participants include:\n\n* The use of sexualized language or imagery and unwelcome sexual attention or\nadvances\n* Trolling, insulting/derogatory comments, and personal or political attacks\n* Public or private harassment\n* Publishing others' private information, such as a physical or electronic\n address, without explicit permission\n* Other conduct which could reasonably be considered inappropriate in a\n professional setting\n\n## Our Responsibilities\n\nProject maintainers are responsible for clarifying the standards of acceptable\nbehavior and are expected to take appropriate and fair corrective action in\nresponse to any instances of unacceptable behavior.\n\nProject maintainers have the right and responsibility to remove, edit, or\nreject comments, commits, code, wiki edits, issues, and other contributions\nthat are not aligned to this Code of Conduct, or to ban temporarily or\npermanently any contributor for other behaviors that they deem inappropriate,\nthreatening, offensive, or harmful.\n\n## Scope\n\nThis Code of Conduct applies both within project spaces and in public spaces\nwhen an individual is representing the project or its community. Examples of\nrepresenting a project or community include using an official project e-mail\naddress, posting via an official social media account, or acting as an appointed\nrepresentative at an online or offline event. Representation of a project may be\nfurther defined and clarified by project maintainers.\n\n## Enforcement\n\nInstances of abusive, harassing, or otherwise unacceptable behavior may be\nreported by contacting the project team at jashkenas@gmail.com. The project team\nwill review and investigate all complaints, and will respond in a way that it deems\nappropriate to the circumstances. The project team is obligated to maintain\nconfidentiality with regard to the reporter of an incident.\nProject maintainers who do not follow or enforce the Code of Conduct in good\nfaith may face temporary or permanent repercussions as determined by other\nmembers of the project's leadership.\n\n## Moderation\n\nEdits of another user's comment must be clearly marked with \"**edit**\", the\nmoderator's username, and a timestamp for each occurrence. The only acceptable\nreasons for editing another user's comment are:\n\n1. to edit out violations of Our Pledge. These edits must include a rationale.\n2. to direct future readers to a relevant point later in the conversation\n (usually the resolution). These edits must be append-only.\n\nDeletion of another user's comment is only acceptable when the comment includes\nno original value, such as \"+1\", \":+1:\", or \"me too\".\n\n## Self-Moderation\n\nEdits of your own comment after someone has responded must be append-only and\nclearly marked with \"**edit**\". Typographical and formatting fixes to your own\ncomment which do not affect its meaning are exempt from this requirement.\nDeletion of your own comment is only acceptable before any later comments have\nbeen posted.\n\n## Attribution\n\nThis Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4,\navailable at [https://contributor-covenant.org/version/1/4][version]\n\n[homepage]: https://contributor-covenant.org\n[version]: https://contributor-covenant.org/version/1/4/\n" }, { "path": "CONTRIBUTING.md", "content": "## How to contribute to Underscore.js\n\n* This project adheres to a [code of conduct](CODE_OF_CONDUCT.md). By participating, you are expected to uphold this code.\n\n* Please do not open an issue to report a security issue. Consult the [security policy](SECURITY.md) on what to do instead.\n\n* Before you open an issue or send a pull request, [search](https://github.com/jashkenas/underscore/issues) for previous discussions about the same feature or issue. Add to the earlier ticket if you find one.\n\n* If you're proposing a new feature, make sure it isn't already implemented in [Underscore-Contrib](https://github.com/documentcloud/underscore-contrib).\n\n* When contributing code, make sure that you edit the source code in the `modules/` directory. Also, run `npm install` before committing any changes to ensure that our commit hooks can do their work.\n\n* Before sending a pull request for a feature, be sure to have [tests](https://underscorejs.org/test/).\n\n* Use the same coding style as the rest of the [codebase](https://github.com/jashkenas/underscore/blob/master/modules/index.js).\n\n* In your pull request, do not add documentation or re-build the minified `underscore-umd-min.js` file. We'll do those things before cutting a new release.\n\n### \"Help, cloning fails with `fatal: fsck error in packed object`\"\nThis error is caused by zero-padded file modes in the commit history. As fixing this is highly destructive, we suggest ignoring these warnings. The simplest way is to instruct git to do so when cloning. For example, to clone from `jashkenas/underscore`, run the following command: `git clone --config transfer.fsckobjects=false git@github.com:jashkenas/underscore.git`. If cloning from a different user or organization, replace `jashkenas` with their name in the previous command." }, { "path": "LICENSE", "content": "Copyright (c) 2009-2022 Jeremy Ashkenas, Julian Gonggrijp, and DocumentCloud and Investigative Reporters & Editors\n\nPermission is hereby granted, free of charge, to any person\nobtaining a copy of this software and associated documentation\nfiles (the \"Software\"), to deal in the Software without\nrestriction, including without limitation the rights to use,\ncopy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the\nSoftware is furnished to do so, subject to the following\nconditions:\n\nThe above copyright notice and this permission notice shall be\nincluded in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\nOF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\nNONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\nHOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\nWHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\nFROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\nOTHER DEALINGS IN THE SOFTWARE.\n" }, { "path": "README.md", "content": " __\n /\\ \\ __\n __ __ ___ \\_\\ \\ __ _ __ ____ ___ ___ _ __ __ /\\_\\ ____\n /\\ \\/\\ \\ /' _ `\\ /'_ \\ /'__`\\/\\ __\\/ ,__\\ / ___\\ / __`\\/\\ __\\/'__`\\ \\/\\ \\ /',__\\\n \\ \\ \\_\\ \\/\\ \\/\\ \\/\\ \\ \\ \\/\\ __/\\ \\ \\//\\__, `\\/\\ \\__//\\ \\ \\ \\ \\ \\//\\ __/ __ \\ \\ \\/\\__, `\\\n \\ \\____/\\ \\_\\ \\_\\ \\___,_\\ \\____\\\\ \\_\\\\/\\____/\\ \\____\\ \\____/\\ \\_\\\\ \\____\\/\\_\\ _\\ \\ \\/\\____/\n \\/___/ \\/_/\\/_/\\/__,_ /\\/____/ \\/_/ \\/___/ \\/____/\\/___/ \\/_/ \\/____/\\/_//\\ \\_\\ \\/___/\n \\ \\____/\n \\/___/\n\nUnderscore.js is a utility-belt library for JavaScript that provides\nsupport for the usual functional suspects (each, map, reduce, filter...)\nwithout extending any core JavaScript objects.\n\nFor Docs, License, Tests, and pre-packed downloads, see:\nhttps://underscorejs.org\n\nFor support and questions, please consult\nour [security policy](SECURITY.md),\n[the gitter channel](https://gitter.im/jashkenas/underscore)\nor [stackoverflow](https://stackoverflow.com/search?q=underscore.js)\n\nUnderscore is an open-sourced component of DocumentCloud:\nhttps://github.com/documentcloud\n\nMany thanks to our contributors:\nhttps://github.com/jashkenas/underscore/contributors\n\nYou can support the project by donating on\n[Patreon](https://patreon.com/juliangonggrijp).\nEnterprise coverage is available as part of the\n[Tidelift Subscription](https://tidelift.com/subscription/pkg/npm-underscore?utm_source=npm-underscore&utm_medium=referral&utm_campaign=enterprise).\n\nThis project adheres to a [code of conduct](CODE_OF_CONDUCT.md). By participating, you are expected to uphold this code.\n" }, { "path": "SECURITY.md", "content": "# Security Policy\n\n## Supported Versions\n\nWe currently support the following versions of Underscore with security updates:\n\n- the latest commit on the `master` branch (published as \"edge\" on the\n [project website][website]);\n- the 1.x release tagged as [latest][npm-latest] on npm;\n- any release tagged as [preview][npm-preview] on npm, if present.\n\n[website]: https://underscorejs.org\n[npm-latest]: https://www.npmjs.com/package/underscore/v/latest\n[npm-preview]: https://www.npmjs.com/package/underscore/v/preview\n\n## Reporting a Vulnerability\n\nPlease report security issues by sending an email to\ndev@juliangonggrijp.com and jashkenas@gmail.com.\n\nDo __not__ submit an issue ticket or pull request or otherwise publicly\ndisclose the issue.\n\nAfter receiving your email, we will respond as soon as possible and indicate\nwhat we plan to do.\n\n## Disclosure policy\n\nAfter confirming a vulnerability, we will generally release a security update\nas soon as possible, including the minimum amount of information required for\nsoftware maintainers and system administrators to assess the urgency of the\nupdate for their particular situation.\n\nWe postpone the publication of any further details such as code comments,\ntests, commit history and diffs, in order to enable a substantial share of the\nusers to install the security fix before this time.\n\nUpon publication of full details, we will credit the reporter if the reporter wishes to be publicly identified.\n" }, { "path": "bower.json", "content": "{\n \"name\": \"underscore\",\n \"main\": \"underscore-umd.js\",\n \"keywords\": [\"util\", \"functional\", \"server\", \"client\", \"browser\"],\n \"ignore\" : [\"docs\", \"test\", \"*.yml\", \"CNAME\", \"index.html\", \"favicon.ico\", \"CONTRIBUTING.md\", \".*\", \"package.json\", \"karma.*\"]\n}\n" }, { "path": "docs/.eslintrc", "content": "{\n \"globals\": {\n \"_\": true,\n \"parserOptions\": {},\n \"rules\": [],\n }\n}\n" }, { "path": "docs/docco.css", "content": "/*--------------------- Typography ----------------------------*/\n\n@font-face {\n font-family: 'aller-light';\n src: url('public/fonts/aller-light.eot');\n src: url('public/fonts/aller-light.eot?#iefix') format('embedded-opentype'),\n url('public/fonts/aller-light.woff') format('woff'),\n url('public/fonts/aller-light.ttf') format('truetype');\n font-weight: normal;\n font-style: normal;\n}\n\n@font-face {\n font-family: 'aller-bold';\n src: url('public/fonts/aller-bold.eot');\n src: url('public/fonts/aller-bold.eot?#iefix') format('embedded-opentype'),\n url('public/fonts/aller-bold.woff') format('woff'),\n url('public/fonts/aller-bold.ttf') format('truetype');\n font-weight: normal;\n font-style: normal;\n}\n\n@font-face {\n font-family: 'roboto-black';\n src: url('public/fonts/roboto-black.eot');\n src: url('public/fonts/roboto-black.eot?#iefix') format('embedded-opentype'),\n url('public/fonts/roboto-black.woff') format('woff'),\n url('public/fonts/roboto-black.ttf') format('truetype');\n font-weight: normal;\n font-style: normal;\n}\n\n/*--------------------- Layout ----------------------------*/\nhtml { height: 100%; }\nbody {\n font-family: \"aller-light\";\n font-size: 14px;\n line-height: 18px;\n color: #30404f;\n margin: 0; padding: 0;\n height:100%;\n}\n#container { min-height: 100%; }\n\na {\n color: #000;\n}\n\nb, strong {\n font-weight: normal;\n font-family: \"aller-bold\";\n}\n\np {\n margin: 15px 0 0px;\n}\n .annotation ul, .annotation ol {\n margin: 25px 0;\n }\n .annotation ul li, .annotation ol li {\n font-size: 14px;\n line-height: 18px;\n margin: 10px 0;\n }\n\nh1, h2, h3, h4, h5, h6 {\n color: #112233;\n line-height: 1em;\n font-weight: normal;\n font-family: \"roboto-black\";\n text-transform: uppercase;\n margin: 30px 0 15px 0;\n}\n\nh1 {\n margin-top: 40px;\n}\nh2 {\n font-size: 1.26em;\n}\n\nhr {\n border: 0;\n background: 1px #ddd;\n height: 1px;\n margin: 20px 0;\n}\n\npre, tt, code {\n font-size: 12px; line-height: 16px;\n font-family: Menlo, Monaco, Consolas, \"Lucida Console\", monospace;\n margin: 0; padding: 0;\n}\n .annotation pre {\n display: block;\n margin: 0;\n padding: 7px 10px;\n background: #fcfcfc;\n -moz-box-shadow: inset 0 0 10px rgba(0,0,0,0.1);\n -webkit-box-shadow: inset 0 0 10px rgba(0,0,0,0.1);\n box-shadow: inset 0 0 10px rgba(0,0,0,0.1);\n overflow-x: auto;\n }\n .annotation pre code {\n border: 0;\n padding: 0;\n background: transparent;\n }\n\n\nblockquote {\n border-left: 5px solid #ccc;\n margin: 0;\n padding: 1px 0 1px 1em;\n}\n .sections blockquote p {\n font-family: Menlo, Consolas, Monaco, monospace;\n font-size: 12px; line-height: 16px;\n color: #999;\n margin: 10px 0 0;\n white-space: pre-wrap;\n }\n\nul.sections {\n list-style: none;\n padding:0 0 5px 0;;\n margin:0;\n}\n\n/*\n Force border-box so that % widths fit the parent\n container without overlap because of margin/padding.\n\n More Info : http://www.quirksmode.org/css/box.html\n*/\nul.sections > li > div {\n -moz-box-sizing: border-box; /* firefox */\n -ms-box-sizing: border-box; /* ie */\n -webkit-box-sizing: border-box; /* webkit */\n -khtml-box-sizing: border-box; /* konqueror */\n box-sizing: border-box; /* css3 */\n}\n\n\n/*---------------------- Jump Page -----------------------------*/\n#jump_to, #jump_page {\n margin: 0;\n background: white;\n -webkit-box-shadow: 0 0 25px #777; -moz-box-shadow: 0 0 25px #777;\n -webkit-border-bottom-left-radius: 5px; -moz-border-radius-bottomleft: 5px;\n font: 16px Arial;\n cursor: pointer;\n text-align: right;\n list-style: none;\n}\n\n#jump_to a {\n text-decoration: none;\n}\n\n#jump_to a.large {\n display: none;\n}\n#jump_to a.small {\n font-size: 22px;\n font-weight: bold;\n color: #676767;\n}\n\n#jump_to, #jump_wrapper {\n position: fixed;\n right: 0; top: 0;\n padding: 10px 15px;\n margin:0;\n}\n\n#jump_wrapper {\n display: none;\n padding:0;\n}\n\n#jump_to:hover #jump_wrapper {\n display: block;\n}\n\n#jump_page_wrapper{\n position: fixed;\n right: 0;\n top: 0;\n bottom: 0;\n}\n\n#jump_page {\n padding: 5px 0 3px;\n margin: 0 0 25px 25px;\n max-height: 100%;\n overflow: auto;\n}\n\n#jump_page .source {\n display: block;\n padding: 15px;\n text-decoration: none;\n border-top: 1px solid #eee;\n}\n\n#jump_page .source:hover {\n background: #f5f5ff;\n}\n\n#jump_page .source:first-child {\n}\n\n/*---------------------- Low resolutions (> 320px) ---------------------*/\n@media only screen and (min-width: 320px) {\n .pilwrap { display: none; }\n\n ul.sections > li > div {\n display: block;\n padding:5px 10px 0 10px;\n }\n\n ul.sections > li > div.annotation ul, ul.sections > li > div.annotation ol {\n padding-left: 30px;\n }\n\n ul.sections > li > div.content {\n overflow-x:auto;\n -webkit-box-shadow: inset 0 0 5px #e5e5ee;\n box-shadow: inset 0 0 5px #e5e5ee;\n border: 1px solid #dedede;\n margin:5px 10px 5px 10px;\n padding-bottom: 5px;\n }\n\n ul.sections > li > div.annotation pre {\n margin: 7px 0 7px;\n padding-left: 15px;\n }\n\n ul.sections > li > div.annotation p tt, .annotation code {\n background: #f8f8ff;\n border: 1px solid #dedede;\n font-size: 12px;\n padding: 0 0.2em;\n }\n}\n\n/*---------------------- (> 481px) ---------------------*/\n@media only screen and (min-width: 481px) {\n #container {\n position: relative;\n }\n body {\n background-color: #F5F5FF;\n font-size: 15px;\n line-height: 21px;\n }\n pre, tt, code {\n line-height: 18px;\n }\n p, ul, ol {\n margin: 0 0 15px;\n }\n\n\n #jump_to {\n padding: 5px 10px;\n }\n #jump_wrapper {\n padding: 0;\n }\n #jump_to, #jump_page {\n font: 10px Arial;\n text-transform: uppercase;\n }\n #jump_page .source {\n padding: 5px 10px;\n }\n #jump_to a.large {\n display: inline-block;\n }\n #jump_to a.small {\n display: none;\n }\n\n\n\n #background {\n position: absolute;\n top: 0; bottom: 0;\n width: 350px;\n background: #fff;\n border-right: 1px solid #e5e5ee;\n z-index: -1;\n }\n\n ul.sections > li > div.annotation ul, ul.sections > li > div.annotation ol {\n padding-left: 40px;\n }\n\n ul.sections > li {\n white-space: nowrap;\n }\n\n ul.sections > li > div {\n display: inline-block;\n }\n\n ul.sections > li > div.annotation {\n max-width: 350px;\n min-width: 350px;\n min-height: 5px;\n padding: 13px;\n overflow-x: hidden;\n white-space: normal;\n vertical-align: top;\n text-align: left;\n }\n ul.sections > li > div.annotation pre {\n margin: 15px 0 15px;\n padding-left: 15px;\n }\n\n ul.sections > li > div.content {\n padding: 13px;\n vertical-align: top;\n border: none;\n -webkit-box-shadow: none;\n box-shadow: none;\n }\n\n .pilwrap {\n position: relative;\n display: inline;\n }\n\n .pilcrow {\n font: 12px Arial;\n text-decoration: none;\n color: #454545;\n position: absolute;\n top: 3px; left: -20px;\n padding: 1px 2px;\n opacity: 0;\n -webkit-transition: opacity 0.2s linear;\n }\n .for-h1 .pilcrow {\n top: 47px;\n }\n .for-h2 .pilcrow, .for-h3 .pilcrow, .for-h4 .pilcrow {\n top: 35px;\n }\n\n ul.sections > li > div.annotation:hover .pilcrow {\n opacity: 1;\n }\n}\n\n/*---------------------- (> 1025px) ---------------------*/\n@media only screen and (min-width: 1025px) {\n\n body {\n font-size: 16px;\n line-height: 24px;\n }\n\n #background {\n width: 525px;\n }\n ul.sections > li > div.annotation {\n max-width: 525px;\n min-width: 525px;\n padding: 10px 25px 1px 50px;\n }\n ul.sections > li > div.content {\n padding: 9px 15px 16px 25px;\n }\n}\n\n/*---------------------- Syntax Highlighting -----------------------------*/\n\ntd.linenos { background-color: #f0f0f0; padding-right: 10px; }\nspan.lineno { background-color: #f0f0f0; padding: 0 5px 0 5px; }\n/*\n\ngithub.com style (c) Vasily Polovnyov \n\n*/\n\npre code {\n display: block; padding: 0.5em;\n color: #000;\n background: #f8f8ff\n}\n\npre .hljs-comment,\npre .hljs-template_comment,\npre .hljs-diff .hljs-header,\npre .hljs-javadoc {\n color: #408080;\n font-style: italic\n}\n\npre .hljs-keyword,\npre .hljs-assignment,\npre .hljs-literal,\npre .hljs-css .hljs-rule .hljs-keyword,\npre .hljs-winutils,\npre .hljs-javascript .hljs-title,\npre .hljs-lisp .hljs-title,\npre .hljs-subst {\n color: #954121;\n /*font-weight: bold*/\n}\n\npre .hljs-number,\npre .hljs-hexcolor {\n color: #40a070\n}\n\npre .hljs-string,\npre .hljs-tag .hljs-value,\npre .hljs-phpdoc,\npre .hljs-tex .hljs-formula {\n color: #219161;\n}\n\npre .hljs-title,\npre .hljs-id {\n color: #19469D;\n}\npre .hljs-params {\n color: #00F;\n}\n\npre .hljs-javascript .hljs-title,\npre .hljs-lisp .hljs-title,\npre .hljs-subst {\n font-weight: normal\n}\n\npre .hljs-class .hljs-title,\npre .hljs-haskell .hljs-label,\npre .hljs-tex .hljs-command {\n color: #458;\n font-weight: bold\n}\n\npre .hljs-tag,\npre .hljs-tag .hljs-title,\npre .hljs-rules .hljs-property,\npre .hljs-django .hljs-tag .hljs-keyword {\n color: #000080;\n font-weight: normal\n}\n\npre .hljs-attribute,\npre .hljs-variable,\npre .hljs-instancevar,\npre .hljs-lisp .hljs-body {\n color: #008080\n}\n\npre .hljs-regexp {\n color: #B68\n}\n\npre .hljs-class {\n color: #458;\n font-weight: bold\n}\n\npre .hljs-symbol,\npre .hljs-ruby .hljs-symbol .hljs-string,\npre .hljs-ruby .hljs-symbol .hljs-keyword,\npre .hljs-ruby .hljs-symbol .hljs-keymethods,\npre .hljs-lisp .hljs-keyword,\npre .hljs-tex .hljs-special,\npre .hljs-input_number {\n color: #990073\n}\n\npre .hljs-builtin,\npre .hljs-constructor,\npre .hljs-built_in,\npre .hljs-lisp .hljs-title {\n color: #0086b3\n}\n\npre .hljs-preprocessor,\npre .hljs-pi,\npre .hljs-doctype,\npre .hljs-shebang,\npre .hljs-cdata {\n color: #999;\n font-weight: bold\n}\n\npre .hljs-deletion {\n background: #fdd\n}\n\npre .hljs-addition {\n background: #dfd\n}\n\npre .hljs-diff .hljs-change {\n background: #0086b3\n}\n\npre .hljs-chunk {\n color: #aaa\n}\n\npre .hljs-tex .hljs-formula {\n opacity: 0.5;\n}\n" }, { "path": "docs/linked-esm.jst", "content": "<% /*\n This is an extended version of the resources/parallel/docco.jst that is\n bundled with Docco 0.8.0.\n The license of the original file is available over here:\n https://github.com/jashkenas/docco/blob/master/LICENSE.\n The extension adds hyperlinking to javascript import statements.\n*/ %>\n\n\n\n\n <%= title %>\n \n \n \" />\n\n\n
\n
\n <% if (sources.length > 1) { %>\n \n <% } %>\n \n
\n <% /* Start of hyperlinking extension */ %>\n \n \n <% /* End of hyperlinking extension */ %>\n\n\n" }, { "path": "docs/main.js", "content": "(function() {\n var functions = document.querySelectorAll('[data-name]');\n var sections = document.querySelectorAll('.searchable_section');\n var searchInput = document.getElementById('function_filter');\n\n function searchValue() {\n return searchInput.value.trim().replace(/^_\\.?/, '');\n }\n\n function strIn(a, b) {\n a = a.toLowerCase();\n b = b.toLowerCase();\n return b.indexOf(a) >= 0;\n }\n\n function doesMatch(element) {\n var name = element.getAttribute('data-name');\n var aliases = element.getAttribute('data-aliases') || '';\n var value = searchValue();\n return strIn(value, name) || strIn(value, aliases);\n }\n\n function filterElement(element) {\n element.style.display = doesMatch(element) ? '' : 'none';\n }\n\n function filterToc() {\n _.each(functions, filterElement);\n\n var emptySearch = searchValue() === '';\n\n // Hide the titles of empty sections\n _.each(sections, function(section) {\n var sectionFunctions = section.querySelectorAll('[data-name]');\n var showSection = emptySearch || _.some(sectionFunctions, doesMatch);\n section.style.display = showSection ? '' : 'none';\n });\n }\n\n function gotoFirst() {\n var firstFunction = _.find(functions, doesMatch);\n if (firstFunction) {\n window.location.hash = firstFunction.getAttribute('data-name');\n searchInput.focus();\n }\n }\n\n searchInput.addEventListener('input', filterToc, false);\n\n // Press \"Enter\" to jump to the first matching function\n searchInput.addEventListener('keypress', function(e) {\n if (e.which === 13) {\n gotoFirst();\n }\n });\n\n // Press \"/\" to search\n document.body.addEventListener('keyup', function(event) {\n if (191 === event.which) {\n searchInput.focus();\n }\n });\n}());\n" }, { "path": "docs/modules/_baseCreate.html", "content": "\n\n\n\n\n _baseCreate.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_baseIteratee.html", "content": "\n\n\n\n\n _baseIteratee.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_cb.html", "content": "\n\n\n\n\n _cb.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_chainResult.html", "content": "\n\n\n\n\n _chainResult.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_collectNonEnumProps.html", "content": "\n\n\n\n\n _collectNonEnumProps.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_createAssigner.html", "content": "\n\n\n\n\n _createAssigner.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_createEscaper.html", "content": "\n\n\n\n\n _createEscaper.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_createIndexFinder.html", "content": "\n\n\n\n\n _createIndexFinder.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_createPredicateIndexFinder.html", "content": "\n\n\n\n\n _createPredicateIndexFinder.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_createReduce.html", "content": "\n\n\n\n\n _createReduce.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_createSizePropertyCheck.html", "content": "\n\n\n\n\n _createSizePropertyCheck.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_deepGet.html", "content": "\n\n\n\n\n _deepGet.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_escapeMap.html", "content": "\n\n\n\n\n _escapeMap.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_executeBound.html", "content": "\n\n\n\n\n _executeBound.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_flatten.html", "content": "\n\n\n\n\n _flatten.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_getByteLength.html", "content": "\n\n\n\n\n _getByteLength.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_getLength.html", "content": "\n\n\n\n\n _getLength.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_group.html", "content": "\n\n\n\n\n _group.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_has.html", "content": "\n\n\n\n\n _has.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_hasObjectTag.html", "content": "\n\n\n\n\n _hasObjectTag.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_isArrayLike.html", "content": "\n\n\n\n\n _isArrayLike.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_isBufferLike.html", "content": "\n\n\n\n\n _isBufferLike.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_keyInObj.html", "content": "\n\n\n\n\n _keyInObj.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_methodFingerprint.html", "content": "\n\n\n\n\n _methodFingerprint.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_optimizeCb.html", "content": "\n\n\n\n\n _optimizeCb.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_setup.html", "content": "\n\n\n\n\n _setup.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_shallowProperty.html", "content": "\n\n\n\n\n _shallowProperty.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_stringTagBug.html", "content": "\n\n\n\n\n _stringTagBug.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_tagTester.html", "content": "\n\n\n\n\n _tagTester.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_toBufferView.html", "content": "\n\n\n\n\n _toBufferView.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_toPath.html", "content": "\n\n\n\n\n _toPath.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/_unescapeMap.html", "content": "\n\n\n\n\n _unescapeMap.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/after.html", "content": "\n\n\n\n\n after.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/allKeys.html", "content": "\n\n\n\n\n allKeys.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/before.html", "content": "\n\n\n\n\n before.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/bind.html", "content": "\n\n\n\n\n bind.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/bindAll.html", "content": "\n\n\n\n\n bindAll.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/chain.html", "content": "\n\n\n\n\n chain.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/chunk.html", "content": "\n\n\n\n\n chunk.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/clone.html", "content": "\n\n\n\n\n clone.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/compact.html", "content": "\n\n\n\n\n compact.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/compose.html", "content": "\n\n\n\n\n compose.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/constant.html", "content": "\n\n\n\n\n constant.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/contains.html", "content": "\n\n\n\n\n contains.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/countBy.html", "content": "\n\n\n\n\n countBy.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/create.html", "content": "\n\n\n\n\n create.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/debounce.html", "content": "\n\n\n\n\n debounce.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/defaults.html", "content": "\n\n\n\n\n defaults.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/defer.html", "content": "\n\n\n\n\n defer.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/delay.html", "content": "\n\n\n\n\n delay.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/difference.html", "content": "\n\n\n\n\n difference.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/each.html", "content": "\n\n\n\n\n each.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/escape.html", "content": "\n\n\n\n\n escape.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/every.html", "content": "\n\n\n\n\n every.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/extend.html", "content": "\n\n\n\n\n extend.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/extendOwn.html", "content": "\n\n\n\n\n extendOwn.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/filter.html", "content": "\n\n\n\n\n filter.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/find.html", "content": "\n\n\n\n\n find.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/findIndex.html", "content": "\n\n\n\n\n findIndex.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/findKey.html", "content": "\n\n\n\n\n findKey.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/findLastIndex.html", "content": "\n\n\n\n\n findLastIndex.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/findWhere.html", "content": "\n\n\n\n\n findWhere.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/first.html", "content": "\n\n\n\n\n first.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/flatten.html", "content": "\n\n\n\n\n flatten.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/functions.html", "content": "\n\n\n\n\n functions.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/get.html", "content": "\n\n\n\n\n get.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/groupBy.html", "content": "\n\n\n\n\n groupBy.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/has.html", "content": "\n\n\n\n\n has.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/identity.html", "content": "\n\n\n\n\n identity.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/index-all.html", "content": "\n\n\n\n\n ESM Exports\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/index-default.html", "content": "\n\n\n\n\n Default Export\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/index.html", "content": "\n\n\n\n\n Named Exports\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/indexBy.html", "content": "\n\n\n\n\n indexBy.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/indexOf.html", "content": "\n\n\n\n\n indexOf.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/initial.html", "content": "\n\n\n\n\n initial.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/intersection.html", "content": "\n\n\n\n\n intersection.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/invert.html", "content": "\n\n\n\n\n invert.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/invoke.html", "content": "\n\n\n\n\n invoke.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/isArguments.html", "content": "\n\n\n\n\n isArguments.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/isArray.html", "content": "\n\n\n\n\n isArray.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/isArrayBuffer.html", "content": "\n\n\n\n\n isArrayBuffer.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/isBoolean.html", "content": "\n\n\n\n\n isBoolean.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/isDataView.html", "content": "\n\n\n\n\n isDataView.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/isDate.html", "content": "\n\n\n\n\n isDate.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/isElement.html", "content": "\n\n\n\n\n isElement.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/isEmpty.html", "content": "\n\n\n\n\n isEmpty.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/isEqual.html", "content": "\n\n\n\n\n isEqual.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/isError.html", "content": "\n\n\n\n\n isError.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/isFinite.html", "content": "\n\n\n\n\n isFinite.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/isFunction.html", "content": "\n\n\n\n\n isFunction.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/isMap.html", "content": "\n\n\n\n\n isMap.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/isMatch.html", "content": "\n\n\n\n\n isMatch.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/isNaN.html", "content": "\n\n\n\n\n isNaN.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/isNull.html", "content": "\n\n\n\n\n isNull.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/isNumber.html", "content": "\n\n\n\n\n isNumber.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/isObject.html", "content": "\n\n\n\n\n isObject.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/isRegExp.html", "content": "\n\n\n\n\n isRegExp.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/isSet.html", "content": "\n\n\n\n\n isSet.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/isString.html", "content": "\n\n\n\n\n isString.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/isSymbol.html", "content": "\n\n\n\n\n isSymbol.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/isTypedArray.html", "content": "\n\n\n\n\n isTypedArray.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/isUndefined.html", "content": "\n\n\n\n\n isUndefined.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/isWeakMap.html", "content": "\n\n\n\n\n isWeakMap.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/isWeakSet.html", "content": "\n\n\n\n\n isWeakSet.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/iteratee.html", "content": "\n\n\n\n\n iteratee.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/keys.html", "content": "\n\n\n\n\n keys.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/last.html", "content": "\n\n\n\n\n last.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/lastIndexOf.html", "content": "\n\n\n\n\n lastIndexOf.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/map.html", "content": "\n\n\n\n\n map.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/mapObject.html", "content": "\n\n\n\n\n mapObject.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/matcher.html", "content": "\n\n\n\n\n matcher.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/max.html", "content": "\n\n\n\n\n max.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/memoize.html", "content": "\n\n\n\n\n memoize.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/min.html", "content": "\n\n\n\n\n min.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/mixin.html", "content": "\n\n\n\n\n mixin.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/negate.html", "content": "\n\n\n\n\n negate.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/noop.html", "content": "\n\n\n\n\n noop.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/now.html", "content": "\n\n\n\n\n now.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/object.html", "content": "\n\n\n\n\n object.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/omit.html", "content": "\n\n\n\n\n omit.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/once.html", "content": "\n\n\n\n\n once.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/pairs.html", "content": "\n\n\n\n\n pairs.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/partial.html", "content": "\n\n\n\n\n partial.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/partition.html", "content": "\n\n\n\n\n partition.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/pick.html", "content": "\n\n\n\n\n pick.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/pluck.html", "content": "\n\n\n\n\n pluck.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/property.html", "content": "\n\n\n\n\n property.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/propertyOf.html", "content": "\n\n\n\n\n propertyOf.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/random.html", "content": "\n\n\n\n\n random.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/range.html", "content": "\n\n\n\n\n range.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/reduce.html", "content": "\n\n\n\n\n reduce.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/reduceRight.html", "content": "\n\n\n\n\n reduceRight.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/reject.html", "content": "\n\n\n\n\n reject.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/rest.html", "content": "\n\n\n\n\n rest.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/restArguments.html", "content": "\n\n\n\n\n restArguments.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/result.html", "content": "\n\n\n\n\n result.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/sample.html", "content": "\n\n\n\n\n sample.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/shuffle.html", "content": "\n\n\n\n\n shuffle.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/size.html", "content": "\n\n\n\n\n size.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/some.html", "content": "\n\n\n\n\n some.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/sortBy.html", "content": "\n\n\n\n\n sortBy.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/sortedIndex.html", "content": "\n\n\n\n\n sortedIndex.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/tap.html", "content": "\n\n\n\n\n tap.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/template.html", "content": "\n\n\n\n\n template.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/templateSettings.html", "content": "\n\n\n\n\n templateSettings.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/throttle.html", "content": "\n\n\n\n\n throttle.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/times.html", "content": "\n\n\n\n\n times.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/toArray.html", "content": "\n\n\n\n\n toArray.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/toPath.html", "content": "\n\n\n\n\n toPath.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/underscore-array-methods.html", "content": "\n\n\n\n\n underscore-array-methods.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/underscore.html", "content": "\n\n\n\n\n underscore.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/unescape.html", "content": "\n\n\n\n\n unescape.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/union.html", "content": "\n\n\n\n\n union.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/uniq.html", "content": "\n\n\n\n\n uniq.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/uniqueId.html", "content": "\n\n\n\n\n uniqueId.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/unzip.html", "content": "\n\n\n\n\n unzip.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/values.html", "content": "\n\n\n\n\n values.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/where.html", "content": "\n\n\n\n\n where.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/without.html", "content": "\n\n\n\n\n without.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/wrap.html", "content": "\n\n\n\n\n wrap.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/modules/zip.html", "content": "\n\n\n\n\n zip.js\n \n \n \n\n\n
\n
\n \n \n \n \n
\n \n \n \n \n\n\n" }, { "path": "docs/public/stylesheets/normalize.css", "content": "/*! normalize.css v2.0.1 | MIT License | git.io/normalize */\n\n/* ==========================================================================\n HTML5 display definitions\n ========================================================================== */\n\n/*\n * Corrects `block` display not defined in IE 8/9.\n */\n\narticle,\naside,\ndetails,\nfigcaption,\nfigure,\nfooter,\nheader,\nhgroup,\nnav,\nsection,\nsummary {\n display: block;\n}\n\n/*\n * Corrects `inline-block` display not defined in IE 8/9.\n */\n\naudio,\ncanvas,\nvideo {\n display: inline-block;\n}\n\n/*\n * Prevents modern browsers from displaying `audio` without controls.\n * Remove excess height in iOS 5 devices.\n */\n\naudio:not([controls]) {\n display: none;\n height: 0;\n}\n\n/*\n * Addresses styling for `hidden` attribute not present in IE 8/9.\n */\n\n[hidden] {\n display: none;\n}\n\n/* ==========================================================================\n Base\n ========================================================================== */\n\n/*\n * 1. Sets default font family to sans-serif.\n * 2. Prevents iOS text size adjust after orientation change, without disabling\n * user zoom.\n */\n\nhtml {\n font-family: sans-serif; /* 1 */\n -webkit-text-size-adjust: 100%; /* 2 */\n -ms-text-size-adjust: 100%; /* 2 */\n}\n\n/*\n * Removes default margin.\n */\n\nbody {\n margin: 0;\n}\n\n/* ==========================================================================\n Links\n ========================================================================== */\n\n/*\n * Addresses `outline` inconsistency between Chrome and other browsers.\n */\n\na:focus {\n outline: thin dotted;\n}\n\n/*\n * Improves readability when focused and also mouse hovered in all browsers.\n */\n\na:active,\na:hover {\n outline: 0;\n}\n\n/* ==========================================================================\n Typography\n ========================================================================== */\n\n/*\n * Addresses `h1` font sizes within `section` and `article` in Firefox 4+,\n * Safari 5, and Chrome.\n */\n\nh1 {\n font-size: 2em;\n}\n\n/*\n * Addresses styling not present in IE 8/9, Safari 5, and Chrome.\n */\n\nabbr[title] {\n border-bottom: 1px dotted;\n}\n\n/*\n * Addresses style set to `bolder` in Firefox 4+, Safari 5, and Chrome.\n */\n\nb,\nstrong {\n font-weight: bold;\n}\n\n/*\n * Addresses styling not present in Safari 5 and Chrome.\n */\n\ndfn {\n font-style: italic;\n}\n\n/*\n * Addresses styling not present in IE 8/9.\n */\n\nmark {\n background: #ff0;\n color: #000;\n}\n\n\n/*\n * Corrects font family set oddly in Safari 5 and Chrome.\n */\n\ncode,\nkbd,\npre,\nsamp {\n font-family: monospace, serif;\n font-size: 1em;\n}\n\n/*\n * Improves readability of pre-formatted text in all browsers.\n */\n\npre {\n white-space: pre;\n white-space: pre-wrap;\n word-wrap: break-word;\n}\n\n/*\n * Sets consistent quote types.\n */\n\nq {\n quotes: \"\\201C\" \"\\201D\" \"\\2018\" \"\\2019\";\n}\n\n/*\n * Addresses inconsistent and variable font size in all browsers.\n */\n\nsmall {\n font-size: 80%;\n}\n\n/*\n * Prevents `sub` and `sup` affecting `line-height` in all browsers.\n */\n\nsub,\nsup {\n font-size: 75%;\n line-height: 0;\n position: relative;\n vertical-align: baseline;\n}\n\nsup {\n top: -0.5em;\n}\n\nsub {\n bottom: -0.25em;\n}\n\n/* ==========================================================================\n Embedded content\n ========================================================================== */\n\n/*\n * Removes border when inside `a` element in IE 8/9.\n */\n\nimg {\n border: 0;\n}\n\n/*\n * Corrects overflow displayed oddly in IE 9.\n */\n\nsvg:not(:root) {\n overflow: hidden;\n}\n\n/* ==========================================================================\n Figures\n ========================================================================== */\n\n/*\n * Addresses margin not present in IE 8/9 and Safari 5.\n */\n\nfigure {\n margin: 0;\n}\n\n/* ==========================================================================\n Forms\n ========================================================================== */\n\n/*\n * Define consistent border, margin, and padding.\n */\n\nfieldset {\n border: 1px solid #c0c0c0;\n margin: 0 2px;\n padding: 0.35em 0.625em 0.75em;\n}\n\n/*\n * 1. Corrects color not being inherited in IE 8/9.\n * 2. Remove padding so people aren't caught out if they zero out fieldsets.\n */\n\nlegend {\n border: 0; /* 1 */\n padding: 0; /* 2 */\n}\n\n/*\n * 1. Corrects font family not being inherited in all browsers.\n * 2. Corrects font size not being inherited in all browsers.\n * 3. Addresses margins set differently in Firefox 4+, Safari 5, and Chrome\n */\n\nbutton,\ninput,\nselect,\ntextarea {\n font-family: inherit; /* 1 */\n font-size: 100%; /* 2 */\n margin: 0; /* 3 */\n}\n\n/*\n * Addresses Firefox 4+ setting `line-height` on `input` using `!important` in\n * the UA stylesheet.\n */\n\nbutton,\ninput {\n line-height: normal;\n}\n\n/*\n * 1. Avoid the WebKit bug in Android 4.0.* where (2) destroys native `audio`\n * and `video` controls.\n * 2. Corrects inability to style clickable `input` types in iOS.\n * 3. Improves usability and consistency of cursor style between image-type\n * `input` and others.\n */\n\nbutton,\nhtml input[type=\"button\"], /* 1 */\ninput[type=\"reset\"],\ninput[type=\"submit\"] {\n -webkit-appearance: button; /* 2 */\n cursor: pointer; /* 3 */\n}\n\n/*\n * Re-set default cursor for disabled elements.\n */\n\nbutton[disabled],\ninput[disabled] {\n cursor: default;\n}\n\n/*\n * 1. Addresses box sizing set to `content-box` in IE 8/9.\n * 2. Removes excess padding in IE 8/9.\n */\n\ninput[type=\"checkbox\"],\ninput[type=\"radio\"] {\n box-sizing: border-box; /* 1 */\n padding: 0; /* 2 */\n}\n\n/*\n * 1. Addresses `appearance` set to `searchfield` in Safari 5 and Chrome.\n * 2. Addresses `box-sizing` set to `border-box` in Safari 5 and Chrome\n * (include `-moz` to future-proof).\n */\n\ninput[type=\"search\"] {\n -webkit-appearance: textfield; /* 1 */\n -moz-box-sizing: content-box;\n -webkit-box-sizing: content-box; /* 2 */\n box-sizing: content-box;\n}\n\n/*\n * Removes inner padding and search cancel button in Safari 5 and Chrome\n * on OS X.\n */\n\ninput[type=\"search\"]::-webkit-search-cancel-button,\ninput[type=\"search\"]::-webkit-search-decoration {\n -webkit-appearance: none;\n}\n\n/*\n * Removes inner padding and border in Firefox 4+.\n */\n\nbutton::-moz-focus-inner,\ninput::-moz-focus-inner {\n border: 0;\n padding: 0;\n}\n\n/*\n * 1. Removes default vertical scrollbar in IE 8/9.\n * 2. Improves readability and alignment in all browsers.\n */\n\ntextarea {\n overflow: auto; /* 1 */\n vertical-align: top; /* 2 */\n}\n\n/* ==========================================================================\n Tables\n ========================================================================== */\n\n/*\n * Remove most spacing between table cells.\n */\n\ntable {\n border-collapse: collapse;\n border-spacing: 0;\n}" }, { "path": "docs/underscore-esm.html", "content": "\n\n\n\n underscore-esm.js\n \n \n \n\n\n
\n
\n \n \n
\n\n\n" }, { "path": "index.html", "content": "\n\n\n \n \n \n\n \n \n Underscore.js\n \n\n\n\n \n \n
\n
\n\n \n Underscore.js (1.13.8)\n \n\n \n\n \n\n
\n \n Introduction\n \n
\n\n
\n \n Collections\n \n \n
\n\n
\n \n Arrays\n \n \n
\n\n
\n \n Functions\n \n \n
\n\n
\n \n Objects\n \n \n
\n\n
\n \n Utility\n \n \n
\n\n
\n \n OOP Style\n \n
\n\n
\n \n Chaining\n \n \n
\n\n
\n \n Links\n \n
\n\n
\n \n Notes\n \n
\n\n
\n \n Change Log\n \n
\n\n
\n
\n
\n\n

\n \"Underscore.js\"\n

\n\n

\n Underscore\n is a JavaScript library that provides a whole mess of useful functional\n programming helpers without extending any built-in objects.\n It’s the answer to the question: “If I sit down in front of a\n blank HTML page, and want to start being productive immediately, what do I need?”\n … and the tie to go along with\n jQuery's tux and\n Backbone's suspenders.\n

\n\n

\n Underscore provides over 100 functions that support both your favorite\n workaday functional helpers: map, filter, invoke —\n as well as more specialized goodies: function binding, javascript\n templating, creating quick indexes, deep equality testing, and so on.\n

\n\n

\n A complete Test Suite\n is included for your perusal.\n

\n\n

\n You may also read through the annotated source code. There is a modular version with clickable\n import references as well.\n

\n\n

\n You may choose between monolithic and modular imports. There is a quick\n summary of the options below, as well as a more comprehensive\n discussion in the article.\n

\n\n

\n Enjoying Underscore, and want to turn it up to 11? Try Underscore-contrib.\n

\n\n

\n The project is\n hosted on GitHub.\n You can report bugs and discuss features on the\n issues page\n or chat in the Gitter\n channel.\n

\n\n

\n You can support the project by donating on\n Patreon.\n Enterprise coverage is available as part of the Tidelift Subscription.\n

\n\n

\n Underscore is an open-source component of DocumentCloud.\n

\n\n

v1.13.8 Downloads (Right-click, and use \"Save As\")

\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n
ESM (Development)\n 65.9 KB, Uncompressed with Plentiful Comments\n  (Source Map)\n
ESM (Production)\n 8.59 KB, Minified and Gzipped\n  (Source Map)\n
UMD (Development)\n 68.4 KB, Uncompressed with Bountiful Comments\n  (Source Map)\n
UMD (Production)\n 7.48 KB, Minified and Gzipped\n  (Source Map)\n
Edge ESMUnreleased, current master, use by your own judgement and at your own risk
Edge UMDUnreleased, current master, use if you’re feeling lucky
\n\n

v1.13.8 CDN URLs (Use with <script src=\"...\"></script>)

\n\n \n\n

\n In most cases, you can replace the version number above by\n latest so that your embed will automatically use the latest\n version, or stable if you want to delay updating until an update\n has proven to be free of accidental breaking changes. Example:
\n https://cdn.jsdelivr.net/npm/underscore@latest/underscore-umd-min.js\n

\n\n

Package Installation

\n\n \n\n

\n If you are hardcoding the path to the file within the package and you\n are unsure which build to use, it is very likely that you need\n underscore-umd.js or the minified variant\n underscore-umd-min.js.\n

\n\n

Monolithic Import (recommended)

\n\n \n\n

Modular Import

\n\n \n\n

\n For functions with multiple aliases, the file name of the module is\n always the first name that appears in the documentation. For\n example, _.reduce/_.inject/_.foldl is exported\n from underscore/modules/reduce.js. Modular usage is mostly\n recommended for creating a customized build of Underscore.\n

\n\n

Engine Compatibility

\n\n

\n Underscore 1.x is backwards compatible with any engine that fully\n supports ES3, while also utilizing newer features when available, such as\n Object.keys, typed arrays and ES modules. We routinely run our\n unittests against the JavaScript engines listed below:\n

\n\n \n\n

\n In addition:\n

\n\n \n\n

\n Underscore 2.x will likely remove support for some outdated environments.\n

\n\n
\n\n

Collection Functions (Arrays or Objects)

\n\n

\n each_.each(list, iteratee, [context])\n Alias: forEach\n source\n
\n Iterates over a list of elements, yielding each in turn to an\n iteratee function.\n The iteratee is bound to the context object, if one is\n passed. Each invocation of iteratee is called with three arguments:\n (element, index, list). If list is a JavaScript object, iteratee's\n arguments will be (value, key, list). Returns the list for chaining.\n

\n 
\n_.each([1, 2, 3], alert);\n=> alerts each number in turn...\n_.each({one: 1, two: 2, three: 3}, alert);\n=> alerts each number value in turn...
\n\n

\n \n Note: Collection functions work on arrays, objects, and\n array-like objects such as arguments, NodeList\n and similar. But it works by duck-typing, so avoid passing objects with\n a numeric length property. It's also good to note that an\n each loop cannot be broken out of — to break, use _.find\n instead.\n \n

\n\n

\n map_.map(list, iteratee, [context])\n Alias: collect\n source\n
\n Produces a new array of values by mapping each value in list\n through a transformation function (iteratee).\n The iteratee is passed three arguments: the value,\n then the index (or key) of the iteration,\n and finally a reference to the entire list.\n

\n 
\n_.map([1, 2, 3], function(num){ return num * 3; });\n=> [3, 6, 9]\n_.map({one: 1, two: 2, three: 3}, function(num, key){ return num * 3; });\n=> [3, 6, 9]\n_.map([[1, 2], [3, 4]], _.first);\n=> [1, 3]
\n\n

\n reduce_.reduce(list, iteratee, [memo], [context])\n Aliases: inject, foldl\n source\n
\n Also known as inject and foldl, reduce boils down a list of values into a single value.\n Memo is the initial state of the reduction, and each successive step of it should be returned by\n iteratee. The iteratee is passed four arguments: the memo, then the value and\n index (or key) of the iteration, and finally a reference to the entire list.\n

\n

\n If no memo is passed to the initial invocation of reduce, the iteratee is not invoked on the first element\n of the list. The first element is instead passed as the memo in the invocation of the iteratee on the next\n element in the list.\n

\n 
\nvar sum = _.reduce([1, 2, 3], function(memo, num){ return memo + num; }, 0);\n=> 6\n
\n\n

\n reduceRight_.reduceRight(list, iteratee, [memo], [context])\n Alias: foldr\n source\n
\n The right-associative version of reduce. Foldr\n is not as useful in JavaScript as it would be in a language with lazy\n evaluation.\n

\n 
\nvar list = [[0, 1], [2, 3], [4, 5]];\nvar flat = _.reduceRight(list, function(a, b) { return a.concat(b); }, []);\n=> [4, 5, 2, 3, 0, 1]\n
\n\n

\n find_.find(list, predicate, [context])\n Alias: detect\n source\n
\n Looks through each value in the list, returning the first one that\n passes a truth test (predicate), or undefined if no value\n passes the test. The function returns as\n soon as it finds an acceptable element, and doesn't traverse the\n entire list.\n predicate is transformed through iteratee\n to facilitate shorthand syntaxes.\n

\n 
\nvar even = _.find([1, 2, 3, 4, 5, 6], function(num){ return num % 2 == 0; });\n=> 2\n
\n\n

\n filter_.filter(list, predicate, [context])\n Alias: select\n source\n
\n Looks through each value in the list, returning an array of all\n the values that pass a truth test (predicate).\n predicate is transformed through iteratee\n to facilitate shorthand syntaxes.\n

\n 
\nvar evens = _.filter([1, 2, 3, 4, 5, 6], function(num){ return num % 2 == 0; });\n=> [2, 4, 6]\n
\n\n

\n findWhere_.findWhere(list, properties)\n source\n
\n Looks through the list and returns the first value that matches\n all of the key-value pairs listed in properties.\n

\n

\n If no match is found, or if list is empty, undefined will be\n returned.\n

\n 
\n_.findWhere(publicServicePulitzers, {newsroom: \"The New York Times\"});\n=> {year: 1918, newsroom: \"The New York Times\",\n  reason: \"For its public service in publishing in full so many official reports,\n  documents and speeches by European statesmen relating to the progress and\n  conduct of the war.\"}\n
\n\n

\n where_.where(list, properties)\n source\n
\n Looks through each value in the list, returning an array of all\n the values that matches the key-value pairs listed in properties.\n

\n 
\n_.where(listOfPlays, {author: \"Shakespeare\", year: 1611});\n=> [{title: \"Cymbeline\", author: \"Shakespeare\", year: 1611},\n    {title: \"The Tempest\", author: \"Shakespeare\", year: 1611}]\n
\n\n

\n reject_.reject(list, predicate, [context])\n source\n
\n Returns the values in list without the elements that the truth\n test (predicate) passes. The opposite of filter.\n predicate is transformed through iteratee\n to facilitate shorthand syntaxes.\n

\n 
\nvar odds = _.reject([1, 2, 3, 4, 5, 6], function(num){ return num % 2 == 0; });\n=> [1, 3, 5]\n
\n\n

\n every_.every(list, [predicate], [context])\n Alias: all\n source\n
\n Returns true if all of the values in the list pass the\n predicate truth test. Short-circuits and stops traversing the list\n if a false element is found.\n predicate is transformed through iteratee\n to facilitate shorthand syntaxes.\n

\n 
\n_.every([2, 4, 5], function(num) { return num % 2 == 0; });\n=> false\n
\n\n

\n some_.some(list, [predicate], [context])\n Alias: any\n source\n
\n Returns true if any of the values in the list pass the\n predicate truth test. Short-circuits and stops traversing the list\n if a true element is found.\n predicate is transformed through iteratee\n to facilitate shorthand syntaxes.\n

\n 
\n_.some([null, 0, 'yes', false]);\n=> true\n
\n\n

\n contains_.contains(list, value, [fromIndex])\n Aliases: include, includes\n source\n
\n Returns true if the value is present in the list.\n Uses indexOf internally, if list is an Array.\n Use fromIndex to start your search at a given index.\n

\n 
\n_.contains([1, 2, 3], 3);\n=> true\n
\n\n

\n invoke_.invoke(list, methodName, *arguments)\n source\n
\n Calls the method named by methodName on each value in the list.\n Any extra arguments passed to invoke will be forwarded on to the\n method invocation.\n

\n 
\n_.invoke([[5, 1, 7], [3, 2, 1]], 'sort');\n=> [[1, 5, 7], [1, 2, 3]]\n
\n\n

\n pluck_.pluck(list, propertyName)\n source\n
\n A convenient version of what is perhaps the most common use-case for\n map: extracting a list of property values.\n

\n 
\nvar stooges = [{name: 'moe', age: 40}, {name: 'larry', age: 50}, {name: 'curly', age: 60}];\n_.pluck(stooges, 'name');\n=> [\"moe\", \"larry\", \"curly\"]\n
\n\n

\n max_.max(list, [iteratee], [context])\n source\n
\n Returns the maximum value in list. If an iteratee\n function is provided, it will be used on each value to generate the\n criterion by which the value is ranked. -Infinity is returned\n if list is empty, so an isEmpty guard\n may be required. This function can currently only compare numbers reliably.\n This function uses operator <\n (note).\n

\n 
\nvar stooges = [{name: 'moe', age: 40}, {name: 'larry', age: 50}, {name: 'curly', age: 60}];\n_.max(stooges, function(stooge){ return stooge.age; });\n=> {name: 'curly', age: 60};\n
\n\n

\n min_.min(list, [iteratee], [context])\n source\n
\n Returns the minimum value in list. If an iteratee\n function is provided, it will be used on each value to generate the\n criterion by which the value is ranked. Infinity is returned\n if list is empty, so an isEmpty guard\n may be required. This function can currently only compare numbers reliably.\n This function uses operator <\n (note).\n

\n 
\nvar numbers = [10, 5, 100, 2, 1000];\n_.min(numbers);\n=> 2\n
\n\n

\n sortBy_.sortBy(list, iteratee, [context])\n source\n
\n Returns a (stably) sorted copy of list, ranked in ascending\n order by the results of running each value through iteratee.\n iteratee may also be the string name of the property to sort by (eg.\n length). This function uses operator <\n (note).\n

\n 
\n_.sortBy([1, 2, 3, 4, 5, 6], function(num){ return Math.sin(num); });\n=> [5, 4, 6, 3, 1, 2]\n\nvar stooges = [{name: 'moe', age: 40}, {name: 'larry', age: 50}, {name: 'curly', age: 60}];\n_.sortBy(stooges, 'name');\n=> [{name: 'curly', age: 60}, {name: 'larry', age: 50}, {name: 'moe', age: 40}];\n
\n

\n groupBy_.groupBy(list, iteratee, [context])\n source\n
\n Splits a collection into sets, grouped by the result of running each\n value through iteratee. If iteratee is a string instead of\n a function, groups by the property named by iteratee on each of\n the values.\n

\n 
\n_.groupBy([1.3, 2.1, 2.4], function(num){ return Math.floor(num); });\n=> {1: [1.3], 2: [2.1, 2.4]}\n\n_.groupBy(['one', 'two', 'three'], 'length');\n=> {3: [\"one\", \"two\"], 5: [\"three\"]}\n
\n\n

\n indexBy_.indexBy(list, iteratee, [context])\n source\n
\n Given a list, and an iteratee function\n that returns a key for each element in the list (or a property name),\n returns an object with an index of each item.\n Just like groupBy, but for when you know your\n keys are unique.\n

\n 
\nvar stooges = [{name: 'moe', age: 40}, {name: 'larry', age: 50}, {name: 'curly', age: 60}];\n_.indexBy(stooges, 'age');\n=> {\n  \"40\": {name: 'moe', age: 40},\n  \"50\": {name: 'larry', age: 50},\n  \"60\": {name: 'curly', age: 60}\n}\n
\n\n

\n countBy_.countBy(list, iteratee, [context])\n source\n
\n Sorts a list into groups and returns a count for the number of objects\n in each group.\n Similar to groupBy, but instead of returning a list of values,\n returns a count for the number of values in that group.\n

\n 
\n_.countBy([1, 2, 3, 4, 5], function(num) {\n  return num % 2 == 0 ? 'even': 'odd';\n});\n=> {odd: 3, even: 2}\n
\n\n

\n shuffle_.shuffle(list)\n source\n
\n Returns a shuffled copy of the list, using a version of the\n Fisher-Yates shuffle.\n

\n 
\n_.shuffle([1, 2, 3, 4, 5, 6]);\n=> [4, 1, 6, 3, 5, 2]\n
\n\n

\n sample_.sample(list, [n])\n source\n
\n Produce a random sample from the list. Pass a number to\n return n random elements from the list. Otherwise a single random\n item will be returned.\n

\n 
\n_.sample([1, 2, 3, 4, 5, 6]);\n=> 4\n\n_.sample([1, 2, 3, 4, 5, 6], 3);\n=> [1, 6, 2]\n
\n\n

\n toArray_.toArray(list)\n source\n
\n Creates a real Array from the list (anything that can be\n iterated over). Useful for transmuting the arguments object.\n

\n 
\n(function(){ return _.toArray(arguments).slice(1); })(1, 2, 3, 4);\n=> [2, 3, 4]\n
\n\n

\n size_.size(list)\n source\n
\n Return the number of values in the list.\n

\n 
\n_.size([1, 2, 3, 4, 5]);\n=> 5\n\n_.size({one: 1, two: 2, three: 3});\n=> 3\n
\n\n

\n partition_.partition(list, predicate)\n source\n
\n Split list into two arrays: one whose elements all satisfy\n predicate and one whose elements all do not satisfy predicate.\n predicate is transformed through iteratee\n to facilitate shorthand syntaxes.\n

\n 
\n_.partition([0, 1, 2, 3, 4, 5], isOdd);\n=> [[1, 3, 5], [0, 2, 4]]\n
\n\n

\n compact_.compact(list)\n source\n
\n Returns a copy of the list with all falsy values removed.\n In JavaScript, false, null, 0, \"\",\n undefined and NaN are all falsy.\n

\n 
\n_.compact([0, 1, false, 2, '', 3]);\n=> [1, 2, 3]\n
\n\n

Array Functions

\n\n

\n \n Note: All array functions will also work on the arguments object.\n However, Underscore functions are not designed to work on \"sparse\" arrays.\n \n

\n\n

\n first_.first(array, [n])\n Aliases: head, take\n source\n
\n Returns the first element of an array. Passing n will\n return the first n elements of the array.\n

\n 
\n_.first([5, 4, 3, 2, 1]);\n=> 5\n
\n\n

\n initial_.initial(array, [n])\n source\n
\n Returns everything but the last entry of the array. Especially useful on\n the arguments object. Pass n to exclude the last n elements\n from the result.\n

\n 
\n_.initial([5, 4, 3, 2, 1]);\n=> [5, 4, 3, 2]\n
\n\n

\n last_.last(array, [n])\n source\n
\n Returns the last element of an array. Passing n will return\n the last n elements of the array.\n

\n 
\n_.last([5, 4, 3, 2, 1]);\n=> 1\n
\n\n

\n rest_.rest(array, [index])\n Aliases: tail, drop\n source\n
\n Returns the rest of the elements in an array. Pass an index\n to return the values of the array from that index onward.\n

\n 
\n_.rest([5, 4, 3, 2, 1]);\n=> [4, 3, 2, 1]\n
\n\n

\n flatten_.flatten(array, [depth])\n source\n
\n Flattens a nested array. If you pass true or 1\n as the depth, the array will only be flattened a single level.\n Passing a greater number will cause the flattening to descend deeper\n into the nesting hierarchy. Omitting the depth argument, or\n passing false or Infinity, flattens the array all the\n way to the deepest nesting level.\n

\n 
\n_.flatten([1, [2], [3, [[4]]]]);\n=> [1, 2, 3, 4];\n\n_.flatten([1, [2], [3, [[4]]]], true);\n=> [1, 2, 3, [[4]]];\n\n_.flatten([1, [2], [3, [[4]]]], 2);\n=> [1, 2, 3, [4]];\n
\n\n

\n without_.without(array, *values)\n source\n
\n Returns a copy of the array with all instances of the values\n removed.\n

\n 
\n_.without([1, 2, 1, 0, 3, 1, 4], 0, 1);\n=> [2, 3, 4]\n
\n\n

\n union_.union(*arrays)\n source\n
\n Computes the union of the passed-in arrays: the list of unique items,\n in order, that are present in one or more of the arrays.\n

\n 
\n_.union([1, 2, 3], [101, 2, 1, 10], [2, 1]);\n=> [1, 2, 3, 101, 10]\n
\n\n

\n intersection_.intersection(*arrays)\n source\n
\n Computes the list of values that are the intersection of all the arrays.\n Each value in the result is present in each of the arrays.\n

\n 
\n_.intersection([1, 2, 3], [101, 2, 1, 10], [2, 1]);\n=> [1, 2]\n
\n\n

\n difference_.difference(array, *others)\n source\n
\n Similar to without, but returns the values from array that\n are not present in the other arrays.\n

\n 
\n_.difference([1, 2, 3, 4, 5], [5, 2, 10]);\n=> [1, 3, 4]\n
\n\n

\n uniq_.uniq(array, [isSorted], [iteratee])\n Alias: unique\n source\n
\n Produces a duplicate-free version of the array, using === to test\n object equality. In particular only the first occurrence of each value is kept.\n If you know in advance that the array is sorted,\n passing true for isSorted will run a much faster algorithm.\n If you want to compute unique items based on a transformation, pass an\n iteratee function.\n

\n 
\n_.uniq([1, 2, 1, 4, 1, 3]);\n=> [1, 2, 4, 3]\n
\n\n

\n zip_.zip(*arrays)\n source\n
\n Merges together the values of each of the arrays with the\n values at the corresponding position. Useful when you have separate\n data sources that are coordinated through matching array indexes.\n

\n 
\n_.zip(['moe', 'larry', 'curly'], [30, 40, 50], [true, false, false]);\n=> [[\"moe\", 30, true], [\"larry\", 40, false], [\"curly\", 50, false]]\n\n
\n\n

\n unzip_.unzip(array)\n Alias: transpose\n source\n
\n The opposite of zip. Given an array of\n arrays, returns a series of new arrays, the first of which contains all\n of the first elements in the input arrays, the second of which contains\n all of the second elements, and so on. If you're working with a matrix\n of nested arrays, this can be used to transpose the matrix.\n

\n 
\n_.unzip([[\"moe\", 30, true], [\"larry\", 40, false], [\"curly\", 50, false]]);\n=> [['moe', 'larry', 'curly'], [30, 40, 50], [true, false, false]]\n
\n\n

\n object_.object(list, [values])\n source\n
\n Converts arrays into objects. Pass either a single list of\n [key, value] pairs, or a list of keys, and a list of values. Passing\n by pairs is the reverse of pairs. If duplicate keys exist,\n the last value wins.\n

\n 
\n_.object(['moe', 'larry', 'curly'], [30, 40, 50]);\n=> {moe: 30, larry: 40, curly: 50}\n\n_.object([['moe', 30], ['larry', 40], ['curly', 50]]);\n=> {moe: 30, larry: 40, curly: 50}\n
\n\n

\n chunk_.chunk(array, length)\n source\n
\n Chunks an array into multiple arrays, each containing length\n or fewer items.\n

\n 
\nvar partners = _.chunk(_.shuffle(kindergarten), 2);\n=> [[\"Tyrone\", \"Elie\"], [\"Aidan\", \"Sam\"], [\"Katrina\", \"Billie\"], [\"Little Timmy\"]]\n
\n\n

\n indexOf_.indexOf(array, value, [isSorted])\n source\n
\n Returns the index at which value can be found in the array,\n or -1 if value is not present in the array. If you're working with a\n large array, and you know that the array is already sorted, pass true\n for isSorted to use a faster binary search ... or, pass a number as\n the third argument in order to look for the first matching value in the\n array after the given index. If isSorted is true,\n this function uses operator <\n (note).\n

\n 
\n_.indexOf([1, 2, 3], 2);\n=> 1\n
\n\n

\n lastIndexOf_.lastIndexOf(array, value, [fromIndex])\n source\n
\n Returns the index of the last occurrence of value in the array,\n or -1 if value is not present. Pass fromIndex to start your search at a\n given index.\n

\n 
\n_.lastIndexOf([1, 2, 3, 1, 2, 3], 2);\n=> 4\n
\n\n

\n sortedIndex_.sortedIndex(array, value, [iteratee], [context])\n source\n
\n Uses a binary search to determine the smallest index at which the value\n should be inserted into the array in order to maintain the array's\n sorted order. If an iteratee function is provided,\n it will be used to compute the sort ranking of each value, including the value you pass.\n The iteratee may also be the string name of the property to sort by\n (eg. length). This function uses operator <\n (note).\n

\n 
\n_.sortedIndex([10, 20, 30, 40, 50], 35);\n=> 3\n\nvar stooges = [{name: 'moe', age: 40}, {name: 'curly', age: 60}];\n_.sortedIndex(stooges, {name: 'larry', age: 50}, 'age');\n=> 1\n
\n\n

\n findIndex_.findIndex(array, predicate, [context])\n source\n
\n Similar to _.indexOf, returns the first index\n where the predicate truth test passes; otherwise returns -1.\n

\n 
\n_.findIndex([4, 6, 8, 12], isPrime);\n=> -1 // not found\n_.findIndex([4, 6, 7, 12], isPrime);\n=> 2\n
\n\n

\n findLastIndex_.findLastIndex(array, predicate, [context])\n source\n
\n Like _.findIndex but iterates the array in reverse,\n returning the index closest to the end where the predicate truth test\n passes.\n

\n 
\nvar users = [{'id': 1, 'name': 'Bob', 'last': 'Brown'},\n             {'id': 2, 'name': 'Ted', 'last': 'White'},\n             {'id': 3, 'name': 'Frank', 'last': 'James'},\n             {'id': 4, 'name': 'Ted', 'last': 'Jones'}];\n_.findLastIndex(users, {\n  name: 'Ted'\n});\n=> 3\n
\n\n

\n range_.range([start], stop, [step])\n source\n
\n A function to create flexibly-numbered lists of integers, handy for\n each and map loops. start, if omitted,\n defaults to 0; step defaults to 1 if start\n is before stop, otherwise -1. Returns a list\n of integers from start (inclusive) to stop (exclusive),\n incremented (or decremented) by step.\n

\n 
\n_.range(10);\n=> [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]\n_.range(1, 11);\n=> [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]\n_.range(0, 30, 5);\n=> [0, 5, 10, 15, 20, 25]\n_.range(0, -10, -1);\n=> [0, -1, -2, -3, -4, -5, -6, -7, -8, -9]\n_.range(0);\n=> []\n
\n\n

Function (uh, ahem) Functions

\n\n

\n bind_.bind(function, object, *arguments)\n source\n
\n Bind a function to an object, meaning that whenever\n the function is called, the value of this will be the object.\n Optionally, pass arguments to the function to pre-fill them,\n also known as partial application. For partial application without\n context binding, use partial.\n

\n 
\nvar func = function(greeting){ return greeting + ': ' + this.name };\nfunc = _.bind(func, {name: 'moe'}, 'hi');\nfunc();\n=> 'hi: moe'\n
\n\n

\n bindAll_.bindAll(object, *methodNames)\n source\n
\n Binds a number of methods on the object, specified by\n methodNames, to be run in the context of that object whenever they\n are invoked. Very handy for binding functions that are going to be used\n as event handlers, which would otherwise be invoked with a fairly useless\n this. methodNames are required.\n

\n 
\nvar buttonView = {\n  label  : 'underscore',\n  onClick: function(){ alert('clicked: ' + this.label); },\n  onHover: function(){ console.log('hovering: ' + this.label); }\n};\n_.bindAll(buttonView, 'onClick', 'onHover');\n// When the button is clicked, this.label will have the correct value.\njQuery('#underscore_button').on('click', buttonView.onClick);\n
\n\n

\n partial_.partial(function, *arguments)\n source\n
\n Partially apply a function by filling in any number of its\n arguments, without changing its dynamic this\n value. A close cousin of bind. You may pass\n _ in your list of arguments to specify an argument that\n should not be pre-filled, but left open to supply at call-time.\n Note: if you need _ placeholders and a this\n binding at the same time, use both _.partial and\n _.bind.\n

\n 
\nvar subtract = function(a, b) { return b - a; };\nsub5 = _.partial(subtract, 5);\nsub5(20);\n=> 15\n\n// Using a placeholder\nsubFrom20 = _.partial(subtract, _, 20);\nsubFrom20(5);\n=> 15\n
\n\n

\n memoize_.memoize(function, [hashFunction])\n source\n
\n Memoizes a given function by caching the computed result. Useful\n for speeding up slow-running computations. If passed an optional\n hashFunction, it will be used to compute the hash key for storing\n the result, based on the arguments to the original function. The default\n hashFunction just uses the first argument to the memoized function\n as the key. The cache of memoized values is available as the cache\n property on the returned function.\n

\n 
\nvar fibonacci = _.memoize(function(n) {\n  return n < 2 ? n: fibonacci(n - 1) + fibonacci(n - 2);\n});\n
\n\n

\n delay_.delay(function, wait, *arguments)\n source\n
\n Much like setTimeout, invokes function after wait\n milliseconds. If you pass the optional arguments, they will be\n forwarded on to the function when it is invoked.\n

\n 
\nvar log = _.bind(console.log, console);\n_.delay(log, 1000, 'logged later');\n=> 'logged later' // Appears after one second.\n
\n\n

\n defer_.defer(function, *arguments)\n source\n
\n Defers invoking the function until the current call stack has cleared,\n similar to using setTimeout with a delay of 0. Useful for performing\n expensive computations or HTML rendering in chunks without blocking the UI thread\n from updating. If you pass the optional arguments, they will be\n forwarded on to the function when it is invoked.\n

\n 
\n_.defer(function(){ alert('deferred'); });\n// Returns from the function before the alert runs.\n
\n\n

\n throttle_.throttle(function, wait, [options])\n source\n
\n Creates and returns a new, throttled version of the passed function,\n that, when invoked repeatedly, will only actually call the original function\n at most once per every wait\n milliseconds. Useful for rate-limiting events that occur faster than you\n can keep up with.\n

\n

\n By default, throttle will execute the function as soon as you call it\n for the first time, and, if you call it again any number of times\n during the wait period, as soon as that period is over.\n If you'd like to disable the leading-edge\n call, pass {leading: false}, and if you'd like to disable the\n execution on the trailing-edge, pass
{trailing: false}.\n

\n 
\nvar throttled = _.throttle(updatePosition, 100);\n$(window).scroll(throttled);\n
\n

\n If you need to cancel a scheduled throttle, you can call .cancel()\n on the throttled function.\n

\n\n

\n debounce_.debounce(function, wait, [immediate])\n source\n
\n Creates and returns a new debounced version of the passed function which\n will postpone its execution until after\n wait milliseconds have elapsed since the last time it\n was invoked. Useful for implementing behavior that should only happen\n after the input has stopped arriving. For example: rendering a\n preview of a Markdown comment, recalculating a layout after the window\n has stopped being resized, and so on.\n

\n

\n At the end of the wait interval, the function will be called\n with the arguments that were passed most recently to the\n debounced function.\n

\n

\n Pass true for the immediate argument to cause\n debounce to trigger the function on the leading instead of the\n trailing edge of the wait interval. Useful in circumstances like\n preventing accidental double-clicks on a \"submit\" button from firing a\n second time.\n

\n 
\nvar lazyLayout = _.debounce(calculateLayout, 300);\n$(window).resize(lazyLayout);\n
\n

\n If you need to cancel a scheduled debounce, you can call .cancel()\n on the debounced function.\n

\n\n

\n once_.once(function)\n source\n
\n Creates a version of the function that can only be called one time.\n Repeated calls to the modified function will have no effect, returning\n the value from the original call. Useful for initialization functions,\n instead of having to set a boolean flag and then check it later.\n

\n 
\nvar initialize = _.once(createApplication);\ninitialize();\ninitialize();\n// Application is only created once.\n
\n\n

\n after_.after(count, function)\n source\n
\n Creates a wrapper of function that does nothing at first. From\n the count-th call onwards, it starts actually calling\n function. Useful for grouping asynchronous responses, where you\n want to be sure that all the async calls have finished, before\n proceeding.\n

\n 
\nvar renderNotes = _.after(notes.length, render);\n_.each(notes, function(note) {\n  note.asyncSave({success: renderNotes});\n});\n// renderNotes is run once, after all notes have saved.\n
\n\n

\n before_.before(count, function)\n source\n
\n Creates a wrapper of function that memoizes its return value.\n From the count-th call onwards, the memoized result of the last\n invocation is returned immediately instead of invoking function\n again. So the wrapper will invoke function at most count\n - 1 times.\n

\n 
\nvar monthlyMeeting = _.before(3, askForRaise);\nmonthlyMeeting();\nmonthlyMeeting();\nmonthlyMeeting();\n// the result of any subsequent calls is the same as the second call\n
\n\n

\n wrap_.wrap(function, wrapper)\n source\n
\n Wraps the first function inside of the wrapper function,\n passing it as the first argument. This allows the wrapper to\n execute code before and after the function runs, adjust the arguments,\n and execute it conditionally.\n

\n 
\nvar hello = function(name) { return \"hello: \" + name; };\nhello = _.wrap(hello, function(func) {\n  return \"before, \" + func(\"moe\") + \", after\";\n});\nhello();\n=> 'before, hello: moe, after'\n
\n\n

\n negate_.negate(predicate)\n source\n
\n Returns a new negated version of the predicate function.\n

\n 
\nvar isFalsy = _.negate(Boolean);\n_.find([-2, -1, 0, 1, 2], isFalsy);\n=> 0\n
\n\n

\n compose_.compose(*functions)\n source\n
\n Returns the composition of a list of functions, where each function\n consumes the return value of the function that follows. In math terms,\n composing the functions f(), g(), and h() produces\n f(g(h())).\n

\n 
\nvar greet    = function(name){ return \"hi: \" + name; };\nvar exclaim  = function(statement){ return statement.toUpperCase() + \"!\"; };\nvar welcome = _.compose(greet, exclaim);\nwelcome('moe');\n=> 'hi: MOE!'\n
\n\n

\n restArguments_.restArguments(function, [startIndex])\n source\n
\n Returns a version of the function that, when called, receives all\n arguments from and beyond startIndex collected into a single array.\n If you don’t pass an explicit startIndex, it will be determined by\n looking at the number of arguments to the function itself. Similar\n to ES6’s rest\n parameters syntax.\n

\n 
\nvar raceResults = _.restArguments(function(gold, silver, bronze, everyoneElse) {\n  _.each(everyoneElse, sendConsolations);\n});\n\nraceResults(\"Dopey\", \"Grumpy\", \"Happy\", \"Sneezy\", \"Bashful\", \"Sleepy\", \"Doc\");\n
\n\n

Object Functions

\n\n

\n keys_.keys(object)\n source\n
\n Retrieve all the names of the object's own enumerable properties.\n

\n 
\n_.keys({one: 1, two: 2, three: 3});\n=> [\"one\", \"two\", \"three\"]\n
\n\n

\n allKeys_.allKeys(object)\n source\n
\n Retrieve all the names of object's own and inherited properties.\n

\n 
\nfunction Stooge(name) {\n  this.name = name;\n}\nStooge.prototype.silly = true;\n_.allKeys(new Stooge(\"Moe\"));\n=> [\"name\", \"silly\"]\n
\n\n

\n values_.values(object)\n source\n
\n Return all of the values of the object's own properties.\n

\n 
\n_.values({one: 1, two: 2, three: 3});\n=> [1, 2, 3]\n
\n\n

\n mapObject_.mapObject(object, iteratee, [context])\n source\n
\n Like map, but for objects. Transform the value\n of each property in turn.\n

\n 
\n_.mapObject({start: 5, end: 12}, function(val, key) {\n  return val + 5;\n});\n=> {start: 10, end: 17}\n
\n\n

\n pairs_.pairs(object)\n source\n
\n Convert an object into a list of [key, value] pairs. The opposite\n of object.\n

\n 
\n_.pairs({one: 1, two: 2, three: 3});\n=> [[\"one\", 1], [\"two\", 2], [\"three\", 3]]\n
\n\n

\n invert_.invert(object)\n source\n
\n Returns a copy of the object where the keys have become the values\n and the values the keys. For this to work, all of your object's values\n should be unique and string serializable.\n

\n 
\n_.invert({Moe: \"Moses\", Larry: \"Louis\", Curly: \"Jerome\"});\n=> {Moses: \"Moe\", Louis: \"Larry\", Jerome: \"Curly\"};\n
\n\n

\n create_.create(prototype, props)\n source\n
\n Creates a new object with the given prototype, optionally attaching\n props as own properties. Basically, Object.create,\n but without all of the property descriptor jazz.\n

\n 
\nvar moe = _.create(Stooge.prototype, {name: \"Moe\"});\n
\n\n

\n functions_.functions(object)\n Alias: methods\n source\n
\n Returns a sorted list of the names of every method in an object —\n that is to say, the name of every function property of the object.\n

\n 
\n_.functions(_);\n=> [\"all\", \"any\", \"bind\", \"bindAll\", \"clone\", \"compact\", \"compose\" ...\n
\n\n

\n findKey_.findKey(object, predicate, [context])\n source\n
\n Similar to _.findIndex but for keys in objects.\n Returns the key where the predicate truth test\n passes or undefined.\n predicate is transformed through iteratee\n to facilitate shorthand syntaxes.\n

\n\n

\n extend_.extend(destination, *sources)\n source\n
\n Shallowly copy all of the properties in the source objects over to the\n destination object, and return the destination object.\n Any nested objects or arrays will be copied by reference, not duplicated.\n It's in-order, so the last source will override properties of the same\n name in previous arguments.\n

\n 
\n_.extend({name: 'moe'}, {age: 50});\n=> {name: 'moe', age: 50}\n
\n\n

\n extendOwn_.extendOwn(destination, *sources)\n Alias: assign\n source\n
\n Like extend, but only copies own properties over to the\n destination object.\n

\n\n

\n pick_.pick(object, *keys)\n source\n
\n Return a copy of the object, filtered to only have values for\n the allowed keys (or array of valid keys). Alternatively\n accepts a predicate indicating which keys to pick.\n

\n 
\n_.pick({name: 'moe', age: 50, userid: 'moe1'}, 'name', 'age');\n=> {name: 'moe', age: 50}\n_.pick({name: 'moe', age: 50, userid: 'moe1'}, function(value, key, object) {\n  return _.isNumber(value);\n});\n=> {age: 50}\n
\n\n

\n omit_.omit(object, *keys)\n source\n
\n Return a copy of the object, filtered to omit the disallowed\n keys (or array of keys). Alternatively accepts a predicate\n indicating which keys to omit.\n

\n 
\n_.omit({name: 'moe', age: 50, userid: 'moe1'}, 'userid');\n=> {name: 'moe', age: 50}\n_.omit({name: 'moe', age: 50, userid: 'moe1'}, function(value, key, object) {\n  return _.isNumber(value);\n});\n=> {name: 'moe', userid: 'moe1'}\n
\n\n

\n defaults_.defaults(object, *defaults)\n source\n
\n Returns object after filling in its undefined properties\n with the first value present in the following list of defaults objects.\n

\n 
\nvar iceCream = {flavor: \"chocolate\"};\n_.defaults(iceCream, {flavor: \"vanilla\", sprinkles: \"lots\"});\n=> {flavor: \"chocolate\", sprinkles: \"lots\"}\n
\n\n

\n clone_.clone(object)\n source\n
\n Create a shallow-copied clone of the provided plain object.\n Any nested objects or arrays will be copied by reference, not duplicated.\n

\n 
\n_.clone({name: 'moe'});\n=> {name: 'moe'};\n
\n\n

\n tap_.tap(object, interceptor)\n source\n
\n Invokes interceptor with the object, and then returns object.\n The primary purpose of this method is to \"tap into\" a method chain, in order to perform operations on intermediate results within the chain.\n

\n 
\n_.chain([1,2,3,200])\n  .filter(function(num) { return num % 2 == 0; })\n  .tap(alert)\n  .map(function(num) { return num * num })\n  .value();\n=> // [2, 200] (alerted)\n=> [4, 40000]\n
\n\n

\n toPath_.toPath(path)\n source\n
\n Ensures that path is an array. If path is a string, it is\n wrapped in a single-element array; if it is an array already, it is\n returned unmodified.\n

\n 
\n_.toPath('key');\n=> ['key']\n_.toPath(['a', 0, 'b']);\n=> ['a', 0, 'b'] // (same array)\n
\n

\n _.toPath is used internally in has, get,\n invoke, property, propertyOf and\n result, as well as in iteratee\n and all functions that depend on it, in order to normalize deep\n property paths. You can override _.toPath if you want to\n customize this behavior, for example to enable Lodash-like string path\n shorthands. Be advised that altering _.toPath will unavoidably\n cause some keys to become unreachable; override at your own risk.\n

\n 
\n// Support dotted path shorthands.\nvar originalToPath = _.toPath;\n_.mixin({\n  toPath: function(path) {\n    return _.isString(path) ? path.split('.') : originalToPath(path);\n  }\n});\n_.get({a: [{b: 5}]}, 'a.0.b');\n=> 5\n
\n\n

\n get_.get(object, path, [default])\n source\n
\n Returns the specified property of object. path may be\n specified as a simple key, or as an array of object keys or array\n indexes, for deep property fetching. If the property does not exist or\n is undefined, the optional default is returned.\n

\n 
\n_.get({a: 10}, 'a');\n=> 10\n_.get({a: [{b: 2}]}, ['a', 0, 'b']);\n=> 2\n_.get({a: 10}, 'b', 100);\n=> 100\n
\n\n

\n has_.has(object, key)\n source\n
\n Does the object contain the given key? Identical to\n object.hasOwnProperty(key), but uses a safe reference to the\n hasOwnProperty function, in case it's been\n\n overridden accidentally.\n

\n 
\n_.has({a: 1, b: 2, c: 3}, \"b\");\n=> true\n
\n\n

\n property_.property(path)\n source\n
\n Returns a function that will return the specified property of any\n passed-in object. path may be specified as a simple key, or\n as an array of object keys or array indexes, for deep property fetching.\n

\n 
\nvar stooge = {name: 'moe'};\n'moe' === _.property('name')(stooge);\n=> true\n\nvar stooges = {moe: {fears: {worst: 'Spiders'}}, curly: {fears: {worst: 'Moe'}}};\nvar curlysWorstFear = _.property(['curly', 'fears', 'worst']);\ncurlysWorstFear(stooges);\n=> 'Moe'\n
\n\n

\n propertyOf_.propertyOf(object)\n source\n
\n Inverse of _.property. Takes an object and returns a function\n which will return the value of a provided property.\n

\n 
\nvar stooge = {name: 'moe'};\n_.propertyOf(stooge)('name');\n=> 'moe'
\n\n

\n matcher_.matcher(attrs)\n Alias: matches\n source\n
\n Returns a predicate function that will tell you if a passed in object\n contains all of the key/value properties present in attrs.\n

\n 
\nvar ready = _.matcher({selected: true, visible: true});\nvar readyToGoList = _.filter(list, ready);
\n\n

\n isEqual_.isEqual(object, other)\n source\n
\n Performs an optimized deep comparison between the two objects, to determine\n if they should be considered equal.\n

\n 
\nvar stooge = {name: 'moe', luckyNumbers: [13, 27, 34]};\nvar clone  = {name: 'moe', luckyNumbers: [13, 27, 34]};\nstooge == clone;\n=> false\n_.isEqual(stooge, clone);\n=> true\n
\n\n

\n isMatch_.isMatch(object, properties)\n source\n
\n Tells you if the keys and values in properties are contained\n in object.\n

\n 
\nvar stooge = {name: 'moe', age: 32};\n_.isMatch(stooge, {age: 32});\n=> true\n
\n\n

\n isEmpty_.isEmpty(collection)\n source\n
\n Returns true if collection has no elements. For strings\n and array-like objects _.isEmpty checks if the length property\n is 0. For other objects, it returns true if the object has no\n enumerable own-properties. Note that primitive numbers, booleans and\n symbols are always empty by this definition.\n

\n 
\n_.isEmpty([1, 2, 3]);\n=> false\n_.isEmpty({});\n=> true\n
\n\n

\n isElement_.isElement(object)\n source\n
\n Returns true if object is a DOM element.\n

\n 
\n_.isElement(jQuery('body')[0]);\n=> true\n
\n\n

\n isArray_.isArray(object)\n source\n
\n Returns true if object is an Array.\n

\n 
\n(function(){ return _.isArray(arguments); })();\n=> false\n_.isArray([1,2,3]);\n=> true\n
\n\n

\n isObject_.isObject(value)\n source\n
\n Returns true if value is an Object. Note that JavaScript\n arrays and functions are objects, while (normal) strings and numbers are not.\n

\n 
\n_.isObject({});\n=> true\n_.isObject(1);\n=> false\n
\n\n

\n isArguments_.isArguments(object)\n source\n
\n Returns true if object is an Arguments object.\n

\n 
\n(function(){ return _.isArguments(arguments); })(1, 2, 3);\n=> true\n_.isArguments([1,2,3]);\n=> false\n
\n\n

\n isFunction_.isFunction(object)\n source\n
\n Returns true if object is a Function.\n

\n 
\n_.isFunction(alert);\n=> true\n
\n\n

\n isString_.isString(object)\n source\n
\n Returns true if object is a String.\n

\n 
\n_.isString(\"moe\");\n=> true\n
\n\n

\n isNumber_.isNumber(object)\n source\n
\n Returns true if object is a Number (including NaN).\n

\n 
\n_.isNumber(8.4 * 5);\n=> true\n
\n\n

\n isFinite_.isFinite(object)\n source\n
\n Returns true if object is a finite Number.\n

\n 
\n_.isFinite(-101);\n=> true\n\n_.isFinite(-Infinity);\n=> false\n
\n\n

\n isBoolean_.isBoolean(object)\n source\n
\n Returns true if object is either true or false.\n

\n 
\n_.isBoolean(null);\n=> false\n
\n\n

\n isDate_.isDate(object)\n source\n
\n Returns true if object is a Date.\n

\n 
\n_.isDate(new Date());\n=> true\n
\n\n

\n isRegExp_.isRegExp(object)\n source\n
\n Returns true if object is a RegExp.\n

\n 
\n_.isRegExp(/moe/);\n=> true\n
\n\n

\n isError_.isError(object)\n source\n
\n Returns true if object inherits from an Error.\n

\n 
\ntry {\n  throw new TypeError(\"Example\");\n} catch (o_O) {\n  _.isError(o_O);\n}\n=> true\n
\n\n

\n isSymbol_.isSymbol(object)\n source\n
\n Returns true if object is a Symbol.\n

\n 
\n_.isSymbol(Symbol());\n=> true\n
\n\n

\n isMap_.isMap(object)\n source\n
\n Returns true if object is a Map.\n

\n 
\n_.isMap(new Map());\n=> true\n
\n\n

\n isWeakMap_.isWeakMap(object)\n source\n
\n Returns true if object is a WeakMap.\n

\n 
\n_.isWeakMap(new WeakMap());\n=> true\n
\n\n

\n isSet_.isSet(object)\n source\n
\n Returns true if object is a Set.\n

\n 
\n_.isSet(new Set());\n=> true\n
\n\n

\n isWeakSet_.isWeakSet(object)\n source\n
\n Returns true if object is a WeakSet.\n

\n 
\n_.isWeakSet(WeakSet());\n=> true\n
\n\n

\n isArrayBuffer_.isArrayBuffer(object)\n source\n
\n Returns true if object is an ArrayBuffer.\n

\n 
\n_.isArrayBuffer(new ArrayBuffer(8));\n=> true\n
\n\n

\n isDataView_.isDataView(object)\n source\n
\n Returns true if object is a DataView.\n

\n 
\n_.isDataView(new DataView(new ArrayBuffer(8)));\n=> true\n
\n\n

\n isTypedArray_.isTypedArray(object)\n source\n
\n Returns true if object is a TypedArray.\n

\n 
\n_.isTypedArray(new Int8Array(8));\n=> true\n
\n\n

\n isNaN_.isNaN(object)\n source\n
\n Returns true if object is NaN.
Note: this is not\n the same as the native isNaN function, which will also return\n true for many other not-number values, such as undefined.\n

\n 
\n_.isNaN(NaN);\n=> true\nisNaN(undefined);\n=> true\n_.isNaN(undefined);\n=> false\n
\n\n

\n isNull_.isNull(object)\n source\n
\n Returns true if the value of object is null.\n

\n 
\n_.isNull(null);\n=> true\n_.isNull(undefined);\n=> false\n
\n\n

\n isUndefined_.isUndefined(value)\n source\n
\n Returns true if value is undefined.\n

\n 
\n_.isUndefined(window.missingVariable);\n=> true\n
\n\n

Utility Functions

\n\n

\n noConflict_.noConflict()\n source\n
\n Give control of the global _ variable back to its previous\n owner. Returns a reference to the Underscore object.\n

\n 
\nvar underscore = _.noConflict();\n
\n

\n The _.noConflict function is not present if you use the EcmaScript 6, AMD or CommonJS module system to import Underscore.\n

\n\n

\n identity_.identity(value)\n source\n
\n Returns the same value that is used as the argument. In math:\n f(x) = x
\n This function looks useless, but is used throughout Underscore as\n a default iteratee.\n

\n 
\nvar stooge = {name: 'moe'};\nstooge === _.identity(stooge);\n=> true\n
\n\n

\n constant_.constant(value)\n source\n
\n Creates a function that returns the same value that is used as the\n argument of _.constant.\n

\n 
\nvar stooge = {name: 'moe'};\nstooge === _.constant(stooge)();\n=> true
\n\n

\n noop_.noop()\n source\n
\n Returns undefined irrespective of the arguments passed to it.\n Useful as the default for optional callback arguments.\n

\n 
\nobj.initialize = _.noop;\n
\n\n

\n times_.times(n, iteratee, [context])\n source\n
\n Invokes the given iteratee function n times. Each invocation of\n iteratee is called with an index argument.\n Produces an array of the returned values.\n

\n 
\n_.times(3, function(n){ genie.grantWishNumber(n); });
\n\n

\n random_.random(min, max)\n source\n
\n Returns a random integer between min and max, inclusive.\n If you only pass one argument, it will return a number between 0\n and that number.\n

\n 
\n_.random(0, 100);\n=> 42
\n\n

\n mixin_.mixin(object)\n source\n
\n Allows you to extend Underscore with your own utility functions. Pass\n a hash of {name: function} definitions to have your functions\n added to the Underscore object, as well as the OOP wrapper. Returns the\n Underscore object to facilitate chaining.

\n 
\n_.mixin({\n  capitalize: function(string) {\n    return string.charAt(0).toUpperCase() + string.substring(1).toLowerCase();\n  }\n});\n_(\"fabio\").capitalize();\n=> \"Fabio\"\n
\n\n

\n iteratee_.iteratee(value, [context])\n source\n
\n Generates a callback that can be applied to each element in\n a collection. _.iteratee supports a number of shorthand\n syntaxes for common callback use cases. Depending upon value's\n type, _.iteratee will return:\n

\n 
\n// No value\n_.iteratee();\n=> _.identity()\n\n// Function\n_.iteratee(function(n) { return n * 2; });\n=> function(n) { return n * 2; }\n\n// Object\n_.iteratee({firstName: 'Chelsea'});\n=> _.matcher({firstName: 'Chelsea'});\n\n// Anything else\n_.iteratee('firstName');\n=> _.property('firstName');
\n\n

\n The following Underscore methods transform their predicates through\n _.iteratee: countBy, every,\n filter, find, findIndex, findKey,\n findLastIndex, groupBy, indexBy,\n map, mapObject, max, min,\n partition, reject, some, sortBy,\n sortedIndex, and uniq\n

\n\n

\n You may overwrite _.iteratee with your own custom function,\n if you want additional or different shorthand syntaxes:\n

\n 
\n// Support `RegExp` predicate shorthand.\nvar builtinIteratee = _.iteratee;\n_.iteratee = function(value, context) {\n  if (_.isRegExp(value)) return function(obj) { return value.test(obj) };\n  return builtinIteratee(value, context);\n};
\n

\n uniqueId_.uniqueId([prefix])\n source\n
\n Generate a globally-unique id for client-side models or DOM elements\n that need one. If prefix is passed, the id will be appended to it.\n

\n 
\n_.uniqueId('contact_');\n=> 'contact_104'
\n\n

\n escape_.escape(string)\n source\n
\n Escapes a string for insertion into HTML, replacing\n &, <, >, ", `, and ' characters.\n

\n 
\n_.escape('Curly, Larry & Moe');\n=> \"Curly, Larry &amp; Moe\"
\n\n

\n unescape_.unescape(string)\n source\n
\n The opposite of escape, replaces\n &amp;, &lt;, &gt;,\n &quot;, &#x60; and &#x27;\n with their unescaped counterparts.\n

\n 
\n_.unescape('Curly, Larry &amp; Moe');\n=> \"Curly, Larry & Moe\"
\n\n

\n result_.result(object, property, [defaultValue])\n source\n
\n If the value of the named property is a function then invoke it\n with the object as context; otherwise, return it. If a default value\n is provided and the property doesn't exist or is undefined then the default\n will be returned. If defaultValue is a function its result will be returned.\n

\n 
\nvar object = {cheese: 'crumpets', stuff: function(){ return 'nonsense'; }};\n_.result(object, 'cheese');\n=> \"crumpets\"\n_.result(object, 'stuff');\n=> \"nonsense\"\n_.result(object, 'meat', 'ham');\n=> \"ham\"\n
\n\n

\n now_.now()\n source\n
\n Returns an integer timestamp for the current time, using the fastest\n method available in the runtime. Useful for implementing timing/animation\n functions.\n

\n 
\n_.now();\n=> 1392066795351\n
\n\n

\n template_.template(templateString, [settings])\n source\n
\n Compiles JavaScript templates into functions that can be evaluated\n for rendering. Useful for rendering complicated bits of HTML from JSON\n data sources. Template functions can both interpolate values, using\n <%= … %>, as well as execute arbitrary JavaScript code, with\n <% … %>. If you wish to interpolate a value, and have\n it be HTML-escaped, use <%- … %>. When you evaluate a\n template function, pass in a data object that has properties\n corresponding to the template's free variables. The settings argument\n should be a hash containing any _.templateSettings that should be overridden.\n

\n\n 
\nvar compiled = _.template(\"hello: <%= name %>\");\ncompiled({name: 'moe'});\n=> \"hello: moe\"\n\nvar template = _.template(\"<b><%- value %></b>\");\ntemplate({value: '<script>'});\n=> \"<b>&lt;script&gt;</b>\"
\n\n

\n You can also use print from within JavaScript code. This is\n sometimes more convenient than using <%= ... %>.\n

\n\n 
\nvar compiled = _.template(\"<% print('Hello ' + epithet); %>\");\ncompiled({epithet: \"stooge\"});\n=> \"Hello stooge\"
\n\n

\n If ERB-style delimiters aren't your cup of tea, you can change Underscore's\n template settings to use different symbols to set off interpolated code.\n Define an interpolate regex to match expressions that should be\n interpolated verbatim, an escape regex to match expressions that should\n be inserted after being HTML-escaped, and an evaluate regex to match\n expressions that should be evaluated without insertion into the resulting\n string. Note that if part of your template matches more than one of these\n regexes, the first will be applied by the following order of priority:\n (1) escape, (2) interpolate, (3) evaluate. You may\n define or omit any combination of the three. For example, to perform\n Mustache.js-style\n templating:\n

\n\n 
\n_.templateSettings = {\n  interpolate: /\\{\\{(.+?)\\}\\}/g\n};\n\nvar template = _.template(\"Hello {{ name }}!\");\ntemplate({name: \"Mustache\"});\n=> \"Hello Mustache!\"
\n\n

\n By default, template places the values from your data in the local scope\n via the with statement. However, you can specify a single variable name\n with the variable setting. This can significantly improve the speed\n at which a template is able to render.\n

\n\n 
\n_.template(\"Using 'with': <%= data.answer %>\", {variable: 'data'})({answer: 'no'});\n=> \"Using 'with': no\"
\n\n

\n Precompiling your templates can be a big help when debugging errors you can't\n reproduce. This is because precompiled templates can provide line numbers and\n a stack trace, something that is not possible when compiling templates on the client.\n The source property is available on the compiled template\n function for easy precompilation.\n

\n\n 
<script>\n  JST.project = <%= _.template(jstText).source %>;\n</script>
\n\n

\n VERSION\n
\n It is possible to get the current Underscore version via\n _.VERSION\n .\n 

_.VERSION => 1.13.8
\n

\n\n

Object-Oriented Style

\n\n

\n You can use Underscore in either an object-oriented or a functional style,\n depending on your preference. The following two lines of code are\n identical ways to double a list of numbers.\n source,\n source\n

\n\n 
\n_.map([1, 2, 3], function(n){ return n * 2; });\n_([1, 2, 3]).map(function(n){ return n * 2; });
\n\n

Chaining

\n\n

\n Calling chain will cause all future method calls to return\n wrapped objects. When you've finished the computation, call\n value to retrieve the final value. Here's an example of chaining\n together a map/flatten/reduce, in order to get the word count of\n every word in a song.\n

\n\n
\nvar lyrics = [\n  {line: 1, words: \"I'm a lumberjack and I'm okay\"},\n  {line: 2, words: \"I sleep all night and I work all day\"},\n  {line: 3, words: \"He's a lumberjack and he's okay\"},\n  {line: 4, words: \"He sleeps all night and he works all day\"}\n];\n\n_.chain(lyrics)\n  .map(function(line) { return line.words.split(' '); })\n  .flatten()\n  .reduce(function(counts, word) {\n    counts[word] = (counts[word] || 0) + 1;\n    return counts;\n  }, {})\n  .value();\n\n=> {lumberjack: 2, all: 4, night: 2 ... }
\n\n

\n In addition, the\n Array prototype's methods\n are proxied through the chained Underscore object, so you can slip a\n reverse or a push into your chain, and continue to\n modify the array.\n

\n\n

\n chain_.chain(obj)\n source\n
\n Returns a wrapped object. Calling methods on this object will continue\n to return wrapped objects until value is called.\n

\n 
\nvar stooges = [{name: 'curly', age: 25}, {name: 'moe', age: 21}, {name: 'larry', age: 23}];\nvar youngest = _.chain(stooges)\n  .sortBy(function(stooge){ return stooge.age; })\n  .map(function(stooge){ return stooge.name + ' is ' + stooge.age; })\n  .first()\n  .value();\n=> \"moe is 21\"\n
\n\n

\n value_.chain(obj).value()\n source\n
\n Extracts the value of a wrapped object.\n

\n 
\n_.chain([1, 2, 3]).reverse().value();\n=> [3, 2, 1]\n
\n\n

Links & Suggested Reading

\n\n

\n Underscore.lua,\n a Lua port of the functions that are applicable in both languages.\n Includes OOP-wrapping and chaining.\n (source)\n

\n\n

\n Dollar.swift, a Swift port\n of many of the Underscore.js functions and more.\n (source)\n

\n\n

\n Underscore.m, an Objective-C port\n of many of the Underscore.js functions, using a syntax that encourages\n chaining.\n (source)\n

\n\n

\n _.m, an alternative\n Objective-C port that tries to stick a little closer to the original\n Underscore.js API.\n (source)\n

\n\n

\n Underscore.php,\n a PHP port of the functions that are applicable in both languages.\n Tailored for PHP 5.4 and made with data-type tolerance in mind.\n (source)\n

\n\n

\n Underscore-perl,\n a Perl port of many of the Underscore.js functions,\n aimed at on Perl hashes and arrays.\n (source)\n

\n\n

\n Underscore.cfc,\n a Coldfusion port of many of the Underscore.js functions.\n (source)\n

\n\n

\n Underscore.string,\n an Underscore extension that adds functions for string-manipulation:\n trim, startsWith, contains, capitalize,\n reverse, sprintf, and more.\n

\n\n

\n Underscore-java,\n a java port of the functions that are applicable in both languages.\n Includes OOP-wrapping and chaining.\n (source)\n

\n\n

\n Ruby's Enumerable module.\n

\n\n

\n Prototype.js, which provides\n JavaScript with collection functions in the manner closest to Ruby's Enumerable.\n

\n\n

\n Oliver Steele's\n Functional JavaScript,\n which includes comprehensive higher-order function support as well as string lambdas.\n

\n\n

\n Michael Aufreiter's Data.js,\n a data manipulation + persistence library for JavaScript.\n

\n\n

\n Python's itertools.\n

\n\n

\n PyToolz, a Python port\n that extends itertools and functools to include much of the\n Underscore API.\n

\n\n

\n Funcy, a practical\n collection of functional helpers for Python, partially inspired by Underscore.\n

\n\n

Notes

\n\n

\n On the use of < in Underscore\n
\n Underscore functions that depend on ordering, such as\n _.sortBy and\n _.sortedIndex, use\n JavaScript’s built-in\n relational operators,\n specifically the “less than” operator <. It is\n important to understand that these operators are only meaningful for\n numbers and strings. You can throw any value to them, but JavaScript\n will convert the operands to string or number first before performing\n the actual comparison. If you pass an operand that\n cannot be meaningfully converted to string or number, it ends up being\n NaN by default. This value is unsortable.\n

\n

\n Ideally, the values that you are sorting should either be all\n (meaningfully convertible to) strings or all (meaningfully convertible\n to) numbers. If this is not the case, you have two options:\n

    \n
  • \n _.filter out all unsortable values\n first.\n
    • \n
  • \n Pick a target type, i.e., either string or number, and pass an\n iteratee to your Underscore\n function that will convert its argument to a sensible instance of\n the target type. For example, if you have an array of numbers that\n you want to sort and that may occasionally contain null or\n undefined, you can control whether you want to sort these\n before or after all numbers by passing an iteratee to\n _.sortBy that returns -Infinity or\n +Infinity for such values, respectively. Or maybe you want\n to treat them as zeros; it is up to you. The same iteratee\n can also be passed to other Underscore functions to ensure that the\n behavior is consistent.\n
    • \n
\n

\n\n

Change Log

\n\n

\n 1.13.8 — February 19, 2026 — Diff — Docs
\n

    \n
  • \n Fixes a security issue in _.flatten and _.isEqual\n that, under very specific circumstances, could allow for a Denial of\n Service (DoS) attack in server applications. This bug was present in\n all previous versions of Underscore. More details: CVE-2026-27601.\n
    • \n
  • \n Adds documentation for _.VERSION.\n
    • \n
  • \n Clarifies some terminology in the documentation for contributors.\n
    • \n
\n

\n\n

\n 1.13.7 — July 24, 2024 — Diff — Docs
\n

    \n
  • \n Fixes a bug where Underscore might throw an error on load if the\n executing environment overrides the native DataView.\n
    • \n
  • \n Adds a direct link to the corresponding source code for each\n function in the documentation.\n
    • \n
  • \n Clarifies the documentation for the step argument of\n the range function.\n
    • \n
  • \n Adds dark mode support to the home page.\n
    • \n
  • \n Other infrastructural improvements to funding, testing and building.\n
    • \n
\n

\n\n

\n 1.13.6 — September 24, 2022 — Diff — Docs
\n Hotfix for version 1.13.5 to remove a postinstall script from\n the package.json, which unexpectedly broke many people's builds.\n

\n\n

\n 1.13.5 — September 23, 2022 — Diff — Docs
\n

    \n
  • \n Adds a module sub-entry to the package.json’s exports.require condition. When a bundling tool, such as Rollup with recent versions of @rollup/plugin-node-resolve, takes the exports map very literally, this should prevent situations in which the final bundle includes multiple copies of Underscore in different module formats.\n
    • \n
  • \n Updates to the testing infrastructure and development dependencies.\n
    • \n
  • \n No code changes.\n
    • \n
\n

\n\n

\n 1.13.4 — June 2, 2022 — Diff — Docs
\n

    \n
  • \n Fixes a compatibility issue with WebPack module federation.\n
    • \n
  • \n Documentation improvements.\n
    • \n
\n

\n\n

\n 1.13.3 — April 23, 2022 — Diff — Docs
\n

    \n
  • \n Fixes a compatibility issue with ExtendScript.\n
    • \n
  • \n Various improvements to testing and continuous integration,\n including the addition of security scanning and a reduced carbon\n footprint.\n
    • \n
\n

\n\n

\n 1.13.2 — December 16, 2021 — Diff — Docs
\n

    \n
  • \n Fixes a regression introduced in 1.9.0 that caused\n _.sample and _.shuffle to no longer work on\n strings.\n
    • \n
  • \n Fixes an issue in IE8 compatibility code.\n
    • \n
  • \n Makes the website mobile-friendly.\n
    • \n
  • \n Various other minor documentation enhancements and a new test.\n
    • \n
\n

\n\n

\n 1.13.1 — April 15, 2021 — Diff — Docs
\n

    \n
  • \n Restores the underscore.js alias committed to the GitHub\n repository.\n
    • \n
  • \n Adds some build clarifications to the documentation.\n
    • \n
  • \n No code changes.\n
    • \n
\n

\n\n

\n 1.13.0 — April 9, 2021 — Diff — Docs
\n

    \n
  • \n Merges the changes from the 1.13.0-0 through 1.13.0-3 preview\n releases into the main release stream following version 1.12.1. As\n of this release, ESM support is 100%.\n
    • \n
  • \n Adds a security policy to the documentation.\n
    • \n
  • \n Adds funding information to the documentation.\n
    • \n
\n

\n\n

\n 1.13.0-3 — March 31, 2021 — Diff — Docs
\n

    \n
  • \n Adds a \"module\" exports condition to the\n package.json, which should theoretically help to avoid\n duplicate code bundling with exports-aware build tools.\n
    • \n
  • \n Re-synchronizes some comments and documentation text with the\n 1.12.x branch.\n
    • \n
\n

\n\n

\n 1.13.0-2 — March 15, 2021 — Diff — Docs
\n

    \n
  • \n Fixes the same security issue in _.template as the\n parallel 1.12.1 release.\n
    • \n
\n

\n\n

\n 1.12.1 — March 15, 2021 — Diff — Docs
\n

    \n
  • \n Fixes a security issue in _.template that could enable a\n third party to inject code in compiled templates. This issue\n affects all versions of Underscore between 1.3.2 and 1.12.0,\n inclusive, as well as preview releases 1.13.0-0 and 1.13.0-1. The\n fix in this release is also included in the parallel preview\n release 1.13.0-2. CVE-2021-23358\n
    • \n
  • \n Restores an optimization in _.debounce that was\n unintentionally lost in version 1.9.0 (same as in parallel preview\n release 1.13.0-0).\n
    • \n
  • \n Various test and documentation enhancements (same as in parallel\n preview releases 1.13.0-0 and 1.13.0-1).\n
    • \n
\n

\n\n

\n 1.13.0-1 — March 11, 2021 — Diff — Docs
\n

    \n
  • \n Fixes an issue that caused aliases to be absent among the named\n exports in the new native ESM entry point for Node.js 12+.\n
    • \n
  • \n More test and documentation fixes and enhancements.\n
    • \n
\n

\n\n

\n 1.13.0-0 — March 9, 2021 — Diff — Docs
\n

    \n
  • \n Adds experimental support for native ESM imports in Node.js. You\n can now also do named imports or even deep module imports directly\n from a Node.js process in Node.js version 12 and later. Monolithic\n imports are recommended for use in production. State (such as\n mixed-in functions) is shared between CommonJS and ESM consumers.\n
    • \n
  • \n Renames the UMD bundle to underscore-umd.js for\n consistency with the other bundle names. An alias named\n underscore.js is retained for backwards compatibility.\n
    • \n
  • \n Restores an optimization in _.debounce that was\n unintentionally lost in version 1.9.0.\n
    • \n
  • \n Various test and documentation enhancements.\n
    • \n
\n

\n\n

\n 1.12.0 — November 24, 2020 — Diff — Docs
\n

    \n
  • \n Adds the _.get and _.toPath functions. The latter\n can be overridden in order to customize the interpretation of deep\n property paths throughout Underscore. A future version of\n Underscore-contrib will be providing a ready-made function for this\n purpose; users will be able to opt in to string-based path\n shorthands such as 'a.0.b' and 'a[0][\"b\"]' by\n using that function from Underscore-contrib to override\n _.toPath.\n
    • \n
  • \n Fixes a bug in _.isEqual that caused typed arrays to\n compare equal when viewing different segments of the same\n underlying ArrayBuffer.\n
    • \n
  • \n Improves the compatibility of _.isEqual,\n _.isDataView, _.isMap, _.isWeakMap and\n _.isSet with some older browsers, especially IE 11.\n
    • \n
  • \n Significantly enhances the performance of _.isEmpty and\n several members of the isType family of functions.\n
    • \n
  • \n Speeds up _.isEqual comparison of typed arrays and\n DataViews with idential buffer,\n byteOffset and byteLength.\n
    • \n
  • \n Restores cross-browser testing during continuous integration to its\n former glory and adds documentation about engine compatibility.\n
    • \n
  • \n Slims down the development dependencies for testing.\n
    • \n
\n

\n\n

\n 1.11.0 — August 28, 2020 — Diff — Docs — Article
\n

    \n
  • \n Puts the source of every function in a separate module, following\n up on the move to EcmaScript 6 export notation in version 1.10.0. AMD and CommonJS versions of the\n function modules are provided as well. This brings perfect\n treeshaking to all users and unlocks the possibility to create\n arbitrary custom Underscore builds without code size overhead.\n modules/index.js is still present and the UMD bundle is\n still recommended for most users.
    \n Since the modularization obfuscates the diff, piecewise diffs are provided below.\n \n
    • \n
  • \n Adds a monolithic bundle in EcmaScript 6 module format,\n underscore-esm.js, as a modern alternative to the\n monolithic UMD bundle. Users who want to use ES module imports in\n the browser are advised to use this new bundle instead of\n modules/index.js, because underscore-esm.js\n provides the complete Underscore interface in a single download.\n
    • \n
  • \n Adds a modular version of the annotated source, reflecting the full\n internal structure of the primary source code.\n
    • \n
  • \n Adds _.isArrayBuffer, _.isDataView and\n _.isTypedArray functions, as well as support for the\n corresponding value types to _.isEqual.\n
    • \n
  • \n Adds the option to flatten arrays to a specific depth:\n _.flatten(anArray, 3).\n
    • \n
  • \n Adds _.transpose as an alias to _.unzip.\n
    • \n
  • \n Fixes an inconsistency where Array.prototype methods on\n the Underscore wrapper would error when the wrapped value is\n null or undefined. These methods now perform a\n no-op on null values like the other Underscore functions.\n
    • \n
  • \n Fixes a bug that caused _.first and _.last to\n return [] instead of undefined for empty arrays\n when used as an iteratee.\n
    • \n
  • \n Fixes a regression introduced in version 1.9.0 that caused\n _.bindAll to return undefined instead of the\n bound object.\n
    • \n
  • \n Restores continuous integration testing with Travis CI.\n
    • \n
  • \n Replaces stigmatizing\n “whitelist”/“blacklist” terminology in\n comments and documentation by neutral\n “allowed”/“disallowed” terminology.\n
    • \n
  • \n Various clarifications and minor enhancements and fixes to the\n documentation, source comments and a test.\n
    • \n
\n

\n\n

\n 1.10.2 — March 30, 2020 — Diff — Docs
\n

    \n
  • \n Fixes a bug introduced with 1.10.0, while using the legacy\n Node.js require API: var _ = require(\"underscore\")._\n
    • \n
\n

\n\n

\n 1.10.1 — March 30, 2020 — Diff — Docs
\n

    \n
  • \n Fixed relative links among the ES Modules to include the file\n extension, for web browser support.\n
    • \n
\n

\n\n

\n 1.10.0 — March 30, 2020 — Diff — Docs
\n

    \n
  • \n Reformats the source code to use EcmaScript 6 export\n notation. The underscore.js UMD bundle is now compiled\n from underlying source modules instead of being the\n source. From now on, Rollup users have the option to import from\n the underlying source module in order to enable treeshaking.\n
    • \n
  • \n Explicitly states in the documentation, and verifies in the\n unittests, that _.sortedIndex(array, value) always returns\n the lower bound, i.e., the smallest index, at which value\n may be inserted in array.\n
    • \n
  • \n Makes the notation of the _.max unittest consistent with\n other unittests.\n
    • \n
  • \n Fixes a bug that would cause infinite recursion if an overridden\n implementation of _.iteratee attempted to fall back to the\n original implementation.\n
    • \n
  • \n Restores compatibility with EcmaScript 3 and ExtendScript.\n
    • \n
\n

\n\n

\n 1.9.2 — Jan 6, 2020 — Diff — Docs
\n

    \n
  • \n No code changes. Updated a test to help out\n CITGM.\n
    • \n
\n

\n\n

\n 1.9.1 — May 31, 2018 — Diff — Docs
\n

    \n
  • \n Fixes edge-case regressions from 1.9.0, including certain forms\n of calling _.first and _.last on an empty array,\n and passing arrays as keys to _.countBy and _.groupBy.\n
    • \n
\n

\n\n

\n 1.9.0 — April 18, 2018 — Diff — Docs
\n

    \n
  • \n Adds the _.restArguments function for variadic function\n handling.\n
    • \n
  • \n Adds the _.chunk function for chunking up an array.\n
    • \n
  • \n Adds a _.isSymbol, _.isMap, _.isWeakMap,\n _.isSet and _.isWeakSet functions.\n
    • \n
  • \n _.throttle and _.debounce return functions that now\n have a .cancel() method, which can be used to cancel any\n scheduled calls.\n
    • \n
  • \n _.property now accepts arrays of keys and indexes as path\n specifiers, for looking up a deep properties of a value.\n
    • \n
  • \n _.range now accepts negative ranges to generate descending\n arrays.\n
    • \n
  • \n Adds support for several environments including: WebWorkers,\n browserify and ES6 imports.\n
    • \n
  • \n Removes the component.json as the Component package\n management system is discontinued.\n
    • \n
  • \n The placeholder used for partial is now configurable by setting\n _.partial.placeholder.\n
    • \n
  • \n _.bindAll now accepts arrays or arguments for keys.\n
    • \n
  • \n Three years of performance improvements.\n
    • \n
\n

\n\n

\n 1.8.3 — April 2, 2015 — Diff — Docs
\n

    \n
  • \n Adds an _.create method, as a slimmed down version of\n Object.create.\n
    • \n
  • \n Works around an iOS bug that can improperly cause isArrayLike\n to be JIT-ed. Also fixes a bug when passing 0 to isArrayLike.\n
    • \n
\n

\n\n

\n 1.8.2 — Feb. 22, 2015 — Diff — Docs
\n

    \n
  • \n Restores the previous old-Internet-Explorer edge cases changed in\n 1.8.1.\n
    • \n
  • \n Adds a fromIndex argument to _.contains.\n
    • \n
\n

\n\n

\n 1.8.1 — Feb. 19, 2015 — Diff — Docs
\n

    \n
  • \n Fixes/changes some old-Internet Explorer and related edge case\n behavior. Test your app with Underscore 1.8.1 in an old IE and let\n us know how it's doing...\n
    • \n
\n

\n\n

\n 1.8.0 — Feb. 19, 2015 — Diff — Docs
\n

    \n
  • \n Added _.mapObject, which is similar to _.map, but just\n for the values in your object. (A real crowd pleaser.)\n
    • \n
  • \n Added _.allKeys which returns all the enumerable property\n names on an object.\n
    • \n
  • \n Reverted a 1.7.0 change where _.extend only copied \"own\"\n properties. Hopefully this will un-break you — if it breaks you\n again, I apologize.\n
    • \n
  • \n Added _.extendOwn — a less-useful form of _.extend that\n only copies over \"own\" properties.\n
    • \n
  • \n Added _.findIndex and _.findLastIndex functions,\n which nicely complement their twin-twins _.indexOf and _.lastIndexOf.\n
    • \n
  • \n Added an _.isMatch predicate function that tells you if an\n object matches key-value properties. A kissing cousin of\n _.isEqual and _.matcher.\n
    • \n
  • \n Added an _.isError function.\n
    • \n
  • \n Restored the _.unzip function as the inverse of zip.\n Flip-flopping. I know.\n
    • \n
  • \n _.result now takes an optional fallback value (or function\n that provides the fallback value).\n
    • \n
  • \n Added the _.propertyOf function generator as a mirror-world\n version of _.property.\n
    • \n
  • \n Deprecated _.matches. It's now known by a more harmonious\n name — _.matcher.\n
    • \n
  • \n Various and diverse code simplifications, changes for improved\n cross-platform compatibility, and edge case bug fixes.\n
    • \n
\n

\n\n

\n 1.7.0 — August 26, 2014 — Diff — Docs
\n

    \n
  • \n For consistency and speed across browsers, Underscore now ignores\n native array methods for forEach, map, reduce,\n reduceRight, filter, every, some,\n indexOf, and lastIndexOf. \"Sparse\" arrays are\n officially dead in Underscore.\n
    • \n
  • \n Added _.iteratee to customize the iterators used by collection\n functions. Many Underscore methods will take a string argument for easier\n _.property-style lookups, an object for _.where-style\n filtering, or a function as a custom callback.\n
    • \n
  • \n Added _.before as a counterpart to _.after.\n
    • \n
  • \n Added _.negate to invert the truth value of a passed-in\n predicate.\n
    • \n
  • \n Added _.noop as a handy empty placeholder function.\n
    • \n
  • \n _.isEmpty now works with arguments objects.\n
    • \n
  • \n _.has now guards against nullish objects.\n
    • \n
  • \n _.omit can now take an iteratee function.\n
    • \n
  • \n _.partition is now called with index and object.\n
    • \n
  • \n _.matches creates a shallow clone of your object and only iterates\n over own properties.\n
    • \n
  • \n Aligning better with the forthcoming ECMA6 Object.assign,\n _.extend only iterates over the object's own properties.\n
    • \n
  • \n Falsy guards are no longer needed in _.extend and\n _.defaults—if the passed in argument isn't a JavaScript\n object it's just returned.\n
    • \n
  • \n Fixed a few edge cases in _.max and _.min to\n handle arrays containing NaN (like strings or other objects)\n and Infinity and -Infinity.\n
    • \n
  • \n Override base methods like each and some\n and they'll be used internally by other Underscore functions too.\n
    • \n
  • \n The escape functions handle backticks (`), to deal with an\n IE ≤ 8 bug.\n
    • \n
  • \n For consistency, _.union and _.difference now\n only work with arrays and not variadic args.\n
    • \n
  • \n _.memoize exposes the cache of memoized values as a property\n on the returned function.\n
    • \n
  • \n _.pick accepts iteratee and context\n arguments for a more advanced callback.\n
    • \n
  • \n Underscore templates no longer accept an initial data object.\n _.template always returns a function now.\n
    • \n
  • \n Optimizations and code cleanup aplenty.\n
    • \n
\n

\n\n

\n 1.6.0 — February 10, 2014 — Diff — Docs
\n

    \n
  • \n Underscore now registers itself for AMD (Require.js), Bower and Component,\n as well as being a CommonJS module and a regular (Java)Script.\n An ugliness, but perhaps a necessary one.\n
    • \n
  • \n Added _.partition, a way to split a collection into two lists\n of results — those that pass and those that fail a particular predicate.\n
    • \n
  • \n Added _.property, for easy creation of iterators that pull\n specific properties from objects. Useful in conjunction with other\n Underscore collection functions.\n
    • \n
  • \n Added _.matches, a function that will give you a predicate\n that can be used to tell if a given object matches a list of specified\n key/value properties.\n
    • \n
  • \n Added _.constant, as a higher-order _.identity.\n
    • \n
  • \n Added _.now, an optimized way to get a timestamp — used\n internally to speed up debounce and throttle.\n
    • \n
  • \n The _.partial function may now be used to partially apply\n any of its arguments, by passing _ wherever you'd like a\n placeholder variable, to be filled-in later.\n
    • \n
  • \n The _.each function now returns a reference to the list for chaining.\n
    • \n
  • \n The _.keys function now returns an empty array for\n non-objects instead of throwing.\n
    • \n
  • \n … and more miscellaneous refactoring.\n
    • \n
\n

\n\n

\n 1.5.2 — September 7, 2013 — Diff — Docs
\n

    \n
  • \n Added an indexBy function, which fits in alongside its\n cousins, countBy and groupBy.\n
    • \n
  • \n Added a sample function, for sampling random elements from\n arrays.\n
    • \n
  • \n Some optimizations relating to functions that can be implemented\n in terms of _.keys (which includes, significantly,\n each on objects). Also for debounce in a tight loop.\n
    • \n
  • \n The _.escape function no longer escapes '/'.\n
    • \n
\n

\n\n

\n 1.5.1 — July 8, 2013 — Diff — Docs
\n

    \n
  • \n Removed unzip, as it's simply the application of zip\n to an array of arguments. Use _.zip.apply(_, list) to\n transpose instead.\n
    • \n
\n

\n\n

\n 1.5.0 — July 6, 2013 — Diff — Docs
\n

    \n
  • \n Added a new unzip function, as the inverse of _.zip.\n
    • \n
  • \n The throttle function now takes an options argument,\n allowing you to disable execution of the throttled function on either\n the leading or trailing edge.\n
    • \n
  • \n A source map is now supplied for easier debugging of the minified\n production build of Underscore.\n
    • \n
  • \n The defaults function now only overrides undefined\n values, not null ones.\n
    • \n
  • \n Removed the ability to call _.bindAll with no method name\n arguments. It's pretty much always wiser to allow the names of\n the methods you'd like to bind.\n
    • \n
  • \n Removed the ability to call _.after with an invocation count\n of zero. The minimum number of calls is (naturally) now 1.\n
    • \n
\n

\n\n

\n 1.4.4 — January 30, 2013 — Diff — Docs
\n

    \n
  • \n Added _.findWhere, for finding the first element in a list\n that matches a particular set of keys and values.\n
    • \n
  • \n Added _.partial, for partially applying a function without\n changing its dynamic reference to this.\n
    • \n
  • \n Simplified bind by removing some edge cases involving\n constructor functions. In short: don't _.bind your\n constructors.\n
    • \n
  • \n A minor optimization to invoke.\n
    • \n
  • \n Fix bug in the minified version due to the minifier incorrectly\n optimizing-away isFunction.\n
    • \n
\n

\n\n

\n 1.4.3 — December 4, 2012 — Diff — Docs
\n

    \n
  • \n Improved Underscore compatibility with Adobe's JS engine that can be\n used to script Illustrator, Photoshop, and friends.\n
    • \n
  • \n Added a default _.identity iterator to countBy and\n groupBy.\n
    • \n
  • \n The uniq function can now take array, iterator, context\n as the argument list.\n
    • \n
  • \n The times function now returns the mapped array of iterator\n results.\n
    • \n
  • \n Simplified and fixed bugs in throttle.\n
    • \n
\n

\n\n

\n 1.4.2 — October 6, 2012 — Diff — Docs
\n

    \n
  • \n For backwards compatibility, returned to pre-1.4.0 behavior when\n passing null to iteration functions. They now become no-ops\n again.\n
    • \n
\n

\n\n

\n 1.4.1 — October 1, 2012 — Diff — Docs
\n

    \n
  • \n Fixed a 1.4.0 regression in the lastIndexOf function.\n
    • \n
\n

\n\n

\n 1.4.0 — September 27, 2012 — Diff — Docs
\n

    \n
  • \n Added a pairs function, for turning a JavaScript object\n into [key, value] pairs ... as well as an object\n function, for converting an array of [key, value] pairs\n into an object.\n
    • \n
  • \n Added a countBy function, for counting the number of objects\n in a list that match a certain criteria.\n
    • \n
  • \n Added an invert function, for performing a simple inversion\n of the keys and values in an object.\n
    • \n
  • \n Added a where function, for easy cases of filtering a list\n for objects with specific values.\n
    • \n
  • \n Added an omit function, for filtering an object to remove\n certain keys.\n
    • \n
  • \n Added a random function, to return a random number in a\n given range.\n
    • \n
  • \n _.debounce'd functions now return their last updated value,\n just like _.throttle'd functions do.\n
    • \n
  • \n The sortBy function now runs a stable sort algorithm.\n
    • \n
  • \n Added the optional fromIndex option to indexOf and\n lastIndexOf.\n
    • \n
  • \n \"Sparse\" arrays are no longer supported in Underscore iteration\n functions. Use a for loop instead (or better yet, an object).\n
    • \n
  • \n The min and max functions may now be called on\n very large arrays.\n
    • \n
  • \n Interpolation in templates now represents null and\n undefined as the empty string.\n
    • \n
  • \n Underscore iteration functions no longer accept null values\n as a no-op argument. You'll get an early error instead.\n
    • \n
  • \n A number of edge-cases fixes and tweaks, which you can spot in the\n diff.\n Depending on how you're using Underscore, 1.4.0 may be more\n backwards-incompatible than usual — please test when you upgrade.\n
    • \n
\n

\n\n

\n 1.3.3 — April 10, 2012 — Diff — Docs
\n

    \n
  • \n Many improvements to _.template, which now provides the\n source of the template function as a property, for potentially\n even more efficient pre-compilation on the server-side. You may now\n also set the variable option when creating a template,\n which will cause your passed-in data to be made available under the\n variable you named, instead of using a with statement —\n significantly improving the speed of rendering the template.\n
    • \n
  • \n Added the pick function, which allows you to filter an\n object literal with a list of allowed property names.\n
    • \n
  • \n Added the result function, for convenience when working\n with APIs that allow either functions or raw properties.\n
    • \n
  • \n Added the isFinite function, because sometimes knowing that\n a value is a number just ain't quite enough.\n
    • \n
  • \n The sortBy function may now also be passed the string name\n of a property to use as the sort order on each object.\n
    • \n
  • \n Fixed uniq to work with sparse arrays.\n
    • \n
  • \n The difference function now performs a shallow flatten\n instead of a deep one when computing array differences.\n
    • \n
  • \n The debounce function now takes an immediate\n parameter, which will cause the callback to fire on the leading\n instead of the trailing edge.\n
    • \n
\n

\n\n

\n 1.3.1 — January 23, 2012 — Diff — Docs
\n

    \n
  • \n Added an _.has function, as a safer way to use hasOwnProperty.\n
    • \n
  • \n Added _.collect as an alias for _.map. Smalltalkers, rejoice.\n
    • \n
  • \n Reverted an old change so that _.extend will correctly copy\n over keys with undefined values again.\n
    • \n
  • \n Bugfix to stop escaping slashes within interpolations in _.template.\n
    • \n
\n

\n\n

\n 1.3.0 — January 11, 2012 — Diff — Docs
\n

    \n
  • \n Removed AMD (RequireJS) support from Underscore. If you'd like to use\n Underscore with RequireJS, you can load it as a normal script, wrap\n or patch your copy, or download a forked version.\n
    • \n
\n

\n\n

\n 1.2.4 — January 4, 2012 — Diff — Docs
\n

    \n
  • \n You now can (and probably should, as it's simpler)\n write _.chain(list)\n instead of _(list).chain().\n
    • \n
  • \n Fix for escaped characters in Underscore templates, and for supporting\n customizations of _.templateSettings that only define one or\n two of the required regexes.\n
    • \n
  • \n Fix for passing an array as the first argument to an _.wrap'd function.\n
    • \n
  • \n Improved compatibility with ClojureScript, which adds a call\n function to String.prototype.\n
    • \n
\n

\n\n

\n 1.2.3 — December 7, 2011 — Diff — Docs
\n

    \n
  • \n Dynamic scope is now preserved for compiled _.template functions,\n so you can use the value of this if you like.\n
    • \n
  • \n Sparse array support of _.indexOf, _.lastIndexOf.\n
    • \n
  • \n Both _.reduce and _.reduceRight can now be passed an\n explicitly undefined value. (There's no reason why you'd\n want to do this.)\n
    • \n
\n

\n\n

\n 1.2.2 — November 14, 2011 — Diff — Docs
\n

    \n
  • \n Continued tweaks to _.isEqual semantics. Now JS primitives are\n considered equivalent to their wrapped versions, and arrays are compared\n by their numeric properties only (#351).\n
    • \n
  • \n _.escape no longer tries to be smart about not double-escaping\n already-escaped HTML entities. Now it just escapes regardless (#350).\n
    • \n
  • \n In _.template, you may now leave semicolons out of evaluated\n statements if you wish: <% }) %> (#369).\n
    • \n
  • \n _.after(callback, 0) will now trigger the callback immediately,\n making \"after\" easier to use with asynchronous APIs (#366).\n
    • \n
\n

\n\n

\n 1.2.1 — October 24, 2011 — Diff — Docs
\n

    \n
  • \n Several important bug fixes for _.isEqual, which should now\n do better on mutated Arrays, and on non-Array objects with\n length properties. (#329)\n
    • \n
  • \n James Burke\n contributed Underscore exporting for AMD module loaders, and\n Tony Lukasavage\n for Appcelerator Titanium.\n (#335, #338)\n
    • \n
  • \n You can now _.groupBy(list, 'property') as a shortcut for\n grouping values by a particular common property.\n
    • \n
  • \n _.throttle'd functions now fire immediately upon invocation,\n and are rate-limited thereafter (#170, #266).\n
    • \n
  • \n Most of the _.is[Type] checks no longer ducktype.\n
    • \n
  • \n The _.bind function now also works on constructors, a-la\n ES5 ... but you would never want to use _.bind on a\n constructor function.\n
    • \n
  • \n _.clone no longer wraps non-object types in Objects.\n
    • \n
  • \n _.find and _.filter are now the preferred names for\n _.detect and _.select.\n
    • \n
\n

\n\n

\n 1.2.0 — October 5, 2011 — Diff — Docs
\n

    \n
  • \n The _.isEqual function now\n supports true deep equality comparisons, with checks for cyclic structures,\n thanks to Kit Cambridge.\n
    • \n
  • \n Underscore templates now support HTML escaping interpolations, using\n <%- ... %> syntax.\n
    • \n
  • \n Ryan Tenney contributed _.shuffle, which uses a modified\n Fisher-Yates to give you a shuffled copy of an array.\n
    • \n
  • \n _.uniq can now be passed an optional iterator, to determine by\n what criteria an object should be considered unique.\n
    • \n
  • \n _.last now takes an optional argument which will return the last\n N elements of the list.\n
    • \n
  • \n A new _.initial function was added, as a mirror of _.rest,\n which returns all the initial values of a list (except the last N).\n
    • \n
\n

\n\n

\n 1.1.7 — July 13, 2011 — Diff — Docs
\n Added _.groupBy, which aggregates a collection into groups of like items.\n Added _.union and _.difference, to complement the\n (re-named) _.intersection.\n Various improvements for support of sparse arrays.\n _.toArray now returns a clone, if directly passed an array.\n _.functions now also returns the names of functions that are present\n in the prototype chain.\n

\n\n

\n 1.1.6 — April 18, 2011 — Diff — Docs
\n Added _.after, which will return a function that only runs after\n first being called a specified number of times.\n _.invoke can now take a direct function reference.\n _.every now requires an iterator function to be passed, which\n mirrors the ES5 API.\n _.extend no longer copies keys when the value is undefined.\n _.bind now errors when trying to bind an undefined value.\n

\n\n

\n 1.1.5 — March 20, 2011 — Diff — Docs
\n Added an _.defaults function, for use merging together JS objects\n representing default options.\n Added an _.once function, for manufacturing functions that should\n only ever execute a single time.\n _.bind now delegates to the native ES5 version,\n where available.\n _.keys now throws an error when used on non-Object values, as in\n ES5.\n Fixed a bug with _.keys when used over sparse arrays.\n

\n\n

\n 1.1.4 — January 9, 2011 — Diff — Docs
\n Improved compliance with ES5's Array methods when passing null\n as a value. _.wrap now correctly sets this for the\n wrapped function. _.indexOf now takes an optional flag for\n finding the insertion index in an array that is guaranteed to already\n be sorted. Avoiding the use of .callee, to allow _.isArray\n to work properly in ES5's strict mode.\n

\n\n

\n 1.1.3 — December 1, 2010 — Diff — Docs
\n In CommonJS, Underscore may now be required with just:
\n var _ = require(\"underscore\").\n Added _.throttle and _.debounce functions.\n Removed _.breakLoop, in favor of an ES5-style un-break-able\n each implementation — this removes the try/catch, and you'll now have\n better stack traces for exceptions that are thrown within an Underscore iterator.\n Improved the isType family of functions for better interoperability\n with Internet Explorer host objects.\n _.template now correctly escapes backslashes in templates.\n Improved _.reduce compatibility with the ES5 version:\n if you don't pass an initial value, the first item in the collection is used.\n _.each no longer returns the iterated collection, for improved\n consistency with ES5's forEach.\n

\n\n

\n 1.1.2 — October 15, 2010 — Diff — Docs
\n Fixed _.contains, which was mistakenly pointing at\n _.intersect instead of _.include, like it should\n have been. Added _.unique as an alias for _.uniq.\n

\n\n

\n 1.1.1 — October 5, 2010 — Diff — Docs
\n Improved the speed of _.template, and its handling of multiline\n interpolations. Ryan Tenney contributed optimizations to many Underscore\n functions. An annotated version of the source code is now available.\n

\n\n

\n 1.1.0 — August 18, 2010 — Diff — Docs
\n The method signature of _.reduce has been changed to match\n the ES5 signature, instead of the Ruby/Prototype.js version.\n This is a backwards-incompatible change. _.template may now be\n called with no arguments, and preserves whitespace. _.contains\n is a new alias for _.include.\n

\n\n

\n 1.0.4 — June 22, 2010 — Diff — Docs
\n Andri Möll contributed the _.memoize\n function, which can be used to speed up expensive repeated computations\n by caching the results.\n

\n\n

\n 1.0.3 — June 14, 2010 — Diff — Docs
\n Patch that makes _.isEqual return false if any property\n of the compared object has a NaN value. Technically the correct\n thing to do, but of questionable semantics. Watch out for NaN comparisons.\n

\n\n

\n 1.0.2 — March 23, 2010 — Diff — Docs
\n Fixes _.isArguments in recent versions of Opera, which have\n arguments objects as real Arrays.\n

\n\n

\n 1.0.1 — March 19, 2010 — Diff — Docs
\n Bugfix for _.isEqual, when comparing two objects with the same\n number of undefined keys, but with different names.\n

\n\n

\n 1.0.0 — March 18, 2010 — Diff — Docs
\n Things have been stable for many months now, so Underscore is now\n considered to be out of beta, at 1.0. Improvements since 0.6\n include _.isBoolean, and the ability to have _.extend\n take multiple source objects.\n

\n\n

\n 0.6.0 — February 24, 2010 — Diff — Docs
\n Major release. Incorporates a number of\n Mile Frawley's refactors for\n safer duck-typing on collection functions, and cleaner internals. A new\n _.mixin method that allows you to extend Underscore with utility\n functions of your own. Added _.times, which works the same as in\n Ruby or Prototype.js. Native support for ES5's Array.isArray,\n and Object.keys.\n

\n\n

\n 0.5.8 — January 28, 2010 — Diff — Docs
\n Fixed Underscore's collection functions to work on\n NodeLists and\n HTMLCollections\n once more, thanks to\n Justin Tulloss.\n

\n\n

\n 0.5.7 — January 20, 2010 — Diff — Docs
\n A safer implementation of _.isArguments, and a\n faster _.isNumber,
thanks to\n Jed Schmidt.\n

\n\n

\n 0.5.6 — January 18, 2010 — Diff — Docs
\n Customizable delimiters for _.template, contributed by\n Noah Sloan.\n

\n\n

\n 0.5.5 — January 9, 2010 — Diff — Docs
\n Fix for a bug in MobileSafari's OOP-wrapper, with the arguments object.\n

\n\n

\n 0.5.4 — January 5, 2010 — Diff — Docs
\n Fix for multiple single quotes within a template string for\n _.template. See:\n Rick Strahl's blog post.\n

\n\n

\n 0.5.2 — January 1, 2010 — Diff — Docs
\n New implementations of isArray, isDate, isFunction,\n isNumber, isRegExp, and isString, thanks to\n a suggestion from\n Robert Kieffer.\n Instead of doing Object#toString\n comparisons, they now check for expected properties, which is less safe,\n but more than an order of magnitude faster. Most other Underscore\n functions saw minor speed improvements as a result.\n Evgeniy Dolzhenko\n contributed _.tap,\n similar to Ruby 1.9's,\n which is handy for injecting side effects (like logging) into chained calls.\n

\n\n

\n 0.5.1 — December 9, 2009 — Diff — Docs
\n Added an _.isArguments function. Lots of little safety checks\n and optimizations contributed by\n Noah Sloan and\n Andri Möll.\n

\n\n

\n 0.5.0 — December 7, 2009 — Diff — Docs
\n [API Changes] _.bindAll now takes the context object as\n its first parameter. If no method names are passed, all of the context\n object's methods are bound to it, enabling chaining and easier binding.\n _.functions now takes a single argument and returns the names\n of its Function properties. Calling _.functions(_) will get you\n the previous behavior.\n Added _.isRegExp so that isEqual can now test for RegExp equality.\n All of the \"is\" functions have been shrunk down into a single definition.\n Karl Guertin contributed patches.\n

\n\n

\n 0.4.7 — December 6, 2009 — Diff — Docs
\n Added isDate, isNaN, and isNull, for completeness.\n Optimizations for isEqual when checking equality between Arrays\n or Dates. _.keys is now 25%–2X faster (depending on your\n browser) which speeds up the functions that rely on it, such as _.each.\n

\n\n

\n 0.4.6 — November 30, 2009 — Diff — Docs
\n Added the range function, a port of the\n Python\n function of the same name, for generating flexibly-numbered lists\n of integers. Original patch contributed by\n Kirill Ishanov.\n

\n\n

\n 0.4.5 — November 19, 2009 — Diff — Docs
\n Added rest for Arrays and arguments objects, and aliased\n first as head, and rest as tail,\n thanks to Luke Sutton's patches.\n Added tests ensuring that all Underscore Array functions also work on\n arguments objects.\n

\n\n

\n 0.4.4 — November 18, 2009 — Diff — Docs
\n Added isString, and isNumber, for consistency. Fixed\n _.isEqual(NaN, NaN) to return true (which is debatable).\n

\n\n

\n 0.4.3 — November 9, 2009 — Diff — Docs
\n Started using the native StopIteration object in browsers that support it.\n Fixed Underscore setup for CommonJS environments.\n

\n\n

\n 0.4.2 — November 9, 2009 — Diff — Docs
\n Renamed the unwrapping function to value, for clarity.\n

\n\n

\n 0.4.1 — November 8, 2009 — Diff — Docs
\n Chained Underscore objects now support the Array prototype methods, so\n that you can perform the full range of operations on a wrapped array\n without having to break your chain. Added a breakLoop method\n to break in the middle of any Underscore iteration. Added an\n isEmpty function that works on arrays and objects.\n

\n\n

\n 0.4.0 — November 7, 2009 — Diff — Docs
\n All Underscore functions can now be called in an object-oriented style,\n like so: _([1, 2, 3]).map(...);. Original patch provided by\n Marc-André Cournoyer.\n Wrapped objects can be chained through multiple\n method invocations. A functions method\n was added, providing a sorted list of all the functions in Underscore.\n

\n\n

\n 0.3.3 — October 31, 2009 — Diff — Docs
\n Added the JavaScript 1.8 function reduceRight. Aliased it\n as foldr, and aliased reduce as foldl.\n

\n\n

\n 0.3.2 — October 29, 2009 — Diff — Docs
\n Now runs on stock Rhino\n interpreters with: load(\"underscore.js\").\n Added identity as a utility function.\n

\n\n

\n 0.3.1 — October 29, 2009 — Diff — Docs
\n All iterators are now passed in the original collection as their third\n argument, the same as JavaScript 1.6's forEach. Iterating over\n objects is now called with (value, key, collection), for details\n see _.each.\n

\n\n

\n 0.3.0 — October 29, 2009 — Diff — Docs
\n Added Dmitry Baranovskiy's\n comprehensive optimizations, merged in\n Kris Kowal's patches to make Underscore\n CommonJS and\n Narwhal compliant.\n

\n\n

\n 0.2.0 — October 28, 2009 — Diff — Docs
\n Added compose and lastIndexOf, renamed inject to\n reduce, added aliases for inject, filter,\n every, some, and forEach.\n

\n\n

\n 0.1.1 — October 28, 2009 — Diff — Docs
\n Added noConflict, so that the \"Underscore\" object can be assigned to\n other variables.\n

\n\n

\n 0.1.0 — October 28, 2009 — Docs
\n Initial release of Underscore.js.\n

\n\n

\n \n \"A\n \n

\n\n
\n\n
\n\n \n \n \n \n\n\n" }, { "path": "karma.conf-sauce.js", "content": "var _ = require('./');\n\n// Browsers to run on Sauce Labs platforms\n// (See https://saucelabs.com/platform/supported-browsers-devices for an\n// up-to-date overview of supported versions of browsers and platforms.)\nvar sauceBrowsers = _.reduce([\n ['firefox', 'latest'],\n ['firefox', '60'],\n ['firefox', '40'],\n ['firefox', '11'],\n // ['firefox', '4'], // failing due to \"not enough arguments\"\n\n ['chrome', 'latest'],\n ['chrome', '60'],\n ['chrome', '40'],\n ['chrome', '26'],\n\n // latest Edge as well as pre-Blink versions\n ['microsoftedge', 'latest', 'Windows 10'],\n ['microsoftedge', '18', 'Windows 10'],\n ['microsoftedge', '13', 'Windows 10'],\n\n ['internet explorer', 'latest', 'Windows 10'],\n ['internet explorer', '10', 'Windows 8'],\n ['internet explorer', '9', 'Windows 7'],\n // Older versions of IE no longer supported by Sauce Labs\n\n ['safari', 'latest', 'macOS 10.15'],\n ['safari', '12', 'macOS 10.14'],\n ['safari', '11', 'macOS 10.13'],\n ['safari', '8', 'OS X 10.10'],\n\n], function(memo, platform) {\n // internet explorer -> ie\n var label = platform[0].split(' ');\n if (label.length > 1) {\n label = _.invoke(label, 'charAt', 0)\n }\n label = (label.join(\"\") + '_v' + platform[1]).replace(' ', '_').toUpperCase();\n memo[label] = _.pick({\n 'base': 'SauceLabs',\n 'browserName': platform[0],\n 'version': platform[1],\n 'platform': platform[2]\n }, Boolean);\n return memo;\n}, {});\n\nmodule.exports = function(config) {\n if ( !process.env.SAUCE_USERNAME || !process.env.SAUCE_ACCESS_KEY ) {\n console.log('Sauce environments not set --- Skipping');\n return process.exit(0);\n }\n\n config.set({\n basePath: '',\n frameworks: ['qunit'],\n singleRun: true,\n browserDisconnectTolerance: 5,\n browserNoActivityTimeout: 240000,\n\n // list of files / patterns to load in the browser\n files: [\n 'test/vendor/qunit-extras.js',\n 'test/qunit-setup.js',\n 'test/overrides.js',\n 'underscore-umd.js',\n 'test/*.js'\n ],\n\n // Number of sauce tests to start in parallel\n concurrency: 9,\n\n // test results reporter to use\n reporters: ['dots', 'saucelabs'],\n port: 9876,\n colors: true,\n logLevel: config.LOG_INFO,\n sauceLabs: {\n build: 'TRAVIS #' + process.env.TRAVIS_BUILD_NUMBER + ' (' + process.env.TRAVIS_BUILD_ID + ')',\n startConnect: true,\n tunnelIdentifier: process.env.TRAVIS_JOB_NUMBER\n },\n\n captureTimeout: 120000,\n customLaunchers: sauceBrowsers,\n\n // Browsers to launch, commented out to prevent karma from starting\n // too many concurrent browsers and timing sauce out.\n browsers: _.keys(sauceBrowsers)\n });\n};\n" }, { "path": "karma.conf.js", "content": "// Note some browser launchers should be installed before using karma start.\n\n// For example:\n// $ npm install karma-firefox-launcher\n// $ karma start --browser=Firefox\n\n// See https://karma-runner.github.io/0.8/config/configuration-file.html\nmodule.exports = function(config) {\n config.set({\n basePath: '',\n frameworks: ['qunit'],\n logLevel: config.LOG_INFO,\n port: 9876,\n\n // list of files / patterns to load in the browser\n files: [\n 'test/qunit-setup.js',\n 'test/overrides.js',\n 'underscore-umd.js',\n 'test/*.js'\n ],\n\n // Test results reporter to use\n // https://npmjs.org/browse/keyword/karma-reporter\n reporters: ['progress'],\n\n // start these browsers\n // available browser launchers: https://npmjs.org/browse/keyword/karma-launcher\n browsers: ['PhantomJS'],\n\n // Continuous Integration mode\n // if true, Karma captures browsers, runs the tests and exits\n singleRun: true\n });\n};" }, { "path": "modules/.eslintrc", "content": "{\n \"parserOptions\": {\n \"ecmaVersion\": 6,\n \"sourceType\": \"module\",\n },\n \"plugins\": [\n \"import\"\n ],\n \"extends\": [\n \"plugin:import/errors\"\n ],\n \"rules\": {\n // ExtendScript wrongly gives equal precedence to && and ||. #2949\n \"no-mixed-operators\": [\n \"error\",\n {\n \"groups\": [[\"&&\", \"||\"]]\n }\n ]\n }\n}\n" }, { "path": "modules/_baseCreate.js", "content": "import isObject from './isObject.js';\nimport { nativeCreate } from './_setup.js';\n\n// Create a naked function reference for surrogate-prototype-swapping.\nfunction ctor() {\n return function(){};\n}\n\n// An internal function for creating a new object that inherits from another.\nexport default function baseCreate(prototype) {\n if (!isObject(prototype)) return {};\n if (nativeCreate) return nativeCreate(prototype);\n var Ctor = ctor();\n Ctor.prototype = prototype;\n var result = new Ctor;\n Ctor.prototype = null;\n return result;\n}\n" }, { "path": "modules/_baseIteratee.js", "content": "import identity from './identity.js';\nimport isFunction from './isFunction.js';\nimport isObject from './isObject.js';\nimport isArray from './isArray.js';\nimport matcher from './matcher.js';\nimport property from './property.js';\nimport optimizeCb from './_optimizeCb.js';\n\n// An internal function to generate callbacks that can be applied to each\n// element in a collection, returning the desired result — either `_.identity`,\n// an arbitrary callback, a property matcher, or a property accessor.\nexport default function baseIteratee(value, context, argCount) {\n if (value == null) return identity;\n if (isFunction(value)) return optimizeCb(value, context, argCount);\n if (isObject(value) && !isArray(value)) return matcher(value);\n return property(value);\n}\n" }, { "path": "modules/_cb.js", "content": "import _ from './underscore.js';\nimport baseIteratee from './_baseIteratee.js';\nimport iteratee from './iteratee.js';\n\n// The function we call internally to generate a callback. It invokes\n// `_.iteratee` if overridden, otherwise `baseIteratee`.\nexport default function cb(value, context, argCount) {\n if (_.iteratee !== iteratee) return _.iteratee(value, context);\n return baseIteratee(value, context, argCount);\n}\n" }, { "path": "modules/_chainResult.js", "content": "import _ from './underscore.js';\n\n// Helper function to continue chaining intermediate results.\nexport default function chainResult(instance, obj) {\n return instance._chain ? _(obj).chain() : obj;\n}\n" }, { "path": "modules/_collectNonEnumProps.js", "content": "import { nonEnumerableProps, ObjProto } from './_setup.js';\nimport isFunction from './isFunction.js';\nimport has from './_has.js';\n\n// Internal helper to create a simple lookup structure.\n// `collectNonEnumProps` used to depend on `_.contains`, but this led to\n// circular imports. `emulatedSet` is a one-off solution that only works for\n// arrays of strings.\nfunction emulatedSet(keys) {\n var hash = {};\n for (var l = keys.length, i = 0; i < l; ++i) hash[keys[i]] = true;\n return {\n contains: function(key) { return hash[key] === true; },\n push: function(key) {\n hash[key] = true;\n return keys.push(key);\n }\n };\n}\n\n// Internal helper. Checks `keys` for the presence of keys in IE < 9 that won't\n// be iterated by `for key in ...` and thus missed. Extends `keys` in place if\n// needed.\nexport default function collectNonEnumProps(obj, keys) {\n keys = emulatedSet(keys);\n var nonEnumIdx = nonEnumerableProps.length;\n var constructor = obj.constructor;\n var proto = (isFunction(constructor) && constructor.prototype) || ObjProto;\n\n // Constructor is a special case.\n var prop = 'constructor';\n if (has(obj, prop) && !keys.contains(prop)) keys.push(prop);\n\n while (nonEnumIdx--) {\n prop = nonEnumerableProps[nonEnumIdx];\n if (prop in obj && obj[prop] !== proto[prop] && !keys.contains(prop)) {\n keys.push(prop);\n }\n }\n}\n" }, { "path": "modules/_createAssigner.js", "content": "// An internal function for creating assigner functions.\nexport default function createAssigner(keysFunc, defaults) {\n return function(obj) {\n var length = arguments.length;\n if (defaults) obj = Object(obj);\n if (length < 2 || obj == null) return obj;\n for (var index = 1; index < length; index++) {\n var source = arguments[index],\n keys = keysFunc(source),\n l = keys.length;\n for (var i = 0; i < l; i++) {\n var key = keys[i];\n if (!defaults || obj[key] === void 0) obj[key] = source[key];\n }\n }\n return obj;\n };\n}\n" }, { "path": "modules/_createEscaper.js", "content": "import keys from './keys.js';\n\n// Internal helper to generate functions for escaping and unescaping strings\n// to/from HTML interpolation.\nexport default function createEscaper(map) {\n var escaper = function(match) {\n return map[match];\n };\n // Regexes for identifying a key that needs to be escaped.\n var source = '(?:' + keys(map).join('|') + ')';\n var testRegexp = RegExp(source);\n var replaceRegexp = RegExp(source, 'g');\n return function(string) {\n string = string == null ? '' : '' + string;\n return testRegexp.test(string) ? string.replace(replaceRegexp, escaper) : string;\n };\n}\n" }, { "path": "modules/_createIndexFinder.js", "content": "import getLength from './_getLength.js';\nimport { slice } from './_setup.js';\nimport isNaN from './isNaN.js';\n\n// Internal function to generate the `_.indexOf` and `_.lastIndexOf` functions.\nexport default function createIndexFinder(dir, predicateFind, sortedIndex) {\n return function(array, item, idx) {\n var i = 0, length = getLength(array);\n if (typeof idx == 'number') {\n if (dir > 0) {\n i = idx >= 0 ? idx : Math.max(idx + length, i);\n } else {\n length = idx >= 0 ? Math.min(idx + 1, length) : idx + length + 1;\n }\n } else if (sortedIndex && idx && length) {\n idx = sortedIndex(array, item);\n return array[idx] === item ? idx : -1;\n }\n if (item !== item) {\n idx = predicateFind(slice.call(array, i, length), isNaN);\n return idx >= 0 ? idx + i : -1;\n }\n for (idx = dir > 0 ? i : length - 1; idx >= 0 && idx < length; idx += dir) {\n if (array[idx] === item) return idx;\n }\n return -1;\n };\n}\n" }, { "path": "modules/_createPredicateIndexFinder.js", "content": "import cb from './_cb.js';\nimport getLength from './_getLength.js';\n\n// Internal function to generate `_.findIndex` and `_.findLastIndex`.\nexport default function createPredicateIndexFinder(dir) {\n return function(array, predicate, context) {\n predicate = cb(predicate, context);\n var length = getLength(array);\n var index = dir > 0 ? 0 : length - 1;\n for (; index >= 0 && index < length; index += dir) {\n if (predicate(array[index], index, array)) return index;\n }\n return -1;\n };\n}\n" }, { "path": "modules/_createReduce.js", "content": "import isArrayLike from './_isArrayLike.js';\nimport keys from './keys.js';\nimport optimizeCb from './_optimizeCb.js';\n\n// Internal helper to create a reducing function, iterating left or right.\nexport default function createReduce(dir) {\n // Wrap code that reassigns argument variables in a separate function than\n // the one that accesses `arguments.length` to avoid a perf hit. (#1991)\n var reducer = function(obj, iteratee, memo, initial) {\n var _keys = !isArrayLike(obj) && keys(obj),\n length = (_keys || obj).length,\n index = dir > 0 ? 0 : length - 1;\n if (!initial) {\n memo = obj[_keys ? _keys[index] : index];\n index += dir;\n }\n for (; index >= 0 && index < length; index += dir) {\n var currentKey = _keys ? _keys[index] : index;\n memo = iteratee(memo, obj[currentKey], currentKey, obj);\n }\n return memo;\n };\n\n return function(obj, iteratee, memo, context) {\n var initial = arguments.length >= 3;\n return reducer(obj, optimizeCb(iteratee, context, 4), memo, initial);\n };\n}\n" }, { "path": "modules/_createSizePropertyCheck.js", "content": "import { MAX_ARRAY_INDEX } from './_setup.js';\n\n// Common internal logic for `isArrayLike` and `isBufferLike`.\nexport default function createSizePropertyCheck(getSizeProperty) {\n return function(collection) {\n var sizeProperty = getSizeProperty(collection);\n return typeof sizeProperty == 'number' && sizeProperty >= 0 && sizeProperty <= MAX_ARRAY_INDEX;\n }\n}\n" }, { "path": "modules/_deepGet.js", "content": "// Internal function to obtain a nested property in `obj` along `path`.\nexport default function deepGet(obj, path) {\n var length = path.length;\n for (var i = 0; i < length; i++) {\n if (obj == null) return void 0;\n obj = obj[path[i]];\n }\n return length ? obj : void 0;\n}\n" }, { "path": "modules/_escapeMap.js", "content": "// Internal list of HTML entities for escaping.\nexport default {\n '&': '&',\n '<': '<',\n '>': '>',\n '\"': '"',\n \"'\": ''',\n '`': '`'\n};\n" }, { "path": "modules/_executeBound.js", "content": "import baseCreate from './_baseCreate.js';\nimport isObject from './isObject.js';\n\n// Internal function to execute `sourceFunc` bound to `context` with optional\n// `args`. Determines whether to execute a function as a constructor or as a\n// normal function.\nexport default function executeBound(sourceFunc, boundFunc, context, callingContext, args) {\n if (!(callingContext instanceof boundFunc)) return sourceFunc.apply(context, args);\n var self = baseCreate(sourceFunc.prototype);\n var result = sourceFunc.apply(self, args);\n if (isObject(result)) return result;\n return self;\n}\n" }, { "path": "modules/_flatten.js", "content": "import getLength from './_getLength.js';\nimport isArrayLike from './_isArrayLike.js';\nimport isArray from './isArray.js';\nimport isArguments from './isArguments.js';\n\n// Internal implementation of a `flatten` function.\nexport default function flatten(input, depth, strict) {\n if (!depth && depth !== 0) depth = Infinity;\n // We will be avoiding recursive calls because this could be exploited to\n // cause a stack overflow (CVE-2026-27601). Instead, we \"trampoline\" on an\n // explicit stack.\n var output = [], idx = 0, i = 0, length = getLength(input) || 0, stack = [];\n while (true) {\n if (i >= length) {\n if (!stack.length) break;\n var frame = stack.pop();\n i = frame.i;\n input = frame.v;\n length = getLength(input);\n continue;\n }\n var value = input[i++];\n if (stack.length >= depth) {\n output[idx++] = value;\n } else if (isArrayLike(value) && (isArray(value) || isArguments(value))) {\n // Flatten current level of array or arguments object.\n stack.push({i: i, v: input});\n i = 0;\n input = value;\n length = getLength(input);\n } else if (!strict) {\n output[idx++] = value;\n }\n }\n return output;\n}\n" }, { "path": "modules/_getByteLength.js", "content": "import shallowProperty from './_shallowProperty.js';\n\n// Internal helper to obtain the `byteLength` property of an object.\nexport default shallowProperty('byteLength');\n" }, { "path": "modules/_getLength.js", "content": "import shallowProperty from './_shallowProperty.js';\n\n// Internal helper to obtain the `length` property of an object.\nexport default shallowProperty('length');\n" }, { "path": "modules/_group.js", "content": "import cb from './_cb.js';\nimport each from './each.js';\n\n// An internal function used for aggregate \"group by\" operations.\nexport default function group(behavior, partition) {\n return function(obj, iteratee, context) {\n var result = partition ? [[], []] : {};\n iteratee = cb(iteratee, context);\n each(obj, function(value, index) {\n var key = iteratee(value, index, obj);\n behavior(result, value, key);\n });\n return result;\n };\n}\n" }, { "path": "modules/_has.js", "content": "import { hasOwnProperty } from './_setup.js';\n\n// Internal function to check whether `key` is an own property name of `obj`.\nexport default function has(obj, key) {\n return obj != null && hasOwnProperty.call(obj, key);\n}\n" }, { "path": "modules/_hasObjectTag.js", "content": "import tagTester from './_tagTester.js';\n\nexport default tagTester('Object');\n" }, { "path": "modules/_isArrayLike.js", "content": "import createSizePropertyCheck from './_createSizePropertyCheck.js';\nimport getLength from './_getLength.js';\n\n// Internal helper for collection methods to determine whether a collection\n// should be iterated as an array or as an object.\n// Related: https://people.mozilla.org/~jorendorff/es6-draft.html#sec-tolength\n// Avoids a very nasty iOS 8 JIT bug on ARM-64. #2094\nexport default createSizePropertyCheck(getLength);\n" }, { "path": "modules/_isBufferLike.js", "content": "import createSizePropertyCheck from './_createSizePropertyCheck.js';\nimport getByteLength from './_getByteLength.js';\n\n// Internal helper to determine whether we should spend extensive checks against\n// `ArrayBuffer` et al.\nexport default createSizePropertyCheck(getByteLength);\n" }, { "path": "modules/_keyInObj.js", "content": "// Internal `_.pick` helper function to determine whether `key` is an enumerable\n// property name of `obj`.\nexport default function keyInObj(value, key, obj) {\n return key in obj;\n}\n" }, { "path": "modules/_methodFingerprint.js", "content": "import getLength from './_getLength.js';\nimport isFunction from './isFunction.js';\nimport allKeys from './allKeys.js';\n\n// Since the regular `Object.prototype.toString` type tests don't work for\n// some types in IE 11, we use a fingerprinting heuristic instead, based\n// on the methods. It's not great, but it's the best we got.\n// The fingerprint method lists are defined below.\nexport function ie11fingerprint(methods) {\n var length = getLength(methods);\n return function(obj) {\n if (obj == null) return false;\n // `Map`, `WeakMap` and `Set` have no enumerable keys.\n var keys = allKeys(obj);\n if (getLength(keys)) return false;\n for (var i = 0; i < length; i++) {\n if (!isFunction(obj[methods[i]])) return false;\n }\n // If we are testing against `WeakMap`, we need to ensure that\n // `obj` doesn't have a `forEach` method in order to distinguish\n // it from a regular `Map`.\n return methods !== weakMapMethods || !isFunction(obj[forEachName]);\n };\n}\n\n// In the interest of compact minification, we write\n// each string in the fingerprints only once.\nvar forEachName = 'forEach',\n hasName = 'has',\n commonInit = ['clear', 'delete'],\n mapTail = ['get', hasName, 'set'];\n\n// `Map`, `WeakMap` and `Set` each have slightly different\n// combinations of the above sublists.\nexport var mapMethods = commonInit.concat(forEachName, mapTail),\n weakMapMethods = commonInit.concat(mapTail),\n setMethods = ['add'].concat(commonInit, forEachName, hasName);\n" }, { "path": "modules/_optimizeCb.js", "content": "// Internal function that returns an efficient (for current engines) version\n// of the passed-in callback, to be repeatedly applied in other Underscore\n// functions.\nexport default function optimizeCb(func, context, argCount) {\n if (context === void 0) return func;\n switch (argCount == null ? 3 : argCount) {\n case 1: return function(value) {\n return func.call(context, value);\n };\n // The 2-argument case is omitted because we’re not using it.\n case 3: return function(value, index, collection) {\n return func.call(context, value, index, collection);\n };\n case 4: return function(accumulator, value, index, collection) {\n return func.call(context, accumulator, value, index, collection);\n };\n }\n return function() {\n return func.apply(context, arguments);\n };\n}\n" }, { "path": "modules/_setup.js", "content": "// Current version.\nexport var VERSION = '1.13.8';\n\n// Establish the root object, `window` (`self`) in the browser, `global`\n// on the server, or `this` in some virtual machines. We use `self`\n// instead of `window` for `WebWorker` support.\nexport var root = (typeof self == 'object' && self.self === self && self) ||\n (typeof global == 'object' && global.global === global && global) ||\n Function('return this')() ||\n {};\n\n// Save bytes in the minified (but not gzipped) version:\nexport var ArrayProto = Array.prototype, ObjProto = Object.prototype;\nexport var SymbolProto = typeof Symbol !== 'undefined' ? Symbol.prototype : null;\n\n// Create quick reference variables for speed access to core prototypes.\nexport var push = ArrayProto.push,\n slice = ArrayProto.slice,\n toString = ObjProto.toString,\n hasOwnProperty = ObjProto.hasOwnProperty;\n\n// Modern feature detection.\nexport var supportsArrayBuffer = typeof ArrayBuffer !== 'undefined',\n supportsDataView = typeof DataView !== 'undefined';\n\n// All **ECMAScript 5+** native function implementations that we hope to use\n// are declared here.\nexport var nativeIsArray = Array.isArray,\n nativeKeys = Object.keys,\n nativeCreate = Object.create,\n nativeIsView = supportsArrayBuffer && ArrayBuffer.isView;\n\n// Create references to these builtin functions because we override them.\nexport var _isNaN = isNaN,\n _isFinite = isFinite;\n\n// Keys in IE < 9 that won't be iterated by `for key in ...` and thus missed.\nexport var hasEnumBug = !{toString: null}.propertyIsEnumerable('toString');\nexport var nonEnumerableProps = ['valueOf', 'isPrototypeOf', 'toString',\n 'propertyIsEnumerable', 'hasOwnProperty', 'toLocaleString'];\n\n// The largest integer that can be represented exactly.\nexport var MAX_ARRAY_INDEX = Math.pow(2, 53) - 1;\n" }, { "path": "modules/_shallowProperty.js", "content": "// Internal helper to generate a function to obtain property `key` from `obj`.\nexport default function shallowProperty(key) {\n return function(obj) {\n return obj == null ? void 0 : obj[key];\n };\n}\n" }, { "path": "modules/_stringTagBug.js", "content": "import { supportsDataView } from './_setup.js';\nimport hasObjectTag from './_hasObjectTag.js';\n\n// In IE 10 - Edge 13, `DataView` has string tag `'[object Object]'`.\n// In IE 11, the most common among them, this problem also applies to\n// `Map`, `WeakMap` and `Set`.\n// Also, there are cases where an application can override the native\n// `DataView` object, in cases like that we can't use the constructor\n// safely and should just rely on alternate `DataView` checks\nexport var hasDataViewBug = (\n supportsDataView && (!/\\[native code\\]/.test(String(DataView)) || hasObjectTag(new DataView(new ArrayBuffer(8))))\n ),\n isIE11 = (typeof Map !== 'undefined' && hasObjectTag(new Map));\n" }, { "path": "modules/_tagTester.js", "content": "import { toString } from './_setup.js';\n\n// Internal function for creating a `toString`-based type tester.\nexport default function tagTester(name) {\n var tag = '[object ' + name + ']';\n return function(obj) {\n return toString.call(obj) === tag;\n };\n}\n" }, { "path": "modules/_toBufferView.js", "content": "import getByteLength from './_getByteLength.js';\n\n// Internal function to wrap or shallow-copy an ArrayBuffer,\n// typed array or DataView to a new view, reusing the buffer.\nexport default function toBufferView(bufferSource) {\n return new Uint8Array(\n bufferSource.buffer || bufferSource,\n bufferSource.byteOffset || 0,\n getByteLength(bufferSource)\n );\n}\n" }, { "path": "modules/_toPath.js", "content": "import _ from './underscore.js';\nimport './toPath.js';\n\n// Internal wrapper for `_.toPath` to enable minification.\n// Similar to `cb` for `_.iteratee`.\nexport default function toPath(path) {\n return _.toPath(path);\n}\n" }, { "path": "modules/_unescapeMap.js", "content": "import invert from './invert.js';\nimport escapeMap from './_escapeMap.js';\n\n// Internal list of HTML entities for unescaping.\nexport default invert(escapeMap);\n" }, { "path": "modules/after.js", "content": "// Returns a function that will only be executed on and after the Nth call.\nexport default function after(times, func) {\n return function() {\n if (--times < 1) {\n return func.apply(this, arguments);\n }\n };\n}\n" }, { "path": "modules/allKeys.js", "content": "import isObject from './isObject.js';\nimport { hasEnumBug } from './_setup.js';\nimport collectNonEnumProps from './_collectNonEnumProps.js';\n\n// Retrieve all the enumerable property names of an object.\nexport default function allKeys(obj) {\n if (!isObject(obj)) return [];\n var keys = [];\n for (var key in obj) keys.push(key);\n // Ahem, IE < 9.\n if (hasEnumBug) collectNonEnumProps(obj, keys);\n return keys;\n}\n" }, { "path": "modules/before.js", "content": "// Returns a function that will only be executed up to (but not including) the\n// Nth call.\nexport default function before(times, func) {\n var memo;\n return function() {\n if (--times > 0) {\n memo = func.apply(this, arguments);\n }\n if (times <= 1) func = null;\n return memo;\n };\n}\n" }, { "path": "modules/bind.js", "content": "import restArguments from './restArguments.js';\nimport isFunction from './isFunction.js';\nimport executeBound from './_executeBound.js';\n\n// Create a function bound to a given object (assigning `this`, and arguments,\n// optionally).\nexport default restArguments(function(func, context, args) {\n if (!isFunction(func)) throw new TypeError('Bind must be called on a function');\n var bound = restArguments(function(callArgs) {\n return executeBound(func, bound, context, this, args.concat(callArgs));\n });\n return bound;\n});\n" }, { "path": "modules/bindAll.js", "content": "import restArguments from './restArguments.js';\nimport flatten from './_flatten.js';\nimport bind from './bind.js';\n\n// Bind a number of an object's methods to that object. Remaining arguments\n// are the method names to be bound. Useful for ensuring that all callbacks\n// defined on an object belong to it.\nexport default restArguments(function(obj, keys) {\n keys = flatten(keys, false, false);\n var index = keys.length;\n if (index < 1) throw new Error('bindAll must be passed function names');\n while (index--) {\n var key = keys[index];\n obj[key] = bind(obj[key], obj);\n }\n return obj;\n});\n" }, { "path": "modules/chain.js", "content": "import _ from './underscore.js';\n\n// Start chaining a wrapped Underscore object.\nexport default function chain(obj) {\n var instance = _(obj);\n instance._chain = true;\n return instance;\n}\n" }, { "path": "modules/chunk.js", "content": "import { slice } from './_setup.js';\n\n// Chunk a single array into multiple arrays, each containing `count` or fewer\n// items.\nexport default function chunk(array, count) {\n if (count == null || count < 1) return [];\n var result = [];\n var i = 0, length = array.length;\n while (i < length) {\n result.push(slice.call(array, i, i += count));\n }\n return result;\n}\n" }, { "path": "modules/clone.js", "content": "import isObject from './isObject.js';\nimport isArray from './isArray.js';\nimport extend from './extend.js';\n\n// Create a (shallow-cloned) duplicate of an object.\nexport default function clone(obj) {\n if (!isObject(obj)) return obj;\n return isArray(obj) ? obj.slice() : extend({}, obj);\n}\n" }, { "path": "modules/compact.js", "content": "import filter from './filter.js';\n\n// Trim out all falsy values from an array.\nexport default function compact(array) {\n return filter(array, Boolean);\n}\n" }, { "path": "modules/compose.js", "content": "// Returns a function that is the composition of a list of functions, each\n// consuming the return value of the function that follows.\nexport default function compose() {\n var args = arguments;\n var start = args.length - 1;\n return function() {\n var i = start;\n var result = args[start].apply(this, arguments);\n while (i--) result = args[i].call(this, result);\n return result;\n };\n}\n" }, { "path": "modules/constant.js", "content": "// Predicate-generating function. Often useful outside of Underscore.\nexport default function constant(value) {\n return function() {\n return value;\n };\n}\n" }, { "path": "modules/contains.js", "content": "import isArrayLike from './_isArrayLike.js';\nimport values from './values.js';\nimport indexOf from './indexOf.js';\n\n// Determine if the array or object contains a given item (using `===`).\nexport default function contains(obj, item, fromIndex, guard) {\n if (!isArrayLike(obj)) obj = values(obj);\n if (typeof fromIndex != 'number' || guard) fromIndex = 0;\n return indexOf(obj, item, fromIndex) >= 0;\n}\n" }, { "path": "modules/countBy.js", "content": "import group from './_group.js';\nimport has from './_has.js';\n\n// Counts instances of an object that group by a certain criterion. Pass\n// either a string attribute to count by, or a function that returns the\n// criterion.\nexport default group(function(result, value, key) {\n if (has(result, key)) result[key]++; else result[key] = 1;\n});\n" }, { "path": "modules/create.js", "content": "import baseCreate from './_baseCreate.js';\nimport extendOwn from './extendOwn.js';\n\n// Creates an object that inherits from the given prototype object.\n// If additional properties are provided then they will be added to the\n// created object.\nexport default function create(prototype, props) {\n var result = baseCreate(prototype);\n if (props) extendOwn(result, props);\n return result;\n}\n" }, { "path": "modules/debounce.js", "content": "import restArguments from './restArguments.js';\nimport now from './now.js';\n\n// When a sequence of calls of the returned function ends, the argument\n// function is triggered. The end of a sequence is defined by the `wait`\n// parameter. If `immediate` is passed, the argument function will be\n// triggered at the beginning of the sequence instead of at the end.\nexport default function debounce(func, wait, immediate) {\n var timeout, previous, args, result, context;\n\n var later = function() {\n var passed = now() - previous;\n if (wait > passed) {\n timeout = setTimeout(later, wait - passed);\n } else {\n timeout = null;\n if (!immediate) result = func.apply(context, args);\n // This check is needed because `func` can recursively invoke `debounced`.\n if (!timeout) args = context = null;\n }\n };\n\n var debounced = restArguments(function(_args) {\n context = this;\n args = _args;\n previous = now();\n if (!timeout) {\n timeout = setTimeout(later, wait);\n if (immediate) result = func.apply(context, args);\n }\n return result;\n });\n\n debounced.cancel = function() {\n clearTimeout(timeout);\n timeout = args = context = null;\n };\n\n return debounced;\n}\n" }, { "path": "modules/defaults.js", "content": "import createAssigner from './_createAssigner.js';\nimport allKeys from './allKeys.js';\n\n// Fill in a given object with default properties.\nexport default createAssigner(allKeys, true);\n" }, { "path": "modules/defer.js", "content": "import partial from './partial.js';\nimport delay from './delay.js';\nimport _ from './underscore.js';\n\n// Defers a function, scheduling it to run after the current call stack has\n// cleared.\nexport default partial(delay, _, 1);\n" }, { "path": "modules/delay.js", "content": "import restArguments from './restArguments.js';\n\n// Delays a function for the given number of milliseconds, and then calls\n// it with the arguments supplied.\nexport default restArguments(function(func, wait, args) {\n return setTimeout(function() {\n return func.apply(null, args);\n }, wait);\n});\n" }, { "path": "modules/difference.js", "content": "import restArguments from './restArguments.js';\nimport flatten from './_flatten.js';\nimport filter from './filter.js';\nimport contains from './contains.js';\n\n// Take the difference between one array and a number of other arrays.\n// Only the elements present in just the first array will remain.\nexport default restArguments(function(array, rest) {\n rest = flatten(rest, true, true);\n return filter(array, function(value){\n return !contains(rest, value);\n });\n});\n" }, { "path": "modules/each.js", "content": "import optimizeCb from './_optimizeCb.js';\nimport isArrayLike from './_isArrayLike.js';\nimport keys from './keys.js';\n\n// The cornerstone for collection functions, an `each`\n// implementation, aka `forEach`.\n// Handles raw objects in addition to array-likes. Treats all\n// sparse array-likes as if they were dense.\nexport default function each(obj, iteratee, context) {\n iteratee = optimizeCb(iteratee, context);\n var i, length;\n if (isArrayLike(obj)) {\n for (i = 0, length = obj.length; i < length; i++) {\n iteratee(obj[i], i, obj);\n }\n } else {\n var _keys = keys(obj);\n for (i = 0, length = _keys.length; i < length; i++) {\n iteratee(obj[_keys[i]], _keys[i], obj);\n }\n }\n return obj;\n}\n" }, { "path": "modules/escape.js", "content": "import createEscaper from './_createEscaper.js';\nimport escapeMap from './_escapeMap.js';\n\n// Function for escaping strings to HTML interpolation.\nexport default createEscaper(escapeMap);\n" }, { "path": "modules/every.js", "content": "import cb from './_cb.js';\nimport isArrayLike from './_isArrayLike.js';\nimport keys from './keys.js';\n\n// Determine whether all of the elements pass a truth test.\nexport default function every(obj, predicate, context) {\n predicate = cb(predicate, context);\n var _keys = !isArrayLike(obj) && keys(obj),\n length = (_keys || obj).length;\n for (var index = 0; index < length; index++) {\n var currentKey = _keys ? _keys[index] : index;\n if (!predicate(obj[currentKey], currentKey, obj)) return false;\n }\n return true;\n}\n" }, { "path": "modules/extend.js", "content": "import createAssigner from './_createAssigner.js';\nimport allKeys from './allKeys.js';\n\n// Extend a given object with all the properties in passed-in object(s).\nexport default createAssigner(allKeys);\n" }, { "path": "modules/extendOwn.js", "content": "import createAssigner from './_createAssigner.js';\nimport keys from './keys.js';\n\n// Assigns a given object with all the own properties in the passed-in\n// object(s).\n// (https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Object/assign)\nexport default createAssigner(keys);\n" }, { "path": "modules/filter.js", "content": "import cb from './_cb.js';\nimport each from './each.js';\n\n// Return all the elements that pass a truth test.\nexport default function filter(obj, predicate, context) {\n var results = [];\n predicate = cb(predicate, context);\n each(obj, function(value, index, list) {\n if (predicate(value, index, list)) results.push(value);\n });\n return results;\n}\n" }, { "path": "modules/find.js", "content": "import isArrayLike from './_isArrayLike.js';\nimport findIndex from './findIndex.js';\nimport findKey from './findKey.js';\n\n// Return the first value which passes a truth test.\nexport default function find(obj, predicate, context) {\n var keyFinder = isArrayLike(obj) ? findIndex : findKey;\n var key = keyFinder(obj, predicate, context);\n if (key !== void 0 && key !== -1) return obj[key];\n}\n" }, { "path": "modules/findIndex.js", "content": "import createPredicateIndexFinder from './_createPredicateIndexFinder.js';\n\n// Returns the first index on an array-like that passes a truth test.\nexport default createPredicateIndexFinder(1);\n" }, { "path": "modules/findKey.js", "content": "import cb from './_cb.js';\nimport keys from './keys.js';\n\n// Returns the first key on an object that passes a truth test.\nexport default function findKey(obj, predicate, context) {\n predicate = cb(predicate, context);\n var _keys = keys(obj), key;\n for (var i = 0, length = _keys.length; i < length; i++) {\n key = _keys[i];\n if (predicate(obj[key], key, obj)) return key;\n }\n}\n" }, { "path": "modules/findLastIndex.js", "content": "import createPredicateIndexFinder from './_createPredicateIndexFinder.js';\n\n// Returns the last index on an array-like that passes a truth test.\nexport default createPredicateIndexFinder(-1);\n" }, { "path": "modules/findWhere.js", "content": "import find from './find.js';\nimport matcher from './matcher.js';\n\n// Convenience version of a common use case of `_.find`: getting the first\n// object containing specific `key:value` pairs.\nexport default function findWhere(obj, attrs) {\n return find(obj, matcher(attrs));\n}\n" }, { "path": "modules/first.js", "content": "import initial from './initial.js';\n\n// Get the first element of an array. Passing **n** will return the first N\n// values in the array. The **guard** check allows it to work with `_.map`.\nexport default function first(array, n, guard) {\n if (array == null || array.length < 1) return n == null || guard ? void 0 : [];\n if (n == null || guard) return array[0];\n return initial(array, array.length - n);\n}\n" }, { "path": "modules/flatten.js", "content": "import _flatten from './_flatten.js';\n\n// Flatten out an array, either recursively (by default), or up to `depth`.\n// Passing `true` or `false` as `depth` means `1` or `Infinity`, respectively.\nexport default function flatten(array, depth) {\n return _flatten(array, depth, false);\n}\n" }, { "path": "modules/functions.js", "content": "import isFunction from './isFunction.js';\n\n// Return a sorted list of the function names available on the object.\nexport default function functions(obj) {\n var names = [];\n for (var key in obj) {\n if (isFunction(obj[key])) names.push(key);\n }\n return names.sort();\n}\n" }, { "path": "modules/get.js", "content": "import toPath from './_toPath.js';\nimport deepGet from './_deepGet.js';\nimport isUndefined from './isUndefined.js';\n\n// Get the value of the (deep) property on `path` from `object`.\n// If any property in `path` does not exist or if the value is\n// `undefined`, return `defaultValue` instead.\n// The `path` is normalized through `_.toPath`.\nexport default function get(object, path, defaultValue) {\n var value = deepGet(object, toPath(path));\n return isUndefined(value) ? defaultValue : value;\n}\n" }, { "path": "modules/groupBy.js", "content": "import group from './_group.js';\nimport has from './_has.js';\n\n// Groups the object's values by a criterion. Pass either a string attribute\n// to group by, or a function that returns the criterion.\nexport default group(function(result, value, key) {\n if (has(result, key)) result[key].push(value); else result[key] = [value];\n});\n" }, { "path": "modules/has.js", "content": "import _has from './_has.js';\nimport toPath from './_toPath.js';\n\n// Shortcut function for checking if an object has a given property directly on\n// itself (in other words, not on a prototype). Unlike the internal `has`\n// function, this public version can also traverse nested properties.\nexport default function has(obj, path) {\n path = toPath(path);\n var length = path.length;\n for (var i = 0; i < length; i++) {\n var key = path[i];\n if (!_has(obj, key)) return false;\n obj = obj[key];\n }\n return !!length;\n}\n" }, { "path": "modules/identity.js", "content": "// Keep the identity function around for default iteratees.\nexport default function identity(value) {\n return value;\n}\n" }, { "path": "modules/index-all.js", "content": "// ESM Exports\n// ===========\n// This module is the package entry point for ES module users. In other words,\n// it is the module they are interfacing with when they import from the whole\n// package instead of from a submodule, like this:\n//\n// ```js\n// import { map } from 'underscore';\n// ```\n//\n// The difference with `./index-default`, which is the package entry point for\n// CommonJS, AMD and UMD users, is purely technical. In ES modules, named and\n// default exports are considered to be siblings, so when you have a default\n// export, its properties are not automatically available as named exports. For\n// this reason, we re-export the named exports in addition to providing the same\n// default export as in `./index-default`.\nexport { default } from './index-default.js';\nexport * from './index.js';\n" }, { "path": "modules/index-default.js", "content": "// Default Export\n// ==============\n// In this module, we mix our bundled exports into the `_` object and export\n// the result. This is analogous to setting `module.exports = _` in CommonJS.\n// Hence, this module is also the entry point of our UMD bundle and the package\n// entry point for CommonJS and AMD users. In other words, this is (the source\n// of) the module you are interfacing with when you do any of the following:\n//\n// ```js\n// // CommonJS\n// var _ = require('underscore');\n//\n// // AMD\n// define(['underscore'], function(_) {...});\n//\n// // UMD in the browser\n// // _ is available as a global variable\n// ```\nimport * as allExports from './index.js';\nimport { mixin } from './index.js';\n\n// Add all of the Underscore functions to the wrapper object.\nvar _ = mixin(allExports);\n// Legacy Node.js API.\n_._ = _;\n// Export the Underscore API.\nexport default _;\n" }, { "path": "modules/index.js", "content": "// Named Exports\n// =============\n\n// Underscore.js 1.13.8\n// https://underscorejs.org\n// (c) 2009-2026 Jeremy Ashkenas, Julian Gonggrijp, and DocumentCloud and Investigative Reporters & Editors\n// Underscore may be freely distributed under the MIT license.\n\n// Baseline setup.\nexport { VERSION } from './_setup.js';\nexport { default as restArguments } from './restArguments.js';\n\n// Object Functions\n// ----------------\n// Our most fundamental functions operate on any JavaScript object.\n// Most functions in Underscore depend on at least one function in this section.\n\n// A group of functions that check the types of core JavaScript values.\n// These are often informally referred to as the \"isType\" functions.\nexport { default as isObject } from './isObject.js';\nexport { default as isNull } from './isNull.js';\nexport { default as isUndefined } from './isUndefined.js';\nexport { default as isBoolean } from './isBoolean.js';\nexport { default as isElement } from './isElement.js';\nexport { default as isString } from './isString.js';\nexport { default as isNumber } from './isNumber.js';\nexport { default as isDate } from './isDate.js';\nexport { default as isRegExp } from './isRegExp.js';\nexport { default as isError } from './isError.js';\nexport { default as isSymbol } from './isSymbol.js';\nexport { default as isArrayBuffer } from './isArrayBuffer.js';\nexport { default as isDataView } from './isDataView.js';\nexport { default as isArray } from './isArray.js';\nexport { default as isFunction } from './isFunction.js';\nexport { default as isArguments } from './isArguments.js';\nexport { default as isFinite } from './isFinite.js';\nexport { default as isNaN } from './isNaN.js';\nexport { default as isTypedArray } from './isTypedArray.js';\nexport { default as isEmpty } from './isEmpty.js';\nexport { default as isMatch } from './isMatch.js';\nexport { default as isEqual } from './isEqual.js';\nexport { default as isMap } from './isMap.js';\nexport { default as isWeakMap } from './isWeakMap.js';\nexport { default as isSet } from './isSet.js';\nexport { default as isWeakSet } from './isWeakSet.js';\n\n// Functions that treat an object as a dictionary of key-value pairs.\nexport { default as keys } from './keys.js';\nexport { default as allKeys } from './allKeys.js';\nexport { default as values } from './values.js';\nexport { default as pairs } from './pairs.js';\nexport { default as invert } from './invert.js';\nexport { default as functions,\n default as methods } from './functions.js';\nexport { default as extend } from './extend.js';\nexport { default as extendOwn,\n default as assign } from './extendOwn.js';\nexport { default as defaults } from './defaults.js';\nexport { default as create } from './create.js';\nexport { default as clone } from './clone.js';\nexport { default as tap } from './tap.js';\nexport { default as get } from './get.js';\nexport { default as has } from './has.js';\nexport { default as mapObject } from './mapObject.js';\n\n// Utility Functions\n// -----------------\n// A bit of a grab bag: Predicate-generating functions for use with filters and\n// loops, string escaping and templating, create random numbers and unique ids,\n// and functions that facilitate Underscore's chaining and iteration conventions.\nexport { default as identity } from './identity.js';\nexport { default as constant } from './constant.js';\nexport { default as noop } from './noop.js';\nexport { default as toPath } from './toPath.js';\nexport { default as property } from './property.js';\nexport { default as propertyOf } from './propertyOf.js';\nexport { default as matcher,\n default as matches } from './matcher.js';\nexport { default as times } from './times.js';\nexport { default as random } from './random.js';\nexport { default as now } from './now.js';\nexport { default as escape } from './escape.js';\nexport { default as unescape } from './unescape.js';\nexport { default as templateSettings } from './templateSettings.js';\nexport { default as template } from './template.js';\nexport { default as result } from './result.js';\nexport { default as uniqueId } from './uniqueId.js';\nexport { default as chain } from './chain.js';\nexport { default as iteratee } from './iteratee.js';\n\n// Function (ahem) Functions\n// -------------------------\n// These functions take a function as an argument and return a new function\n// as the result. Also known as higher-order functions.\nexport { default as partial } from './partial.js';\nexport { default as bind } from './bind.js';\nexport { default as bindAll } from './bindAll.js';\nexport { default as memoize } from './memoize.js';\nexport { default as delay } from './delay.js';\nexport { default as defer } from './defer.js';\nexport { default as throttle } from './throttle.js';\nexport { default as debounce } from './debounce.js';\nexport { default as wrap } from './wrap.js';\nexport { default as negate } from './negate.js';\nexport { default as compose } from './compose.js';\nexport { default as after } from './after.js';\nexport { default as before } from './before.js';\nexport { default as once } from './once.js';\n\n// Finders\n// -------\n// Functions that extract (the position of) a single element from an object\n// or array based on some criterion.\nexport { default as findKey } from './findKey.js';\nexport { default as findIndex } from './findIndex.js';\nexport { default as findLastIndex } from './findLastIndex.js';\nexport { default as sortedIndex } from './sortedIndex.js';\nexport { default as indexOf } from './indexOf.js';\nexport { default as lastIndexOf } from './lastIndexOf.js';\nexport { default as find,\n default as detect } from './find.js';\nexport { default as findWhere } from './findWhere.js';\n\n// Collection Functions\n// --------------------\n// Functions that work on any collection of elements: either an array, or\n// an object of key-value pairs.\nexport { default as each,\n default as forEach } from './each.js';\nexport { default as map,\n default as collect } from './map.js';\nexport { default as reduce,\n default as foldl,\n default as inject } from './reduce.js';\nexport { default as reduceRight,\n default as foldr } from './reduceRight.js';\nexport { default as filter,\n default as select } from './filter.js';\nexport { default as reject } from './reject.js';\nexport { default as every,\n default as all } from './every.js';\nexport { default as some,\n default as any } from './some.js';\nexport { default as contains,\n default as includes,\n default as include } from './contains.js';\nexport { default as invoke } from './invoke.js';\nexport { default as pluck } from './pluck.js';\nexport { default as where } from './where.js';\nexport { default as max } from './max.js';\nexport { default as min } from './min.js';\nexport { default as shuffle } from './shuffle.js';\nexport { default as sample } from './sample.js';\nexport { default as sortBy } from './sortBy.js';\nexport { default as groupBy } from './groupBy.js';\nexport { default as indexBy } from './indexBy.js';\nexport { default as countBy } from './countBy.js';\nexport { default as partition } from './partition.js';\nexport { default as toArray } from './toArray.js';\nexport { default as size } from './size.js';\n\n// `_.pick` and `_.omit` are actually object functions, but we put\n// them here in order to create a more natural reading order in the\n// monolithic build as they depend on `_.contains`.\nexport { default as pick } from './pick.js';\nexport { default as omit } from './omit.js';\n\n// Array Functions\n// ---------------\n// Functions that operate on arrays (and array-likes) only, because they’re\n// expressed in terms of operations on an ordered list of values.\nexport { default as first,\n default as head,\n default as take } from './first.js';\nexport { default as initial } from './initial.js';\nexport { default as last } from './last.js';\nexport { default as rest,\n default as tail,\n default as drop } from './rest.js';\nexport { default as compact } from './compact.js';\nexport { default as flatten } from './flatten.js';\nexport { default as without } from './without.js';\nexport { default as uniq,\n default as unique } from './uniq.js';\nexport { default as union } from './union.js';\nexport { default as intersection } from './intersection.js';\nexport { default as difference } from './difference.js';\nexport { default as unzip,\n default as transpose } from './unzip.js';\nexport { default as zip } from './zip.js';\nexport { default as object } from './object.js';\nexport { default as range } from './range.js';\nexport { default as chunk } from './chunk.js';\n\n// OOP\n// ---\n// These modules support the \"object-oriented\" calling style. See also\n// `underscore.js` and `index-default.js`.\nexport { default as mixin } from './mixin.js';\nexport { default } from './underscore-array-methods.js';\n" }, { "path": "modules/indexBy.js", "content": "import group from './_group.js';\n\n// Indexes the object's values by a criterion, similar to `_.groupBy`, but for\n// when you know that your index values will be unique.\nexport default group(function(result, value, key) {\n result[key] = value;\n});\n" }, { "path": "modules/indexOf.js", "content": "import sortedIndex from './sortedIndex.js';\nimport findIndex from './findIndex.js';\nimport createIndexFinder from './_createIndexFinder.js';\n\n// Return the position of the first occurrence of an item in an array,\n// or -1 if the item is not included in the array.\n// If the array is large and already in sort order, pass `true`\n// for **isSorted** to use binary search.\nexport default createIndexFinder(1, findIndex, sortedIndex);\n" }, { "path": "modules/initial.js", "content": "import { slice } from './_setup.js';\n\n// Returns everything but the last entry of the array. Especially useful on\n// the arguments object. Passing **n** will return all the values in\n// the array, excluding the last N.\nexport default function initial(array, n, guard) {\n return slice.call(array, 0, Math.max(0, array.length - (n == null || guard ? 1 : n)));\n}\n" }, { "path": "modules/intersection.js", "content": "import getLength from './_getLength.js';\nimport contains from './contains.js';\n\n// Produce an array that contains every item shared between all the\n// passed-in arrays.\nexport default function intersection(array) {\n var result = [];\n var argsLength = arguments.length;\n for (var i = 0, length = getLength(array); i < length; i++) {\n var item = array[i];\n if (contains(result, item)) continue;\n var j;\n for (j = 1; j < argsLength; j++) {\n if (!contains(arguments[j], item)) break;\n }\n if (j === argsLength) result.push(item);\n }\n return result;\n}\n" }, { "path": "modules/invert.js", "content": "import keys from './keys.js';\n\n// Invert the keys and values of an object. The values must be serializable.\nexport default function invert(obj) {\n var result = {};\n var _keys = keys(obj);\n for (var i = 0, length = _keys.length; i < length; i++) {\n result[obj[_keys[i]]] = _keys[i];\n }\n return result;\n}\n" }, { "path": "modules/invoke.js", "content": "import restArguments from './restArguments.js';\nimport isFunction from './isFunction.js';\nimport map from './map.js';\nimport deepGet from './_deepGet.js';\nimport toPath from './_toPath.js';\n\n// Invoke a method (with arguments) on every item in a collection.\nexport default restArguments(function(obj, path, args) {\n var contextPath, func;\n if (isFunction(path)) {\n func = path;\n } else {\n path = toPath(path);\n contextPath = path.slice(0, -1);\n path = path[path.length - 1];\n }\n return map(obj, function(context) {\n var method = func;\n if (!method) {\n if (contextPath && contextPath.length) {\n context = deepGet(context, contextPath);\n }\n if (context == null) return void 0;\n method = context[path];\n }\n return method == null ? method : method.apply(context, args);\n });\n});\n" }, { "path": "modules/isArguments.js", "content": "import tagTester from './_tagTester.js';\nimport has from './_has.js';\n\nvar isArguments = tagTester('Arguments');\n\n// Define a fallback version of the method in browsers (ahem, IE < 9), where\n// there isn't any inspectable \"Arguments\" type.\n(function() {\n if (!isArguments(arguments)) {\n isArguments = function(obj) {\n return has(obj, 'callee');\n };\n }\n}());\n\nexport default isArguments;\n" }, { "path": "modules/isArray.js", "content": "import { nativeIsArray } from './_setup.js';\nimport tagTester from './_tagTester.js';\n\n// Is a given value an array?\n// Delegates to ECMA5's native `Array.isArray`.\nexport default nativeIsArray || tagTester('Array');\n" }, { "path": "modules/isArrayBuffer.js", "content": "import tagTester from './_tagTester.js';\n\nexport default tagTester('ArrayBuffer');\n" }, { "path": "modules/isBoolean.js", "content": "import { toString } from './_setup.js';\n\n// Is a given value a boolean?\nexport default function isBoolean(obj) {\n return obj === true || obj === false || toString.call(obj) === '[object Boolean]';\n}\n" }, { "path": "modules/isDataView.js", "content": "import tagTester from './_tagTester.js';\nimport isFunction from './isFunction.js';\nimport isArrayBuffer from './isArrayBuffer.js';\nimport { hasDataViewBug } from './_stringTagBug.js';\n\nvar isDataView = tagTester('DataView');\n\n// In IE 10 - Edge 13, we need a different heuristic\n// to determine whether an object is a `DataView`.\n// Also, in cases where the native `DataView` is\n// overridden we can't rely on the tag itself.\nfunction alternateIsDataView(obj) {\n return obj != null && isFunction(obj.getInt8) && isArrayBuffer(obj.buffer);\n}\n\nexport default (hasDataViewBug ? alternateIsDataView : isDataView);\n" }, { "path": "modules/isDate.js", "content": "import tagTester from './_tagTester.js';\n\nexport default tagTester('Date');\n" }, { "path": "modules/isElement.js", "content": "// Is a given value a DOM element?\nexport default function isElement(obj) {\n return !!(obj && obj.nodeType === 1);\n}\n" }, { "path": "modules/isEmpty.js", "content": "import getLength from './_getLength.js';\nimport isArray from './isArray.js';\nimport isString from './isString.js';\nimport isArguments from './isArguments.js';\nimport keys from './keys.js';\n\n// Is a given array, string, or object empty?\n// An \"empty\" object has no enumerable own-properties.\nexport default function isEmpty(obj) {\n if (obj == null) return true;\n // Skip the more expensive `toString`-based type checks if `obj` has no\n // `.length`.\n var length = getLength(obj);\n if (typeof length == 'number' && (\n isArray(obj) || isString(obj) || isArguments(obj)\n )) return length === 0;\n return getLength(keys(obj)) === 0;\n}\n" }, { "path": "modules/isEqual.js", "content": "import _ from './underscore.js';\nimport { toString, SymbolProto } from './_setup.js';\nimport getByteLength from './_getByteLength.js';\nimport isTypedArray from './isTypedArray.js';\nimport isFunction from './isFunction.js';\nimport { hasDataViewBug } from './_stringTagBug.js';\nimport isDataView from './isDataView.js';\nimport keys from './keys.js';\nimport has from './_has.js';\nimport toBufferView from './_toBufferView.js';\n\n// We use this string twice, so give it a name for minification.\nvar tagDataView = '[object DataView]';\n\n// Perform a deep comparison to check if two objects are equal.\nexport default function isEqual(a, b) {\n // Keep track of which pairs of values need to be compared. We will be\n // trampolining on this stack instead of using function recursion.\n // (CVE-2026-27601)\n var todo = [{a: a, b: b}];\n // Initializing stacks of traversed objects for cycle detection.\n var aStack = [], bStack = [];\n\n // Keep traversing pairs until there is nothing left to compare.\n while (todo.length) {\n var frame = todo.pop();\n // As a special case, a single `true` on the todo means that we can\n // unwind the cycle detection stacks.\n if (frame === true) {\n // Remove the first object from the stack of traversed objects.\n aStack.pop();\n bStack.pop();\n continue;\n }\n a = frame.a;\n b = frame.b;\n\n // Identical objects are equal. `0 === -0`, but they aren't identical.\n // See the [Harmony `egal` proposal](https://wiki.ecmascript.org/doku.php?id=harmony:egal).\n if (a === b) {\n if (a !== 0 || 1 / a === 1 / b) continue;\n return false;\n }\n // `null` or `undefined` only equal to itself (strict comparison).\n if (a == null || b == null) return false;\n // `NaN`s are equivalent, but non-reflexive.\n if (a !== a) {\n if (b !== b) continue;\n return false;\n }\n // Exhaust primitive checks\n var type = typeof a;\n if (type !== 'function' && type !== 'object' && typeof b != 'object') return false;\n\n // Unwrap any wrapped objects.\n if (a instanceof _) a = a._wrapped;\n if (b instanceof _) b = b._wrapped;\n // Compare `[[Class]]` names.\n var className = toString.call(a);\n if (className !== toString.call(b)) return false;\n // Work around a bug in IE 10 - Edge 13.\n if (hasDataViewBug && className == '[object Object]' && isDataView(a)) {\n if (!isDataView(b)) return false;\n className = tagDataView;\n }\n switch (className) {\n // These types are compared by value.\n case '[object RegExp]':\n // RegExps are coerced to strings for comparison (Note: '' + /a/i === '/a/i')\n case '[object String]':\n // Primitives and their corresponding object wrappers are equivalent; thus, `\"5\"` is\n // equivalent to `new String(\"5\")`.\n if ('' + a === '' + b) continue;\n return false;\n case '[object Number]':\n todo.push({a: +a, b: +b});\n continue;\n case '[object Date]':\n case '[object Boolean]':\n // Coerce dates and booleans to numeric primitive values. Dates are compared by their\n // millisecond representations. Note that invalid dates with millisecond representations\n // of `NaN` are not equivalent.\n if (+a === +b) continue;\n return false;\n case '[object Symbol]':\n if (SymbolProto.valueOf.call(a) === SymbolProto.valueOf.call(b)) continue;\n return false;\n case '[object ArrayBuffer]':\n case tagDataView:\n // Coerce to typed array so we can fall through.\n todo.push({a: toBufferView(a), b: toBufferView(b)});\n continue;\n }\n\n var areArrays = className === '[object Array]';\n if (!areArrays && isTypedArray(a)) {\n var byteLength = getByteLength(a);\n if (byteLength !== getByteLength(b)) return false;\n if (a.buffer === b.buffer && a.byteOffset === b.byteOffset) continue;\n areArrays = true;\n }\n if (!areArrays) {\n if (typeof a != 'object' || typeof b != 'object') return false;\n\n // Objects with different constructors are not equivalent, but `Object`s or `Array`s\n // from different frames are.\n var aCtor = a.constructor, bCtor = b.constructor;\n if (aCtor !== bCtor && !(isFunction(aCtor) && aCtor instanceof aCtor &&\n isFunction(bCtor) && bCtor instanceof bCtor)\n && ('constructor' in a && 'constructor' in b)) {\n return false;\n }\n }\n\n // Assume equality for cyclic structures. The algorithm for detecting cyclic\n // structures is adapted from ES 5.1 section 15.12.3, abstract operation `JO`.\n\n var length = aStack.length;\n while (length--) {\n // Linear search. Performance is inversely proportional to the number of\n // unique nested structures.\n if (aStack[length] === a) {\n // Cycle detected. Break out of the inner loop and continue the outer\n // loop. Step 1:\n if (bStack[length] === b) break;\n return false;\n }\n }\n // Step 2, use `length` to verify whether we detected a cycle:\n if (length >= 0) continue;\n\n // Add the first object to the stack of traversed objects.\n aStack.push(a);\n bStack.push(b);\n // Remember to remove them again after the recursion below.\n todo.push(true);\n\n // Recursively compare objects and arrays.\n if (areArrays) {\n // Compare array lengths to determine if a deep comparison is necessary.\n length = a.length;\n if (length !== b.length) return false;\n // Deep compare the contents, ignoring non-numeric properties.\n while (length--) {\n todo.push({a: a[length], b: b[length]});\n }\n } else {\n // Deep compare objects.\n var _keys = keys(a), key;\n length = _keys.length;\n // Ensure that both objects contain the same number of properties before comparing deep equality.\n if (keys(b).length !== length) return false;\n while (length--) {\n // Deep compare each member\n key = _keys[length];\n if (!has(b, key)) return false;\n todo.push({a: a[key], b: b[key]});\n }\n }\n }\n // We made it to the end and found no differences.\n return true;\n}\n" }, { "path": "modules/isError.js", "content": "import tagTester from './_tagTester.js';\n\nexport default tagTester('Error');\n" }, { "path": "modules/isFinite.js", "content": "import { _isFinite } from './_setup.js';\nimport isSymbol from './isSymbol.js';\n\n// Is a given object a finite number?\nexport default function isFinite(obj) {\n return !isSymbol(obj) && _isFinite(obj) && !isNaN(parseFloat(obj));\n}\n" }, { "path": "modules/isFunction.js", "content": "import tagTester from './_tagTester.js';\nimport { root } from './_setup.js';\n\nvar isFunction = tagTester('Function');\n\n// Optimize `isFunction` if appropriate. Work around some `typeof` bugs in old\n// v8, IE 11 (#1621), Safari 8 (#1929), and PhantomJS (#2236).\nvar nodelist = root.document && root.document.childNodes;\nif (typeof /./ != 'function' && typeof Int8Array != 'object' && typeof nodelist != 'function') {\n isFunction = function(obj) {\n return typeof obj == 'function' || false;\n };\n}\n\nexport default isFunction;\n" }, { "path": "modules/isMap.js", "content": "import tagTester from './_tagTester.js';\nimport { isIE11 } from './_stringTagBug.js';\nimport { ie11fingerprint, mapMethods } from './_methodFingerprint.js';\n\nexport default isIE11 ? ie11fingerprint(mapMethods) : tagTester('Map');\n" }, { "path": "modules/isMatch.js", "content": "import keys from './keys.js';\n\n// Returns whether an object has a given set of `key:value` pairs.\nexport default function isMatch(object, attrs) {\n var _keys = keys(attrs), length = _keys.length;\n if (object == null) return !length;\n var obj = Object(object);\n for (var i = 0; i < length; i++) {\n var key = _keys[i];\n if (attrs[key] !== obj[key] || !(key in obj)) return false;\n }\n return true;\n}\n" }, { "path": "modules/isNaN.js", "content": "import { _isNaN } from './_setup.js';\nimport isNumber from './isNumber.js';\n\n// Is the given value `NaN`?\nexport default function isNaN(obj) {\n return isNumber(obj) && _isNaN(obj);\n}\n" }, { "path": "modules/isNull.js", "content": "// Is a given value equal to null?\nexport default function isNull(obj) {\n return obj === null;\n}\n" }, { "path": "modules/isNumber.js", "content": "import tagTester from './_tagTester.js';\n\nexport default tagTester('Number');\n" }, { "path": "modules/isObject.js", "content": "// Is a given variable an object?\nexport default function isObject(obj) {\n var type = typeof obj;\n return type === 'function' || (type === 'object' && !!obj);\n}\n" }, { "path": "modules/isRegExp.js", "content": "import tagTester from './_tagTester.js';\n\nexport default tagTester('RegExp');\n" }, { "path": "modules/isSet.js", "content": "import tagTester from './_tagTester.js';\nimport { isIE11 } from './_stringTagBug.js';\nimport { ie11fingerprint, setMethods } from './_methodFingerprint.js';\n\nexport default isIE11 ? ie11fingerprint(setMethods) : tagTester('Set');\n" }, { "path": "modules/isString.js", "content": "import tagTester from './_tagTester.js';\n\nexport default tagTester('String');\n" }, { "path": "modules/isSymbol.js", "content": "import tagTester from './_tagTester.js';\n\nexport default tagTester('Symbol');\n" }, { "path": "modules/isTypedArray.js", "content": "import { supportsArrayBuffer, nativeIsView, toString } from './_setup.js';\nimport isDataView from './isDataView.js';\nimport constant from './constant.js';\nimport isBufferLike from './_isBufferLike.js';\n\n// Is a given value a typed array?\nvar typedArrayPattern = /\\[object ((I|Ui)nt(8|16|32)|Float(32|64)|Uint8Clamped|Big(I|Ui)nt64)Array\\]/;\nfunction isTypedArray(obj) {\n // `ArrayBuffer.isView` is the most future-proof, so use it when available.\n // Otherwise, fall back on the above regular expression.\n return nativeIsView ? (nativeIsView(obj) && !isDataView(obj)) :\n isBufferLike(obj) && typedArrayPattern.test(toString.call(obj));\n}\n\nexport default supportsArrayBuffer ? isTypedArray : constant(false);\n" }, { "path": "modules/isUndefined.js", "content": "// Is a given variable undefined?\nexport default function isUndefined(obj) {\n return obj === void 0;\n}\n" }, { "path": "modules/isWeakMap.js", "content": "import tagTester from './_tagTester.js';\nimport { isIE11 } from './_stringTagBug.js';\nimport { ie11fingerprint, weakMapMethods } from './_methodFingerprint.js';\n\nexport default isIE11 ? ie11fingerprint(weakMapMethods) : tagTester('WeakMap');\n" }, { "path": "modules/isWeakSet.js", "content": "import tagTester from './_tagTester.js';\n\nexport default tagTester('WeakSet');\n" }, { "path": "modules/iteratee.js", "content": "import _ from './underscore.js';\nimport baseIteratee from './_baseIteratee.js';\n\n// External wrapper for our callback generator. Users may customize\n// `_.iteratee` if they want additional predicate/iteratee shorthand styles.\n// This abstraction hides the internal-only `argCount` argument.\nexport default function iteratee(value, context) {\n return baseIteratee(value, context, Infinity);\n}\n_.iteratee = iteratee;\n" }, { "path": "modules/keys.js", "content": "import isObject from './isObject.js';\nimport { nativeKeys, hasEnumBug } from './_setup.js';\nimport has from './_has.js';\nimport collectNonEnumProps from './_collectNonEnumProps.js';\n\n// Retrieve the names of an object's own properties.\n// Delegates to **ECMAScript 5**'s native `Object.keys`.\nexport default function keys(obj) {\n if (!isObject(obj)) return [];\n if (nativeKeys) return nativeKeys(obj);\n var keys = [];\n for (var key in obj) if (has(obj, key)) keys.push(key);\n // Ahem, IE < 9.\n if (hasEnumBug) collectNonEnumProps(obj, keys);\n return keys;\n}\n" }, { "path": "modules/last.js", "content": "import rest from './rest.js';\n\n// Get the last element of an array. Passing **n** will return the last N\n// values in the array.\nexport default function last(array, n, guard) {\n if (array == null || array.length < 1) return n == null || guard ? void 0 : [];\n if (n == null || guard) return array[array.length - 1];\n return rest(array, Math.max(0, array.length - n));\n}\n" }, { "path": "modules/lastIndexOf.js", "content": "import findLastIndex from './findLastIndex.js';\nimport createIndexFinder from './_createIndexFinder.js';\n\n// Return the position of the last occurrence of an item in an array,\n// or -1 if the item is not included in the array.\nexport default createIndexFinder(-1, findLastIndex);\n" }, { "path": "modules/map.js", "content": "import cb from './_cb.js';\nimport isArrayLike from './_isArrayLike.js';\nimport keys from './keys.js';\n\n// Return the results of applying the iteratee to each element.\nexport default function map(obj, iteratee, context) {\n iteratee = cb(iteratee, context);\n var _keys = !isArrayLike(obj) && keys(obj),\n length = (_keys || obj).length,\n results = Array(length);\n for (var index = 0; index < length; index++) {\n var currentKey = _keys ? _keys[index] : index;\n results[index] = iteratee(obj[currentKey], currentKey, obj);\n }\n return results;\n}\n" }, { "path": "modules/mapObject.js", "content": "import cb from './_cb.js';\nimport keys from './keys.js';\n\n// Returns the results of applying the `iteratee` to each element of `obj`.\n// In contrast to `_.map` it returns an object.\nexport default function mapObject(obj, iteratee, context) {\n iteratee = cb(iteratee, context);\n var _keys = keys(obj),\n length = _keys.length,\n results = {};\n for (var index = 0; index < length; index++) {\n var currentKey = _keys[index];\n results[currentKey] = iteratee(obj[currentKey], currentKey, obj);\n }\n return results;\n}\n" }, { "path": "modules/matcher.js", "content": "import extendOwn from './extendOwn.js';\nimport isMatch from './isMatch.js';\n\n// Returns a predicate for checking whether an object has a given set of\n// `key:value` pairs.\nexport default function matcher(attrs) {\n attrs = extendOwn({}, attrs);\n return function(obj) {\n return isMatch(obj, attrs);\n };\n}\n" }, { "path": "modules/max.js", "content": "import isArrayLike from './_isArrayLike.js';\nimport values from './values.js';\nimport cb from './_cb.js';\nimport each from './each.js';\n\n// Return the maximum element (or element-based computation).\nexport default function max(obj, iteratee, context) {\n var result = -Infinity, lastComputed = -Infinity,\n value, computed;\n if (iteratee == null || (typeof iteratee == 'number' && typeof obj[0] != 'object' && obj != null)) {\n obj = isArrayLike(obj) ? obj : values(obj);\n for (var i = 0, length = obj.length; i < length; i++) {\n value = obj[i];\n if (value != null && value > result) {\n result = value;\n }\n }\n } else {\n iteratee = cb(iteratee, context);\n each(obj, function(v, index, list) {\n computed = iteratee(v, index, list);\n if (computed > lastComputed || (computed === -Infinity && result === -Infinity)) {\n result = v;\n lastComputed = computed;\n }\n });\n }\n return result;\n}\n" }, { "path": "modules/memoize.js", "content": "import has from './_has.js';\n\n// Memoize an expensive function by storing its results.\nexport default function memoize(func, hasher) {\n var memoize = function(key) {\n var cache = memoize.cache;\n var address = '' + (hasher ? hasher.apply(this, arguments) : key);\n if (!has(cache, address)) cache[address] = func.apply(this, arguments);\n return cache[address];\n };\n memoize.cache = {};\n return memoize;\n}\n" }, { "path": "modules/min.js", "content": "import isArrayLike from './_isArrayLike.js';\nimport values from './values.js';\nimport cb from './_cb.js';\nimport each from './each.js';\n\n// Return the minimum element (or element-based computation).\nexport default function min(obj, iteratee, context) {\n var result = Infinity, lastComputed = Infinity,\n value, computed;\n if (iteratee == null || (typeof iteratee == 'number' && typeof obj[0] != 'object' && obj != null)) {\n obj = isArrayLike(obj) ? obj : values(obj);\n for (var i = 0, length = obj.length; i < length; i++) {\n value = obj[i];\n if (value != null && value < result) {\n result = value;\n }\n }\n } else {\n iteratee = cb(iteratee, context);\n each(obj, function(v, index, list) {\n computed = iteratee(v, index, list);\n if (computed < lastComputed || (computed === Infinity && result === Infinity)) {\n result = v;\n lastComputed = computed;\n }\n });\n }\n return result;\n}\n" }, { "path": "modules/mixin.js", "content": "import _ from './underscore.js';\nimport each from './each.js';\nimport functions from './functions.js';\nimport { push } from './_setup.js';\nimport chainResult from './_chainResult.js';\n\n// Add your own custom functions to the Underscore object.\nexport default function mixin(obj) {\n each(functions(obj), function(name) {\n var func = _[name] = obj[name];\n _.prototype[name] = function() {\n var args = [this._wrapped];\n push.apply(args, arguments);\n return chainResult(this, func.apply(_, args));\n };\n });\n return _;\n}\n" }, { "path": "modules/negate.js", "content": "// Returns a negated version of the passed-in predicate.\nexport default function negate(predicate) {\n return function() {\n return !predicate.apply(this, arguments);\n };\n}\n" }, { "path": "modules/noop.js", "content": "// Predicate-generating function. Often useful outside of Underscore.\nexport default function noop(){}\n" }, { "path": "modules/now.js", "content": "// A (possibly faster) way to get the current timestamp as an integer.\nexport default Date.now || function() {\n return new Date().getTime();\n};\n" }, { "path": "modules/object.js", "content": "import getLength from './_getLength.js';\n\n// Converts lists into objects. Pass either a single array of `[key, value]`\n// pairs, or two parallel arrays of the same length -- one of keys, and one of\n// the corresponding values. Passing by pairs is the reverse of `_.pairs`.\nexport default function object(list, values) {\n var result = {};\n for (var i = 0, length = getLength(list); i < length; i++) {\n if (values) {\n result[list[i]] = values[i];\n } else {\n result[list[i][0]] = list[i][1];\n }\n }\n return result;\n}\n" }, { "path": "modules/omit.js", "content": "import restArguments from './restArguments.js';\nimport isFunction from './isFunction.js';\nimport negate from './negate.js';\nimport map from './map.js';\nimport flatten from './_flatten.js';\nimport contains from './contains.js';\nimport pick from './pick.js';\n\n// Return a copy of the object without the disallowed properties.\nexport default restArguments(function(obj, keys) {\n var iteratee = keys[0], context;\n if (isFunction(iteratee)) {\n iteratee = negate(iteratee);\n if (keys.length > 1) context = keys[1];\n } else {\n keys = map(flatten(keys, false, false), String);\n iteratee = function(value, key) {\n return !contains(keys, key);\n };\n }\n return pick(obj, iteratee, context);\n});\n" }, { "path": "modules/once.js", "content": "import partial from './partial.js';\nimport before from './before.js';\n\n// Returns a function that will be executed at most one time, no matter how\n// often you call it. Useful for lazy initialization.\nexport default partial(before, 2);\n" }, { "path": "modules/package.json", "content": "{\"type\":\"module\",\"version\":\"1.13.8\"}\n" }, { "path": "modules/pairs.js", "content": "import keys from './keys.js';\n\n// Convert an object into a list of `[key, value]` pairs.\n// The opposite of `_.object` with one argument.\nexport default function pairs(obj) {\n var _keys = keys(obj);\n var length = _keys.length;\n var pairs = Array(length);\n for (var i = 0; i < length; i++) {\n pairs[i] = [_keys[i], obj[_keys[i]]];\n }\n return pairs;\n}\n" }, { "path": "modules/partial.js", "content": "import restArguments from './restArguments.js';\nimport executeBound from './_executeBound.js';\nimport _ from './underscore.js';\n\n// Partially apply a function by creating a version that has had some of its\n// arguments pre-filled, without changing its dynamic `this` context. `_` acts\n// as a placeholder by default, allowing any combination of arguments to be\n// pre-filled. Set `_.partial.placeholder` for a custom placeholder argument.\nvar partial = restArguments(function(func, boundArgs) {\n var placeholder = partial.placeholder;\n var bound = function() {\n var position = 0, length = boundArgs.length;\n var args = Array(length);\n for (var i = 0; i < length; i++) {\n args[i] = boundArgs[i] === placeholder ? arguments[position++] : boundArgs[i];\n }\n while (position < arguments.length) args.push(arguments[position++]);\n return executeBound(func, bound, this, this, args);\n };\n return bound;\n});\n\npartial.placeholder = _;\nexport default partial;\n" }, { "path": "modules/partition.js", "content": "import group from './_group.js';\n\n// Split a collection into two arrays: one whose elements all pass the given\n// truth test, and one whose elements all do not pass the truth test.\nexport default group(function(result, value, pass) {\n result[pass ? 0 : 1].push(value);\n}, true);\n" }, { "path": "modules/pick.js", "content": "import restArguments from './restArguments.js';\nimport isFunction from './isFunction.js';\nimport optimizeCb from './_optimizeCb.js';\nimport allKeys from './allKeys.js';\nimport keyInObj from './_keyInObj.js';\nimport flatten from './_flatten.js';\n\n// Return a copy of the object only containing the allowed properties.\nexport default restArguments(function(obj, keys) {\n var result = {}, iteratee = keys[0];\n if (obj == null) return result;\n if (isFunction(iteratee)) {\n if (keys.length > 1) iteratee = optimizeCb(iteratee, keys[1]);\n keys = allKeys(obj);\n } else {\n iteratee = keyInObj;\n keys = flatten(keys, false, false);\n obj = Object(obj);\n }\n for (var i = 0, length = keys.length; i < length; i++) {\n var key = keys[i];\n var value = obj[key];\n if (iteratee(value, key, obj)) result[key] = value;\n }\n return result;\n});\n" }, { "path": "modules/pluck.js", "content": "import map from './map.js';\nimport property from './property.js';\n\n// Convenience version of a common use case of `_.map`: fetching a property.\nexport default function pluck(obj, key) {\n return map(obj, property(key));\n}\n" }, { "path": "modules/property.js", "content": "import deepGet from './_deepGet.js';\nimport toPath from './_toPath.js';\n\n// Creates a function that, when passed an object, will traverse that object’s\n// properties down the given `path`, specified as an array of keys or indices.\nexport default function property(path) {\n path = toPath(path);\n return function(obj) {\n return deepGet(obj, path);\n };\n}\n" }, { "path": "modules/propertyOf.js", "content": "import noop from './noop.js';\nimport get from './get.js';\n\n// Generates a function for a given object that returns a given property.\nexport default function propertyOf(obj) {\n if (obj == null) return noop;\n return function(path) {\n return get(obj, path);\n };\n}\n" }, { "path": "modules/random.js", "content": "// Return a random integer between `min` and `max` (inclusive).\nexport default function random(min, max) {\n if (max == null) {\n max = min;\n min = 0;\n }\n return min + Math.floor(Math.random() * (max - min + 1));\n}\n" }, { "path": "modules/range.js", "content": "// Generate an integer Array containing an arithmetic progression. A port of\n// the native Python `range()` function. See\n// [the Python documentation](https://docs.python.org/library/functions.html#range).\nexport default function range(start, stop, step) {\n if (stop == null) {\n stop = start || 0;\n start = 0;\n }\n if (!step) {\n step = stop < start ? -1 : 1;\n }\n\n var length = Math.max(Math.ceil((stop - start) / step), 0);\n var range = Array(length);\n\n for (var idx = 0; idx < length; idx++, start += step) {\n range[idx] = start;\n }\n\n return range;\n}\n" }, { "path": "modules/reduce.js", "content": "import createReduce from './_createReduce.js';\n\n// **Reduce** builds up a single result from a list of values, aka `inject`,\n// or `foldl`.\nexport default createReduce(1);\n" }, { "path": "modules/reduceRight.js", "content": "import createReduce from './_createReduce.js';\n\n// The right-associative version of reduce, also known as `foldr`.\nexport default createReduce(-1);\n" }, { "path": "modules/reject.js", "content": "import filter from './filter.js';\nimport negate from './negate.js';\nimport cb from './_cb.js';\n\n// Return all the elements for which a truth test fails.\nexport default function reject(obj, predicate, context) {\n return filter(obj, negate(cb(predicate)), context);\n}\n" }, { "path": "modules/rest.js", "content": "import { slice } from './_setup.js';\n\n// Returns everything but the first entry of the `array`. Especially useful on\n// the `arguments` object. Passing an **n** will return the rest N values in the\n// `array`.\nexport default function rest(array, n, guard) {\n return slice.call(array, n == null || guard ? 1 : n);\n}\n" }, { "path": "modules/restArguments.js", "content": "// Some functions take a variable number of arguments, or a few expected\n// arguments at the beginning and then a variable number of values to operate\n// on. This helper accumulates all remaining arguments past the function’s\n// argument length (or an explicit `startIndex`), into an array that becomes\n// the last argument. Similar to ES6’s \"rest parameter\".\nexport default function restArguments(func, startIndex) {\n startIndex = startIndex == null ? func.length - 1 : +startIndex;\n return function() {\n var length = Math.max(arguments.length - startIndex, 0),\n rest = Array(length),\n index = 0;\n for (; index < length; index++) {\n rest[index] = arguments[index + startIndex];\n }\n switch (startIndex) {\n case 0: return func.call(this, rest);\n case 1: return func.call(this, arguments[0], rest);\n case 2: return func.call(this, arguments[0], arguments[1], rest);\n }\n var args = Array(startIndex + 1);\n for (index = 0; index < startIndex; index++) {\n args[index] = arguments[index];\n }\n args[startIndex] = rest;\n return func.apply(this, args);\n };\n}\n" }, { "path": "modules/result.js", "content": "import isFunction from './isFunction.js';\nimport toPath from './_toPath.js';\n\n// Traverses the children of `obj` along `path`. If a child is a function, it\n// is invoked with its parent as context. Returns the value of the final\n// child, or `fallback` if any child is undefined.\nexport default function result(obj, path, fallback) {\n path = toPath(path);\n var length = path.length;\n if (!length) {\n return isFunction(fallback) ? fallback.call(obj) : fallback;\n }\n for (var i = 0; i < length; i++) {\n var prop = obj == null ? void 0 : obj[path[i]];\n if (prop === void 0) {\n prop = fallback;\n i = length; // Ensure we don't continue iterating.\n }\n obj = isFunction(prop) ? prop.call(obj) : prop;\n }\n return obj;\n}\n" }, { "path": "modules/sample.js", "content": "import isArrayLike from './_isArrayLike.js';\nimport values from './values.js';\nimport getLength from './_getLength.js';\nimport random from './random.js';\nimport toArray from './toArray.js';\n\n// Sample **n** random values from a collection using the modern version of the\n// [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher–Yates_shuffle).\n// If **n** is not specified, returns a single random element.\n// The internal `guard` argument allows it to work with `_.map`.\nexport default function sample(obj, n, guard) {\n if (n == null || guard) {\n if (!isArrayLike(obj)) obj = values(obj);\n return obj[random(obj.length - 1)];\n }\n var sample = toArray(obj);\n var length = getLength(sample);\n n = Math.max(Math.min(n, length), 0);\n var last = length - 1;\n for (var index = 0; index < n; index++) {\n var rand = random(index, last);\n var temp = sample[index];\n sample[index] = sample[rand];\n sample[rand] = temp;\n }\n return sample.slice(0, n);\n}\n" }, { "path": "modules/shuffle.js", "content": "import sample from './sample.js';\n\n// Shuffle a collection.\nexport default function shuffle(obj) {\n return sample(obj, Infinity);\n}\n" }, { "path": "modules/size.js", "content": "import isArrayLike from './_isArrayLike.js';\nimport keys from './keys.js';\n\n// Return the number of elements in a collection.\nexport default function size(obj) {\n if (obj == null) return 0;\n return isArrayLike(obj) ? obj.length : keys(obj).length;\n}\n" }, { "path": "modules/some.js", "content": "import cb from './_cb.js';\nimport isArrayLike from './_isArrayLike.js';\nimport keys from './keys.js';\n\n// Determine if at least one element in the object passes a truth test.\nexport default function some(obj, predicate, context) {\n predicate = cb(predicate, context);\n var _keys = !isArrayLike(obj) && keys(obj),\n length = (_keys || obj).length;\n for (var index = 0; index < length; index++) {\n var currentKey = _keys ? _keys[index] : index;\n if (predicate(obj[currentKey], currentKey, obj)) return true;\n }\n return false;\n}\n" }, { "path": "modules/sortBy.js", "content": "import cb from './_cb.js';\nimport pluck from './pluck.js';\nimport map from './map.js';\n\n// Sort the object's values by a criterion produced by an iteratee.\nexport default function sortBy(obj, iteratee, context) {\n var index = 0;\n iteratee = cb(iteratee, context);\n return pluck(map(obj, function(value, key, list) {\n return {\n value: value,\n index: index++,\n criteria: iteratee(value, key, list)\n };\n }).sort(function(left, right) {\n var a = left.criteria;\n var b = right.criteria;\n if (a !== b) {\n if (a > b || a === void 0) return 1;\n if (a < b || b === void 0) return -1;\n }\n return left.index - right.index;\n }), 'value');\n}\n" }, { "path": "modules/sortedIndex.js", "content": "import cb from './_cb.js';\nimport getLength from './_getLength.js';\n\n// Use a comparator function to figure out the smallest index at which\n// an object should be inserted so as to maintain order. Uses binary search.\nexport default function sortedIndex(array, obj, iteratee, context) {\n iteratee = cb(iteratee, context, 1);\n var value = iteratee(obj);\n var low = 0, high = getLength(array);\n while (low < high) {\n var mid = Math.floor((low + high) / 2);\n if (iteratee(array[mid]) < value) low = mid + 1; else high = mid;\n }\n return low;\n}\n" }, { "path": "modules/tap.js", "content": "// Invokes `interceptor` with the `obj` and then returns `obj`.\n// The primary purpose of this method is to \"tap into\" a method chain, in\n// order to perform operations on intermediate results within the chain.\nexport default function tap(obj, interceptor) {\n interceptor(obj);\n return obj;\n}\n" }, { "path": "modules/template.js", "content": "import defaults from './defaults.js';\nimport _ from './underscore.js';\nimport './templateSettings.js';\n\n// When customizing `_.templateSettings`, if you don't want to define an\n// interpolation, evaluation or escaping regex, we need one that is\n// guaranteed not to match.\nvar noMatch = /(.)^/;\n\n// Certain characters need to be escaped so that they can be put into a\n// string literal.\nvar escapes = {\n \"'\": \"'\",\n '\\\\': '\\\\',\n '\\r': 'r',\n '\\n': 'n',\n '\\u2028': 'u2028',\n '\\u2029': 'u2029'\n};\n\nvar escapeRegExp = /\\\\|'|\\r|\\n|\\u2028|\\u2029/g;\n\nfunction escapeChar(match) {\n return '\\\\' + escapes[match];\n}\n\n// In order to prevent third-party code injection through\n// `_.templateSettings.variable`, we test it against the following regular\n// expression. It is intentionally a bit more liberal than just matching valid\n// identifiers, but still prevents possible loopholes through defaults or\n// destructuring assignment.\nvar bareIdentifier = /^\\s*(\\w|\\$)+\\s*$/;\n\n// JavaScript micro-templating, similar to John Resig's implementation.\n// Underscore templating handles arbitrary delimiters, preserves whitespace,\n// and correctly escapes quotes within interpolated code.\n// NB: `oldSettings` only exists for backwards compatibility.\nexport default function template(text, settings, oldSettings) {\n if (!settings && oldSettings) settings = oldSettings;\n settings = defaults({}, settings, _.templateSettings);\n\n // Combine delimiters into one regular expression via alternation.\n var matcher = RegExp([\n (settings.escape || noMatch).source,\n (settings.interpolate || noMatch).source,\n (settings.evaluate || noMatch).source\n ].join('|') + '|$', 'g');\n\n // Compile the template source, escaping string literals appropriately.\n var index = 0;\n var source = \"__p+='\";\n text.replace(matcher, function(match, escape, interpolate, evaluate, offset) {\n source += text.slice(index, offset).replace(escapeRegExp, escapeChar);\n index = offset + match.length;\n\n if (escape) {\n source += \"'+\\n((__t=(\" + escape + \"))==null?'':_.escape(__t))+\\n'\";\n } else if (interpolate) {\n source += \"'+\\n((__t=(\" + interpolate + \"))==null?'':__t)+\\n'\";\n } else if (evaluate) {\n source += \"';\\n\" + evaluate + \"\\n__p+='\";\n }\n\n // Adobe VMs need the match returned to produce the correct offset.\n return match;\n });\n source += \"';\\n\";\n\n var argument = settings.variable;\n if (argument) {\n // Insure against third-party code injection. (CVE-2021-23358)\n if (!bareIdentifier.test(argument)) throw new Error(\n 'variable is not a bare identifier: ' + argument\n );\n } else {\n // If a variable is not specified, place data values in local scope.\n source = 'with(obj||{}){\\n' + source + '}\\n';\n argument = 'obj';\n }\n\n source = \"var __t,__p='',__j=Array.prototype.join,\" +\n \"print=function(){__p+=__j.call(arguments,'');};\\n\" +\n source + 'return __p;\\n';\n\n var render;\n try {\n render = new Function(argument, '_', source);\n } catch (e) {\n e.source = source;\n throw e;\n }\n\n var template = function(data) {\n return render.call(this, data, _);\n };\n\n // Provide the compiled source as a convenience for precompilation.\n template.source = 'function(' + argument + '){\\n' + source + '}';\n\n return template;\n}\n" }, { "path": "modules/templateSettings.js", "content": "import _ from './underscore.js';\n\n// By default, Underscore uses ERB-style template delimiters. Change the\n// following template settings to use alternative delimiters.\nexport default _.templateSettings = {\n evaluate: /<%([\\s\\S]+?)%>/g,\n interpolate: /<%=([\\s\\S]+?)%>/g,\n escape: /<%-([\\s\\S]+?)%>/g\n};\n" }, { "path": "modules/throttle.js", "content": "import now from './now.js';\n\n// Returns a function, that, when invoked, will only be triggered at most once\n// during a given window of time. Normally, the throttled function will run\n// as much as it can, without ever going more than once per `wait` duration;\n// but if you'd like to disable the execution on the leading edge, pass\n// `{leading: false}`. To disable execution on the trailing edge, ditto.\nexport default function throttle(func, wait, options) {\n var timeout, context, args, result;\n var previous = 0;\n if (!options) options = {};\n\n var later = function() {\n previous = options.leading === false ? 0 : now();\n timeout = null;\n result = func.apply(context, args);\n if (!timeout) context = args = null;\n };\n\n var throttled = function() {\n var _now = now();\n if (!previous && options.leading === false) previous = _now;\n var remaining = wait - (_now - previous);\n context = this;\n args = arguments;\n if (remaining <= 0 || remaining > wait) {\n if (timeout) {\n clearTimeout(timeout);\n timeout = null;\n }\n previous = _now;\n result = func.apply(context, args);\n if (!timeout) context = args = null;\n } else if (!timeout && options.trailing !== false) {\n timeout = setTimeout(later, remaining);\n }\n return result;\n };\n\n throttled.cancel = function() {\n clearTimeout(timeout);\n previous = 0;\n timeout = context = args = null;\n };\n\n return throttled;\n}\n" }, { "path": "modules/times.js", "content": "import optimizeCb from './_optimizeCb.js';\n\n// Run a function **n** times.\nexport default function times(n, iteratee, context) {\n var accum = Array(Math.max(0, n));\n iteratee = optimizeCb(iteratee, context, 1);\n for (var i = 0; i < n; i++) accum[i] = iteratee(i);\n return accum;\n}\n" }, { "path": "modules/toArray.js", "content": "import isArray from './isArray.js';\nimport { slice } from './_setup.js';\nimport isString from './isString.js';\nimport isArrayLike from './_isArrayLike.js';\nimport map from './map.js';\nimport identity from './identity.js';\nimport values from './values.js';\n\n// Safely create a real, live array from anything iterable.\nvar reStrSymbol = /[^\\ud800-\\udfff]|[\\ud800-\\udbff][\\udc00-\\udfff]|[\\ud800-\\udfff]/g;\nexport default function toArray(obj) {\n if (!obj) return [];\n if (isArray(obj)) return slice.call(obj);\n if (isString(obj)) {\n // Keep surrogate pair characters together.\n return obj.match(reStrSymbol);\n }\n if (isArrayLike(obj)) return map(obj, identity);\n return values(obj);\n}\n" }, { "path": "modules/toPath.js", "content": "import _ from './underscore.js';\nimport isArray from './isArray.js';\n\n// Normalize a (deep) property `path` to array.\n// Like `_.iteratee`, this function can be customized.\nexport default function toPath(path) {\n return isArray(path) ? path : [path];\n}\n_.toPath = toPath;\n" }, { "path": "modules/underscore-array-methods.js", "content": "import _ from './underscore.js';\nimport each from './each.js';\nimport { ArrayProto } from './_setup.js';\nimport chainResult from './_chainResult.js';\n\n// Add all mutator `Array` functions to the wrapper.\neach(['pop', 'push', 'reverse', 'shift', 'sort', 'splice', 'unshift'], function(name) {\n var method = ArrayProto[name];\n _.prototype[name] = function() {\n var obj = this._wrapped;\n if (obj != null) {\n method.apply(obj, arguments);\n if ((name === 'shift' || name === 'splice') && obj.length === 0) {\n delete obj[0];\n }\n }\n return chainResult(this, obj);\n };\n});\n\n// Add all accessor `Array` functions to the wrapper.\neach(['concat', 'join', 'slice'], function(name) {\n var method = ArrayProto[name];\n _.prototype[name] = function() {\n var obj = this._wrapped;\n if (obj != null) obj = method.apply(obj, arguments);\n return chainResult(this, obj);\n };\n});\n\nexport default _;\n" }, { "path": "modules/underscore.js", "content": "import { VERSION } from './_setup.js';\n\n// If Underscore is called as a function, it returns a wrapped object that can\n// be used OO-style. This wrapper holds altered versions of all functions added\n// through `_.mixin`. Wrapped objects may be chained.\nexport default function _(obj) {\n if (obj instanceof _) return obj;\n if (!(this instanceof _)) return new _(obj);\n this._wrapped = obj;\n}\n\n_.VERSION = VERSION;\n\n// Extracts the result from a wrapped and chained object.\n_.prototype.value = function() {\n return this._wrapped;\n};\n\n// Provide unwrapping proxies for some methods used in engine operations\n// such as arithmetic and JSON stringification.\n_.prototype.valueOf = _.prototype.toJSON = _.prototype.value;\n\n_.prototype.toString = function() {\n return String(this._wrapped);\n};\n" }, { "path": "modules/unescape.js", "content": "import createEscaper from './_createEscaper.js';\nimport unescapeMap from './_unescapeMap.js';\n\n// Function for unescaping strings from HTML interpolation.\nexport default createEscaper(unescapeMap);\n" }, { "path": "modules/union.js", "content": "import restArguments from './restArguments.js';\nimport uniq from './uniq.js';\nimport flatten from './_flatten.js';\n\n// Produce an array that contains the union: each distinct element from all of\n// the passed-in arrays.\nexport default restArguments(function(arrays) {\n return uniq(flatten(arrays, true, true));\n});\n" }, { "path": "modules/uniq.js", "content": "import isBoolean from './isBoolean.js';\nimport cb from './_cb.js';\nimport getLength from './_getLength.js';\nimport contains from './contains.js';\n\n// Produce a duplicate-free version of the array. If the array has already\n// been sorted, you have the option of using a faster algorithm.\n// The faster algorithm will not work with an iteratee if the iteratee\n// is not a one-to-one function, so providing an iteratee will disable\n// the faster algorithm.\nexport default function uniq(array, isSorted, iteratee, context) {\n if (!isBoolean(isSorted)) {\n context = iteratee;\n iteratee = isSorted;\n isSorted = false;\n }\n if (iteratee != null) iteratee = cb(iteratee, context);\n var result = [];\n var seen = [];\n for (var i = 0, length = getLength(array); i < length; i++) {\n var value = array[i],\n computed = iteratee ? iteratee(value, i, array) : value;\n if (isSorted && !iteratee) {\n if (!i || seen !== computed) result.push(value);\n seen = computed;\n } else if (iteratee) {\n if (!contains(seen, computed)) {\n seen.push(computed);\n result.push(value);\n }\n } else if (!contains(result, value)) {\n result.push(value);\n }\n }\n return result;\n}\n" }, { "path": "modules/uniqueId.js", "content": "// Generate a unique integer id (unique within the entire client session).\n// Useful for temporary DOM ids.\nvar idCounter = 0;\nexport default function uniqueId(prefix) {\n var id = ++idCounter + '';\n return prefix ? prefix + id : id;\n}\n" }, { "path": "modules/unzip.js", "content": "import max from './max.js';\nimport getLength from './_getLength.js';\nimport pluck from './pluck.js';\n\n// Complement of zip. Unzip accepts an array of arrays and groups\n// each array's elements on shared indices.\nexport default function unzip(array) {\n var length = (array && max(array, getLength).length) || 0;\n var result = Array(length);\n\n for (var index = 0; index < length; index++) {\n result[index] = pluck(array, index);\n }\n return result;\n}\n" }, { "path": "modules/values.js", "content": "import keys from './keys.js';\n\n// Retrieve the values of an object's properties.\nexport default function values(obj) {\n var _keys = keys(obj);\n var length = _keys.length;\n var values = Array(length);\n for (var i = 0; i < length; i++) {\n values[i] = obj[_keys[i]];\n }\n return values;\n}\n" }, { "path": "modules/where.js", "content": "import filter from './filter.js';\nimport matcher from './matcher.js';\n\n// Convenience version of a common use case of `_.filter`: selecting only\n// objects containing specific `key:value` pairs.\nexport default function where(obj, attrs) {\n return filter(obj, matcher(attrs));\n}\n" }, { "path": "modules/without.js", "content": "import restArguments from './restArguments.js';\nimport difference from './difference.js';\n\n// Return a version of the array that does not contain the specified value(s).\nexport default restArguments(function(array, otherArrays) {\n return difference(array, otherArrays);\n});\n" }, { "path": "modules/wrap.js", "content": "import partial from './partial.js';\n\n// Returns the first function passed as an argument to the second,\n// allowing you to adjust arguments, run code before and after, and\n// conditionally execute the original function.\nexport default function wrap(func, wrapper) {\n return partial(wrapper, func);\n}\n" }, { "path": "modules/zip.js", "content": "import restArguments from './restArguments.js';\nimport unzip from './unzip.js';\n\n// Zip together multiple lists into a single array -- elements that share\n// an index go together.\nexport default restArguments(unzip);\n" }, { "path": "package.json", "content": "{\n \"name\": \"underscore\",\n \"description\": \"JavaScript's functional programming helper library.\",\n \"version\": \"1.13.8\",\n \"author\": \"Jeremy Ashkenas \",\n \"license\": \"MIT\",\n \"homepage\": \"https://underscorejs.org\",\n \"repository\": {\n \"type\": \"git\",\n \"url\": \"git://github.com/jashkenas/underscore.git\"\n },\n \"keywords\": [\n \"util\",\n \"functional\",\n \"server\",\n \"client\",\n \"browser\"\n ],\n \"main\": \"underscore-umd.js\",\n \"module\": \"modules/index-all.js\",\n \"type\": \"commonjs\",\n \"exports\": {\n \".\": {\n \"import\": {\n \"module\": \"./modules/index-all.js\",\n \"browser\": {\n \"production\": \"./underscore-esm-min.js\",\n \"default\": \"./underscore-esm.js\"\n },\n \"node\": \"./underscore-node.mjs\",\n \"default\": \"./underscore-esm.js\"\n },\n \"require\": {\n \"module\": \"./modules/index-all.js\",\n \"browser\": {\n \"production\": \"./underscore-umd-min.js\",\n \"default\": \"./underscore-umd.js\"\n },\n \"node\": \"./underscore-node.cjs\",\n \"default\": \"./underscore-umd.js\"\n },\n \"default\": \"./underscore-umd.js\"\n },\n \"./underscore*\": \"./underscore*\",\n \"./modules/*\": {\n \"require\": \"./cjs/*\",\n \"default\": \"./modules/*\"\n },\n \"./amd/*\": \"./amd/*\",\n \"./cjs/*\": \"./cjs/*\",\n \"./package.json\": \"./package.json\"\n },\n \"devDependencies\": {\n \"coveralls\": \"^3.1.1\",\n \"cpy-cli\": \"^3.1.1\",\n \"docco\": \"^0.8.0\",\n \"eslint\": \"^6.8.0\",\n \"eslint-plugin-import\": \"^2.20.1\",\n \"glob\": \"^7.1.6\",\n \"gzip-size-cli\": \"^1.0.0\",\n \"husky\": \"^4.2.3\",\n \"karma\": \"^4.4.1\",\n \"karma-qunit\": \"^4.1.2\",\n \"karma-sauce-launcher\": \"^4.3.6\",\n \"nyc\": \"^15.1.0\",\n \"patch-package\": \"^6.4.7\",\n \"pretty-bytes-cli\": \"^1.0.0\",\n \"qunit\": \"2.10.1\",\n \"rollup\": \"^2.40.0\",\n \"terser\": \"^4.6.13\"\n },\n \"overrides\": {\n \"colors@>1.4.0\": \"1.4.0\"\n },\n \"scripts\": {\n \"test\": \"npm run lint && npm run prepare-tests && npm run test-node\",\n \"coverage\": \"npm run prepare-tests && nyc npm run test-node && nyc report\",\n \"coveralls\": \"nyc npm run test-node && nyc report --reporter=text-lcov | coveralls\",\n \"lint\": \"eslint modules/*.js test/*.js\",\n \"test-node\": \"qunit test/\",\n \"test-browser\": \"npm i karma-phantomjs-launcher && karma start\",\n \"bundle\": \"rollup -c && eslint underscore-umd.js && rollup -c rollup.config2.js\",\n \"bundle-treeshake\": \"cd test-treeshake && rollup --config\",\n \"prepare-tests\": \"npm run bundle && npm run bundle-treeshake\",\n \"minify-umd\": \"terser underscore-umd.js -c \\\"evaluate=false\\\" --comments \\\"/ .*/\\\" -m\",\n \"minify-esm\": \"terser underscore-esm.js -c \\\"evaluate=false\\\" --comments \\\"/ .*/\\\" -m\",\n \"module-package-json\": \"node -e 'console.log(`{\\\"type\\\":\\\"module\\\",\\\"version\\\":\\\"${process.env.npm_package_version}\\\"}`)' > modules/package.json\",\n \"build-umd\": \"npm run minify-umd -- --source-map content=underscore-umd.js.map --source-map-url \\\" \\\" -o underscore-umd-min.js\",\n \"build-esm\": \"npm run module-package-json && npm run minify-esm -- --source-map content=underscore-esm.js.map --source-map-url \\\" \\\" -o underscore-esm-min.js\",\n \"alias-bundle\": \"cpy --rename=underscore.js underscore-umd.js . && cpy --rename=underscore-min.js underscore-umd-min.js . && cpy --rename=underscore-min.js.map underscore-umd-min.js.map .\",\n \"build\": \"npm run bundle && npm run build-umd && npm run build-esm && npm run alias-bundle\",\n \"doc\": \"patch-package && docco underscore-esm.js && docco modules/*.js -c docco.css -t docs/linked-esm.jst\",\n \"weight\": \"npm run bundle && npm run minify-umd | gzip-size | pretty-bytes\",\n \"prepublishOnly\": \"npm run build && npm run doc\"\n },\n \"files\": [\n \"underscore-esm.js\",\n \"underscore-esm.js.map\",\n \"underscore-esm-min.js\",\n \"underscore-esm-min.js.map\",\n \"underscore-umd.js\",\n \"underscore-umd.js.map\",\n \"underscore-umd-min.js\",\n \"underscore-umd-min.js.map\",\n \"underscore.js\",\n \"underscore-min.js\",\n \"underscore-min.js.map\",\n \"underscore-node-f.cjs\",\n \"underscore-node-f.cjs.map\",\n \"underscore-node.cjs\",\n \"underscore-node.cjs.map\",\n \"underscore-node.mjs\",\n \"underscore-node.mjs.map\",\n \"modules/\",\n \"amd/\",\n \"cjs/\"\n ],\n \"husky\": {\n \"hooks\": {\n \"pre-commit\": \"npm run bundle && git add underscore-umd.js underscore-umd.js.map underscore-esm.js underscore-esm.js.map underscore-node-f.cjs underscore-node-f.cjs.map underscore-node.cjs underscore-node.cjs.map underscore-node.mjs underscore-node.mjs.map\",\n \"post-commit\": \"git reset underscore-umd.js underscore-umd.js.map underscore-esm.js underscore-esm.js.map underscore-node-f.cjs underscore-node-f.cjs.map underscore-node.cjs underscore-node.cjs.map underscore-node.mjs underscore-node.mjs.map\"\n }\n }\n}\n" }, { "path": "patches/docco+0.8.0.patch", "content": "diff --git a/node_modules/docco/docco.js b/node_modules/docco/docco.js\nindex 0bb5a8b..f38f9a5 100644\n--- a/node_modules/docco/docco.js\n+++ b/node_modules/docco/docco.js\n@@ -314,7 +314,7 @@\n \n path = require('path');\n \n- marked = require('marked');\n+ marked = require('marked').marked;\n \n commander = require('commander');\n \n" }, { "path": "rollup.common.js", "content": "import { readFileSync } from 'fs';\nimport { extend } from './underscore-esm.js';\n\nvar intro = readFileSync('modules/index.js', 'utf-8').split('\\n').slice(3, 7).join('\\n');\n\nvar outputBase = {\n strict: false,\n externalLiveBindings: false,\n freeze: false,\n};\n\nvar sourcemapBase = {\n sourcemap: true,\n sourcemapExcludeSources: true,\n};\n\nexport function outputConf(particular) {\n return extend(particular, outputBase);\n}\n\nexport function sourcemapConf(particular) {\n return extend(particular, outputBase, sourcemapBase);\n}\n\nexport function monolithConf(particular) {\n return extend(particular, outputBase, sourcemapBase, {intro});\n}\n" }, { "path": "rollup.config.js", "content": "import glob from 'glob';\nimport { filter } from './underscore-esm.js';\nimport { outputConf, sourcemapConf, monolithConf } from './rollup.common.js';\n\nexport default [\n // Monolithic ESM bundle for browsers and deno.\n {\n input: 'modules/index-all.js',\n treeshake: false,\n output: monolithConf({\n file: 'underscore-esm.js',\n format: 'esm',\n }),\n },\n // Monolithic UMD bundle for browsers, AMD and old Node.js.\n {\n input: 'modules/index-default.js',\n treeshake: false,\n output: monolithConf({\n file: 'underscore-umd.js',\n exports: 'default',\n format: 'umd',\n name: '_',\n amd: {\n id: 'underscore',\n },\n noConflict: true,\n }),\n },\n // Custom builds for Node.js, first pass. Second pass in rollup.config2.js.\n {\n input: {\n 'underscore-node-cjs-pre': 'modules/index-default.js',\n 'underscore-node-mjs-pre': 'modules/index-all.js',\n },\n treeshake: false,\n output: sourcemapConf({\n chunkFileNames: 'underscore-node-f-pre.js',\n dir: '.',\n minifyInternalExports: false,\n format: 'esm',\n }),\n },\n // AMD and CJS versions of the individual modules for development\n // and custom bundles.\n {\n input: filter(\n glob.sync('modules/**/*.js'),\n function(path) { return path !== 'modules/index-all.js'; }\n ),\n preserveModules: true,\n output: [\n outputConf({\n dir: 'amd',\n exports: 'auto',\n format: 'amd',\n }),\n outputConf({\n dir: 'cjs',\n exports: 'auto',\n format: 'cjs',\n }),\n ],\n }\n];\n" }, { "path": "rollup.config2.js", "content": "import { resolve } from 'path';\nimport { monolithConf } from './rollup.common.js';\n\nvar sharedInput = './underscore-node-f-pre.js';\nvar sharedOutput = './underscore-node-f.cjs';\n\nexport default [\n // ESM entry point for Node.js 12+.\n {\n input: 'underscore-node-mjs-pre.js',\n external: sharedInput,\n output: monolithConf({\n file: 'underscore-node.mjs',\n format: 'esm',\n paths: {\n [resolve(__dirname, sharedInput)]: sharedOutput,\n },\n }),\n },\n // CJS entry point for Node.js 12+, plus code shared with the ESM entry.\n {\n input: {\n 'underscore-node-f': sharedInput,\n 'underscore-node': 'underscore-node-cjs-pre.js',\n },\n preserveModules: true,\n output: monolithConf({\n entryFileNames: '[name].cjs',\n dir: '.',\n exports: 'auto',\n format: 'cjs',\n }),\n },\n];\n" }, { "path": "test/.eslintrc", "content": "{\n \"env\": {\n \"browser\": true\n },\n \"parserOptions\": {},\n \"globals\": {\n \"QUnit\": false\n },\n \"rules\": {\n \"brace-style\": 0,\n \"no-new-wrappers\": 0,\n \"no-extend-native\": 0\n }\n}\n" }, { "path": "test/arrays.js", "content": "(function() {\n var _ = typeof require == 'function' ? require('..') : window._;\n\n QUnit.module('Arrays');\n\n QUnit.test('first', function(assert) {\n assert.strictEqual(_.first([1, 2, 3]), 1, 'can pull out the first element of an array');\n assert.strictEqual(_([1, 2, 3]).first(), 1, 'can perform OO-style \"first()\"');\n assert.deepEqual(_.first([1, 2, 3], 0), [], 'returns an empty array when n <= 0 (0 case)');\n assert.deepEqual(_.first([1, 2, 3], -1), [], 'returns an empty array when n <= 0 (negative case)');\n assert.deepEqual(_.first([1, 2, 3], 2), [1, 2], 'can fetch the first n elements');\n assert.deepEqual(_.first([1, 2, 3], 5), [1, 2, 3], 'returns the whole array if n > length');\n var result = (function(){ return _.first(arguments); }(4, 3, 2, 1));\n assert.strictEqual(result, 4, 'works on an arguments object');\n result = _.map([[1, 2, 3], [], [1, 2, 3]], _.first);\n assert.deepEqual(result, [1, void 0, 1], 'works well with _.map');\n assert.strictEqual(_.first(null), void 0, 'returns undefined when called on null');\n assert.deepEqual(_.first([], 10), [], 'returns an empty array when called with an explicit number of elements to return');\n assert.deepEqual(_.first([], 1), [], 'returns an empty array when called with an explicit number of elements to return');\n assert.deepEqual(_.first(null, 5), [], 'returns an empty array when called with an explicit number of elements to return');\n\n Array.prototype[0] = 'boo';\n assert.strictEqual(_.first([]), void 0, 'return undefined when called on a empty array');\n delete Array.prototype[0];\n });\n\n QUnit.test('head', function(assert) {\n assert.strictEqual(_.head, _.first, 'is an alias for first');\n });\n\n QUnit.test('take', function(assert) {\n assert.strictEqual(_.take, _.first, 'is an alias for first');\n });\n\n QUnit.test('rest', function(assert) {\n var numbers = [1, 2, 3, 4];\n assert.deepEqual(_.rest(numbers), [2, 3, 4], 'fetches all but the first element');\n assert.deepEqual(_.rest(numbers, 0), [1, 2, 3, 4], 'returns the whole array when index is 0');\n assert.deepEqual(_.rest(numbers, 2), [3, 4], 'returns elements starting at the given index');\n var result = (function(){ return _(arguments).rest(); }(1, 2, 3, 4));\n assert.deepEqual(result, [2, 3, 4], 'works on an arguments object');\n result = _.map([[1, 2, 3], [1, 2, 3]], _.rest);\n assert.deepEqual(_.flatten(result), [2, 3, 2, 3], 'works well with _.map');\n });\n\n QUnit.test('tail', function(assert) {\n assert.strictEqual(_.tail, _.rest, 'is an alias for rest');\n });\n\n QUnit.test('drop', function(assert) {\n assert.strictEqual(_.drop, _.rest, 'is an alias for rest');\n });\n\n QUnit.test('initial', function(assert) {\n assert.deepEqual(_.initial([1, 2, 3, 4, 5]), [1, 2, 3, 4], 'returns all but the last element');\n assert.deepEqual(_.initial([1, 2, 3, 4], 2), [1, 2], 'returns all but the last n elements');\n assert.deepEqual(_.initial([1, 2, 3, 4], 6), [], 'returns an empty array when n > length');\n var result = (function(){ return _(arguments).initial(); }(1, 2, 3, 4));\n assert.deepEqual(result, [1, 2, 3], 'works on an arguments object');\n result = _.map([[1, 2, 3], [1, 2, 3]], _.initial);\n assert.deepEqual(_.flatten(result), [1, 2, 1, 2], 'works well with _.map');\n });\n\n QUnit.test('last', function(assert) {\n assert.strictEqual(_.last([1, 2, 3]), 3, 'can pull out the last element of an array');\n assert.strictEqual(_([1, 2, 3]).last(), 3, 'can perform OO-style \"last()\"');\n assert.deepEqual(_.last([1, 2, 3], 0), [], 'returns an empty array when n <= 0 (0 case)');\n assert.deepEqual(_.last([1, 2, 3], -1), [], 'returns an empty array when n <= 0 (negative case)');\n assert.deepEqual(_.last([1, 2, 3], 2), [2, 3], 'can fetch the last n elements');\n assert.deepEqual(_.last([1, 2, 3], 5), [1, 2, 3], 'returns the whole array if n > length');\n var result = (function(){ return _(arguments).last(); }(1, 2, 3, 4));\n assert.strictEqual(result, 4, 'works on an arguments object');\n result = _.map([[1, 2, 3], [], [1, 2, 3]], _.last);\n assert.deepEqual(result, [3, void 0, 3], 'works well with _.map');\n assert.strictEqual(_.last(null), void 0, 'returns undefined when called on null');\n assert.deepEqual(_.last([], 10), [], 'returns an empty array when called with an explicit number of elements to return');\n assert.deepEqual(_.last([], 1), [], 'returns an empty array when called with an explicit number of elements to return');\n assert.deepEqual(_.last(null, 5), [], 'returns an empty array when called with an explicit number of elements to return');\n\n var arr = [];\n arr[-1] = 'boo';\n assert.strictEqual(_.last(arr), void 0, 'return undefined when called on a empty array');\n });\n\n QUnit.test('compact', function(assert) {\n assert.deepEqual(_.compact([1, false, null, 0, '', void 0, NaN, 2]), [1, 2], 'removes all falsy values');\n var result = (function(){ return _.compact(arguments); }(0, 1, false, 2, false, 3));\n assert.deepEqual(result, [1, 2, 3], 'works on an arguments object');\n result = _.map([[1, false, false], [false, false, 3]], _.compact);\n assert.deepEqual(result, [[1], [3]], 'works well with _.map');\n });\n\n QUnit.test('flatten', function(assert) {\n assert.deepEqual(_.flatten(null), [], 'supports null');\n assert.deepEqual(_.flatten(void 0), [], 'supports undefined');\n\n assert.deepEqual(_.flatten([[], [[]], []]), [], 'supports empty arrays');\n assert.deepEqual(_.flatten([[], [[]], []], true), [[]], 'can shallowly flatten empty arrays');\n\n var list = [1, [2], [3, [[[4]]]]];\n assert.deepEqual(_.flatten(list), [1, 2, 3, 4], 'can flatten nested arrays');\n assert.deepEqual(_.flatten(list, true), [1, 2, 3, [[[4]]]], 'can shallowly flatten nested arrays');\n assert.deepEqual(_.flatten(list, false), [1, 2, 3, 4], 'false means deep');\n var result = (function(){ return _.flatten(arguments); }(1, [2], [3, [[[4]]]]));\n assert.deepEqual(result, [1, 2, 3, 4], 'works on an arguments object');\n list = [[1], [2], [3], [[4]]];\n assert.deepEqual(_.flatten(list, true), [1, 2, 3, [4]], 'can shallowly flatten arrays containing only other arrays');\n list = [1, [2], [[3]], [[[4]]]];\n assert.deepEqual(_.flatten(list, 2), [1, 2, 3, [4]], 'can flatten arrays to a given depth');\n assert.deepEqual(_.flatten(list, 0), list, 'can flatten arrays to depth of 0');\n assert.deepEqual(_.flatten(list, -1), list, 'can flatten arrays to depth of -1');\n\n assert.strictEqual(_.flatten([_.range(10), _.range(10), 5, 1, 3], true).length, 23, 'can flatten medium length arrays');\n assert.strictEqual(_.flatten([_.range(10), _.range(10), 5, 1, 3]).length, 23, 'can shallowly flatten medium length arrays');\n assert.strictEqual(_.flatten([new Array(10)]).length, 10, 'can flatten array with nulls of size n');\n assert.strictEqual(_.flatten([new Array(1000000), _.range(56000), 5, 1, 3]).length, 1056003, 'can handle massive arrays');\n assert.strictEqual(_.flatten([new Array(1000000), _.range(56000), 5, 1, 3], true).length, 1056003, 'can handle massive arrays in shallow mode');\n\n // Check against extremely deep recursion because of CVE-2026-27601.\n var x = _.range(100000);\n for (var i = 0; i < 1000; i++) x = [x];\n assert.deepEqual(_.flatten(x), _.range(100000), 'can handle very deep arrays');\n assert.deepEqual(_.flatten(x, true), x[0], 'can handle very deep arrays in shallow mode');\n\n var y = [1, 2, 3];\n for (var i = 0; i < 100000; ++i) y = [y];\n assert.deepEqual(_.flatten(y), [1, 2, 3], 'can handle extremely deeply nested arrays');\n });\n\n QUnit.test('without', function(assert) {\n var list = [1, 2, 1, 0, 3, 1, 4];\n assert.deepEqual(_.without(list, 0, 1), [2, 3, 4], 'removes all instances of the given values');\n var result = (function(){ return _.without(arguments, 0, 1); }(1, 2, 1, 0, 3, 1, 4));\n assert.deepEqual(result, [2, 3, 4], 'works on an arguments object');\n\n list = [{one: 1}, {two: 2}];\n assert.deepEqual(_.without(list, {one: 1}), list, 'compares objects by reference (value case)');\n assert.deepEqual(_.without(list, list[0]), [{two: 2}], 'compares objects by reference (reference case)');\n });\n\n QUnit.test('sortedIndex', function(assert) {\n var numbers = [10, 20, 30, 30, 30, 40, 50, 60];\n var indexFor35 = _.sortedIndex(numbers, 35);\n assert.strictEqual(indexFor35, 5, 'finds the index at which a value should be inserted to retain order');\n var indexFor30 = _.sortedIndex(numbers, 30);\n assert.strictEqual(indexFor30, 2, 'finds the smallest index at which a value could be inserted to retain order');\n\n var objects = [{x: 10}, {x: 20}, {x: 30}, {x: 40}];\n var iterator = function(obj){ return obj.x; };\n assert.strictEqual(_.sortedIndex(objects, {x: 25}, iterator), 2, 'uses the result of `iterator` for order comparisons');\n assert.strictEqual(_.sortedIndex(objects, {x: 35}, 'x'), 3, 'when `iterator` is a string, uses that key for order comparisons');\n\n var context = {1: 2, 2: 3, 3: 4};\n iterator = function(obj){ return this[obj]; };\n assert.strictEqual(_.sortedIndex([1, 3], 2, iterator, context), 1, 'can execute its iterator in the given context');\n\n var values = [0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535, 131071, 262143, 524287,\n 1048575, 2097151, 4194303, 8388607, 16777215, 33554431, 67108863, 134217727, 268435455, 536870911, 1073741823, 2147483647];\n var largeArray = Array(Math.pow(2, 32) - 1);\n var length = values.length;\n // Sparsely populate `array`\n while (length--) {\n largeArray[values[length]] = values[length];\n }\n assert.strictEqual(_.sortedIndex(largeArray, 2147483648), 2147483648, 'works with large indexes');\n });\n\n QUnit.test('uniq', function(assert) {\n var list = [1, 2, 1, 3, 1, 4];\n assert.deepEqual(_.uniq(list), [1, 2, 3, 4], 'can find the unique values of an unsorted array');\n list = [1, 1, 1, 2, 2, 3];\n assert.deepEqual(_.uniq(list, true), [1, 2, 3], 'can find the unique values of a sorted array faster');\n\n list = [-2, -1, 0, 1, 2];\n var notInjective = function(x) {return x * x;};\n assert.deepEqual(_.uniq(list, true, notInjective), [-2, -1, 0], 'can find values of sorted array which map to unique values through a non one-to-one function by switching to slower algorithm even when isSorted=true');\n\n list = [{name: 'Moe'}, {name: 'Curly'}, {name: 'Larry'}, {name: 'Curly'}];\n var expected = [{name: 'Moe'}, {name: 'Curly'}, {name: 'Larry'}];\n var iterator = function(stooge) { return stooge.name; };\n assert.deepEqual(_.uniq(list, false, iterator), expected, 'uses the result of `iterator` for uniqueness comparisons (unsorted case)');\n assert.deepEqual(_.uniq(list, iterator), expected, '`sorted` argument defaults to false when omitted');\n assert.deepEqual(_.uniq(list, 'name'), expected, 'when `iterator` is a string, uses that key for comparisons (unsorted case)');\n\n list = [{score: 8}, {score: 10}, {score: 10}];\n expected = [{score: 8}, {score: 10}];\n iterator = function(item) { return item.score; };\n assert.deepEqual(_.uniq(list, true, iterator), expected, 'uses the result of `iterator` for uniqueness comparisons (sorted case)');\n assert.deepEqual(_.uniq(list, true, 'score'), expected, 'when `iterator` is a string, uses that key for comparisons (sorted case)');\n\n assert.deepEqual(_.uniq([{0: 1}, {0: 1}, {0: 1}, {0: 2}], 0), [{0: 1}, {0: 2}], 'can use falsy pluck like iterator');\n\n var result = (function(){ return _.uniq(arguments); }(1, 2, 1, 3, 1, 4));\n assert.deepEqual(result, [1, 2, 3, 4], 'works on an arguments object');\n\n var a = {}, b = {}, c = {};\n assert.deepEqual(_.uniq([a, b, a, b, c]), [a, b, c], 'works on values that can be tested for equivalency but not ordered');\n\n assert.deepEqual(_.uniq(null), [], 'returns an empty array when `array` is not iterable');\n\n var context = {};\n list = [3];\n _.uniq(list, function(value, index, array) {\n assert.strictEqual(this, context, 'executes its iterator in the given context');\n assert.strictEqual(value, 3, 'passes its iterator the value');\n assert.strictEqual(index, 0, 'passes its iterator the index');\n assert.strictEqual(array, list, 'passes its iterator the entire array');\n }, context);\n\n });\n\n QUnit.test('unique', function(assert) {\n assert.strictEqual(_.unique, _.uniq, 'is an alias for uniq');\n });\n\n QUnit.test('intersection', function(assert) {\n var stooges = ['moe', 'curly', 'larry'], leaders = ['moe', 'groucho'];\n assert.deepEqual(_.intersection(stooges, leaders), ['moe'], 'can find the set intersection of two arrays');\n assert.deepEqual(_(stooges).intersection(leaders), ['moe'], 'can perform an OO-style intersection');\n var result = (function(){ return _.intersection(arguments, leaders); }('moe', 'curly', 'larry'));\n assert.deepEqual(result, ['moe'], 'works on an arguments object');\n var theSixStooges = ['moe', 'moe', 'curly', 'curly', 'larry', 'larry'];\n assert.deepEqual(_.intersection(theSixStooges, leaders), ['moe'], 'returns a duplicate-free array');\n result = _.intersection([2, 4, 3, 1], [1, 2, 3]);\n assert.deepEqual(result, [2, 3, 1], 'preserves the order of the first array');\n result = _.intersection(null, [1, 2, 3]);\n assert.deepEqual(result, [], 'returns an empty array when passed null as the first argument');\n result = _.intersection([1, 2, 3], null);\n assert.deepEqual(result, [], 'returns an empty array when passed null as an argument beyond the first');\n });\n\n QUnit.test('union', function(assert) {\n var result = _.union([1, 2, 3], [2, 30, 1], [1, 40]);\n assert.deepEqual(result, [1, 2, 3, 30, 40], 'can find the union of a list of arrays');\n\n result = _([1, 2, 3]).union([2, 30, 1], [1, 40]);\n assert.deepEqual(result, [1, 2, 3, 30, 40], 'can perform an OO-style union');\n\n result = _.union([1, 2, 3], [2, 30, 1], [1, 40, [1]]);\n assert.deepEqual(result, [1, 2, 3, 30, 40, [1]], 'can find the union of a list of nested arrays');\n\n result = _.union([10, 20], [1, 30, 10], [0, 40]);\n assert.deepEqual(result, [10, 20, 1, 30, 0, 40], 'orders values by their first encounter');\n\n result = (function(){ return _.union(arguments, [2, 30, 1], [1, 40]); }(1, 2, 3));\n assert.deepEqual(result, [1, 2, 3, 30, 40], 'works on an arguments object');\n\n assert.deepEqual(_.union([1, 2, 3], 4), [1, 2, 3], 'restricts the union to arrays only');\n });\n\n QUnit.test('difference', function(assert) {\n var result = _.difference([1, 2, 3], [2, 30, 40]);\n assert.deepEqual(result, [1, 3], 'can find the difference of two arrays');\n\n var result = _.difference([1, 2, 3], [2, 30, 40, [1]]);\n assert.deepEqual(result, [1, 3], 'avoids deep flattening of arrays');\n\n result = _([1, 2, 3]).difference([2, 30, 40]);\n assert.deepEqual(result, [1, 3], 'can perform an OO-style difference');\n\n result = _.difference([1, 2, 3, 4], [2, 30, 40], [1, 11, 111]);\n assert.deepEqual(result, [3, 4], 'can find the difference of three arrays');\n\n result = _.difference([8, 9, 3, 1], [3, 8]);\n assert.deepEqual(result, [9, 1], 'preserves the order of the first array');\n\n result = (function(){ return _.difference(arguments, [2, 30, 40]); }(1, 2, 3));\n assert.deepEqual(result, [1, 3], 'works on an arguments object');\n\n result = _.difference([1, 2, 3], 1);\n assert.deepEqual(result, [1, 2, 3], 'restrict the difference to arrays only');\n });\n\n QUnit.test('zip', function(assert) {\n var names = ['moe', 'larry', 'curly'], ages = [30, 40, 50], leaders = [true];\n assert.deepEqual(_.zip(names, ages, leaders), [\n ['moe', 30, true],\n ['larry', 40, void 0],\n ['curly', 50, void 0]\n ], 'zipped together arrays of different lengths');\n\n var stooges = _.zip(['moe', 30, 'stooge 1'], ['larry', 40, 'stooge 2'], ['curly', 50, 'stooge 3']);\n assert.deepEqual(stooges, [['moe', 'larry', 'curly'], [30, 40, 50], ['stooge 1', 'stooge 2', 'stooge 3']], 'zipped pairs');\n\n // In the case of different lengths of the tuples, undefined values\n // should be used as placeholder\n stooges = _.zip(['moe', 30], ['larry', 40], ['curly', 50, 'extra data']);\n assert.deepEqual(stooges, [['moe', 'larry', 'curly'], [30, 40, 50], [void 0, void 0, 'extra data']], 'zipped pairs with empties');\n\n var empty = _.zip([]);\n assert.deepEqual(empty, [], 'unzipped empty');\n\n assert.deepEqual(_.zip(null), [], 'handles null');\n assert.deepEqual(_.zip(), [], '_.zip() returns []');\n });\n\n QUnit.test('unzip', function(assert) {\n assert.deepEqual(_.unzip(null), [], 'handles null');\n\n assert.deepEqual(_.unzip([['a', 'b'], [1, 2]]), [['a', 1], ['b', 2]]);\n\n // complements zip\n var zipped = _.zip(['fred', 'barney'], [30, 40], [true, false]);\n assert.deepEqual(_.unzip(zipped), [['fred', 'barney'], [30, 40], [true, false]]);\n\n zipped = _.zip(['moe', 30], ['larry', 40], ['curly', 50, 'extra data']);\n assert.deepEqual(_.unzip(zipped), [['moe', 30, void 0], ['larry', 40, void 0], ['curly', 50, 'extra data']], 'Uses length of largest array');\n });\n\n QUnit.test('object', function(assert) {\n var result = _.object(['moe', 'larry', 'curly'], [30, 40, 50]);\n var shouldBe = {moe: 30, larry: 40, curly: 50};\n assert.deepEqual(result, shouldBe, 'two arrays zipped together into an object');\n\n result = _.object([['one', 1], ['two', 2], ['three', 3]]);\n shouldBe = {one: 1, two: 2, three: 3};\n assert.deepEqual(result, shouldBe, 'an array of pairs zipped together into an object');\n\n var stooges = {moe: 30, larry: 40, curly: 50};\n assert.deepEqual(_.object(_.pairs(stooges)), stooges, 'an object converted to pairs and back to an object');\n\n assert.deepEqual(_.object(null), {}, 'handles nulls');\n });\n\n QUnit.test('transpose', function(assert) {\n assert.strictEqual(_.transpose, _.unzip, 'is an alias for unzip');\n });\n\n QUnit.test('indexOf', function(assert) {\n var numbers = [1, 2, 3];\n assert.strictEqual(_.indexOf(numbers, 2), 1, 'can compute indexOf');\n var result = (function(){ return _.indexOf(arguments, 2); }(1, 2, 3));\n assert.strictEqual(result, 1, 'works on an arguments object');\n\n _.each([null, void 0, [], false], function(val) {\n var msg = 'Handles: ' + (_.isArray(val) ? '[]' : val);\n assert.strictEqual(_.indexOf(val, 2), -1, msg);\n assert.strictEqual(_.indexOf(val, 2, -1), -1, msg);\n assert.strictEqual(_.indexOf(val, 2, -20), -1, msg);\n assert.strictEqual(_.indexOf(val, 2, 15), -1, msg);\n });\n\n var num = 35;\n numbers = [10, 20, 30, 40, 50];\n var index = _.indexOf(numbers, num, true);\n assert.strictEqual(index, -1, '35 is not in the list');\n\n numbers = [10, 20, 30, 40, 50]; num = 40;\n index = _.indexOf(numbers, num, true);\n assert.strictEqual(index, 3, '40 is in the list');\n\n numbers = [1, 40, 40, 40, 40, 40, 40, 40, 50, 60, 70]; num = 40;\n assert.strictEqual(_.indexOf(numbers, num, true), 1, '40 is in the list');\n assert.strictEqual(_.indexOf(numbers, 6, true), -1, '6 isnt in the list');\n assert.strictEqual(_.indexOf([1, 2, 5, 4, 6, 7], 5, true), -1, 'sorted indexOf doesn\\'t use binary search');\n assert.ok(_.every(['1', [], {}, null], function() {\n return _.indexOf(numbers, num, {}) === 1;\n }), 'non-nums as fromIndex make indexOf assume sorted');\n\n numbers = [1, 2, 3, 1, 2, 3, 1, 2, 3];\n index = _.indexOf(numbers, 2, 5);\n assert.strictEqual(index, 7, 'supports the fromIndex argument');\n\n index = _.indexOf([,,, 0], void 0);\n assert.strictEqual(index, 0, 'treats sparse arrays as if they were dense');\n\n var array = [1, 2, 3, 1, 2, 3];\n assert.strictEqual(_.indexOf(array, 1, -3), 3, 'neg `fromIndex` starts at the right index');\n assert.strictEqual(_.indexOf(array, 1, -2), -1, 'neg `fromIndex` starts at the right index');\n assert.strictEqual(_.indexOf(array, 2, -3), 4);\n _.each([-6, -8, -Infinity], function(fromIndex) {\n assert.strictEqual(_.indexOf(array, 1, fromIndex), 0);\n });\n assert.strictEqual(_.indexOf([1, 2, 3], 1, true), 0);\n\n index = _.indexOf([], void 0, true);\n assert.strictEqual(index, -1, 'empty array with truthy `isSorted` returns -1');\n });\n\n QUnit.test('indexOf with NaN', function(assert) {\n assert.strictEqual(_.indexOf([1, 2, NaN, NaN], NaN), 2, 'Expected [1, 2, NaN] to contain NaN');\n assert.strictEqual(_.indexOf([1, 2, Infinity], NaN), -1, 'Expected [1, 2, Infinity] to NOT contain NaN');\n\n assert.strictEqual(_.indexOf([1, 2, NaN, NaN], NaN, 1), 2, 'startIndex does not affect result');\n assert.strictEqual(_.indexOf([1, 2, NaN, NaN], NaN, -2), 2, 'startIndex does not affect result');\n\n (function() {\n assert.strictEqual(_.indexOf(arguments, NaN), 2, 'Expected arguments [1, 2, NaN] to contain NaN');\n }(1, 2, NaN, NaN));\n });\n\n QUnit.test('indexOf with +- 0', function(assert) {\n _.each([-0, +0], function(val) {\n assert.strictEqual(_.indexOf([1, 2, val, val], val), 2);\n assert.strictEqual(_.indexOf([1, 2, val, val], -val), 2);\n });\n });\n\n QUnit.test('lastIndexOf', function(assert) {\n var numbers = [1, 0, 1];\n var falsy = [void 0, '', 0, false, NaN, null, void 0];\n assert.strictEqual(_.lastIndexOf(numbers, 1), 2);\n\n numbers = [1, 0, 1, 0, 0, 1, 0, 0, 0];\n numbers.lastIndexOf = null;\n assert.strictEqual(_.lastIndexOf(numbers, 1), 5, 'can compute lastIndexOf, even without the native function');\n assert.strictEqual(_.lastIndexOf(numbers, 0), 8, 'lastIndexOf the other element');\n var result = (function(){ return _.lastIndexOf(arguments, 1); }(1, 0, 1, 0, 0, 1, 0, 0, 0));\n assert.strictEqual(result, 5, 'works on an arguments object');\n\n _.each([null, void 0, [], false], function(val) {\n var msg = 'Handles: ' + (_.isArray(val) ? '[]' : val);\n assert.strictEqual(_.lastIndexOf(val, 2), -1, msg);\n assert.strictEqual(_.lastIndexOf(val, 2, -1), -1, msg);\n assert.strictEqual(_.lastIndexOf(val, 2, -20), -1, msg);\n assert.strictEqual(_.lastIndexOf(val, 2, 15), -1, msg);\n });\n\n numbers = [1, 2, 3, 1, 2, 3, 1, 2, 3];\n var index = _.lastIndexOf(numbers, 2, 2);\n assert.strictEqual(index, 1, 'supports the fromIndex argument');\n\n var array = [1, 2, 3, 1, 2, 3];\n\n assert.strictEqual(_.lastIndexOf(array, 1, 0), 0, 'starts at the correct from idx');\n assert.strictEqual(_.lastIndexOf(array, 3), 5, 'should return the index of the last matched value');\n assert.strictEqual(_.lastIndexOf(array, 4), -1, 'should return `-1` for an unmatched value');\n\n assert.strictEqual(_.lastIndexOf(array, 1, 2), 0, 'should work with a positive `fromIndex`');\n\n _.each([6, 8, Math.pow(2, 32), Infinity], function(fromIndex) {\n assert.strictEqual(_.lastIndexOf(array, void 0, fromIndex), -1);\n assert.strictEqual(_.lastIndexOf(array, 1, fromIndex), 3);\n assert.strictEqual(_.lastIndexOf(array, '', fromIndex), -1);\n });\n\n var expected = _.map(falsy, function(value) {\n return typeof value == 'number' ? -1 : 5;\n });\n\n var actual = _.map(falsy, function(fromIndex) {\n return _.lastIndexOf(array, 3, fromIndex);\n });\n\n assert.deepEqual(actual, expected, 'should treat falsy `fromIndex` values, except `0` and `NaN`, as `array.length`');\n assert.strictEqual(_.lastIndexOf(array, 3, '1'), 5, 'should treat non-number `fromIndex` values as `array.length`');\n assert.strictEqual(_.lastIndexOf(array, 3, true), 5, 'should treat non-number `fromIndex` values as `array.length`');\n\n assert.strictEqual(_.lastIndexOf(array, 2, -3), 1, 'should work with a negative `fromIndex`');\n assert.strictEqual(_.lastIndexOf(array, 1, -3), 3, 'neg `fromIndex` starts at the right index');\n\n assert.deepEqual(_.map([-6, -8, -Infinity], function(fromIndex) {\n return _.lastIndexOf(array, 1, fromIndex);\n }), [0, -1, -1]);\n });\n\n QUnit.test('lastIndexOf with NaN', function(assert) {\n assert.strictEqual(_.lastIndexOf([1, 2, NaN, NaN], NaN), 3, 'Expected [1, 2, NaN] to contain NaN');\n assert.strictEqual(_.lastIndexOf([1, 2, Infinity], NaN), -1, 'Expected [1, 2, NaN] to contain NaN');\n\n assert.strictEqual(_.lastIndexOf([1, 2, NaN, NaN], NaN, 2), 2, 'fromIndex does not affect result');\n assert.strictEqual(_.lastIndexOf([1, 2, NaN, NaN], NaN, -2), 2, 'fromIndex does not affect result');\n\n (function() {\n assert.strictEqual(_.lastIndexOf(arguments, NaN), 3, 'Expected arguments [1, 2, NaN] to contain NaN');\n }(1, 2, NaN, NaN));\n });\n\n QUnit.test('lastIndexOf with +- 0', function(assert) {\n _.each([-0, +0], function(val) {\n assert.strictEqual(_.lastIndexOf([1, 2, val, val], val), 3);\n assert.strictEqual(_.lastIndexOf([1, 2, val, val], -val), 3);\n assert.strictEqual(_.lastIndexOf([-1, 1, 2], -val), -1);\n });\n });\n\n QUnit.test('findIndex', function(assert) {\n var objects = [\n {a: 0, b: 0},\n {a: 1, b: 1},\n {a: 2, b: 2},\n {a: 0, b: 0}\n ];\n\n assert.strictEqual(_.findIndex(objects, function(obj) {\n return obj.a === 0;\n }), 0);\n\n assert.strictEqual(_.findIndex(objects, function(obj) {\n return obj.b * obj.a === 4;\n }), 2);\n\n assert.strictEqual(_.findIndex(objects, 'a'), 1, 'Uses lookupIterator');\n\n assert.strictEqual(_.findIndex(objects, function(obj) {\n return obj.b * obj.a === 5;\n }), -1);\n\n assert.strictEqual(_.findIndex(null, _.noop), -1);\n assert.strictEqual(_.findIndex(objects, function(a) {\n return a.foo === null;\n }), -1);\n _.findIndex([{a: 1}], function(a, key, obj) {\n assert.strictEqual(key, 0);\n assert.deepEqual(obj, [{a: 1}]);\n assert.strictEqual(this, objects, 'called with context');\n }, objects);\n\n var sparse = [];\n sparse[20] = {a: 2, b: 2};\n assert.strictEqual(_.findIndex(sparse, function(obj) {\n return obj && obj.b * obj.a === 4;\n }), 20, 'Works with sparse arrays');\n\n var array = [1, 2, 3, 4];\n array.match = 55;\n assert.strictEqual(_.findIndex(array, function(x) { return x === 55; }), -1, 'doesn\\'t match array-likes keys');\n });\n\n QUnit.test('findLastIndex', function(assert) {\n var objects = [\n {a: 0, b: 0},\n {a: 1, b: 1},\n {a: 2, b: 2},\n {a: 0, b: 0}\n ];\n\n assert.strictEqual(_.findLastIndex(objects, function(obj) {\n return obj.a === 0;\n }), 3);\n\n assert.strictEqual(_.findLastIndex(objects, function(obj) {\n return obj.b * obj.a === 4;\n }), 2);\n\n assert.strictEqual(_.findLastIndex(objects, 'a'), 2, 'Uses lookupIterator');\n\n assert.strictEqual(_.findLastIndex(objects, function(obj) {\n return obj.b * obj.a === 5;\n }), -1);\n\n assert.strictEqual(_.findLastIndex(null, _.noop), -1);\n assert.strictEqual(_.findLastIndex(objects, function(a) {\n return a.foo === null;\n }), -1);\n _.findLastIndex([{a: 1}], function(a, key, obj) {\n assert.strictEqual(key, 0);\n assert.deepEqual(obj, [{a: 1}]);\n assert.strictEqual(this, objects, 'called with context');\n }, objects);\n\n var sparse = [];\n sparse[20] = {a: 2, b: 2};\n assert.strictEqual(_.findLastIndex(sparse, function(obj) {\n return obj && obj.b * obj.a === 4;\n }), 20, 'Works with sparse arrays');\n\n var array = [1, 2, 3, 4];\n array.match = 55;\n assert.strictEqual(_.findLastIndex(array, function(x) { return x === 55; }), -1, 'doesn\\'t match array-likes keys');\n });\n\n QUnit.test('range', function(assert) {\n assert.deepEqual(_.range(0), [], 'range with 0 as a first argument generates an empty array');\n assert.deepEqual(_.range(4), [0, 1, 2, 3], 'range with a single positive argument generates an array of elements 0,1,2,...,n-1');\n assert.deepEqual(_.range(5, 8), [5, 6, 7], 'range with two arguments a & b, a<b generates an array of elements a,a+1,a+2,...,b-2,b-1');\n assert.deepEqual(_.range(3, 10, 3), [3, 6, 9], 'range with three arguments a & b & c, c < b-a, a < b generates an array of elements a,a+c,a+2c,...,b - (multiplier of a) < c');\n assert.deepEqual(_.range(3, 10, 15), [3], 'range with three arguments a & b & c, c > b-a, a < b generates an array with a single element, equal to a');\n assert.deepEqual(_.range(12, 7, -2), [12, 10, 8], 'range with three arguments a & b & c, a > b, c < 0 generates an array of elements a,a-c,a-2c and ends with the number not less than b');\n assert.deepEqual(_.range(0, -10, -1), [0, -1, -2, -3, -4, -5, -6, -7, -8, -9], 'final example in the Python docs');\n assert.strictEqual(1 / _.range(-0, 1)[0], -Infinity, 'should preserve -0');\n assert.deepEqual(_.range(8, 5), [8, 7, 6], 'negative range generates descending array');\n assert.deepEqual(_.range(-3), [0, -1, -2], 'negative range generates descending array');\n });\n\n QUnit.test('chunk', function(assert) {\n assert.deepEqual(_.chunk([], 2), [], 'chunk for empty array returns an empty array');\n\n assert.deepEqual(_.chunk([1, 2, 3], 0), [], 'chunk into parts of 0 elements returns empty array');\n assert.deepEqual(_.chunk([1, 2, 3], -1), [], 'chunk into parts of negative amount of elements returns an empty array');\n assert.deepEqual(_.chunk([1, 2, 3]), [], 'defaults to empty array (chunk size 0)');\n\n assert.deepEqual(_.chunk([1, 2, 3], 1), [[1], [2], [3]], 'chunk into parts of 1 elements returns original array');\n\n assert.deepEqual(_.chunk([1, 2, 3], 3), [[1, 2, 3]], 'chunk into parts of current array length elements returns the original array');\n assert.deepEqual(_.chunk([1, 2, 3], 5), [[1, 2, 3]], 'chunk into parts of more then current array length elements returns the original array');\n\n assert.deepEqual(_.chunk([10, 20, 30, 40, 50, 60, 70], 2), [[10, 20], [30, 40], [50, 60], [70]], 'chunk into parts of less then current array length elements');\n assert.deepEqual(_.chunk([10, 20, 30, 40, 50, 60, 70], 3), [[10, 20, 30], [40, 50, 60], [70]], 'chunk into parts of less then current array length elements');\n });\n}());\n" }, { "path": "test/chaining.js", "content": "(function() {\n var _ = typeof require == 'function' ? require('..') : window._;\n\n QUnit.module('Chaining');\n\n QUnit.test('map/flatten/reduce', function(assert) {\n var lyrics = [\n 'I\\'m a lumberjack and I\\'m okay',\n 'I sleep all night and I work all day',\n 'He\\'s a lumberjack and he\\'s okay',\n 'He sleeps all night and he works all day'\n ];\n var counts = _(lyrics).chain()\n .map(function(line) { return line.split(''); })\n .flatten()\n .reduce(function(hash, l) {\n hash[l] = hash[l] || 0;\n hash[l]++;\n return hash;\n }, {})\n .value();\n assert.strictEqual(counts.a, 16, 'counted all the letters in the song');\n assert.strictEqual(counts.e, 10, 'counted all the letters in the song');\n });\n\n QUnit.test('select/reject/sortBy', function(assert) {\n var numbers = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];\n numbers = _(numbers).chain().select(function(n) {\n return n % 2 === 0;\n }).reject(function(n) {\n return n % 4 === 0;\n }).sortBy(function(n) {\n return -n;\n }).value();\n assert.deepEqual(numbers, [10, 6, 2], 'filtered and reversed the numbers');\n });\n\n QUnit.test('select/reject/sortBy in functional style', function(assert) {\n var numbers = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];\n numbers = _.chain(numbers).select(function(n) {\n return n % 2 === 0;\n }).reject(function(n) {\n return n % 4 === 0;\n }).sortBy(function(n) {\n return -n;\n }).value();\n assert.deepEqual(numbers, [10, 6, 2], 'filtered and reversed the numbers');\n });\n\n QUnit.test('reverse/concat/unshift/pop/map', function(assert) {\n var numbers = [1, 2, 3, 4, 5];\n numbers = _(numbers).chain()\n .reverse()\n .concat([5, 5, 5])\n .unshift(17)\n .pop()\n .map(function(n){ return n * 2; })\n .value();\n assert.deepEqual(numbers, [34, 10, 8, 6, 4, 2, 10, 10], 'can chain together array functions.');\n });\n\n QUnit.test('splice', function(assert) {\n var instance = _([1, 2, 3, 4, 5]).chain();\n assert.deepEqual(instance.splice(1, 3).value(), [1, 5]);\n assert.deepEqual(instance.splice(1, 0).value(), [1, 5]);\n assert.deepEqual(instance.splice(1, 1).value(), [1]);\n assert.deepEqual(instance.splice(0, 1).value(), [], '#397 Can create empty array');\n });\n\n QUnit.test('shift', function(assert) {\n var instance = _([1, 2, 3]).chain();\n assert.deepEqual(instance.shift().value(), [2, 3]);\n assert.deepEqual(instance.shift().value(), [3]);\n assert.deepEqual(instance.shift().value(), [], '#397 Can create empty array');\n });\n\n QUnit.test('pop', function(assert) {\n var instance = _([1, 2, 3]).chain();\n assert.deepEqual(instance.pop().value(), [1, 2]);\n assert.deepEqual(instance.pop().value(), [1]);\n assert.deepEqual(instance.pop().value(), [], '#397 Can create empty array');\n });\n\n QUnit.test('chaining works in small stages', function(assert) {\n var o = _([1, 2, 3, 4]).chain();\n assert.deepEqual(o.filter(function(i) { return i < 3; }).value(), [1, 2]);\n assert.deepEqual(o.filter(function(i) { return i > 2; }).value(), [3, 4]);\n });\n\n QUnit.test('#1562: Engine proxies for chained functions', function(assert) {\n var wrapped = _(512);\n assert.strictEqual(wrapped.toJSON(), 512);\n assert.strictEqual(wrapped.valueOf(), 512);\n assert.strictEqual(+wrapped, 512);\n assert.strictEqual(wrapped.toString(), '512');\n assert.strictEqual('' + wrapped, '512');\n });\n\n QUnit.test('wrapper methods handle undefined and null', function(assert) {\n var w1 = _(), w2 = _(null);\n _.each([w1, w2], function(wrapped) {\n assert.equal(wrapped.extend({a: 1}), void 0);\n assert.equal(wrapped.first(), void 0);\n assert.equal(wrapped.push(1), void 0);\n assert.equal(wrapped.concat([1]), void 0);\n });\n });\n\n}());\n" }, { "path": "test/collections.js", "content": "(function() {\n var _ = typeof require == 'function' ? require('..') : window._;\n\n QUnit.module('Collections');\n\n QUnit.test('each', function(assert) {\n _.each([1, 2, 3], function(num, i) {\n assert.strictEqual(num, i + 1, 'each iterators provide value and iteration count');\n });\n\n var answers = [];\n _.each([1, 2, 3], function(num){ answers.push(num * this.multiplier); }, {multiplier: 5});\n assert.deepEqual(answers, [5, 10, 15], 'context object property accessed');\n\n answers = [];\n _.each([1, 2, 3], function(num){ answers.push(num); });\n assert.deepEqual(answers, [1, 2, 3], 'can iterate a simple array');\n\n answers = [];\n var obj = {one: 1, two: 2, three: 3};\n obj.constructor.prototype.four = 4;\n _.each(obj, function(value, key){ answers.push(key); });\n assert.deepEqual(answers, ['one', 'two', 'three'], 'iterating over objects works, and ignores the object prototype.');\n delete obj.constructor.prototype.four;\n\n // ensure the each function is JITed\n _(1000).times(function() { _.each([], function(){}); });\n var count = 0;\n obj = {1: 'foo', 2: 'bar', 3: 'baz'};\n _.each(obj, function(){ count++; });\n assert.strictEqual(count, 3, 'the fun should be called only 3 times');\n\n var answer = null;\n _.each([1, 2, 3], function(num, index, arr){ if (_.include(arr, num)) answer = true; });\n assert.ok(answer, 'can reference the original collection from inside the iterator');\n\n answers = 0;\n _.each(null, function(){ ++answers; });\n assert.strictEqual(answers, 0, 'handles a null properly');\n\n _.each(false, function(){});\n\n var a = [1, 2, 3];\n assert.strictEqual(_.each(a, function(){}), a);\n assert.strictEqual(_.each(null, function(){}), null);\n });\n\n QUnit.test('forEach', function(assert) {\n assert.strictEqual(_.forEach, _.each, 'is an alias for each');\n });\n\n QUnit.test('lookupIterator with contexts', function(assert) {\n _.each([true, false, 'yes', '', 0, 1, {}], function(context) {\n _.each([1], function() {\n assert.strictEqual(typeof this, 'object', 'context is a wrapped primitive');\n assert.strictEqual(this.valueOf(), context, 'the unwrapped context is the specified primitive');\n assert.equal(this, context, 'context can be coerced to the specified primitive');\n }, context);\n });\n });\n\n QUnit.test('Iterating objects with sketchy length properties', function(assert) {\n var functions = [\n 'each', 'map', 'filter', 'find',\n 'some', 'every', 'max', 'min',\n 'groupBy', 'countBy', 'partition', 'indexBy'\n ];\n var reducers = ['reduce', 'reduceRight'];\n\n var tricks = [\n {length: '5'},\n {length: {valueOf: _.constant(5)}},\n {length: Math.pow(2, 53) + 1},\n {length: Math.pow(2, 53)},\n {length: null},\n {length: -2},\n {length: new Number(15)}\n ];\n\n assert.expect(tricks.length * (functions.length + reducers.length + 4));\n\n _.each(tricks, function(trick) {\n var length = trick.length;\n assert.strictEqual(_.size(trick), 1, 'size on obj with length: ' + length);\n assert.deepEqual(_.toArray(trick), [length], 'toArray on obj with length: ' + length);\n assert.deepEqual(_.shuffle(trick), [length], 'shuffle on obj with length: ' + length);\n assert.deepEqual(_.sample(trick), length, 'sample on obj with length: ' + length);\n\n\n _.each(functions, function(method) {\n _[method](trick, function(val, key) {\n assert.strictEqual(key, 'length', method + ': ran with length = ' + val);\n });\n });\n\n _.each(reducers, function(method) {\n assert.strictEqual(_[method](trick), trick.length, method);\n });\n });\n });\n\n QUnit.test('Resistant to collection length and properties changing while iterating', function(assert) {\n\n var collection = [\n 'each', 'map', 'filter', 'find',\n 'some', 'every', 'max', 'min', 'reject',\n 'groupBy', 'countBy', 'partition', 'indexBy',\n 'reduce', 'reduceRight'\n ];\n var array = [\n 'findIndex', 'findLastIndex'\n ];\n var object = [\n 'mapObject', 'findKey', 'pick', 'omit'\n ];\n\n _.each(collection.concat(array), function(method) {\n var sparseArray = [1, 2, 3];\n sparseArray.length = 100;\n var answers = 0;\n _[method](sparseArray, function(){\n ++answers;\n return method === 'every' ? true : null;\n }, {});\n assert.strictEqual(answers, 100, method + ' enumerates [0, length)');\n\n var growingCollection = [1, 2, 3], count = 0;\n _[method](growingCollection, function() {\n if (count < 10) growingCollection.push(count++);\n return method === 'every' ? true : null;\n }, {});\n assert.strictEqual(count, 3, method + ' is resistant to length changes');\n });\n\n _.each(collection.concat(object), function(method) {\n var changingObject = {0: 0, 1: 1}, count = 0;\n _[method](changingObject, function(val) {\n if (count < 10) changingObject[++count] = val + 1;\n return method === 'every' ? true : null;\n }, {});\n\n assert.strictEqual(count, 2, method + ' is resistant to property changes');\n });\n });\n\n QUnit.test('map', function(assert) {\n var doubled = _.map([1, 2, 3], function(num){ return num * 2; });\n assert.deepEqual(doubled, [2, 4, 6], 'doubled numbers');\n\n var tripled = _.map([1, 2, 3], function(num){ return num * this.multiplier; }, {multiplier: 3});\n assert.deepEqual(tripled, [3, 6, 9], 'tripled numbers with context');\n\n doubled = _([1, 2, 3]).map(function(num){ return num * 2; });\n assert.deepEqual(doubled, [2, 4, 6], 'OO-style doubled numbers');\n\n var ids = _.map({length: 2, 0: {id: '1'}, 1: {id: '2'}}, function(n){\n return n.id;\n });\n assert.deepEqual(ids, ['1', '2'], 'Can use collection methods on Array-likes.');\n\n assert.deepEqual(_.map(null, _.noop), [], 'handles a null properly');\n\n assert.deepEqual(_.map([1], function() {\n return this.length;\n }, [5]), [1], 'called with context');\n\n // Passing a property name like _.pluck.\n var people = [{name: 'moe', age: 30}, {name: 'curly', age: 50}];\n assert.deepEqual(_.map(people, 'name'), ['moe', 'curly'], 'predicate string map to object properties');\n });\n\n QUnit.test('collect', function(assert) {\n assert.strictEqual(_.collect, _.map, 'is an alias for map');\n });\n\n QUnit.test('reduce', function(assert) {\n var sum = _.reduce([1, 2, 3], function(memo, num){ return memo + num; }, 0);\n assert.strictEqual(sum, 6, 'can sum up an array');\n\n var context = {multiplier: 3};\n sum = _.reduce([1, 2, 3], function(memo, num){ return memo + num * this.multiplier; }, 0, context);\n assert.strictEqual(sum, 18, 'can reduce with a context object');\n\n sum = _([1, 2, 3]).reduce(function(memo, num){ return memo + num; }, 0);\n assert.strictEqual(sum, 6, 'OO-style reduce');\n\n sum = _.reduce([1, 2, 3], function(memo, num){ return memo + num; });\n assert.strictEqual(sum, 6, 'default initial value');\n\n var prod = _.reduce([1, 2, 3, 4], function(memo, num){ return memo * num; });\n assert.strictEqual(prod, 24, 'can reduce via multiplication');\n\n assert.strictEqual(_.reduce(null, _.noop, 138), 138, 'handles a null (with initial value) properly');\n assert.strictEqual(_.reduce([], _.noop, void 0), void 0, 'undefined can be passed as a special case');\n assert.strictEqual(_.reduce([_], _.noop), _, 'collection of length one with no initial value returns the first item');\n assert.strictEqual(_.reduce([], _.noop), void 0, 'returns undefined when collection is empty and no initial value');\n });\n\n QUnit.test('foldl', function(assert) {\n assert.strictEqual(_.foldl, _.reduce, 'is an alias for reduce');\n });\n\n QUnit.test('inject', function(assert) {\n assert.strictEqual(_.inject, _.reduce, 'is an alias for reduce');\n });\n\n QUnit.test('reduceRight', function(assert) {\n var list = _.reduceRight(['foo', 'bar', 'baz'], function(memo, str){ return memo + str; }, '');\n assert.strictEqual(list, 'bazbarfoo', 'can perform right folds');\n\n list = _.reduceRight(['foo', 'bar', 'baz'], function(memo, str){ return memo + str; });\n assert.strictEqual(list, 'bazbarfoo', 'default initial value');\n\n var sum = _.reduceRight({a: 1, b: 2, c: 3}, function(memo, num){ return memo + num; });\n assert.strictEqual(sum, 6, 'default initial value on object');\n\n assert.strictEqual(_.reduceRight(null, _.noop, 138), 138, 'handles a null (with initial value) properly');\n assert.strictEqual(_.reduceRight([_], _.noop), _, 'collection of length one with no initial value returns the first item');\n\n assert.strictEqual(_.reduceRight([], _.noop, void 0), void 0, 'undefined can be passed as a special case');\n assert.strictEqual(_.reduceRight([], _.noop), void 0, 'returns undefined when collection is empty and no initial value');\n\n // Assert that the correct arguments are being passed.\n\n var args,\n init = {},\n object = {a: 1, b: 2},\n lastKey = _.keys(object).pop();\n\n var expected = lastKey === 'a'\n ? [init, 1, 'a', object]\n : [init, 2, 'b', object];\n\n _.reduceRight(object, function() {\n if (!args) args = _.toArray(arguments);\n }, init);\n\n assert.deepEqual(args, expected);\n\n // And again, with numeric keys.\n\n object = {2: 'a', 1: 'b'};\n lastKey = _.keys(object).pop();\n args = null;\n\n expected = lastKey === '2'\n ? [init, 'a', '2', object]\n : [init, 'b', '1', object];\n\n _.reduceRight(object, function() {\n if (!args) args = _.toArray(arguments);\n }, init);\n\n assert.deepEqual(args, expected);\n });\n\n QUnit.test('foldr', function(assert) {\n assert.strictEqual(_.foldr, _.reduceRight, 'is an alias for reduceRight');\n });\n\n QUnit.test('find', function(assert) {\n var array = [1, 2, 3, 4];\n assert.strictEqual(_.find(array, function(n) { return n > 2; }), 3, 'should return first found `value`');\n assert.strictEqual(_.find(array, function() { return false; }), void 0, 'should return `undefined` if `value` is not found');\n\n array.dontmatch = 55;\n assert.strictEqual(_.find(array, function(x) { return x === 55; }), void 0, 'iterates array-likes correctly');\n\n // Matching an object like _.findWhere.\n var list = [{a: 1, b: 2}, {a: 2, b: 2}, {a: 1, b: 3}, {a: 1, b: 4}, {a: 2, b: 4}];\n assert.deepEqual(_.find(list, {a: 1}), {a: 1, b: 2}, 'can be used as findWhere');\n assert.deepEqual(_.find(list, {b: 4}), {a: 1, b: 4});\n assert.ok(!_.find(list, {c: 1}), 'undefined when not found');\n assert.ok(!_.find([], {c: 1}), 'undefined when searching empty list');\n\n var result = _.find([1, 2, 3], function(num){ return num * 2 === 4; });\n assert.strictEqual(result, 2, 'found the first \"2\" and broke the loop');\n\n var obj = {\n a: {x: 1, z: 3},\n b: {x: 2, z: 2},\n c: {x: 3, z: 4},\n d: {x: 4, z: 1}\n };\n\n assert.deepEqual(_.find(obj, {x: 2}), {x: 2, z: 2}, 'works on objects');\n assert.deepEqual(_.find(obj, {x: 2, z: 1}), void 0);\n assert.deepEqual(_.find(obj, function(x) {\n return x.x === 4;\n }), {x: 4, z: 1});\n\n _.findIndex([{a: 1}], function(a, key, o) {\n assert.strictEqual(key, 0);\n assert.deepEqual(o, [{a: 1}]);\n assert.strictEqual(this, _, 'called with context');\n }, _);\n });\n\n QUnit.test('detect', function(assert) {\n assert.strictEqual(_.detect, _.find, 'is an alias for find');\n });\n\n QUnit.test('filter', function(assert) {\n var evenArray = [1, 2, 3, 4, 5, 6];\n var evenObject = {one: 1, two: 2, three: 3};\n var isEven = function(num){ return num % 2 === 0; };\n\n assert.deepEqual(_.filter(evenArray, isEven), [2, 4, 6]);\n assert.deepEqual(_.filter(evenObject, isEven), [2], 'can filter objects');\n assert.deepEqual(_.filter([{}, evenObject, []], 'two'), [evenObject], 'predicate string map to object properties');\n\n _.filter([1], function() {\n assert.strictEqual(this, evenObject, 'given context');\n }, evenObject);\n\n // Can be used like _.where.\n var list = [{a: 1, b: 2}, {a: 2, b: 2}, {a: 1, b: 3}, {a: 1, b: 4}];\n assert.deepEqual(_.filter(list, {a: 1}), [{a: 1, b: 2}, {a: 1, b: 3}, {a: 1, b: 4}]);\n assert.deepEqual(_.filter(list, {b: 2}), [{a: 1, b: 2}, {a: 2, b: 2}]);\n assert.deepEqual(_.filter(list, {}), list, 'Empty object accepts all items');\n assert.deepEqual(_(list).filter({}), list, 'OO-filter');\n });\n\n QUnit.test('select', function(assert) {\n assert.strictEqual(_.select, _.filter, 'is an alias for filter');\n });\n\n QUnit.test('reject', function(assert) {\n var odds = _.reject([1, 2, 3, 4, 5, 6], function(num){ return num % 2 === 0; });\n assert.deepEqual(odds, [1, 3, 5], 'rejected each even number');\n\n var context = 'obj';\n\n var evens = _.reject([1, 2, 3, 4, 5, 6], function(num){\n assert.strictEqual(context, 'obj');\n return num % 2 !== 0;\n }, context);\n assert.deepEqual(evens, [2, 4, 6], 'rejected each odd number');\n\n assert.deepEqual(_.reject([odds, {one: 1, two: 2, three: 3}], 'two'), [odds], 'predicate string map to object properties');\n\n // Can be used like _.where.\n var list = [{a: 1, b: 2}, {a: 2, b: 2}, {a: 1, b: 3}, {a: 1, b: 4}];\n assert.deepEqual(_.reject(list, {a: 1}), [{a: 2, b: 2}]);\n assert.deepEqual(_.reject(list, {b: 2}), [{a: 1, b: 3}, {a: 1, b: 4}]);\n assert.deepEqual(_.reject(list, {}), [], 'Returns empty list given empty object');\n });\n\n QUnit.test('every', function(assert) {\n assert.ok(_.every([], _.identity), 'the empty set');\n assert.ok(_.every([true, true, true], _.identity), 'every true values');\n assert.ok(!_.every([true, false, true], _.identity), 'one false value');\n assert.ok(_.every([0, 10, 28], function(num){ return num % 2 === 0; }), 'even numbers');\n assert.ok(!_.every([0, 11, 28], function(num){ return num % 2 === 0; }), 'an odd number');\n assert.strictEqual(_.every([1], _.identity), true, 'cast to boolean - true');\n assert.strictEqual(_.every([0], _.identity), false, 'cast to boolean - false');\n assert.ok(!_.every([void 0, void 0, void 0], _.identity), 'works with arrays of undefined');\n\n var list = [{a: 1, b: 2}, {a: 2, b: 2}, {a: 1, b: 3}, {a: 1, b: 4}];\n assert.ok(!_.every(list, {a: 1, b: 2}), 'Can be called with object');\n assert.ok(_.every(list, 'a'), 'String mapped to object property');\n\n list = [{a: 1, b: 2}, {a: 2, b: 2, c: true}];\n assert.ok(_.every(list, {b: 2}), 'Can be called with object');\n assert.ok(!_.every(list, 'c'), 'String mapped to object property');\n\n assert.ok(_.every({a: 1, b: 2, c: 3, d: 4}, _.isNumber), 'takes objects');\n assert.ok(!_.every({a: 1, b: 2, c: 3, d: 4}, _.isObject), 'takes objects');\n assert.ok(_.every(['a', 'b', 'c', 'd'], _.hasOwnProperty, {a: 1, b: 2, c: 3, d: 4}), 'context works');\n assert.ok(!_.every(['a', 'b', 'c', 'd', 'f'], _.hasOwnProperty, {a: 1, b: 2, c: 3, d: 4}), 'context works');\n });\n\n QUnit.test('all', function(assert) {\n assert.strictEqual(_.all, _.every, 'is an alias for every');\n });\n\n QUnit.test('some', function(assert) {\n assert.ok(!_.some([]), 'the empty set');\n assert.ok(!_.some([false, false, false]), 'all false values');\n assert.ok(_.some([false, false, true]), 'one true value');\n assert.ok(_.some([null, 0, 'yes', false]), 'a string');\n assert.ok(!_.some([null, 0, '', false]), 'falsy values');\n assert.ok(!_.some([1, 11, 29], function(num){ return num % 2 === 0; }), 'all odd numbers');\n assert.ok(_.some([1, 10, 29], function(num){ return num % 2 === 0; }), 'an even number');\n assert.strictEqual(_.some([1], _.identity), true, 'cast to boolean - true');\n assert.strictEqual(_.some([0], _.identity), false, 'cast to boolean - false');\n assert.ok(_.some([false, false, true]));\n\n var list = [{a: 1, b: 2}, {a: 2, b: 2}, {a: 1, b: 3}, {a: 1, b: 4}];\n assert.ok(!_.some(list, {a: 5, b: 2}), 'Can be called with object');\n assert.ok(_.some(list, 'a'), 'String mapped to object property');\n\n list = [{a: 1, b: 2}, {a: 2, b: 2, c: true}];\n assert.ok(_.some(list, {b: 2}), 'Can be called with object');\n assert.ok(!_.some(list, 'd'), 'String mapped to object property');\n\n assert.ok(_.some({a: '1', b: '2', c: '3', d: '4', e: 6}, _.isNumber), 'takes objects');\n assert.ok(!_.some({a: 1, b: 2, c: 3, d: 4}, _.isObject), 'takes objects');\n assert.ok(_.some(['a', 'b', 'c', 'd'], _.hasOwnProperty, {a: 1, b: 2, c: 3, d: 4}), 'context works');\n assert.ok(!_.some(['x', 'y', 'z'], _.hasOwnProperty, {a: 1, b: 2, c: 3, d: 4}), 'context works');\n });\n\n QUnit.test('any', function(assert) {\n assert.strictEqual(_.any, _.some, 'is an alias for some');\n });\n\n QUnit.test('includes', function(assert) {\n _.each([null, void 0, 0, 1, NaN, {}, []], function(val) {\n assert.strictEqual(_.includes(val, 'hasOwnProperty'), false);\n });\n assert.strictEqual(_.includes([1, 2, 3], 2), true, 'two is in the array');\n assert.ok(!_.includes([1, 3, 9], 2), 'two is not in the array');\n\n assert.strictEqual(_.includes([5, 4, 3, 2, 1], 5, true), true, 'doesn\\'t delegate to binary search');\n\n assert.strictEqual(_.includes({moe: 1, larry: 3, curly: 9}, 3), true, '_.includes on objects checks their values');\n assert.ok(_([1, 2, 3]).includes(2), 'OO-style includes');\n\n var numbers = [1, 2, 3, 1, 2, 3, 1, 2, 3];\n assert.strictEqual(_.includes(numbers, 1, 1), true, 'takes a fromIndex');\n assert.strictEqual(_.includes(numbers, 1, -1), false, 'takes a fromIndex');\n assert.strictEqual(_.includes(numbers, 1, -2), false, 'takes a fromIndex');\n assert.strictEqual(_.includes(numbers, 1, -3), true, 'takes a fromIndex');\n assert.strictEqual(_.includes(numbers, 1, 6), true, 'takes a fromIndex');\n assert.strictEqual(_.includes(numbers, 1, 7), false, 'takes a fromIndex');\n\n assert.ok(_.every([1, 2, 3], _.partial(_.includes, numbers)), 'fromIndex is guarded');\n });\n\n QUnit.test('include', function(assert) {\n assert.strictEqual(_.include, _.includes, 'is an alias for includes');\n });\n\n QUnit.test('contains', function(assert) {\n assert.strictEqual(_.contains, _.includes, 'is an alias for includes');\n\n });\n\n QUnit.test('includes with NaN', function(assert) {\n assert.strictEqual(_.includes([1, 2, NaN, NaN], NaN), true, 'Expected [1, 2, NaN] to contain NaN');\n assert.strictEqual(_.includes([1, 2, Infinity], NaN), false, 'Expected [1, 2, Infinity] to NOT contain NaN');\n });\n\n QUnit.test('includes with +- 0', function(assert) {\n _.each([-0, +0], function(val) {\n assert.strictEqual(_.includes([1, 2, val, val], val), true);\n assert.strictEqual(_.includes([1, 2, val, val], -val), true);\n assert.strictEqual(_.includes([-1, 1, 2], -val), false);\n });\n });\n\n\n QUnit.test('invoke', function(assert) {\n assert.expect(13);\n var list = [[5, 1, 7], [3, 2, 1]];\n var result = _.invoke(list, 'sort');\n assert.deepEqual(result[0], [1, 5, 7], 'first array sorted');\n assert.deepEqual(result[1], [1, 2, 3], 'second array sorted');\n\n _.invoke([{\n method: function() {\n assert.deepEqual(_.toArray(arguments), [1, 2, 3], 'called with arguments');\n }\n }], 'method', 1, 2, 3);\n\n assert.deepEqual(_.invoke([{a: null}, {}, {a: _.constant(1)}], 'a'), [null, void 0, 1], 'handles null & undefined');\n\n assert.raises(function() {\n _.invoke([{a: 1}], 'a');\n }, TypeError, 'throws for non-functions');\n\n var getFoo = _.constant('foo');\n var getThis = function() { return this; };\n var item = {\n a: {\n b: getFoo,\n c: getThis,\n d: null\n },\n e: getFoo,\n f: getThis,\n g: function() {\n return {\n h: getFoo\n };\n }\n };\n var arr = [item];\n assert.deepEqual(_.invoke(arr, ['a', 'b']), ['foo'], 'supports deep method access via an array syntax');\n assert.deepEqual(_.invoke(arr, ['a', 'c']), [item.a], 'executes deep methods on their direct parent');\n assert.deepEqual(_.invoke(arr, ['a', 'd', 'z']), [void 0], 'does not try to access attributes of non-objects');\n assert.deepEqual(_.invoke(arr, ['a', 'd']), [null], 'handles deep null values');\n assert.deepEqual(_.invoke(arr, ['e']), ['foo'], 'handles path arrays of length one');\n assert.deepEqual(_.invoke(arr, ['f']), [item], 'correct uses parent context with shallow array syntax');\n assert.deepEqual(_.invoke(arr, ['g', 'h']), [void 0], 'does not execute intermediate functions');\n\n arr = [{\n a: function() { return 'foo'; }\n }, {\n a: function() { return 'bar'; }\n }];\n assert.deepEqual(_.invoke(arr, 'a'), ['foo', 'bar'], 'can handle different methods on subsequent objects');\n });\n\n QUnit.test('invoke w/ function reference', function(assert) {\n var list = [[5, 1, 7], [3, 2, 1]];\n var result = _.invoke(list, Array.prototype.sort);\n assert.deepEqual(result[0], [1, 5, 7], 'first array sorted');\n assert.deepEqual(result[1], [1, 2, 3], 'second array sorted');\n\n assert.deepEqual(_.invoke([1, 2, 3], function(a) {\n return a + this;\n }, 5), [6, 7, 8], 'receives params from invoke');\n });\n\n // Relevant when using ClojureScript\n QUnit.test('invoke when strings have a call method', function(assert) {\n String.prototype.call = function() {\n return 42;\n };\n var list = [[5, 1, 7], [3, 2, 1]];\n var s = 'foo';\n assert.strictEqual(s.call(), 42, 'call function exists');\n var result = _.invoke(list, 'sort');\n assert.deepEqual(result[0], [1, 5, 7], 'first array sorted');\n assert.deepEqual(result[1], [1, 2, 3], 'second array sorted');\n delete String.prototype.call;\n assert.strictEqual(s.call, void 0, 'call function removed');\n });\n\n QUnit.test('pluck', function(assert) {\n var people = [{name: 'moe', age: 30}, {name: 'curly', age: 50}];\n assert.deepEqual(_.pluck(people, 'name'), ['moe', 'curly'], 'pulls names out of objects');\n assert.deepEqual(_.pluck(people, 'address'), [void 0, void 0], 'missing properties are returned as undefined');\n //compat: most flexible handling of edge cases\n assert.deepEqual(_.pluck([{'[object Object]': 1}], {}), [1]);\n });\n\n QUnit.test('where', function(assert) {\n var list = [{a: 1, b: 2}, {a: 2, b: 2}, {a: 1, b: 3}, {a: 1, b: 4}];\n var result = _.where(list, {a: 1});\n assert.strictEqual(result.length, 3);\n assert.strictEqual(result[result.length - 1].b, 4);\n result = _.where(list, {b: 2});\n assert.strictEqual(result.length, 2);\n assert.strictEqual(result[0].a, 1);\n result = _.where(list, {});\n assert.strictEqual(result.length, list.length);\n\n function test() {}\n test.map = _.map;\n assert.deepEqual(_.where([_, {a: 1, b: 2}, _], test), [_, _], 'checks properties given function');\n });\n\n QUnit.test('findWhere', function(assert) {\n var list = [{a: 1, b: 2}, {a: 2, b: 2}, {a: 1, b: 3}, {a: 1, b: 4}, {a: 2, b: 4}];\n var result = _.findWhere(list, {a: 1});\n assert.deepEqual(result, {a: 1, b: 2});\n result = _.findWhere(list, {b: 4});\n assert.deepEqual(result, {a: 1, b: 4});\n\n result = _.findWhere(list, {c: 1});\n assert.ok(_.isUndefined(result), 'undefined when not found');\n\n result = _.findWhere([], {c: 1});\n assert.ok(_.isUndefined(result), 'undefined when searching empty list');\n\n function test() {}\n test.map = _.map;\n assert.strictEqual(_.findWhere([_, {a: 1, b: 2}, _], test), _, 'checks properties given function');\n\n function TestClass() {\n this.y = 5;\n this.x = 'foo';\n }\n var expect = {c: 1, x: 'foo', y: 5};\n assert.deepEqual(_.findWhere([{y: 5, b: 6}, expect], new TestClass()), expect, 'uses class instance properties');\n });\n\n QUnit.test('max', function(assert) {\n assert.strictEqual(_.max(null), -Infinity, 'can handle null/undefined');\n assert.strictEqual(_.max(void 0), -Infinity, 'can handle null/undefined');\n assert.strictEqual(_.max(null, _.identity), -Infinity, 'can handle null/undefined');\n\n assert.strictEqual(_.max([1, 2, 3]), 3, 'can perform a regular Math.max');\n\n var neg = _.max([1, 2, 3], function(num){ return -num; });\n assert.strictEqual(neg, 1, 'can perform a computation-based max');\n\n assert.strictEqual(_.max({}), -Infinity, 'Maximum value of an empty object');\n assert.strictEqual(_.max([]), -Infinity, 'Maximum value of an empty array');\n assert.strictEqual(_.max({a: 'a'}), -Infinity, 'Maximum value of a non-numeric collection');\n\n assert.strictEqual(_.max(_.range(1, 300000)), 299999, 'Maximum value of a too-big array');\n\n assert.strictEqual(_.max([1, 2, 3, 'test']), 3, 'Finds correct max in array starting with num and containing a NaN');\n assert.strictEqual(_.max(['test', 1, 2, 3]), 3, 'Finds correct max in array starting with NaN');\n\n assert.strictEqual(_.max([1, 2, 3, null]), 3, 'Finds correct max in array starting with num and containing a `null`');\n assert.strictEqual(_.max([null, 1, 2, 3]), 3, 'Finds correct max in array starting with a `null`');\n\n assert.strictEqual(_.max([1, 2, 3, '']), 3, 'Finds correct max in array starting with num and containing an empty string');\n assert.strictEqual(_.max(['', 1, 2, 3]), 3, 'Finds correct max in array starting with an empty string');\n\n assert.strictEqual(_.max([1, 2, 3, false]), 3, 'Finds correct max in array starting with num and containing a false');\n assert.strictEqual(_.max([false, 1, 2, 3]), 3, 'Finds correct max in array starting with a false');\n\n assert.strictEqual(_.max([0, 1, 2, 3, 4]), 4, 'Finds correct max in array containing a zero');\n assert.strictEqual(_.max([-3, -2, -1, 0]), 0, 'Finds correct max in array containing negative numbers');\n\n assert.deepEqual(_.map([[1, 2, 3], [4, 5, 6]], _.max), [3, 6], 'Finds correct max in array when mapping through multiple arrays');\n\n var a = {x: -Infinity};\n var b = {x: -Infinity};\n var iterator = function(o){ return o.x; };\n assert.strictEqual(_.max([a, b], iterator), a, 'Respects iterator return value of -Infinity');\n\n assert.deepEqual(_.max([{a: 1}, {a: 0, b: 3}, {a: 4}, {a: 2}], 'a'), {a: 4}, 'String keys use property iterator');\n\n assert.deepEqual(_.max([0, 2], function(c){ return c * this.x; }, {x: 1}), 2, 'Iterator context');\n assert.deepEqual(_.max([[1], [2, 3], [-1, 4], [5]], 0), [5], 'Lookup falsy iterator');\n assert.deepEqual(_.max([{0: 1}, {0: 2}, {0: -1}, {a: 1}], 0), {0: 2}, 'Lookup falsy iterator');\n });\n\n QUnit.test('min', function(assert) {\n assert.strictEqual(_.min(null), Infinity, 'can handle null/undefined');\n assert.strictEqual(_.min(void 0), Infinity, 'can handle null/undefined');\n assert.strictEqual(_.min(null, _.identity), Infinity, 'can handle null/undefined');\n\n assert.strictEqual(_.min([1, 2, 3]), 1, 'can perform a regular Math.min');\n\n var neg = _.min([1, 2, 3], function(num){ return -num; });\n assert.strictEqual(neg, 3, 'can perform a computation-based min');\n\n assert.strictEqual(_.min({}), Infinity, 'Minimum value of an empty object');\n assert.strictEqual(_.min([]), Infinity, 'Minimum value of an empty array');\n assert.strictEqual(_.min({a: 'a'}), Infinity, 'Minimum value of a non-numeric collection');\n\n assert.deepEqual(_.map([[1, 2, 3], [4, 5, 6]], _.min), [1, 4], 'Finds correct min in array when mapping through multiple arrays');\n\n var now = new Date(9999999999);\n var then = new Date(0);\n assert.strictEqual(_.min([now, then]), then);\n\n assert.strictEqual(_.min(_.range(1, 300000)), 1, 'Minimum value of a too-big array');\n\n assert.strictEqual(_.min([1, 2, 3, 'test']), 1, 'Finds correct min in array starting with num and containing a NaN');\n assert.strictEqual(_.min(['test', 1, 2, 3]), 1, 'Finds correct min in array starting with NaN');\n\n assert.strictEqual(_.min([1, 2, 3, null]), 1, 'Finds correct min in array starting with num and containing a `null`');\n assert.strictEqual(_.min([null, 1, 2, 3]), 1, 'Finds correct min in array starting with a `null`');\n\n assert.strictEqual(_.min([0, 1, 2, 3, 4]), 0, 'Finds correct min in array containing a zero');\n assert.strictEqual(_.min([-3, -2, -1, 0]), -3, 'Finds correct min in array containing negative numbers');\n\n var a = {x: Infinity};\n var b = {x: Infinity};\n var iterator = function(o){ return o.x; };\n assert.strictEqual(_.min([a, b], iterator), a, 'Respects iterator return value of Infinity');\n\n assert.deepEqual(_.min([{a: 1}, {a: 0, b: 3}, {a: 4}, {a: 2}], 'a'), {a: 0, b: 3}, 'String keys use property iterator');\n\n assert.deepEqual(_.min([0, 2], function(c){ return c * this.x; }, {x: -1}), 2, 'Iterator context');\n assert.deepEqual(_.min([[1], [2, 3], [-1, 4], [5]], 0), [-1, 4], 'Lookup falsy iterator');\n assert.deepEqual(_.min([{0: 1}, {0: 2}, {0: -1}, {a: 1}], 0), {0: -1}, 'Lookup falsy iterator');\n });\n\n QUnit.test('sortBy', function(assert) {\n var people = [{name: 'curly', age: 50}, {name: 'moe', age: 30}];\n people = _.sortBy(people, function(person){ return person.age; });\n assert.deepEqual(_.pluck(people, 'name'), ['moe', 'curly'], 'stooges sorted by age');\n\n var list = [void 0, 4, 1, void 0, 3, 2];\n assert.deepEqual(_.sortBy(list, _.identity), [1, 2, 3, 4, void 0, void 0], 'sortBy with undefined values');\n\n list = ['one', 'two', 'three', 'four', 'five'];\n var sorted = _.sortBy(list, 'length');\n assert.deepEqual(sorted, ['one', 'two', 'four', 'five', 'three'], 'sorted by length');\n\n function Pair(x, y) {\n this.x = x;\n this.y = y;\n }\n\n var stableArray = [\n new Pair(1, 1), new Pair(1, 2),\n new Pair(1, 3), new Pair(1, 4),\n new Pair(1, 5), new Pair(1, 6),\n new Pair(2, 1), new Pair(2, 2),\n new Pair(2, 3), new Pair(2, 4),\n new Pair(2, 5), new Pair(2, 6),\n new Pair(void 0, 1), new Pair(void 0, 2),\n new Pair(void 0, 3), new Pair(void 0, 4),\n new Pair(void 0, 5), new Pair(void 0, 6)\n ];\n\n var stableObject = _.object('abcdefghijklmnopqr'.split(''), stableArray);\n\n var actual = _.sortBy(stableArray, function(pair) {\n return pair.x;\n });\n\n assert.deepEqual(actual, stableArray, 'sortBy should be stable for arrays');\n assert.deepEqual(_.sortBy(stableArray, 'x'), stableArray, 'sortBy accepts property string');\n\n actual = _.sortBy(stableObject, function(pair) {\n return pair.x;\n });\n\n assert.deepEqual(actual, stableArray, 'sortBy should be stable for objects');\n\n list = ['q', 'w', 'e', 'r', 't', 'y'];\n assert.deepEqual(_.sortBy(list), ['e', 'q', 'r', 't', 'w', 'y'], 'uses _.identity if iterator is not specified');\n });\n\n QUnit.test('groupBy', function(assert) {\n var parity = _.groupBy([1, 2, 3, 4, 5, 6], function(num){ return num % 2; });\n assert.ok('0' in parity && '1' in parity, 'created a group for each value');\n assert.deepEqual(parity[0], [2, 4, 6], 'put each even number in the right group');\n\n var list = ['one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight', 'nine', 'ten'];\n var grouped = _.groupBy(list, 'length');\n assert.deepEqual(grouped['3'], ['one', 'two', 'six', 'ten']);\n assert.deepEqual(grouped['4'], ['four', 'five', 'nine']);\n assert.deepEqual(grouped['5'], ['three', 'seven', 'eight']);\n\n var context = {};\n _.groupBy([{}], function(){ assert.strictEqual(this, context); }, context);\n\n grouped = _.groupBy([4.2, 6.1, 6.4], function(num) {\n return Math.floor(num) > 4 ? 'hasOwnProperty' : 'constructor';\n });\n assert.strictEqual(grouped.constructor.length, 1);\n assert.strictEqual(grouped.hasOwnProperty.length, 2);\n\n var array = [{}];\n _.groupBy(array, function(value, index, obj){ assert.strictEqual(obj, array); });\n\n array = [1, 2, 1, 2, 3];\n grouped = _.groupBy(array);\n assert.strictEqual(grouped['1'].length, 2);\n assert.strictEqual(grouped['3'].length, 1);\n\n var matrix = [\n [1, 2],\n [1, 3],\n [2, 3]\n ];\n assert.deepEqual(_.groupBy(matrix, 0), {1: [[1, 2], [1, 3]], 2: [[2, 3]]});\n assert.deepEqual(_.groupBy(matrix, 1), {2: [[1, 2]], 3: [[1, 3], [2, 3]]});\n\n var liz = {name: 'Liz', stats: {power: 10}};\n var chelsea = {name: 'Chelsea', stats: {power: 10}};\n var jordan = {name: 'Jordan', stats: {power: 6}};\n var collection = [liz, chelsea, jordan];\n var expected = {\n 10: [liz, chelsea],\n 6: [jordan]\n };\n assert.deepEqual(_.groupBy(collection, ['stats', 'power']), expected, 'can group by deep properties');\n\n var foos = [{foo: [1, 2]}, {foo: [1, 2]}]\n assert.deepEqual(_.groupBy(foos, 'foo'), {\"1,2\": foos}, 'will coerce arrays to string keys');\n });\n\n QUnit.test('indexBy', function(assert) {\n var parity = _.indexBy([1, 2, 3, 4, 5], function(num){ return num % 2 === 0; });\n assert.strictEqual(parity['true'], 4);\n assert.strictEqual(parity['false'], 5);\n\n var list = ['one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight', 'nine', 'ten'];\n var grouped = _.indexBy(list, 'length');\n assert.strictEqual(grouped['3'], 'ten');\n assert.strictEqual(grouped['4'], 'nine');\n assert.strictEqual(grouped['5'], 'eight');\n\n var array = [1, 2, 1, 2, 3];\n grouped = _.indexBy(array);\n assert.strictEqual(grouped['1'], 1);\n assert.strictEqual(grouped['2'], 2);\n assert.strictEqual(grouped['3'], 3);\n });\n\n QUnit.test('countBy', function(assert) {\n var parity = _.countBy([1, 2, 3, 4, 5], function(num){ return num % 2 === 0; });\n assert.strictEqual(parity['true'], 2);\n assert.strictEqual(parity['false'], 3);\n\n var list = ['one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight', 'nine', 'ten'];\n var grouped = _.countBy(list, 'length');\n assert.strictEqual(grouped['3'], 4);\n assert.strictEqual(grouped['4'], 3);\n assert.strictEqual(grouped['5'], 3);\n\n var context = {};\n _.countBy([{}], function(){ assert.strictEqual(this, context); }, context);\n\n grouped = _.countBy([4.2, 6.1, 6.4], function(num) {\n return Math.floor(num) > 4 ? 'hasOwnProperty' : 'constructor';\n });\n assert.strictEqual(grouped.constructor, 1);\n assert.strictEqual(grouped.hasOwnProperty, 2);\n\n var array = [{}];\n _.countBy(array, function(value, index, obj){ assert.strictEqual(obj, array); });\n\n array = [1, 2, 1, 2, 3];\n grouped = _.countBy(array);\n assert.strictEqual(grouped['1'], 2);\n assert.strictEqual(grouped['3'], 1);\n\n var foos = [{foo: [1, 2]}, {foo: [1, 2]}]\n assert.deepEqual(_.countBy(foos, 'foo'), {'1,2': 2}, 'will coerce arrays to string keys');\n });\n\n QUnit.test('shuffle', function(assert) {\n assert.deepEqual(_.shuffle([1]), [1], 'behaves correctly on size 1 arrays');\n var numbers = _.range(20);\n var shuffled = _.shuffle(numbers);\n assert.notDeepEqual(numbers, shuffled, 'does change the order'); // Chance of false negative: 1 in ~2.4*10^18\n assert.notStrictEqual(numbers, shuffled, 'original object is unmodified');\n assert.deepEqual(numbers, _.sortBy(shuffled), 'contains the same members before and after shuffle');\n\n shuffled = _.shuffle({a: 1, b: 2, c: 3, d: 4});\n assert.strictEqual(shuffled.length, 4);\n assert.deepEqual(shuffled.sort(), [1, 2, 3, 4], 'works on objects');\n });\n\n QUnit.test('sample', function(assert) {\n assert.strictEqual(_.sample([1]), 1, 'behaves correctly when no second parameter is given');\n assert.deepEqual(_.sample([1, 2, 3], -2), [], 'behaves correctly on negative n');\n var numbers = _.range(10);\n var allSampled = _.sample(numbers, 10).sort();\n assert.deepEqual(allSampled, numbers, 'contains the same members before and after sample');\n allSampled = _.sample(numbers, 20).sort();\n assert.deepEqual(allSampled, numbers, 'also works when sampling more objects than are present');\n assert.ok(_.contains(numbers, _.sample(numbers)), 'sampling a single element returns something from the array');\n assert.strictEqual(_.sample([]), void 0, 'sampling empty array with no number returns undefined');\n assert.notStrictEqual(_.sample([], 5), [], 'sampling empty array with a number returns an empty array');\n assert.notStrictEqual(_.sample([1, 2, 3], 0), [], 'sampling an array with 0 picks returns an empty array');\n assert.deepEqual(_.sample([1, 2], -1), [], 'sampling a negative number of picks returns an empty array');\n assert.ok(_.contains([1, 2, 3], _.sample({a: 1, b: 2, c: 3})), 'sample one value from an object');\n var partialSample = _.sample(_.range(1000), 10);\n var partialSampleSorted = partialSample.sort();\n assert.notDeepEqual(partialSampleSorted, _.range(10), 'samples from the whole array, not just the beginning');\n // The next few lines (up to END) are a regression test for #2927.\n var alphabet = 'abcdefghijklmnopqrstuvwxyz';\n var prefixLength = 5;\n var prefix = _.toArray(alphabet.slice(0, prefixLength));\n // We're going to take three random samples from the alphabet and count how\n // many of them are exact prefixes of the alphabet ('abcde').\n var verbatimPrefixes = 0;\n _.times(3, function() {\n var sample = _.toArray(_.sample(alphabet, prefixLength));\n if (_.isEqual(sample, prefix)) ++verbatimPrefixes;\n });\n // The probability of a sample of length N being a prefix is 1/(A!/(A-N)!),\n // with A being the length of the alphabet. That amounts to roughly 1 in\n // 7.9e6 when N=5 and A=26. Most of the time, therefore, we should find that\n // verbatimPrefixes=0. We will however accept the occasional hit. Only when\n // it happens twice, does it start to look really suspicious; the\n // probability of this happening is roughly 1 in 21e12. If you are lucky\n // enough to witness this, you should be fine when you run the test again.\n // However, if you can reliably make the test fail again, you can be sure\n // that the code is not working as intended.\n assert.ok(verbatimPrefixes < 2, 'sampling a string should not just return a prefix');\n // END of regression test for #2927.\n });\n\n QUnit.test('toArray', function(assert) {\n assert.ok(!_.isArray(arguments), 'arguments object is not an array');\n assert.ok(_.isArray(_.toArray(arguments)), 'arguments object converted into array');\n var a = [1, 2, 3];\n assert.notStrictEqual(_.toArray(a), a, 'array is cloned');\n assert.deepEqual(_.toArray(a), [1, 2, 3], 'cloned array contains same elements');\n\n var numbers = _.toArray({one: 1, two: 2, three: 3});\n assert.deepEqual(numbers, [1, 2, 3], 'object flattened into array');\n\n var hearts = '\\uD83D\\uDC95';\n var pair = hearts.split('');\n var expected = [pair[0], hearts, '&', hearts, pair[1]];\n assert.deepEqual(_.toArray(expected.join('')), expected, 'maintains astral characters');\n assert.deepEqual(_.toArray(''), [], 'empty string into empty array');\n\n if (typeof document != 'undefined') {\n // test in IE < 9\n var actual;\n try {\n actual = _.toArray(document.childNodes);\n } catch (e) { /* ignored */ }\n assert.deepEqual(actual, _.map(document.childNodes, _.identity), 'works on NodeList');\n }\n });\n\n QUnit.test('size', function(assert) {\n assert.strictEqual(_.size({one: 1, two: 2, three: 3}), 3, 'can compute the size of an object');\n assert.strictEqual(_.size([1, 2, 3]), 3, 'can compute the size of an array');\n assert.strictEqual(_.size({length: 3, 0: 0, 1: 0, 2: 0}), 3, 'can compute the size of Array-likes');\n\n var func = function() {\n return _.size(arguments);\n };\n\n assert.strictEqual(func(1, 2, 3, 4), 4, 'can test the size of the arguments object');\n\n assert.strictEqual(_.size('hello'), 5, 'can compute the size of a string literal');\n assert.strictEqual(_.size(new String('hello')), 5, 'can compute the size of string object');\n\n assert.strictEqual(_.size(null), 0, 'handles nulls');\n assert.strictEqual(_.size(0), 0, 'handles numbers');\n });\n\n QUnit.test('partition', function(assert) {\n var list = [0, 1, 2, 3, 4, 5];\n assert.deepEqual(_.partition(list, function(x) { return x < 4; }), [[0, 1, 2, 3], [4, 5]], 'handles bool return values');\n assert.deepEqual(_.partition(list, function(x) { return x & 1; }), [[1, 3, 5], [0, 2, 4]], 'handles 0 and 1 return values');\n assert.deepEqual(_.partition(list, function(x) { return x - 3; }), [[0, 1, 2, 4, 5], [3]], 'handles other numeric return values');\n assert.deepEqual(_.partition(list, function(x) { return x > 1 ? null : true; }), [[0, 1], [2, 3, 4, 5]], 'handles null return values');\n assert.deepEqual(_.partition(list, function(x) { if (x < 2) return true; }), [[0, 1], [2, 3, 4, 5]], 'handles undefined return values');\n assert.deepEqual(_.partition({a: 1, b: 2, c: 3}, function(x) { return x > 1; }), [[2, 3], [1]], 'handles objects');\n\n assert.deepEqual(_.partition(list, function(x, index) { return index % 2; }), [[1, 3, 5], [0, 2, 4]], 'can reference the array index');\n assert.deepEqual(_.partition(list, function(x, index, arr) { return x === arr.length - 1; }), [[5], [0, 1, 2, 3, 4]], 'can reference the collection');\n\n // Default iterator\n assert.deepEqual(_.partition([1, false, true, '']), [[1, true], [false, '']], 'Default iterator');\n assert.deepEqual(_.partition([{x: 1}, {x: 0}, {x: 1}], 'x'), [[{x: 1}, {x: 1}], [{x: 0}]], 'Takes a string');\n\n // Context\n var predicate = function(x){ return x === this.x; };\n assert.deepEqual(_.partition([1, 2, 3], predicate, {x: 2}), [[2], [1, 3]], 'partition takes a context argument');\n\n assert.deepEqual(_.partition([{a: 1}, {b: 2}, {a: 1, b: 2}], {a: 1}), [[{a: 1}, {a: 1, b: 2}], [{b: 2}]], 'predicate can be object');\n\n var object = {a: 1};\n _.partition(object, function(val, key, obj) {\n assert.strictEqual(val, 1);\n assert.strictEqual(key, 'a');\n assert.strictEqual(obj, object);\n assert.strictEqual(this, predicate);\n }, predicate);\n });\n\n if (typeof document != 'undefined') {\n QUnit.test('Can use various collection methods on NodeLists', function(assert) {\n var parent = document.createElement('div');\n parent.innerHTML = 'textnode';\n\n var elementChildren = _.filter(parent.childNodes, _.isElement);\n assert.strictEqual(elementChildren.length, 2);\n\n assert.deepEqual(_.map(elementChildren, 'id'), ['id1', 'id2']);\n assert.deepEqual(_.map(parent.childNodes, 'nodeType'), [1, 3, 1]);\n\n assert.ok(!_.every(parent.childNodes, _.isElement));\n assert.ok(_.some(parent.childNodes, _.isElement));\n\n function compareNode(node) {\n return _.isElement(node) ? node.id.charAt(2) : void 0;\n }\n assert.strictEqual(_.max(parent.childNodes, compareNode), _.last(parent.childNodes));\n assert.strictEqual(_.min(parent.childNodes, compareNode), _.first(parent.childNodes));\n });\n }\n\n}());\n" }, { "path": "test/cross-document.js", "content": "(function() {\n if (typeof document == 'undefined') return;\n\n var _ = typeof require == 'function' ? require('..') : window._;\n\n QUnit.module('Cross Document');\n /* global iObject, iElement, iArguments, iFunction, iArray, iError, iString, iNumber, iBoolean, iDate, iRegExp, iNaN, iNull, iUndefined, ActiveXObject */\n\n // Setup remote variables for iFrame tests.\n var iframe = document.createElement('iframe');\n iframe.frameBorder = iframe.height = iframe.width = 0;\n document.body.appendChild(iframe);\n var iframeContent = iframe.contentDocument || iframe.contentWindow;\n var iDoc = iframeContent.document || iframeContent;\n iDoc.write(\n [\n ''\n ].join('\\n')\n );\n iDoc.close();\n\n QUnit.test('isEqual', function(assert) {\n\n assert.ok(!_.isEqual(iNumber, 101));\n assert.ok(_.isEqual(iNumber, 100));\n\n // Objects from another frame.\n assert.ok(_.isEqual({}, iObject), 'Objects with equivalent members created in different documents are equal');\n\n // Array from another frame.\n assert.ok(_.isEqual([1, 2, 3], iArray), 'Arrays with equivalent elements created in different documents are equal');\n });\n\n QUnit.test('isEmpty', function(assert) {\n assert.ok(!_([iNumber]).isEmpty(), '[1] is not empty');\n assert.ok(!_.isEmpty(iArray), '[] is empty');\n assert.ok(_.isEmpty(iObject), '{} is empty');\n });\n\n QUnit.test('isElement', function(assert) {\n assert.ok(!_.isElement('div'), 'strings are not dom elements');\n assert.ok(_.isElement(document.body), 'the body tag is a DOM element');\n assert.ok(_.isElement(iElement), 'even from another frame');\n });\n\n QUnit.test('isArguments', function(assert) {\n assert.ok(_.isArguments(iArguments), 'even from another frame');\n });\n\n QUnit.test('isObject', function(assert) {\n assert.ok(_.isObject(iElement), 'even from another frame');\n assert.ok(_.isObject(iFunction), 'even from another frame');\n });\n\n QUnit.test('isArray', function(assert) {\n assert.ok(_.isArray(iArray), 'even from another frame');\n });\n\n QUnit.test('isString', function(assert) {\n assert.ok(_.isString(iString), 'even from another frame');\n });\n\n QUnit.test('isNumber', function(assert) {\n assert.ok(_.isNumber(iNumber), 'even from another frame');\n });\n\n QUnit.test('isBoolean', function(assert) {\n assert.ok(_.isBoolean(iBoolean), 'even from another frame');\n });\n\n QUnit.test('isFunction', function(assert) {\n assert.ok(_.isFunction(iFunction), 'even from another frame');\n });\n\n QUnit.test('isDate', function(assert) {\n assert.ok(_.isDate(iDate), 'even from another frame');\n });\n\n QUnit.test('isRegExp', function(assert) {\n assert.ok(_.isRegExp(iRegExp), 'even from another frame');\n });\n\n QUnit.test('isNaN', function(assert) {\n assert.ok(_.isNaN(iNaN), 'even from another frame');\n });\n\n QUnit.test('isNull', function(assert) {\n assert.ok(_.isNull(iNull), 'even from another frame');\n });\n\n QUnit.test('isUndefined', function(assert) {\n assert.ok(_.isUndefined(iUndefined), 'even from another frame');\n });\n\n QUnit.test('isError', function(assert) {\n assert.ok(_.isError(iError), 'even from another frame');\n });\n\n if (typeof ActiveXObject != 'undefined') {\n QUnit.test('IE host objects', function(assert) {\n var xml = new ActiveXObject('Msxml2.DOMDocument.3.0');\n assert.ok(!_.isNumber(xml));\n assert.ok(!_.isBoolean(xml));\n assert.ok(!_.isNaN(xml));\n assert.ok(!_.isFunction(xml));\n assert.ok(!_.isNull(xml));\n assert.ok(!_.isUndefined(xml));\n });\n\n QUnit.test('#1621 IE 11 compat mode DOM elements are not functions', function(assert) {\n var fn = function() {};\n var xml = new ActiveXObject('Msxml2.DOMDocument.3.0');\n var div = document.createElement('div');\n\n // JIT the function\n var count = 200;\n while (count--) {\n _.isFunction(fn);\n }\n\n assert.strictEqual(_.isFunction(xml), false);\n assert.strictEqual(_.isFunction(div), false);\n assert.strictEqual(_.isFunction(fn), true);\n });\n }\n\n}());\n" }, { "path": "test/functions.js", "content": "(function() {\n var _ = typeof require == 'function' ? require('..') : window._;\n\n QUnit.module('Functions');\n QUnit.config.asyncRetries = 3;\n\n QUnit.test('bind', function(assert) {\n var context = {name: 'moe'};\n var func = function(arg) { return 'name: ' + (this.name || arg); };\n var bound = _.bind(func, context);\n assert.strictEqual(bound(), 'name: moe', 'can bind a function to a context');\n\n bound = _(func).bind(context);\n assert.strictEqual(bound(), 'name: moe', 'can do OO-style binding');\n\n bound = _.bind(func, null, 'curly');\n var result = bound();\n // Work around a PhantomJS bug when applying a function with null|undefined.\n assert.ok(result === 'name: curly' || result === 'name: ' + window.name, 'can bind without specifying a context');\n\n func = function(salutation, name) { return salutation + ': ' + name; };\n func = _.bind(func, this, 'hello');\n assert.strictEqual(func('moe'), 'hello: moe', 'the function was partially applied in advance');\n\n func = _.bind(func, this, 'curly');\n assert.strictEqual(func(), 'hello: curly', 'the function was completely applied in advance');\n\n func = function(salutation, firstname, lastname) { return salutation + ': ' + firstname + ' ' + lastname; };\n func = _.bind(func, this, 'hello', 'moe', 'curly');\n assert.strictEqual(func(), 'hello: moe curly', 'the function was partially applied in advance and can accept multiple arguments');\n\n func = function() { return this; };\n assert.strictEqual(typeof _.bind(func, 0)(), 'object', 'binding a primitive to `this` returns a wrapped primitive');\n\n assert.strictEqual(_.bind(func, 0)().valueOf(), 0, 'can bind a function to `0`');\n assert.strictEqual(_.bind(func, '')().valueOf(), '', 'can bind a function to an empty string');\n assert.strictEqual(_.bind(func, false)().valueOf(), false, 'can bind a function to `false`');\n\n // These tests are only meaningful when using a browser without a native bind function\n // To test this with a modern browser, set underscore's nativeBind to undefined\n var F = function() { return this; };\n var boundf = _.bind(F, {hello: 'moe curly'});\n var Boundf = boundf; // make eslint happy.\n var newBoundf = new Boundf();\n assert.strictEqual(newBoundf.hello, void 0, 'function should not be bound to the context, to comply with ECMAScript 5');\n assert.strictEqual(boundf().hello, 'moe curly', \"When called without the new operator, it's OK to be bound to the context\");\n assert.ok(newBoundf instanceof F, 'a bound instance is an instance of the original function');\n\n assert.raises(function() { _.bind('notafunction'); }, TypeError, 'throws an error when binding to a non-function');\n });\n\n QUnit.test('partial', function(assert) {\n var obj = {name: 'moe'};\n var func = function() { return this.name + ' ' + _.toArray(arguments).join(' '); };\n\n obj.func = _.partial(func, 'a', 'b');\n assert.strictEqual(obj.func('c', 'd'), 'moe a b c d', 'can partially apply');\n\n obj.func = _.partial(func, _, 'b', _, 'd');\n assert.strictEqual(obj.func('a', 'c'), 'moe a b c d', 'can partially apply with placeholders');\n\n func = _.partial(function() { return arguments.length; }, _, 'b', _, 'd');\n assert.strictEqual(func('a', 'c', 'e'), 5, 'accepts more arguments than the number of placeholders');\n assert.strictEqual(func('a'), 4, 'accepts fewer arguments than the number of placeholders');\n\n func = _.partial(function() { return typeof arguments[2]; }, _, 'b', _, 'd');\n assert.strictEqual(func('a'), 'undefined', 'unfilled placeholders are undefined');\n\n // passes context\n function MyWidget(name, options) {\n this.name = name;\n this.options = options;\n }\n MyWidget.prototype.get = function() {\n return this.name;\n };\n var MyWidgetWithCoolOpts = _.partial(MyWidget, _, {a: 1});\n var widget = new MyWidgetWithCoolOpts('foo');\n assert.ok(widget instanceof MyWidget, 'Can partially bind a constructor');\n assert.strictEqual(widget.get(), 'foo', 'keeps prototype');\n assert.deepEqual(widget.options, {a: 1});\n\n _.partial.placeholder = obj;\n func = _.partial(function() { return arguments.length; }, obj, 'b', obj, 'd');\n assert.strictEqual(func('a'), 4, 'allows the placeholder to be swapped out');\n\n _.partial.placeholder = {};\n func = _.partial(function() { return arguments.length; }, obj, 'b', obj, 'd');\n assert.strictEqual(func('a'), 5, 'swapping the placeholder preserves previously bound arguments');\n\n _.partial.placeholder = _;\n });\n\n QUnit.test('bindAll', function(assert) {\n var curly = {name: 'curly'};\n var moe = {\n name: 'moe',\n getName: function() { return 'name: ' + this.name; },\n sayHi: function() { return 'hi: ' + this.name; }\n };\n curly.getName = moe.getName;\n var bound = _.bindAll(moe, 'getName', 'sayHi');\n assert.strictEqual(bound, moe, 'returns the bound object');\n curly.sayHi = moe.sayHi;\n assert.strictEqual(curly.getName(), 'name: curly', 'unbound function is bound to current object');\n assert.strictEqual(curly.sayHi(), 'hi: moe', 'bound function is still bound to original object');\n\n curly = {name: 'curly'};\n moe = {\n name: 'moe',\n getName: function() { return 'name: ' + this.name; },\n sayHi: function() { return 'hi: ' + this.name; },\n sayLast: function() { return this.sayHi(_.last(arguments)); }\n };\n\n assert.raises(function() { _.bindAll(moe); }, Error, 'throws an error for bindAll with no functions named');\n assert.raises(function() { _.bindAll(moe, 'sayBye'); }, TypeError, 'throws an error for bindAll if the given key is undefined');\n assert.raises(function() { _.bindAll(moe, 'name'); }, TypeError, 'throws an error for bindAll if the given key is not a function');\n\n _.bindAll(moe, 'sayHi', 'sayLast');\n curly.sayHi = moe.sayHi;\n assert.strictEqual(curly.sayHi(), 'hi: moe');\n\n var sayLast = moe.sayLast;\n assert.strictEqual(sayLast(1, 2, 3, 4, 5, 6, 7, 'Tom'), 'hi: moe', 'createCallback works with any number of arguments');\n\n _.bindAll(moe, ['getName'], [['sayHi']]);\n var getName = moe.getName;\n var sayHi = moe.sayHi;\n assert.strictEqual(getName(), 'name: moe', 'flattens arguments into a single list');\n assert.strictEqual(sayHi(), 'hi: moe', 'deeply flattens arguments into a single list');\n });\n\n QUnit.test('memoize', function(assert) {\n var fib = function(n) {\n return n < 2 ? n : fib(n - 1) + fib(n - 2);\n };\n assert.strictEqual(fib(10), 55, 'a memoized version of fibonacci produces identical results');\n fib = _.memoize(fib); // Redefine `fib` for memoization\n assert.strictEqual(fib(10), 55, 'a memoized version of fibonacci produces identical results');\n\n var o = function(str) {\n return str;\n };\n var fastO = _.memoize(o);\n assert.strictEqual(o('toString'), 'toString', 'checks hasOwnProperty');\n assert.strictEqual(fastO('toString'), 'toString', 'checks hasOwnProperty');\n\n // Expose the cache.\n var upper = _.memoize(function(s) {\n return s.toUpperCase();\n });\n assert.strictEqual(upper('foo'), 'FOO');\n assert.strictEqual(upper('bar'), 'BAR');\n assert.deepEqual(upper.cache, {foo: 'FOO', bar: 'BAR'});\n upper.cache = {foo: 'BAR', bar: 'FOO'};\n assert.strictEqual(upper('foo'), 'BAR');\n assert.strictEqual(upper('bar'), 'FOO');\n\n var hashed = _.memoize(function(key) {\n //https://github.com/jashkenas/underscore/pull/1679#discussion_r13736209\n assert.ok(/[a-z]+/.test(key), 'hasher doesn\\'t change keys');\n return key;\n }, function(key) {\n return key.toUpperCase();\n });\n hashed('yep');\n assert.deepEqual(hashed.cache, {YEP: 'yep'}, 'takes a hasher');\n\n // Test that the hash function can be used to swizzle the key.\n var objCacher = _.memoize(function(value, key) {\n return {key: key, value: value};\n }, function(value, key) {\n return key;\n });\n var myObj = objCacher('a', 'alpha');\n var myObjAlias = objCacher('b', 'alpha');\n assert.notStrictEqual(myObj, void 0, 'object is created if second argument used as key');\n assert.strictEqual(myObj, myObjAlias, 'object is cached if second argument used as key');\n assert.strictEqual(myObj.value, 'a', 'object is not modified if second argument used as key');\n });\n\n QUnit.test('delay', function(assert) {\n assert.expect(2);\n var done = assert.async();\n var delayed = false;\n _.delay(function(){ delayed = true; }, 100);\n setTimeout(function(){ assert.ok(!delayed, \"didn't delay the function quite yet\"); }, 50);\n setTimeout(function(){ assert.ok(delayed, 'delayed the function'); done(); }, 150);\n });\n\n QUnit.test('defer', function(assert) {\n assert.expect(1);\n var done = assert.async();\n var deferred = false;\n _.defer(function(bool){ deferred = bool; }, true);\n _.delay(function(){ assert.ok(deferred, 'deferred the function'); done(); }, 50);\n });\n\n QUnit.test('throttle', function(assert) {\n assert.expect(2);\n var done = assert.async();\n var counter = 0;\n var incr = function(){ counter++; };\n var throttledIncr = _.throttle(incr, 32);\n throttledIncr(); throttledIncr();\n\n assert.strictEqual(counter, 1, 'incr was called immediately');\n _.delay(function(){ assert.strictEqual(counter, 2, 'incr was throttled'); done(); }, 64);\n });\n\n QUnit.test('throttle arguments', function(assert) {\n assert.expect(2);\n var done = assert.async();\n var value = 0;\n var update = function(val){ value = val; };\n var throttledUpdate = _.throttle(update, 32);\n throttledUpdate(1); throttledUpdate(2);\n _.delay(function(){ throttledUpdate(3); }, 64);\n assert.strictEqual(value, 1, 'updated to latest value');\n _.delay(function(){ assert.strictEqual(value, 3, 'updated to latest value'); done(); }, 104);\n });\n\n QUnit.test('throttle once', function(assert) {\n assert.expect(2);\n var done = assert.async();\n var counter = 0;\n var incr = function(){ return ++counter; };\n var throttledIncr = _.throttle(incr, 32);\n var result = throttledIncr();\n _.delay(function(){\n assert.strictEqual(result, 1, 'throttled functions return their value');\n assert.strictEqual(counter, 1, 'incr was called once'); done();\n }, 64);\n });\n\n QUnit.test('throttle twice', function(assert) {\n assert.expect(1);\n var done = assert.async();\n var counter = 0;\n var incr = function(){ counter++; };\n var throttledIncr = _.throttle(incr, 32);\n throttledIncr(); throttledIncr();\n _.delay(function(){ assert.strictEqual(counter, 2, 'incr was called twice'); done(); }, 64);\n });\n\n QUnit.test('throttle three times', function(assert) {\n assert.expect(1);\n var done = assert.async();\n var counter = 0;\n var incr = function(){ counter++; };\n var throttledIncr = _.throttle(incr, 32);\n throttledIncr(); throttledIncr(); throttledIncr();\n _.delay(function(){ assert.strictEqual(counter, 2, 'incr was called twice'); done(); }, 64);\n });\n\n QUnit.test('more throttling', function(assert) {\n assert.expect(3);\n var done = assert.async();\n var counter = 0;\n var incr = function(){ counter++; };\n var throttledIncr = _.throttle(incr, 30);\n throttledIncr(); throttledIncr();\n assert.strictEqual(counter, 1);\n _.delay(function(){\n assert.strictEqual(counter, 2);\n throttledIncr();\n assert.strictEqual(counter, 3);\n done();\n }, 85);\n });\n\n QUnit.test('throttle repeatedly with results', function(assert) {\n assert.expect(6);\n var done = assert.async();\n var counter = 0;\n var incr = function(){ return ++counter; };\n var throttledIncr = _.throttle(incr, 100);\n var results = [];\n var saveResult = function() { results.push(throttledIncr()); };\n saveResult(); saveResult();\n _.delay(saveResult, 50);\n _.delay(saveResult, 150);\n _.delay(saveResult, 160);\n _.delay(saveResult, 230);\n _.delay(function() {\n assert.strictEqual(results[0], 1, 'incr was called once');\n assert.strictEqual(results[1], 1, 'incr was throttled');\n assert.strictEqual(results[2], 1, 'incr was throttled');\n assert.strictEqual(results[3], 2, 'incr was called twice');\n assert.strictEqual(results[4], 2, 'incr was throttled');\n assert.strictEqual(results[5], 3, 'incr was called trailing');\n done();\n }, 304);\n });\n\n QUnit.test('throttle triggers trailing call when invoked repeatedly', function(assert) {\n assert.expect(2);\n var done = assert.async();\n var counter = 0;\n var limit = 48;\n var incr = function(){ counter++; };\n var throttledIncr = _.throttle(incr, 32);\n\n var stamp = new Date;\n while (new Date - stamp < limit) {\n throttledIncr();\n }\n var lastCount = counter;\n assert.ok(counter > 1);\n\n _.delay(function() {\n assert.ok(counter > lastCount);\n done();\n }, 96);\n });\n\n QUnit.test('throttle does not trigger leading call when leading is set to false', function(assert) {\n assert.expect(2);\n var done = assert.async();\n var counter = 0;\n var incr = function(){ counter++; };\n var throttledIncr = _.throttle(incr, 60, {leading: false});\n\n throttledIncr(); throttledIncr();\n assert.strictEqual(counter, 0);\n\n _.delay(function() {\n assert.strictEqual(counter, 1);\n done();\n }, 96);\n });\n\n QUnit.test('more throttle does not trigger leading call when leading is set to false', function(assert) {\n assert.expect(3);\n var done = assert.async();\n var counter = 0;\n var incr = function(){ counter++; };\n var throttledIncr = _.throttle(incr, 100, {leading: false});\n\n throttledIncr();\n _.delay(throttledIncr, 50);\n _.delay(throttledIncr, 60);\n _.delay(throttledIncr, 200);\n assert.strictEqual(counter, 0);\n\n _.delay(function() {\n assert.strictEqual(counter, 1);\n }, 250);\n\n _.delay(function() {\n assert.strictEqual(counter, 2);\n done();\n }, 350);\n });\n\n QUnit.test('one more throttle with leading: false test', function(assert) {\n assert.expect(2);\n var done = assert.async();\n var counter = 0;\n var incr = function(){ counter++; };\n var throttledIncr = _.throttle(incr, 100, {leading: false});\n\n var time = new Date;\n while (new Date - time < 350) throttledIncr();\n assert.ok(counter <= 3);\n\n _.delay(function() {\n assert.ok(counter <= 4);\n done();\n }, 200);\n });\n\n QUnit.test('throttle does not trigger trailing call when trailing is set to false', function(assert) {\n assert.expect(4);\n var done = assert.async();\n var counter = 0;\n var incr = function(){ counter++; };\n var throttledIncr = _.throttle(incr, 60, {trailing: false});\n\n throttledIncr(); throttledIncr(); throttledIncr();\n assert.strictEqual(counter, 1);\n\n _.delay(function() {\n assert.strictEqual(counter, 1);\n\n throttledIncr(); throttledIncr();\n assert.strictEqual(counter, 2);\n\n _.delay(function() {\n assert.strictEqual(counter, 2);\n done();\n }, 96);\n }, 96);\n });\n\n QUnit.test('throttle continues to function after system time is set backwards', function(assert) {\n assert.expect(2);\n var done = assert.async();\n var counter = 0;\n var incr = function(){ counter++; };\n var throttledIncr = _.throttle(incr, 100);\n var originalNowFunc = Date.now;\n var originalGetTimeFunc = Date.prototype.getTime;\n\n throttledIncr();\n assert.strictEqual(counter, 1, 'incr was called immediately');\n\n Date.prototype.getTime = function() {\n return +(new Date(2013, 0, 1, 1, 1, 1));\n }\n Date.now = function() {\n return +(new Date(2013, 0, 1, 1, 1, 1));\n }\n\n _.delay(function() {\n throttledIncr();\n assert.strictEqual(counter, 2, 'incr was throttled successfully, with tampered system time');\n done();\n Date.now = originalNowFunc;\n Date.prototype.getTime = originalGetTimeFunc;\n }, 200);\n });\n\n QUnit.test('throttle continues to function after system time is not accessible (or in invalid format)', function(assert) {\n assert.expect(3);\n var done = assert.async();\n var counter = 0;\n var incr = function(){ counter++; };\n var throttledIncr = _.throttle(incr, 100);\n var originalNowFunc = Date.now;\n var originalGetTimeFunc = Date.prototype.getTime;\n var originalValueOfFunc = Date.prototype.valueOf;\n\n throttledIncr();\n assert.strictEqual(counter, 1, 'incr was called immediately');\n\n Date.prototype.valueOf = function() {\n return null;\n }\n Date.prototype.getTime = function() {\n return null;\n }\n Date.now = function() {\n return null;\n }\n\n _.delay(function() {\n throttledIncr();\n assert.strictEqual(counter, 2, 'incr was throttled successfully, with tampered system time');\n Date.now = originalNowFunc;\n Date.prototype.getTime = originalGetTimeFunc;\n Date.prototype.valueOf = originalValueOfFunc;\n }, 200);\n\n _.delay(function() {\n throttledIncr();\n assert.strictEqual(counter, 3, 'incr was throttled successfully, after system time method restoration');\n done();\n }, 400);\n });\n\n QUnit.test('throttle re-entrant', function(assert) {\n assert.expect(2);\n var done = assert.async();\n var sequence = [\n ['b1', 'b2'],\n ['c1', 'c2']\n ];\n var value = '';\n var throttledAppend;\n var append = function(arg){\n value += this + arg;\n var args = sequence.pop();\n if (args) {\n throttledAppend.call(args[0], args[1]);\n }\n };\n throttledAppend = _.throttle(append, 32);\n throttledAppend.call('a1', 'a2');\n assert.strictEqual(value, 'a1a2');\n _.delay(function(){\n assert.strictEqual(value, 'a1a2c1c2b1b2', 'append was throttled successfully');\n done();\n }, 104);\n });\n\n QUnit.test('throttle cancel', function(assert) {\n var done = assert.async();\n var counter = 0;\n var incr = function(){ counter++; };\n var throttledIncr = _.throttle(incr, 32);\n throttledIncr();\n throttledIncr.cancel();\n throttledIncr();\n throttledIncr();\n\n assert.strictEqual(counter, 2, 'incr was called immediately');\n _.delay(function(){ assert.strictEqual(counter, 3, 'incr was throttled'); done(); }, 64);\n });\n\n QUnit.test('throttle cancel with leading: false', function(assert) {\n var done = assert.async();\n var counter = 0;\n var incr = function(){ counter++; };\n var throttledIncr = _.throttle(incr, 32, {leading: false});\n throttledIncr();\n throttledIncr.cancel();\n\n assert.strictEqual(counter, 0, 'incr was throttled');\n _.delay(function(){ assert.strictEqual(counter, 0, 'incr was throttled'); done(); }, 64);\n });\n\n QUnit.test('debounce', function(assert) {\n assert.expect(1);\n var done = assert.async();\n var counter = 0;\n var incr = function(){ counter++; };\n var debouncedIncr = _.debounce(incr, 32);\n debouncedIncr(); debouncedIncr();\n _.delay(debouncedIncr, 16);\n _.delay(function(){ assert.strictEqual(counter, 1, 'incr was debounced'); done(); }, 96);\n });\n\n QUnit.test('debounce cancel', function(assert) {\n assert.expect(1);\n var done = assert.async();\n var counter = 0;\n var incr = function(){ counter++; };\n var debouncedIncr = _.debounce(incr, 32);\n debouncedIncr();\n debouncedIncr.cancel();\n _.delay(function(){ assert.strictEqual(counter, 0, 'incr was not called'); done(); }, 96);\n });\n\n QUnit.test('debounce asap', function(assert) {\n assert.expect(6);\n var done = assert.async();\n var a, b, c;\n var counter = 0;\n var incr = function(){ return ++counter; };\n var debouncedIncr = _.debounce(incr, 64, true);\n a = debouncedIncr();\n b = debouncedIncr();\n assert.strictEqual(a, 1);\n assert.strictEqual(b, 1);\n assert.strictEqual(counter, 1, 'incr was called immediately');\n _.delay(debouncedIncr, 16);\n _.delay(debouncedIncr, 32);\n _.delay(function() {\n debouncedIncr();\n _.delay(finish, 80);\n }, 48);\n var finish = function(){\n assert.strictEqual(counter, 1, 'incr was debounced');\n c = debouncedIncr();\n assert.strictEqual(c, 2);\n assert.strictEqual(counter, 2, 'incr was called again');\n done();\n };\n });\n\n QUnit.test('debounce asap cancel', function(assert) {\n assert.expect(4);\n var done = assert.async();\n var a, b;\n var counter = 0;\n var incr = function(){ return ++counter; };\n var debouncedIncr = _.debounce(incr, 64, true);\n a = debouncedIncr();\n debouncedIncr.cancel();\n b = debouncedIncr();\n assert.strictEqual(a, 1);\n assert.strictEqual(b, 2);\n assert.strictEqual(counter, 2, 'incr was called immediately');\n _.delay(debouncedIncr, 16);\n _.delay(debouncedIncr, 32);\n _.delay(debouncedIncr, 48);\n _.delay(function(){ assert.strictEqual(counter, 2, 'incr was debounced'); done(); }, 128);\n });\n\n QUnit.test('debounce asap recursively', function(assert) {\n assert.expect(2);\n var done = assert.async();\n var counter = 0;\n var debouncedIncr = _.debounce(function(){\n counter++;\n if (counter < 10) debouncedIncr();\n }, 32, true);\n debouncedIncr();\n assert.strictEqual(counter, 1, 'incr was called immediately');\n _.delay(function(){ assert.strictEqual(counter, 1, 'incr was debounced'); done(); }, 96);\n });\n\n QUnit.test('debounce after system time is set backwards', function(assert) {\n assert.expect(2);\n var done = assert.async();\n var counter = 0;\n var debouncedIncr = _.debounce(function(){\n counter++;\n }, 100, true);\n var originalNowFunc = Date.now;\n var originalGetTimeFunc = Date.prototype.getTime;\n\n debouncedIncr();\n assert.strictEqual(counter, 1, 'incr was called immediately');\n\n Date.prototype.getTime = function() {\n return +(new Date(2013, 0, 1, 1, 1, 1));\n }\n Date.now = function() {\n return +(new Date(2013, 0, 1, 1, 1, 1));\n }\n\n _.delay(function() {\n debouncedIncr();\n assert.strictEqual(counter, 2, 'incr was debounced successfully, with tampered system time');\n done();\n Date.now = originalNowFunc;\n Date.prototype.getTime = originalGetTimeFunc;\n }, 200);\n });\n\n QUnit.test('debounce after system time is is not accessible (or in invalid format)', function(assert) {\n assert.expect(3);\n var done = assert.async();\n var counter = 0;\n var debouncedIncr = _.debounce(function(){\n counter++;\n }, 100, true);\n var originalNowFunc = Date.now;\n var originalGetTimeFunc = Date.prototype.getTime;\n var originalValueOfFunc = Date.prototype.valueOf;\n\n debouncedIncr();\n assert.strictEqual(counter, 1, 'incr was called immediately');\n\n Date.prototype.valueOf = function() {\n return null;\n };\n Date.prototype.getTime = function() {\n return null;\n };\n Date.now = function() {\n return null;\n };\n\n _.delay(function() {\n debouncedIncr();\n assert.strictEqual(counter, 2, 'incr was debounced successfully, with tampered system time');\n Date.now = originalNowFunc;\n Date.prototype.getTime = originalGetTimeFunc;\n Date.prototype.valueOf = originalValueOfFunc;\n }, 200);\n\n _.delay(function() {\n debouncedIncr();\n assert.strictEqual(counter, 3, 'incr was debounced successfully, after system time method restoration');\n done();\n }, 400);\n });\n\n QUnit.test('debounce re-entrant', function(assert) {\n assert.expect(2);\n var done = assert.async();\n var sequence = [\n ['b1', 'b2']\n ];\n var value = '';\n var debouncedAppend;\n var append = function(arg){\n value += this + arg;\n var args = sequence.pop();\n if (args) {\n debouncedAppend.call(args[0], args[1]);\n }\n };\n debouncedAppend = _.debounce(append, 32);\n debouncedAppend.call('a1', 'a2');\n assert.strictEqual(value, '');\n _.delay(function(){\n assert.strictEqual(value, 'a1a2b1b2', 'append was debounced successfully');\n done();\n }, 100);\n });\n\n QUnit.test('once', function(assert) {\n var num = 0;\n var increment = _.once(function(){ return ++num; });\n increment();\n increment();\n assert.strictEqual(num, 1);\n\n assert.strictEqual(increment(), 1, 'stores a memo to the last value');\n });\n\n QUnit.test('Recursive onced function.', function(assert) {\n assert.expect(1);\n var f = _.once(function(){\n assert.ok(true);\n f();\n });\n f();\n });\n\n QUnit.test('wrap', function(assert) {\n var greet = function(name){ return 'hi: ' + name; };\n var backwards = _.wrap(greet, function(func, name){ return func(name) + ' ' + name.split('').reverse().join(''); });\n assert.strictEqual(backwards('moe'), 'hi: moe eom', 'wrapped the salutation function');\n\n var inner = function(){ return 'Hello '; };\n var obj = {name: 'Moe'};\n obj.hi = _.wrap(inner, function(fn){ return fn() + this.name; });\n assert.strictEqual(obj.hi(), 'Hello Moe');\n\n var noop = function(){};\n var wrapped = _.wrap(noop, function(){ return Array.prototype.slice.call(arguments, 0); });\n var ret = wrapped(['whats', 'your'], 'vector', 'victor');\n assert.deepEqual(ret, [noop, ['whats', 'your'], 'vector', 'victor']);\n });\n\n QUnit.test('negate', function(assert) {\n var isOdd = function(n){ return n & 1; };\n assert.strictEqual(_.negate(isOdd)(2), true, 'should return the complement of the given function');\n assert.strictEqual(_.negate(isOdd)(3), false, 'should return the complement of the given function');\n });\n\n QUnit.test('compose', function(assert) {\n var greet = function(name){ return 'hi: ' + name; };\n var exclaim = function(sentence){ return sentence + '!'; };\n var composed = _.compose(exclaim, greet);\n assert.strictEqual(composed('moe'), 'hi: moe!', 'can compose a function that takes another');\n\n composed = _.compose(greet, exclaim);\n assert.strictEqual(composed('moe'), 'hi: moe!', 'in this case, the functions are also commutative');\n\n // f(g(h(x, y, z)))\n function h(x, y, z) {\n assert.strictEqual(arguments.length, 3, 'First function called with multiple args');\n return z * y;\n }\n function g(x) {\n assert.strictEqual(arguments.length, 1, 'Composed function is called with 1 argument');\n return x;\n }\n function f(x) {\n assert.strictEqual(arguments.length, 1, 'Composed function is called with 1 argument');\n return x * 2;\n }\n composed = _.compose(f, g, h);\n assert.strictEqual(composed(1, 2, 3), 12);\n });\n\n QUnit.test('after', function(assert) {\n var testAfter = function(afterAmount, timesCalled) {\n var afterCalled = 0;\n var after = _.after(afterAmount, function() {\n afterCalled++;\n });\n while (timesCalled--) after();\n return afterCalled;\n };\n\n assert.strictEqual(testAfter(5, 5), 1, 'after(N) should fire after being called N times');\n assert.strictEqual(testAfter(5, 4), 0, 'after(N) should not fire unless called N times');\n assert.strictEqual(testAfter(0, 0), 0, 'after(0) should not fire immediately');\n assert.strictEqual(testAfter(0, 1), 1, 'after(0) should fire when first invoked');\n });\n\n QUnit.test('before', function(assert) {\n var testBefore = function(beforeAmount, timesCalled) {\n var beforeCalled = 0;\n var before = _.before(beforeAmount, function() { beforeCalled++; });\n while (timesCalled--) before();\n return beforeCalled;\n };\n\n assert.strictEqual(testBefore(5, 5), 4, 'before(N) should not fire after being called N times');\n assert.strictEqual(testBefore(5, 4), 4, 'before(N) should fire before being called N times');\n assert.strictEqual(testBefore(0, 0), 0, 'before(0) should not fire immediately');\n assert.strictEqual(testBefore(0, 1), 0, 'before(0) should not fire when first invoked');\n\n var context = {num: 0};\n var increment = _.before(3, function(){ return ++this.num; });\n _.times(10, increment, context);\n assert.strictEqual(increment(), 2, 'stores a memo to the last value');\n assert.strictEqual(context.num, 2, 'provides context');\n });\n\n QUnit.test('iteratee', function(assert) {\n var identity = _.iteratee();\n assert.strictEqual(identity, _.identity, '_.iteratee is exposed as an external function.');\n\n function fn() {\n return arguments;\n }\n _.each([_.iteratee(fn), _.iteratee(fn, {})], function(cb) {\n assert.strictEqual(cb().length, 0);\n assert.deepEqual(_.toArray(cb(1, 2, 3)), _.range(1, 4));\n assert.deepEqual(_.toArray(cb(1, 2, 3, 4, 5, 6, 7, 8, 9, 10)), _.range(1, 11));\n });\n\n var deepProperty = _.iteratee(['a', 'b']);\n assert.strictEqual(deepProperty({a: {b: 2}}), 2, 'treats an array as a deep property accessor');\n\n // Test custom iteratee\n var builtinIteratee = _.iteratee;\n _.iteratee = function(value, context) {\n // RegEx values return a function that returns the number of matches\n if (_.isRegExp(value)) return function(obj) {\n return (obj.match(value) || []).length;\n };\n return builtinIteratee(value, context);\n };\n\n var collection = ['foo', 'bar', 'bbiz'];\n\n // Test all methods that claim to be transformed through `_.iteratee`\n assert.deepEqual(_.countBy(collection, /b/g), {0: 1, 1: 1, 2: 1});\n assert.strictEqual(_.every(collection, /b/g), false);\n assert.deepEqual(_.filter(collection, /b/g), ['bar', 'bbiz']);\n assert.strictEqual(_.find(collection, /b/g), 'bar');\n assert.strictEqual(_.findIndex(collection, /b/g), 1);\n assert.strictEqual(_.findKey(collection, /b/g), '1');\n assert.strictEqual(_.findLastIndex(collection, /b/g), 2);\n assert.deepEqual(_.groupBy(collection, /b/g), {0: ['foo'], 1: ['bar'], 2: ['bbiz']});\n assert.deepEqual(_.indexBy(collection, /b/g), {0: 'foo', 1: 'bar', 2: 'bbiz'});\n assert.deepEqual(_.map(collection, /b/g), [0, 1, 2]);\n assert.strictEqual(_.max(collection, /b/g), 'bbiz');\n assert.strictEqual(_.min(collection, /b/g), 'foo');\n assert.deepEqual(_.partition(collection, /b/g), [['bar', 'bbiz'], ['foo']]);\n assert.deepEqual(_.reject(collection, /b/g), ['foo']);\n assert.strictEqual(_.some(collection, /b/g), true);\n assert.deepEqual(_.sortBy(collection, /b/g), ['foo', 'bar', 'bbiz']);\n assert.strictEqual(_.sortedIndex(collection, 'blah', /b/g), 1);\n assert.deepEqual(_.uniq(collection, /b/g), ['foo', 'bar', 'bbiz']);\n\n var objCollection = {a: 'foo', b: 'bar', c: 'bbiz'};\n assert.deepEqual(_.mapObject(objCollection, /b/g), {a: 0, b: 1, c: 2});\n\n // Ensure that the overridden iteratee can still fall back on the builtin\n // iteratee.\n assert.strictEqual(_.iteratee(), _.identity);\n assert.deepEqual(_.toArray(_.iteratee(fn)(1, 2, 3)), _.range(1, 4));\n var matcher = _.iteratee({b: 'bar'});\n assert.equal(matcher(objCollection), true);\n assert.equal(matcher({}), false);\n var property = _.iteratee('b');\n assert.equal(property(objCollection), 'bar');\n assert.equal(property({}), undefined);\n\n // Restore the builtin iteratee\n _.iteratee = builtinIteratee;\n });\n\n QUnit.test('restArguments', function(assert) {\n assert.expect(10);\n _.restArguments(function(a, args) {\n assert.strictEqual(a, 1);\n assert.deepEqual(args, [2, 3], 'collects rest arguments into an array');\n })(1, 2, 3);\n\n _.restArguments(function(a, args) {\n assert.strictEqual(a, void 0);\n assert.deepEqual(args, [], 'passes empty array if there are not enough arguments');\n })();\n\n _.restArguments(function(a, b, c, args) {\n assert.strictEqual(arguments.length, 4);\n assert.deepEqual(args, [4, 5], 'works on functions with many named parameters');\n })(1, 2, 3, 4, 5);\n\n var obj = {};\n _.restArguments(function() {\n assert.strictEqual(this, obj, 'invokes function with this context');\n }).call(obj);\n\n _.restArguments(function(array, iteratee, context) {\n assert.deepEqual(array, [1, 2, 3, 4], 'startIndex can be used manually specify index of rest parameter');\n assert.strictEqual(iteratee, void 0);\n assert.strictEqual(context, void 0);\n }, 0)(1, 2, 3, 4);\n });\n\n}());\n" }, { "path": "test/index.html", "content": "\n\n\n Underscore Test Suite\n \n \n\n\n
\n
\n \n \n \n \n \n \n \n \n \n \n \n\n\n" }, { "path": "test/objects.js", "content": "(function() {\n var _ = typeof require == 'function' ? require('..') : window._;\n\n QUnit.module('Objects');\n\n var testElement = typeof document === 'object' ? document.createElement('div') : void 0;\n\n // Some browsers support typed arrays but not DataView and some applications could override DataView\n var DataViewImpl = typeof NativeDataView !== 'undefined' ? NativeDataView : typeof DataView !== 'undefined' ? DataView : undefined;\n\n QUnit.test('keys', function(assert) {\n assert.deepEqual(_.keys({one: 1, two: 2}), ['one', 'two'], 'can extract the keys from an object');\n // the test above is not safe because it relies on for-in enumeration order\n var a = []; a[1] = 0;\n assert.deepEqual(_.keys(a), ['1'], 'is not fooled by sparse arrays; see issue #95');\n assert.deepEqual(_.keys(null), []);\n assert.deepEqual(_.keys(void 0), []);\n assert.deepEqual(_.keys(1), []);\n assert.deepEqual(_.keys('a'), []);\n assert.deepEqual(_.keys(true), []);\n\n // keys that may be missed if the implementation isn't careful\n var trouble = {\n constructor: Object,\n valueOf: _.noop,\n hasOwnProperty: null,\n toString: 5,\n toLocaleString: void 0,\n propertyIsEnumerable: /a/,\n isPrototypeOf: this,\n __defineGetter__: Boolean,\n __defineSetter__: {},\n __lookupSetter__: false,\n __lookupGetter__: []\n };\n var troubleKeys = ['constructor', 'valueOf', 'hasOwnProperty', 'toString', 'toLocaleString', 'propertyIsEnumerable',\n 'isPrototypeOf', '__defineGetter__', '__defineSetter__', '__lookupSetter__', '__lookupGetter__'].sort();\n assert.deepEqual(_.keys(trouble).sort(), troubleKeys, 'matches non-enumerable properties');\n });\n\n QUnit.test('allKeys', function(assert) {\n assert.deepEqual(_.allKeys({one: 1, two: 2}), ['one', 'two'], 'can extract the allKeys from an object');\n // the test above is not safe because it relies on for-in enumeration order\n var a = []; a[1] = 0;\n assert.deepEqual(_.allKeys(a), ['1'], 'is not fooled by sparse arrays; see issue #95');\n\n a.a = a;\n assert.deepEqual(_.allKeys(a), ['1', 'a'], 'is not fooled by sparse arrays with additional properties');\n\n _.each([null, void 0, 1, 'a', true, NaN, {}, [], new Number(5), new Date(0)], function(val) {\n assert.deepEqual(_.allKeys(val), []);\n });\n\n // allKeys that may be missed if the implementation isn't careful\n var trouble = {\n constructor: Object,\n valueOf: _.noop,\n hasOwnProperty: null,\n toString: 5,\n toLocaleString: void 0,\n propertyIsEnumerable: /a/,\n isPrototypeOf: this\n };\n var troubleKeys = ['constructor', 'valueOf', 'hasOwnProperty', 'toString', 'toLocaleString', 'propertyIsEnumerable',\n 'isPrototypeOf'].sort();\n assert.deepEqual(_.allKeys(trouble).sort(), troubleKeys, 'matches non-enumerable properties');\n\n function A() {}\n A.prototype.foo = 'foo';\n var b = new A();\n b.bar = 'bar';\n assert.deepEqual(_.allKeys(b).sort(), ['bar', 'foo'], 'should include inherited keys');\n\n function y() {}\n y.x = 'z';\n assert.deepEqual(_.allKeys(y), ['x'], 'should get keys from constructor');\n });\n\n QUnit.test('values', function(assert) {\n assert.deepEqual(_.values({one: 1, two: 2}), [1, 2], 'can extract the values from an object');\n assert.deepEqual(_.values({one: 1, two: 2, length: 3}), [1, 2, 3], '... even when one of them is \"length\"');\n });\n\n QUnit.test('pairs', function(assert) {\n assert.deepEqual(_.pairs({one: 1, two: 2}), [['one', 1], ['two', 2]], 'can convert an object into pairs');\n assert.deepEqual(_.pairs({one: 1, two: 2, length: 3}), [['one', 1], ['two', 2], ['length', 3]], '... even when one of them is \"length\"');\n });\n\n QUnit.test('invert', function(assert) {\n var obj = {first: 'Moe', second: 'Larry', third: 'Curly'};\n assert.deepEqual(_.keys(_.invert(obj)), ['Moe', 'Larry', 'Curly'], 'can invert an object');\n assert.deepEqual(_.invert(_.invert(obj)), obj, 'two inverts gets you back where you started');\n\n obj = {length: 3};\n assert.strictEqual(_.invert(obj)['3'], 'length', 'can invert an object with \"length\"');\n });\n\n QUnit.test('functions', function(assert) {\n var obj = {a: 'dash', b: _.map, c: /yo/, d: _.reduce};\n assert.deepEqual(['b', 'd'], _.functions(obj), 'can grab the function names of any passed-in object');\n\n var Animal = function(){};\n Animal.prototype.run = function(){};\n assert.deepEqual(_.functions(new Animal), ['run'], 'also looks up functions on the prototype');\n });\n\n QUnit.test('methods', function(assert) {\n assert.strictEqual(_.methods, _.functions, 'is an alias for functions');\n });\n\n QUnit.test('extend', function(assert) {\n var result;\n assert.strictEqual(_.extend({}, {a: 'b'}).a, 'b', 'can extend an object with the attributes of another');\n assert.strictEqual(_.extend({a: 'x'}, {a: 'b'}).a, 'b', 'properties in source override destination');\n assert.strictEqual(_.extend({x: 'x'}, {a: 'b'}).x, 'x', \"properties not in source don't get overridden\");\n result = _.extend({x: 'x'}, {a: 'a'}, {b: 'b'});\n assert.deepEqual(result, {x: 'x', a: 'a', b: 'b'}, 'can extend from multiple source objects');\n result = _.extend({x: 'x'}, {a: 'a', x: 2}, {a: 'b'});\n assert.deepEqual(result, {x: 2, a: 'b'}, 'extending from multiple source objects last property trumps');\n result = _.extend({}, {a: void 0, b: null});\n assert.deepEqual(_.keys(result), ['a', 'b'], 'extend copies undefined values');\n\n var F = function() {};\n F.prototype = {a: 'b'};\n var subObj = new F();\n subObj.c = 'd';\n assert.deepEqual(_.extend({}, subObj), {a: 'b', c: 'd'}, 'extend copies all properties from source');\n _.extend(subObj, {});\n assert.ok(!subObj.hasOwnProperty('a'), \"extend does not convert destination object's 'in' properties to 'own' properties\");\n\n try {\n result = {};\n _.extend(result, null, void 0, {a: 1});\n } catch (e) { /* ignored */ }\n\n assert.strictEqual(result.a, 1, 'should not error on `null` or `undefined` sources');\n\n assert.strictEqual(_.extend(null, {a: 1}), null, 'extending null results in null');\n assert.strictEqual(_.extend(void 0, {a: 1}), void 0, 'extending undefined results in undefined');\n });\n\n QUnit.test('extendOwn', function(assert) {\n var result;\n assert.strictEqual(_.extendOwn({}, {a: 'b'}).a, 'b', 'can extend an object with the attributes of another');\n assert.strictEqual(_.extendOwn({a: 'x'}, {a: 'b'}).a, 'b', 'properties in source override destination');\n assert.strictEqual(_.extendOwn({x: 'x'}, {a: 'b'}).x, 'x', \"properties not in source don't get overridden\");\n result = _.extendOwn({x: 'x'}, {a: 'a'}, {b: 'b'});\n assert.deepEqual(result, {x: 'x', a: 'a', b: 'b'}, 'can extend from multiple source objects');\n result = _.extendOwn({x: 'x'}, {a: 'a', x: 2}, {a: 'b'});\n assert.deepEqual(result, {x: 2, a: 'b'}, 'extending from multiple source objects last property trumps');\n assert.deepEqual(_.extendOwn({}, {a: void 0, b: null}), {a: void 0, b: null}, 'copies undefined values');\n\n var F = function() {};\n F.prototype = {a: 'b'};\n var subObj = new F();\n subObj.c = 'd';\n assert.deepEqual(_.extendOwn({}, subObj), {c: 'd'}, 'copies own properties from source');\n\n result = {};\n assert.deepEqual(_.extendOwn(result, null, void 0, {a: 1}), {a: 1}, 'should not error on `null` or `undefined` sources');\n\n _.each(['a', 5, null, false], function(val) {\n assert.strictEqual(_.extendOwn(val, {a: 1}), val, 'extending non-objects results in returning the non-object value');\n });\n\n assert.strictEqual(_.extendOwn(void 0, {a: 1}), void 0, 'extending undefined results in undefined');\n\n result = _.extendOwn({a: 1, 0: 2, 1: '5', length: 6}, {0: 1, 1: 2, length: 2});\n assert.deepEqual(result, {a: 1, 0: 1, 1: 2, length: 2}, 'should treat array-like objects like normal objects');\n });\n\n QUnit.test('assign', function(assert) {\n assert.strictEqual(_.assign, _.extendOwn, 'is an alias for extendOwn');\n });\n\n QUnit.test('pick', function(assert) {\n var result;\n result = _.pick({a: 1, b: 2, c: 3}, 'a', 'c');\n assert.deepEqual(result, {a: 1, c: 3}, 'can restrict properties to those named');\n result = _.pick({a: 1, b: 2, c: 3}, ['b', 'c']);\n assert.deepEqual(result, {b: 2, c: 3}, 'can restrict properties to those named in an array');\n result = _.pick({a: 1, b: 2, c: 3}, ['a'], 'b');\n assert.deepEqual(result, {a: 1, b: 2}, 'can restrict properties to those named in mixed args');\n result = _.pick({a: 1, b: 2, c: 3}, ['a'], [['b']]);\n assert.deepEqual(result, {a: 1, b: 2}, 'can restrict properties to those named in mixed deep args');\n result = _.pick(['a', 'b'], 1);\n assert.deepEqual(result, {1: 'b'}, 'can pick numeric properties');\n\n _.each([null, void 0], function(val) {\n assert.deepEqual(_.pick(val, 'hasOwnProperty'), {}, 'Called with null/undefined');\n assert.deepEqual(_.pick(val, _.constant(true)), {});\n });\n assert.deepEqual(_.pick(5, 'toString', 'b'), {toString: Number.prototype.toString}, 'can iterate primitives');\n\n var data = {a: 1, b: 2, c: 3};\n var callback = function(value, key, object) {\n assert.strictEqual(key, {1: 'a', 2: 'b', 3: 'c'}[value]);\n assert.strictEqual(object, data);\n return value !== this.value;\n };\n result = _.pick(data, callback, {value: 2});\n assert.deepEqual(result, {a: 1, c: 3}, 'can accept a predicate and context');\n\n var Obj = function(){};\n Obj.prototype = {a: 1, b: 2, c: 3};\n var instance = new Obj();\n assert.deepEqual(_.pick(instance, 'a', 'c'), {a: 1, c: 3}, 'include prototype props');\n\n assert.deepEqual(_.pick(data, function(val, key) {\n return this[key] === 3 && this === instance;\n }, instance), {c: 3}, 'function is given context');\n\n assert.ok(!_.has(_.pick({}, 'foo'), 'foo'), 'does not set own property if property not in object');\n _.pick(data, function(value, key, obj) {\n assert.strictEqual(obj, data, 'passes same object as third parameter of iteratee');\n });\n });\n\n QUnit.test('omit', function(assert) {\n var result;\n result = _.omit({a: 1, b: 2, c: 3}, 'b');\n assert.deepEqual(result, {a: 1, c: 3}, 'can omit a single named property');\n result = _.omit({a: 1, b: 2, c: 3}, 'a', 'c');\n assert.deepEqual(result, {b: 2}, 'can omit several named properties');\n result = _.omit({a: 1, b: 2, c: 3}, ['b', 'c']);\n assert.deepEqual(result, {a: 1}, 'can omit properties named in an array');\n result = _.omit({a: 1, b: 2, c: 3}, ['b', ['c']]);\n assert.deepEqual(result, {a: 1}, 'can omit properties named in a nested array');\n result = _.omit(['a', 'b'], 0);\n assert.deepEqual(result, {1: 'b'}, 'can omit numeric properties');\n\n assert.deepEqual(_.omit(null, 'a', 'b'), {}, 'non objects return empty object');\n assert.deepEqual(_.omit(void 0, 'toString'), {}, 'null/undefined return empty object');\n assert.deepEqual(_.omit(5, 'toString', 'b'), {}, 'returns empty object for primitives');\n\n var data = {a: 1, b: 2, c: 3};\n var callback = function(value, key, object) {\n assert.strictEqual(key, {1: 'a', 2: 'b', 3: 'c'}[value]);\n assert.strictEqual(object, data);\n return value !== this.value;\n };\n result = _.omit(data, callback, {value: 2});\n assert.deepEqual(result, {b: 2}, 'can accept a predicate');\n\n var Obj = function(){};\n Obj.prototype = {a: 1, b: 2, c: 3};\n var instance = new Obj();\n assert.deepEqual(_.omit(instance, 'b'), {a: 1, c: 3}, 'include prototype props');\n\n assert.deepEqual(_.omit(data, function(val, key) {\n return this[key] === 3 && this === instance;\n }, instance), {a: 1, b: 2}, 'function is given context');\n });\n\n QUnit.test('defaults', function(assert) {\n var options = {zero: 0, one: 1, empty: '', nan: NaN, nothing: null};\n\n _.defaults(options, {zero: 1, one: 10, twenty: 20, nothing: 'str'});\n assert.strictEqual(options.zero, 0, 'value exists');\n assert.strictEqual(options.one, 1, 'value exists');\n assert.strictEqual(options.twenty, 20, 'default applied');\n assert.strictEqual(options.nothing, null, \"null isn't overridden\");\n\n _.defaults(options, {empty: 'full'}, {nan: 'nan'}, {word: 'word'}, {word: 'dog'});\n assert.strictEqual(options.empty, '', 'value exists');\n assert.ok(_.isNaN(options.nan), \"NaN isn't overridden\");\n assert.strictEqual(options.word, 'word', 'new value is added, first one wins');\n\n try {\n options = {};\n _.defaults(options, null, void 0, {a: 1});\n } catch (e) { /* ignored */ }\n\n assert.strictEqual(options.a, 1, 'should not error on `null` or `undefined` sources');\n\n assert.deepEqual(_.defaults(null, {a: 1}), {a: 1}, 'defaults skips nulls');\n assert.deepEqual(_.defaults(void 0, {a: 1}), {a: 1}, 'defaults skips undefined');\n });\n\n QUnit.test('clone', function(assert) {\n var moe = {name: 'moe', lucky: [13, 27, 34]};\n var clone = _.clone(moe);\n assert.strictEqual(clone.name, 'moe', 'the clone as the attributes of the original');\n\n clone.name = 'curly';\n assert.ok(clone.name === 'curly' && moe.name === 'moe', 'clones can change shallow attributes without affecting the original');\n\n clone.lucky.push(101);\n assert.strictEqual(_.last(moe.lucky), 101, 'changes to deep attributes are shared with the original');\n\n assert.strictEqual(_.clone(void 0), void 0, 'non objects should not be changed by clone');\n assert.strictEqual(_.clone(1), 1, 'non objects should not be changed by clone');\n assert.strictEqual(_.clone(null), null, 'non objects should not be changed by clone');\n });\n\n QUnit.test('create', function(assert) {\n var Parent = function() {};\n Parent.prototype = {foo: function() {}, bar: 2};\n\n _.each(['foo', null, void 0, 1], function(val) {\n assert.deepEqual(_.create(val), {}, 'should return empty object when a non-object is provided');\n });\n\n assert.ok(_.create([]) instanceof Array, 'should return new instance of array when array is provided');\n\n var Child = function() {};\n Child.prototype = _.create(Parent.prototype);\n assert.ok(new Child instanceof Parent, 'object should inherit prototype');\n\n var func = function() {};\n Child.prototype = _.create(Parent.prototype, {func: func});\n assert.strictEqual(Child.prototype.func, func, 'properties should be added to object');\n\n Child.prototype = _.create(Parent.prototype, {constructor: Child});\n assert.strictEqual(Child.prototype.constructor, Child);\n\n Child.prototype.foo = 'foo';\n var created = _.create(Child.prototype, new Child);\n assert.ok(!created.hasOwnProperty('foo'), 'should only add own properties');\n });\n\n QUnit.test('isEqual', function(assert) {\n function First() {\n this.value = 1;\n }\n First.prototype.value = 1;\n function Second() {\n this.value = 1;\n }\n Second.prototype.value = 2;\n\n // Basic equality and identity comparisons.\n assert.ok(_.isEqual(null, null), '`null` is equal to `null`');\n assert.ok(_.isEqual(), '`undefined` is equal to `undefined`');\n\n assert.ok(!_.isEqual(0, -0), '`0` is not equal to `-0`');\n assert.ok(!_.isEqual(-0, 0), 'Commutative equality is implemented for `0` and `-0`');\n assert.ok(!_.isEqual(null, void 0), '`null` is not equal to `undefined`');\n assert.ok(!_.isEqual(void 0, null), 'Commutative equality is implemented for `null` and `undefined`');\n\n // String object and primitive comparisons.\n assert.ok(_.isEqual('Curly', 'Curly'), 'Identical string primitives are equal');\n assert.ok(_.isEqual(new String('Curly'), new String('Curly')), 'String objects with identical primitive values are equal');\n assert.ok(_.isEqual(new String('Curly'), 'Curly'), 'String primitives and their corresponding object wrappers are equal');\n assert.ok(_.isEqual('Curly', new String('Curly')), 'Commutative equality is implemented for string objects and primitives');\n\n assert.ok(!_.isEqual('Curly', 'Larry'), 'String primitives with different values are not equal');\n assert.ok(!_.isEqual(new String('Curly'), new String('Larry')), 'String objects with different primitive values are not equal');\n assert.ok(!_.isEqual(new String('Curly'), {toString: function(){ return 'Curly'; }}), 'String objects and objects with a custom `toString` method are not equal');\n\n // Number object and primitive comparisons.\n assert.ok(_.isEqual(75, 75), 'Identical number primitives are equal');\n assert.ok(_.isEqual(new Number(75), new Number(75)), 'Number objects with identical primitive values are equal');\n assert.ok(_.isEqual(75, new Number(75)), 'Number primitives and their corresponding object wrappers are equal');\n assert.ok(_.isEqual(new Number(75), 75), 'Commutative equality is implemented for number objects and primitives');\n assert.ok(!_.isEqual(new Number(0), -0), '`new Number(0)` and `-0` are not equal');\n assert.ok(!_.isEqual(0, new Number(-0)), 'Commutative equality is implemented for `new Number(0)` and `-0`');\n\n assert.ok(!_.isEqual(new Number(75), new Number(63)), 'Number objects with different primitive values are not equal');\n assert.ok(!_.isEqual(new Number(63), {valueOf: function(){ return 63; }}), 'Number objects and objects with a `valueOf` method are not equal');\n\n // Comparisons involving `NaN`.\n assert.ok(_.isEqual(NaN, NaN), '`NaN` is equal to `NaN`');\n assert.ok(_.isEqual(new Number(NaN), NaN), 'Object(`NaN`) is equal to `NaN`');\n assert.ok(!_.isEqual(61, NaN), 'A number primitive is not equal to `NaN`');\n assert.ok(!_.isEqual(new Number(79), NaN), 'A number object is not equal to `NaN`');\n assert.ok(!_.isEqual(Infinity, NaN), '`Infinity` is not equal to `NaN`');\n\n // Boolean object and primitive comparisons.\n assert.ok(_.isEqual(true, true), 'Identical boolean primitives are equal');\n assert.ok(_.isEqual(new Boolean, new Boolean), 'Boolean objects with identical primitive values are equal');\n assert.ok(_.isEqual(true, new Boolean(true)), 'Boolean primitives and their corresponding object wrappers are equal');\n assert.ok(_.isEqual(new Boolean(true), true), 'Commutative equality is implemented for booleans');\n assert.ok(!_.isEqual(new Boolean(true), new Boolean), 'Boolean objects with different primitive values are not equal');\n\n // Common type coercions.\n assert.ok(!_.isEqual(new Boolean(false), true), '`new Boolean(false)` is not equal to `true`');\n assert.ok(!_.isEqual('75', 75), 'String and number primitives with like values are not equal');\n assert.ok(!_.isEqual(new Number(63), new String(63)), 'String and number objects with like values are not equal');\n assert.ok(!_.isEqual(75, '75'), 'Commutative equality is implemented for like string and number values');\n assert.ok(!_.isEqual(0, ''), 'Number and string primitives with like values are not equal');\n assert.ok(!_.isEqual(1, true), 'Number and boolean primitives with like values are not equal');\n assert.ok(!_.isEqual(new Boolean(false), new Number(0)), 'Boolean and number objects with like values are not equal');\n assert.ok(!_.isEqual(false, new String('')), 'Boolean primitives and string objects with like values are not equal');\n assert.ok(!_.isEqual(12564504e5, new Date(2009, 9, 25)), 'Dates and their corresponding numeric primitive values are not equal');\n\n // Dates.\n assert.ok(_.isEqual(new Date(2009, 9, 25), new Date(2009, 9, 25)), 'Date objects referencing identical times are equal');\n assert.ok(!_.isEqual(new Date(2009, 9, 25), new Date(2009, 11, 13)), 'Date objects referencing different times are not equal');\n assert.ok(!_.isEqual(new Date(2009, 11, 13), {\n getTime: function(){\n return 12606876e5;\n }\n }), 'Date objects and objects with a `getTime` method are not equal');\n assert.ok(!_.isEqual(new Date('Curly'), new Date('Curly')), 'Invalid dates are not equal');\n\n // Functions.\n assert.ok(!_.isEqual(First, Second), 'Different functions with identical bodies and source code representations are not equal');\n\n // RegExps.\n assert.ok(_.isEqual(/(?:)/gim, /(?:)/gim), 'RegExps with equivalent patterns and flags are equal');\n assert.ok(_.isEqual(/(?:)/gi, /(?:)/ig), 'Flag order is not significant');\n assert.ok(!_.isEqual(/(?:)/g, /(?:)/gi), 'RegExps with equivalent patterns and different flags are not equal');\n assert.ok(!_.isEqual(/Moe/gim, /Curly/gim), 'RegExps with different patterns and equivalent flags are not equal');\n assert.ok(!_.isEqual(/(?:)/gi, /(?:)/g), 'Commutative equality is implemented for RegExps');\n assert.ok(!_.isEqual(/Curly/g, {source: 'Larry', global: true, ignoreCase: false, multiline: false}), 'RegExps and RegExp-like objects are not equal');\n\n // Empty arrays, array-like objects, and object literals.\n assert.ok(_.isEqual({}, {}), 'Empty object literals are equal');\n assert.ok(_.isEqual([], []), 'Empty array literals are equal');\n assert.ok(_.isEqual([{}], [{}]), 'Empty nested arrays and objects are equal');\n assert.ok(!_.isEqual({length: 0}, []), 'Array-like objects and arrays are not equal.');\n assert.ok(!_.isEqual([], {length: 0}), 'Commutative equality is implemented for array-like objects');\n\n assert.ok(!_.isEqual({}, []), 'Object literals and array literals are not equal');\n assert.ok(!_.isEqual([], {}), 'Commutative equality is implemented for objects and arrays');\n\n // Arrays with primitive and object values.\n assert.ok(_.isEqual([1, 'Larry', true], [1, 'Larry', true]), 'Arrays containing identical primitives are equal');\n assert.ok(_.isEqual([/Moe/g, new Date(2009, 9, 25)], [/Moe/g, new Date(2009, 9, 25)]), 'Arrays containing equivalent elements are equal');\n\n // Multi-dimensional arrays.\n var a = [new Number(47), false, 'Larry', /Moe/, new Date(2009, 11, 13), ['running', 'biking', new String('programming')], {a: 47}];\n var b = [new Number(47), false, 'Larry', /Moe/, new Date(2009, 11, 13), ['running', 'biking', new String('programming')], {a: 47}];\n assert.ok(_.isEqual(a, b), 'Arrays containing nested arrays and objects are recursively compared');\n\n // Overwrite the methods defined in ES 5.1 section 15.4.4.\n a.forEach = a.map = a.filter = a.every = a.indexOf = a.lastIndexOf = a.some = a.reduce = a.reduceRight = null;\n b.join = b.pop = b.reverse = b.shift = b.slice = b.splice = b.concat = b.sort = b.unshift = null;\n\n // Array elements and properties.\n assert.ok(_.isEqual(a, b), 'Arrays containing equivalent elements and different non-numeric properties are equal');\n a.push('White Rocks');\n assert.ok(!_.isEqual(a, b), 'Arrays of different lengths are not equal');\n a.push('East Boulder');\n b.push('Gunbarrel Ranch', 'Teller Farm');\n assert.ok(!_.isEqual(a, b), 'Arrays of identical lengths containing different elements are not equal');\n\n // Sparse arrays.\n assert.ok(_.isEqual(Array(3), Array(3)), 'Sparse arrays of identical lengths are equal');\n assert.ok(!_.isEqual(Array(3), Array(6)), 'Sparse arrays of different lengths are not equal when both are empty');\n\n var sparse = [];\n sparse[1] = 5;\n assert.ok(_.isEqual(sparse, [void 0, 5]), 'Handles sparse arrays as dense');\n\n // Simple objects.\n assert.ok(_.isEqual({a: 'Curly', b: 1, c: true}, {a: 'Curly', b: 1, c: true}), 'Objects containing identical primitives are equal');\n assert.ok(_.isEqual({a: /Curly/g, b: new Date(2009, 11, 13)}, {a: /Curly/g, b: new Date(2009, 11, 13)}), 'Objects containing equivalent members are equal');\n assert.ok(!_.isEqual({a: 63, b: 75}, {a: 61, b: 55}), 'Objects of identical sizes with different values are not equal');\n assert.ok(!_.isEqual({a: 63, b: 75}, {a: 61, c: 55}), 'Objects of identical sizes with different property names are not equal');\n assert.ok(!_.isEqual({a: 1, b: 2}, {a: 1}), 'Objects of different sizes are not equal');\n assert.ok(!_.isEqual({a: 1}, {a: 1, b: 2}), 'Commutative equality is implemented for objects');\n assert.ok(!_.isEqual({x: 1, y: void 0}, {x: 1, z: 2}), 'Objects with identical keys and different values are not equivalent');\n\n // Extremely deeply nested objects (CVE-2026-27601).\n a = b = 'v';\n for (var i = 0; i < 30000; ++i) {\n a = {x: a};\n b = {x: b};\n }\n assert.ok(_.isEqual(a, b), 'Very deeply nested objects can be equal');\n b = {x: b};\n assert.ok(!_.isEqual(a, b), 'Very deeply nested objects can be different');\n assert.ok(!_.isEqual(b, a), 'Commutative equality is implemented for very deeply nested objects');\n\n // `A` contains nested objects and arrays.\n a = {\n name: new String('Moe Howard'),\n age: new Number(77),\n stooge: true,\n hobbies: ['acting'],\n film: {\n name: 'Sing a Song of Six Pants',\n release: new Date(1947, 9, 30),\n stars: [new String('Larry Fine'), 'Shemp Howard'],\n minutes: new Number(16),\n seconds: 54\n }\n };\n\n // `B` contains equivalent nested objects and arrays.\n b = {\n name: new String('Moe Howard'),\n age: new Number(77),\n stooge: true,\n hobbies: ['acting'],\n film: {\n name: 'Sing a Song of Six Pants',\n release: new Date(1947, 9, 30),\n stars: [new String('Larry Fine'), 'Shemp Howard'],\n minutes: new Number(16),\n seconds: 54\n }\n };\n assert.ok(_.isEqual(a, b), 'Objects with nested equivalent members are recursively compared');\n\n // Instances.\n assert.ok(_.isEqual(new First, new First), 'Object instances are equal');\n assert.ok(!_.isEqual(new First, new Second), 'Objects with different constructors and identical own properties are not equal');\n assert.ok(!_.isEqual({value: 1}, new First), 'Object instances and objects sharing equivalent properties are not equal');\n assert.ok(!_.isEqual({value: 2}, new Second), 'The prototype chain of objects should not be examined');\n\n // Circular Arrays.\n (a = []).push(a);\n (b = []).push(b);\n assert.ok(_.isEqual(a, b), 'Arrays containing circular references are equal');\n a.push(new String('Larry'));\n b.push(new String('Larry'));\n assert.ok(_.isEqual(a, b), 'Arrays containing circular references and equivalent properties are equal');\n a.push('Shemp');\n b.push('Curly');\n assert.ok(!_.isEqual(a, b), 'Arrays containing circular references and different properties are not equal');\n\n // More circular arrays #767.\n a = ['everything is checked but', 'this', 'is not'];\n a[1] = a;\n b = ['everything is checked but', ['this', 'array'], 'is not'];\n assert.ok(!_.isEqual(a, b), 'Comparison of circular references with non-circular references are not equal');\n\n // Circular Objects.\n a = {abc: null};\n b = {abc: null};\n a.abc = a;\n b.abc = b;\n assert.ok(_.isEqual(a, b), 'Objects containing circular references are equal');\n a.def = 75;\n b.def = 75;\n assert.ok(_.isEqual(a, b), 'Objects containing circular references and equivalent properties are equal');\n a.def = new Number(75);\n b.def = new Number(63);\n assert.ok(!_.isEqual(a, b), 'Objects containing circular references and different properties are not equal');\n\n // More circular objects #767.\n a = {everything: 'is checked', but: 'this', is: 'not'};\n a.but = a;\n b = {everything: 'is checked', but: {that: 'object'}, is: 'not'};\n assert.ok(!_.isEqual(a, b), 'Comparison of circular references with non-circular object references are not equal');\n\n // Cyclic Structures.\n a = [{abc: null}];\n b = [{abc: null}];\n (a[0].abc = a).push(a);\n (b[0].abc = b).push(b);\n assert.ok(_.isEqual(a, b), 'Cyclic structures are equal');\n a[0].def = 'Larry';\n b[0].def = 'Larry';\n assert.ok(_.isEqual(a, b), 'Cyclic structures containing equivalent properties are equal');\n a[0].def = new String('Larry');\n b[0].def = new String('Curly');\n assert.ok(!_.isEqual(a, b), 'Cyclic structures containing different properties are not equal');\n\n // Complex Circular References.\n a = {foo: {b: {foo: {c: {foo: null}}}}};\n b = {foo: {b: {foo: {c: {foo: null}}}}};\n a.foo.b.foo.c.foo = a;\n b.foo.b.foo.c.foo = b;\n assert.ok(_.isEqual(a, b), 'Cyclic structures with nested and identically-named properties are equal');\n\n // Chaining.\n assert.ok(!_.isEqual(_({x: 1, y: void 0}).chain(), _({x: 1, z: 2}).chain()), 'Chained objects containing different values are not equal');\n\n a = _({x: 1, y: 2}).chain();\n b = _({x: 1, y: 2}).chain();\n assert.strictEqual(_.isEqual(a.isEqual(b), _(true)), true, '`isEqual` can be chained');\n\n // Objects without a `constructor` property\n if (Object.create) {\n a = Object.create(null, {x: {value: 1, enumerable: true}});\n b = {x: 1};\n assert.ok(_.isEqual(a, b), 'Handles objects without a constructor (e.g. from Object.create');\n }\n\n function Foo() { this.a = 1; }\n Foo.prototype.constructor = null;\n\n var other = {a: 1};\n assert.strictEqual(_.isEqual(new Foo, other), false, 'Objects from different constructors are not equal');\n\n\n // Tricky object cases val comparisons\n assert.strictEqual(_.isEqual([0], [-0]), false);\n assert.strictEqual(_.isEqual({a: 0}, {a: -0}), false);\n assert.strictEqual(_.isEqual([NaN], [NaN]), true);\n assert.strictEqual(_.isEqual({a: NaN}, {a: NaN}), true);\n\n if (typeof Symbol !== 'undefined') {\n var symbol = Symbol('x');\n assert.strictEqual(_.isEqual(symbol, symbol), true, 'A symbol is equal to itself');\n assert.strictEqual(_.isEqual(symbol, Object(symbol)), true, 'Even when wrapped in Object()');\n assert.strictEqual(_.isEqual(symbol, null), false, 'Different types are not equal');\n\n var symbolY = Symbol('y');\n assert.strictEqual(_.isEqual(symbol, symbolY), false, 'Different symbols are not equal');\n\n var sameStringSymbol = Symbol('x');\n assert.strictEqual(_.isEqual(symbol, sameStringSymbol), false, 'Different symbols of same string are not equal');\n }\n\n // typed arrays\n if (typeof ArrayBuffer !== 'undefined') {\n var u8 = new Uint8Array([1, 2]);\n var u8b = new Uint8Array([1, 2]);\n var i8 = new Int8Array([1, 2]);\n var u16 = new Uint16Array([1, 2]);\n var u16one = new Uint16Array([3]);\n\n assert.ok(_.isEqual(u8, u8b), 'Identical typed array data are equal');\n assert.ok(_.isEqual(u8.buffer, u8b.buffer), 'Identical ArrayBuffers are equal');\n assert.ok(_.isEqual(u8.buffer, i8.buffer), 'Identical ArrayBuffers of different typed arrays are equal');\n\n assert.notOk(_.isEqual({a: 1, buffer: u8.buffer}, {a: 2, buffer: u8b.buffer}), 'Unequal objects with similar buffer properties are not equals');\n\n assert.notOk(_.isEqual(u8, i8), 'Different types of typed arrays with the same byte data are not equal');\n assert.notOk(_.isEqual(u8, u16), 'Typed arrays with different types and different byte length are not equal');\n assert.notOk(_.isEqual(u8, u16one), 'Typed arrays with different types, same byte length but different byte data are not equal');\n assert.notOk(_.isEqual(u8.buffer, u16.buffer), 'Different ArrayBuffers with different length are not equal');\n assert.notOk(_.isEqual(u8.buffer, u16one.buffer), 'Different ArrayBuffers with different byte data are not equal');\n\n // Regression tests for #2875.\n var shared = new Uint8Array([1, 2, 3, 4]);\n var view1 = new Uint8Array(shared.buffer, 0, 2);\n var view2 = new Uint8Array(shared.buffer, 2, 2);\n assert.notOk(_.isEqual(view1, view2), 'same buffer with different offset is not equal');\n\n // Some older browsers support typed arrays but not DataView.\n if (DataViewImpl) {\n assert.ok(_.isEqual(new DataViewImpl(u8.buffer), new DataViewImpl(u8b.buffer)), 'Identical DataViews are equal');\n assert.ok(_.isEqual(new DataViewImpl(u8.buffer), new DataViewImpl(i8.buffer)), 'Identical DataViews of different typed arrays are equal');\n assert.notOk(_.isEqual(new DataViewImpl(u8.buffer), new DataViewImpl(u16.buffer)), 'Different DataViews with different length are not equal');\n assert.notOk(_.isEqual(new DataViewImpl(u8.buffer), new DataViewImpl(u16one.buffer)), 'Different DataViews with different byte data are not equal');\n }\n }\n });\n\n QUnit.test('isEmpty', function(assert) {\n assert.ok(!_([1]).isEmpty(), '[1] is not empty');\n assert.ok(_.isEmpty([]), '[] is empty');\n assert.ok(!_.isEmpty({one: 1}), '{one: 1} is not empty');\n assert.ok(_.isEmpty({}), '{} is empty');\n assert.ok(_.isEmpty(new RegExp('')), 'objects with prototype properties are empty');\n assert.ok(_.isEmpty(null), 'null is empty');\n assert.ok(_.isEmpty(), 'undefined is empty');\n assert.ok(_.isEmpty(''), 'the empty string is empty');\n assert.ok(!_.isEmpty('moe'), 'but other strings are not');\n\n var obj = {one: 1};\n delete obj.one;\n assert.ok(_.isEmpty(obj), 'deleting all the keys from an object empties it');\n\n var args = function(){ return arguments; };\n assert.ok(_.isEmpty(args()), 'empty arguments object is empty');\n assert.ok(!_.isEmpty(args('')), 'non-empty arguments object is not empty');\n\n // covers collecting non-enumerable properties in IE < 9\n var nonEnumProp = {toString: 5};\n assert.ok(!_.isEmpty(nonEnumProp), 'non-enumerable property is not empty');\n });\n\n if (typeof document === 'object') {\n QUnit.test('isElement', function(assert) {\n assert.ok(!_.isElement('div'), 'strings are not dom elements');\n assert.ok(_.isElement(testElement), 'an element is a DOM element');\n });\n }\n\n QUnit.test('isArguments', function(assert) {\n var args = (function(){ return arguments; }(1, 2, 3));\n assert.ok(!_.isArguments('string'), 'a string is not an arguments object');\n assert.ok(!_.isArguments(_.isArguments), 'a function is not an arguments object');\n assert.ok(_.isArguments(args), 'but the arguments object is an arguments object');\n assert.ok(!_.isArguments(_.toArray(args)), 'but not when it\\'s converted into an array');\n assert.ok(!_.isArguments([1, 2, 3]), 'and not vanilla arrays.');\n });\n\n QUnit.test('isObject', function(assert) {\n assert.ok(_.isObject(arguments), 'the arguments object is object');\n assert.ok(_.isObject([1, 2, 3]), 'and arrays');\n if (testElement) {\n assert.ok(_.isObject(testElement), 'and DOM element');\n }\n assert.ok(_.isObject(function() {}), 'and functions');\n assert.ok(!_.isObject(null), 'but not null');\n assert.ok(!_.isObject(void 0), 'and not undefined');\n assert.ok(!_.isObject('string'), 'and not string');\n assert.ok(!_.isObject(12), 'and not number');\n assert.ok(!_.isObject(true), 'and not boolean');\n assert.ok(_.isObject(new String('string')), 'but new String()');\n });\n\n QUnit.test('isArray', function(assert) {\n assert.ok(!_.isArray(void 0), 'undefined vars are not arrays');\n assert.ok(!_.isArray(arguments), 'the arguments object is not an array');\n assert.ok(_.isArray([1, 2, 3]), 'but arrays are');\n });\n\n QUnit.test('isString', function(assert) {\n var obj = new String('I am a string object');\n if (testElement) {\n assert.ok(!_.isString(testElement), 'an element is not a string');\n }\n assert.ok(_.isString([1, 2, 3].join(', ')), 'but strings are');\n assert.strictEqual(_.isString('I am a string literal'), true, 'string literals are');\n assert.ok(_.isString(obj), 'so are String objects');\n assert.strictEqual(_.isString(1), false);\n });\n\n QUnit.test('isSymbol', function(assert) {\n assert.ok(!_.isSymbol(0), 'numbers are not symbols');\n assert.ok(!_.isSymbol(''), 'strings are not symbols');\n assert.ok(!_.isSymbol(_.isSymbol), 'functions are not symbols');\n if (typeof Symbol === 'function') {\n assert.ok(_.isSymbol(Symbol()), 'symbols are symbols');\n assert.ok(_.isSymbol(Symbol('description')), 'described symbols are symbols');\n assert.ok(_.isSymbol(Object(Symbol())), 'boxed symbols are symbols');\n }\n });\n\n QUnit.test('isNumber', function(assert) {\n assert.ok(!_.isNumber('string'), 'a string is not a number');\n assert.ok(!_.isNumber(arguments), 'the arguments object is not a number');\n assert.ok(!_.isNumber(void 0), 'undefined is not a number');\n assert.ok(_.isNumber(3 * 4 - 7 / 10), 'but numbers are');\n assert.ok(_.isNumber(NaN), 'NaN *is* a number');\n assert.ok(_.isNumber(Infinity), 'Infinity is a number');\n assert.ok(!_.isNumber('1'), 'numeric strings are not numbers');\n });\n\n QUnit.test('isBoolean', function(assert) {\n assert.ok(!_.isBoolean(2), 'a number is not a boolean');\n assert.ok(!_.isBoolean('string'), 'a string is not a boolean');\n assert.ok(!_.isBoolean('false'), 'the string \"false\" is not a boolean');\n assert.ok(!_.isBoolean('true'), 'the string \"true\" is not a boolean');\n assert.ok(!_.isBoolean(arguments), 'the arguments object is not a boolean');\n assert.ok(!_.isBoolean(void 0), 'undefined is not a boolean');\n assert.ok(!_.isBoolean(NaN), 'NaN is not a boolean');\n assert.ok(!_.isBoolean(null), 'null is not a boolean');\n assert.ok(_.isBoolean(true), 'but true is');\n assert.ok(_.isBoolean(false), 'and so is false');\n });\n\n QUnit.test('isMap', function(assert) {\n assert.ok(!_.isMap('string'), 'a string is not a map');\n assert.ok(!_.isMap(2), 'a number is not a map');\n assert.ok(!_.isMap({}), 'an object is not a map');\n assert.ok(!_.isMap(false), 'a boolean is not a map');\n assert.ok(!_.isMap(void 0), 'undefined is not a map');\n assert.ok(!_.isMap([1, 2, 3]), 'an array is not a map');\n if (typeof Set === 'function') {\n assert.ok(!_.isMap(new Set()), 'a set is not a map');\n }\n if (typeof WeakSet === 'function') {\n assert.ok(!_.isMap(new WeakSet()), 'a weakset is not a map');\n }\n if (typeof WeakMap === 'function') {\n assert.ok(!_.isMap(new WeakMap()), 'a weakmap is not a map');\n }\n if (typeof Map === 'function') {\n var keyString = 'a string';\n var obj = new Map();\n obj.set(keyString, \"value associated with 'a string'\");\n assert.ok(_.isMap(obj), 'but a map is');\n }\n });\n\n QUnit.test('isWeakMap', function(assert) {\n assert.ok(!_.isWeakMap('string'), 'a string is not a weakmap');\n assert.ok(!_.isWeakMap(2), 'a number is not a weakmap');\n assert.ok(!_.isWeakMap({}), 'an object is not a weakmap');\n assert.ok(!_.isWeakMap(false), 'a boolean is not a weakmap');\n assert.ok(!_.isWeakMap(void 0), 'undefined is not a weakmap');\n assert.ok(!_.isWeakMap([1, 2, 3]), 'an array is not a weakmap');\n if (typeof Set === 'function') {\n assert.ok(!_.isWeakMap(new Set()), 'a set is not a weakmap');\n }\n if (typeof WeakSet === 'function') {\n assert.ok(!_.isWeakMap(new WeakSet()), 'a weakset is not a weakmap');\n }\n if (typeof Map === 'function') {\n assert.ok(!_.isWeakMap(new Map()), 'a map is not a weakmap');\n }\n if (typeof WeakMap === 'function') {\n var keyObj = {}, obj = new WeakMap();\n obj.set(keyObj, 'value');\n assert.ok(_.isWeakMap(obj), 'but a weakmap is');\n }\n });\n\n QUnit.test('isSet', function(assert) {\n assert.ok(!_.isSet('string'), 'a string is not a set');\n assert.ok(!_.isSet(2), 'a number is not a set');\n assert.ok(!_.isSet({}), 'an object is not a set');\n assert.ok(!_.isSet(false), 'a boolean is not a set');\n assert.ok(!_.isSet(void 0), 'undefined is not a set');\n assert.ok(!_.isSet([1, 2, 3]), 'an array is not a set');\n if (typeof Map === 'function') {\n assert.ok(!_.isSet(new Map()), 'a map is not a set');\n }\n if (typeof WeakMap === 'function') {\n assert.ok(!_.isSet(new WeakMap()), 'a weakmap is not a set');\n }\n if (typeof WeakSet === 'function') {\n assert.ok(!_.isSet(new WeakSet()), 'a weakset is not a set');\n }\n if (typeof Set === 'function') {\n var obj = new Set([1, 2, 3, 4, 5]);\n assert.ok(_.isSet(obj), 'but a set is');\n }\n });\n\n QUnit.test('isWeakSet', function(assert) {\n\n assert.ok(!_.isWeakSet('string'), 'a string is not a weakset');\n assert.ok(!_.isWeakSet(2), 'a number is not a weakset');\n assert.ok(!_.isWeakSet({}), 'an object is not a weakset');\n assert.ok(!_.isWeakSet(false), 'a boolean is not a weakset');\n assert.ok(!_.isWeakSet(void 0), 'undefined is not a weakset');\n assert.ok(!_.isWeakSet([1, 2, 3]), 'an array is not a weakset');\n if (typeof Map === 'function') {\n assert.ok(!_.isWeakSet(new Map()), 'a map is not a weakset');\n }\n if (typeof WeakMap === 'function') {\n assert.ok(!_.isWeakSet(new WeakMap()), 'a weakmap is not a weakset');\n }\n if (typeof Set === 'function') {\n assert.ok(!_.isWeakSet(new Set()), 'a set is not a weakset');\n }\n if (typeof WeakSet === 'function') {\n var obj = new WeakSet();\n obj.add({x: 1}, {y: 'string'}).add({y: 'string'}).add({z: [1, 2, 3]});\n assert.ok(_.isWeakSet(obj), 'but a weakset is');\n }\n });\n\n QUnit.test('isFunction', function(assert) {\n assert.ok(!_.isFunction(void 0), 'undefined vars are not functions');\n assert.ok(!_.isFunction([1, 2, 3]), 'arrays are not functions');\n assert.ok(!_.isFunction('moe'), 'strings are not functions');\n assert.ok(_.isFunction(_.isFunction), 'but functions are');\n assert.ok(_.isFunction(function(){}), 'even anonymous ones');\n\n if (testElement) {\n assert.ok(!_.isFunction(testElement), 'elements are not functions');\n }\n\n var nodelist = typeof document != 'undefined' && document.childNodes;\n if (nodelist) {\n assert.ok(!_.isFunction(nodelist));\n }\n });\n\n if (typeof Int8Array !== 'undefined') {\n QUnit.test('#1929 Typed Array constructors are functions', function(assert) {\n _.chain(['Float32Array', 'Float64Array', 'Int8Array', 'Int16Array', 'Int32Array', 'Uint8Array', 'Uint8ClampedArray', 'Uint16Array', 'Uint32Array'])\n .map(_.propertyOf(typeof global != 'undefined' ? global : window))\n .compact()\n .each(function(TypedArray) {\n // PhantomJS reports `typeof UInt8Array == 'object'` and doesn't report toString TypeArray\n // as a function\n assert.strictEqual(_.isFunction(TypedArray), Object.prototype.toString.call(TypedArray) === '[object Function]');\n });\n });\n }\n\n QUnit.test('isDate', function(assert) {\n assert.ok(!_.isDate(100), 'numbers are not dates');\n assert.ok(!_.isDate({}), 'objects are not dates');\n assert.ok(_.isDate(new Date()), 'but dates are');\n });\n\n QUnit.test('isRegExp', function(assert) {\n assert.ok(!_.isRegExp(_.identity), 'functions are not RegExps');\n assert.ok(_.isRegExp(/identity/), 'but RegExps are');\n });\n\n QUnit.test('isFinite', function(assert) {\n assert.ok(!_.isFinite(void 0), 'undefined is not finite');\n assert.ok(!_.isFinite(null), 'null is not finite');\n assert.ok(!_.isFinite(NaN), 'NaN is not finite');\n assert.ok(!_.isFinite(Infinity), 'Infinity is not finite');\n assert.ok(!_.isFinite(-Infinity), '-Infinity is not finite');\n assert.ok(_.isFinite('12'), 'Numeric strings are numbers');\n assert.ok(!_.isFinite('1a'), 'Non numeric strings are not numbers');\n assert.ok(!_.isFinite(''), 'Empty strings are not numbers');\n var obj = new Number(5);\n assert.ok(_.isFinite(obj), 'Number instances can be finite');\n assert.ok(_.isFinite(0), '0 is finite');\n assert.ok(_.isFinite(123), 'Ints are finite');\n assert.ok(_.isFinite(-12.44), 'Floats are finite');\n if (typeof Symbol === 'function') {\n assert.ok(!_.isFinite(Symbol()), 'symbols are not numbers');\n assert.ok(!_.isFinite(Symbol('description')), 'described symbols are not numbers');\n assert.ok(!_.isFinite(Object(Symbol())), 'boxed symbols are not numbers');\n }\n });\n\n QUnit.test('isNaN', function(assert) {\n assert.ok(!_.isNaN(void 0), 'undefined is not NaN');\n assert.ok(!_.isNaN(null), 'null is not NaN');\n assert.ok(!_.isNaN(0), '0 is not NaN');\n assert.ok(!_.isNaN(new Number(0)), 'wrapped 0 is not NaN');\n assert.ok(_.isNaN(NaN), 'but NaN is');\n assert.ok(_.isNaN(new Number(NaN)), 'wrapped NaN is still NaN');\n if (typeof Symbol !== 'undefined'){\n assert.ok(!_.isNaN(Symbol()), 'symbol is not NaN');\n }\n });\n\n QUnit.test('isNull', function(assert) {\n assert.ok(!_.isNull(void 0), 'undefined is not null');\n assert.ok(!_.isNull(NaN), 'NaN is not null');\n assert.ok(_.isNull(null), 'but null is');\n });\n\n QUnit.test('isUndefined', function(assert) {\n assert.ok(!_.isUndefined(1), 'numbers are defined');\n assert.ok(!_.isUndefined(null), 'null is defined');\n assert.ok(!_.isUndefined(false), 'false is defined');\n assert.ok(!_.isUndefined(NaN), 'NaN is defined');\n assert.ok(_.isUndefined(), 'nothing is undefined');\n assert.ok(_.isUndefined(void 0), 'undefined is undefined');\n });\n\n QUnit.test('isError', function(assert) {\n assert.ok(!_.isError(1), 'numbers are not Errors');\n assert.ok(!_.isError(null), 'null is not an Error');\n assert.ok(!_.isError(Error), 'functions are not Errors');\n assert.ok(_.isError(new Error()), 'Errors are Errors');\n assert.ok(_.isError(new EvalError()), 'EvalErrors are Errors');\n assert.ok(_.isError(new RangeError()), 'RangeErrors are Errors');\n assert.ok(_.isError(new ReferenceError()), 'ReferenceErrors are Errors');\n assert.ok(_.isError(new SyntaxError()), 'SyntaxErrors are Errors');\n assert.ok(_.isError(new TypeError()), 'TypeErrors are Errors');\n assert.ok(_.isError(new URIError()), 'URIErrors are Errors');\n });\n\n if (typeof ArrayBuffer != 'undefined') {\n QUnit.test('isArrayBuffer, isDataView and isTypedArray', function(assert) {\n var buffer = new ArrayBuffer(16);\n var checkValues = {\n 'null': null,\n 'a string': '',\n 'an array': [],\n 'an ArrayBuffer': buffer,\n 'a TypedArray': new Uint8Array(buffer)\n };\n // Some older browsers support typed arrays but not DataView.\n if (DataViewImpl) {\n checkValues['a DataView'] = new DataViewImpl(buffer);\n }\n var types = ['an ArrayBuffer', 'a DataView', 'a TypedArray'];\n _.each(types, function(type) {\n var typeCheck = _['is' + type.split(' ')[1]];\n _.each(checkValues, function(value, description) {\n if (description === type) {\n assert.ok(typeCheck(value), description + ' is ' + type);\n } else {\n assert.ok(!typeCheck(value), description + ' is not ' + type);\n }\n });\n });\n });\n\n QUnit.test('isTypedArray', function(assert) {\n var buffer = new ArrayBuffer(16);\n var typedArrayTypes = [Int8Array, Uint16Array, Int16Array, Uint32Array, Int32Array, Float32Array, Float64Array];\n if (typeof Uint8ClampedArray != 'undefined') {\n typedArrayTypes.push(Uint8ClampedArray);\n }\n if (typeof BigInt64Array != 'undefined') {\n typedArrayTypes.push(BigInt64Array);\n }\n _.each(typedArrayTypes, function(ctor) {\n assert.ok(_.isTypedArray(new ctor(buffer)), ctor.name + ' is a typed array');\n });\n\n });\n }\n\n QUnit.test('tap', function(assert) {\n var intercepted = null;\n var interceptor = function(obj) { intercepted = obj; };\n var returned = _.tap(1, interceptor);\n assert.strictEqual(intercepted, 1, 'passes tapped object to interceptor');\n assert.strictEqual(returned, 1, 'returns tapped object');\n\n returned = _([1, 2, 3]).chain().\n map(function(n){ return n * 2; }).\n max().\n tap(interceptor).\n value();\n assert.strictEqual(returned, 6, 'can use tapped objects in a chain');\n assert.strictEqual(intercepted, returned, 'can use tapped objects in a chain');\n });\n\n QUnit.test('has', function(assert) {\n var obj = {foo: 'bar', func: function(){}};\n assert.ok(_.has(obj, 'foo'), 'checks that the object has a property.');\n assert.ok(!_.has(obj, 'baz'), \"returns false if the object doesn't have the property.\");\n assert.ok(_.has(obj, 'func'), 'works for functions too.');\n obj.hasOwnProperty = null;\n assert.ok(_.has(obj, 'foo'), 'works even when the hasOwnProperty method is deleted.');\n function Child() {}\n Child.prototype = obj;\n var child = new Child();\n assert.ok(!_.has(child, 'foo'), 'does not check the prototype chain for a property.');\n assert.strictEqual(_.has(null, 'foo'), false, 'returns false for null');\n assert.strictEqual(_.has(void 0, 'foo'), false, 'returns false for undefined');\n\n assert.ok(_.has({a: {b: 'foo'}}, ['a', 'b']), 'can check for nested properties.');\n assert.ok(!_.has({a: child}, ['a', 'foo']), 'does not check the prototype of nested props.');\n });\n\n QUnit.test('get', function(assert) {\n var stooge = {name: 'moe'};\n assert.strictEqual(_.get(stooge, 'name'), 'moe', 'should return the property with the given name');\n assert.strictEqual(_.get(null, 'name'), void 0, 'should return undefined for null values');\n assert.strictEqual(_.get(void 0, 'name'), void 0, 'should return undefined for undefined values');\n assert.strictEqual(_.get('foo', null), void 0, 'should return undefined for null object');\n assert.strictEqual(_.get({x: null}, 'x'), null, 'can fetch null values');\n assert.strictEqual(_.get(null, 'length'), void 0, 'does not crash on property access of non-objects');\n assert.strictEqual(_.get(stooge, 'size', 10), 10, 'allows a fallback value for undefined properties');\n assert.strictEqual(_.get(stooge, 'name', 10), 'moe', 'ignores the fallback value if the property is defined');\n\n // Deep property access\n assert.strictEqual(_.get({a: 1}, 'a'), 1, 'can get a direct property');\n assert.strictEqual(_.get({a: {b: 2}}, ['a', 'b']), 2, 'can get a nested property');\n assert.strictEqual(_.get({a: {b: 2}}, ['a', 'c'], 10), 10, 'allows a fallback value for undefined properties');\n assert.strictEqual(_.get({a: {b: 2}}, ['a', 'b'], 10), 2, 'ignores the fallback value if the property is defined');\n assert.strictEqual(_.get({a: false}, ['a']), false, 'can fetch falsy values');\n assert.strictEqual(_.get({x: {y: null}}, ['x', 'y']), null, 'can fetch null values deeply');\n assert.strictEqual(_.get({x: null}, ['x', 'y']), void 0, 'does not crash on property access of nested non-objects');\n assert.strictEqual(_.get({x: 'y'}, []), void 0, 'returns `undefined` for a path that is an empty array');\n });\n\n QUnit.test('property', function(assert) {\n var stooge = {name: 'moe'};\n assert.strictEqual(_.property('name')(stooge), 'moe', 'should return the property with the given name');\n assert.strictEqual(_.property('name')(null), void 0, 'should return undefined for null values');\n assert.strictEqual(_.property('name')(void 0), void 0, 'should return undefined for undefined values');\n assert.strictEqual(_.property(null)('foo'), void 0, 'should return undefined for null object');\n assert.strictEqual(_.property('x')({x: null}), null, 'can fetch null values');\n assert.strictEqual(_.property('length')(null), void 0, 'does not crash on property access of non-objects');\n\n // Deep property access\n assert.strictEqual(_.property('a')({a: 1}), 1, 'can get a direct property');\n assert.strictEqual(_.property(['a', 'b'])({a: {b: 2}}), 2, 'can get a nested property');\n assert.strictEqual(_.property(['a'])({a: false}), false, 'can fetch falsy values');\n assert.strictEqual(_.property(['x', 'y'])({x: {y: null}}), null, 'can fetch null values deeply');\n assert.strictEqual(_.property(['x', 'y'])({x: null}), void 0, 'does not crash on property access of nested non-objects');\n assert.strictEqual(_.property([])({x: 'y'}), void 0, 'returns `undefined` for a path that is an empty array');\n });\n\n QUnit.test('propertyOf', function(assert) {\n var stoogeRanks = _.propertyOf({curly: 2, moe: 1, larry: 3});\n assert.strictEqual(stoogeRanks('curly'), 2, 'should return the property with the given name');\n assert.strictEqual(stoogeRanks(null), void 0, 'should return undefined for null values');\n assert.strictEqual(stoogeRanks(void 0), void 0, 'should return undefined for undefined values');\n assert.strictEqual(_.propertyOf({a: null})('a'), null, 'can fetch null values');\n\n function MoreStooges() { this.shemp = 87; }\n MoreStooges.prototype = {curly: 2, moe: 1, larry: 3};\n var moreStoogeRanks = _.propertyOf(new MoreStooges());\n assert.strictEqual(moreStoogeRanks('curly'), 2, 'should return properties from further up the prototype chain');\n\n var nullPropertyOf = _.propertyOf(null);\n assert.strictEqual(nullPropertyOf('curly'), void 0, 'should return undefined when obj is null');\n\n var undefPropertyOf = _.propertyOf(void 0);\n assert.strictEqual(undefPropertyOf('curly'), void 0, 'should return undefined when obj is undefined');\n\n var deepPropertyOf = _.propertyOf({curly: {number: 2}, joe: {number: null}});\n assert.strictEqual(deepPropertyOf(['curly', 'number']), 2, 'can fetch nested properties of obj');\n assert.strictEqual(deepPropertyOf(['joe', 'number']), null, 'can fetch nested null properties of obj');\n });\n\n QUnit.test('isMatch', function(assert) {\n var moe = {name: 'Moe Howard', hair: true};\n var curly = {name: 'Curly Howard', hair: false};\n\n assert.strictEqual(_.isMatch(moe, {hair: true}), true, 'Returns a boolean');\n assert.strictEqual(_.isMatch(curly, {hair: true}), false, 'Returns a boolean');\n\n assert.strictEqual(_.isMatch(5, {__x__: void 0}), false, 'can match undefined props on primitives');\n assert.strictEqual(_.isMatch({__x__: void 0}, {__x__: void 0}), true, 'can match undefined props');\n\n assert.strictEqual(_.isMatch(null, {}), true, 'Empty spec called with null object returns true');\n assert.strictEqual(_.isMatch(null, {a: 1}), false, 'Non-empty spec called with null object returns false');\n\n _.each([null, void 0], function(item) { assert.strictEqual(_.isMatch(item, null), true, 'null matches null'); });\n _.each([null, void 0], function(item) { assert.strictEqual(_.isMatch(item, null), true, 'null matches {}'); });\n assert.strictEqual(_.isMatch({b: 1}, {a: void 0}), false, 'handles undefined values (1683)');\n\n _.each([true, 5, NaN, null, void 0], function(item) {\n assert.strictEqual(_.isMatch({a: 1}, item), true, 'treats primitives as empty');\n });\n\n function Prototest() {}\n Prototest.prototype.x = 1;\n var specObj = new Prototest;\n assert.strictEqual(_.isMatch({x: 2}, specObj), true, 'spec is restricted to own properties');\n\n specObj.y = 5;\n assert.strictEqual(_.isMatch({x: 1, y: 5}, specObj), true);\n assert.strictEqual(_.isMatch({x: 1, y: 4}, specObj), false);\n\n assert.ok(_.isMatch(specObj, {x: 1, y: 5}), 'inherited and own properties are checked on the test object');\n\n Prototest.x = 5;\n assert.ok(_.isMatch({x: 5, y: 1}, Prototest), 'spec can be a function');\n\n //null edge cases\n var oCon = {constructor: Object};\n assert.deepEqual(_.map([null, void 0, 5, {}], _.partial(_.isMatch, _, oCon)), [false, false, false, true], 'doesnt falsy match constructor on undefined/null');\n });\n\n QUnit.test('matcher', function(assert) {\n var moe = {name: 'Moe Howard', hair: true};\n var curly = {name: 'Curly Howard', hair: false};\n var stooges = [moe, curly];\n\n assert.strictEqual(_.matcher({hair: true})(moe), true, 'Returns a boolean');\n assert.strictEqual(_.matcher({hair: true})(curly), false, 'Returns a boolean');\n\n assert.strictEqual(_.matcher({__x__: void 0})(5), false, 'can match undefined props on primitives');\n assert.strictEqual(_.matcher({__x__: void 0})({__x__: void 0}), true, 'can match undefined props');\n\n assert.strictEqual(_.matcher({})(null), true, 'Empty spec called with null object returns true');\n assert.strictEqual(_.matcher({a: 1})(null), false, 'Non-empty spec called with null object returns false');\n\n assert.strictEqual(_.find(stooges, _.matcher({hair: false})), curly, 'returns a predicate that can be used by finding functions.');\n assert.strictEqual(_.find(stooges, _.matcher(moe)), moe, 'can be used to locate an object exists in a collection.');\n assert.deepEqual(_.filter([null, void 0], _.matcher({a: 1})), [], 'Do not throw on null values.');\n\n assert.deepEqual(_.filter([null, void 0], _.matcher(null)), [null, void 0], 'null matches null');\n assert.deepEqual(_.filter([null, void 0], _.matcher({})), [null, void 0], 'null matches {}');\n assert.deepEqual(_.filter([{b: 1}], _.matcher({a: void 0})), [], 'handles undefined values (1683)');\n\n _.each([true, 5, NaN, null, void 0], function(item) {\n assert.strictEqual(_.matcher(item)({a: 1}), true, 'treats primitives as empty');\n });\n\n function Prototest() {}\n Prototest.prototype.x = 1;\n var specObj = new Prototest;\n var protospec = _.matcher(specObj);\n assert.strictEqual(protospec({x: 2}), true, 'spec is restricted to own properties');\n\n specObj.y = 5;\n protospec = _.matcher(specObj);\n assert.strictEqual(protospec({x: 1, y: 5}), true);\n assert.strictEqual(protospec({x: 1, y: 4}), false);\n\n assert.ok(_.matcher({x: 1, y: 5})(specObj), 'inherited and own properties are checked on the test object');\n\n Prototest.x = 5;\n assert.ok(_.matcher(Prototest)({x: 5, y: 1}), 'spec can be a function');\n\n // #1729\n var o = {b: 1};\n var m = _.matcher(o);\n\n assert.strictEqual(m({b: 1}), true);\n o.b = 2;\n o.a = 1;\n assert.strictEqual(m({b: 1}), true, 'changing spec object doesnt change matches result');\n\n\n //null edge cases\n var oCon = _.matcher({constructor: Object});\n assert.deepEqual(_.map([null, void 0, 5, {}], oCon), [false, false, false, true], 'doesnt falsy match constructor on undefined/null');\n });\n\n QUnit.test('matches', function(assert) {\n assert.strictEqual(_.matches, _.matcher, 'is an alias for matcher');\n });\n\n QUnit.test('findKey', function(assert) {\n var objects = {\n a: {a: 0, b: 0},\n b: {a: 1, b: 1},\n c: {a: 2, b: 2}\n };\n\n assert.strictEqual(_.findKey(objects, function(obj) {\n return obj.a === 0;\n }), 'a');\n\n assert.strictEqual(_.findKey(objects, function(obj) {\n return obj.b * obj.a === 4;\n }), 'c');\n\n assert.strictEqual(_.findKey(objects, 'a'), 'b', 'Uses lookupIterator');\n\n assert.strictEqual(_.findKey(objects, function(obj) {\n return obj.b * obj.a === 5;\n }), void 0);\n\n assert.strictEqual(_.findKey([1, 2, 3, 4, 5, 6], function(obj) {\n return obj === 3;\n }), '2', 'Keys are strings');\n\n assert.strictEqual(_.findKey(objects, function(a) {\n return a.foo === null;\n }), void 0);\n\n _.findKey({a: {a: 1}}, function(a, key, obj) {\n assert.strictEqual(key, 'a');\n assert.deepEqual(obj, {a: {a: 1}});\n assert.strictEqual(this, objects, 'called with context');\n }, objects);\n\n var array = [1, 2, 3, 4];\n array.match = 55;\n assert.strictEqual(_.findKey(array, function(x) { return x === 55; }), 'match', 'matches array-likes keys');\n });\n\n\n QUnit.test('mapObject', function(assert) {\n var obj = {a: 1, b: 2};\n var objects = {\n a: {a: 0, b: 0},\n b: {a: 1, b: 1},\n c: {a: 2, b: 2}\n };\n\n assert.deepEqual(_.mapObject(obj, function(val) {\n return val * 2;\n }), {a: 2, b: 4}, 'simple objects');\n\n assert.deepEqual(_.mapObject(objects, function(val) {\n return _.reduce(val, function(memo, v){\n return memo + v;\n }, 0);\n }), {a: 0, b: 2, c: 4}, 'nested objects');\n\n assert.deepEqual(_.mapObject(obj, function(val, key, o) {\n return o[key] * 2;\n }), {a: 2, b: 4}, 'correct keys');\n\n assert.deepEqual(_.mapObject([1, 2], function(val) {\n return val * 2;\n }), {0: 2, 1: 4}, 'check behavior for arrays');\n\n assert.deepEqual(_.mapObject(obj, function(val) {\n return val * this.multiplier;\n }, {multiplier: 3}), {a: 3, b: 6}, 'keep context');\n\n assert.deepEqual(_.mapObject({a: 1}, function() {\n return this.length;\n }, [1, 2]), {a: 2}, 'called with context');\n\n var ids = _.mapObject({length: 2, 0: {id: '1'}, 1: {id: '2'}}, function(n){\n return n.id;\n });\n assert.deepEqual(ids, {length: void 0, 0: '1', 1: '2'}, 'Check with array-like objects');\n\n // Passing a property name like _.pluck.\n var people = {a: {name: 'moe', age: 30}, b: {name: 'curly', age: 50}};\n assert.deepEqual(_.mapObject(people, 'name'), {a: 'moe', b: 'curly'}, 'predicate string map to object properties');\n\n _.each([null, void 0, 1, 'abc', [], {}, void 0], function(val){\n assert.deepEqual(_.mapObject(val, _.identity), {}, 'mapValue identity');\n });\n\n var Proto = function(){ this.a = 1; };\n Proto.prototype.b = 1;\n var protoObj = new Proto();\n assert.deepEqual(_.mapObject(protoObj, _.identity), {a: 1}, 'ignore inherited values from prototypes');\n\n });\n}());\n" }, { "path": "test/overrides.js", "content": "(function() {\n function overrideDataView() {\n NativeDataView = DataView;\n DataView = {};\n }\n\n // Only override browser functions roughly 1/3rd of the time\n var runOverrides = Math.floor(Math.random() * 3) === 0;\n if (runOverrides) {\n overrideDataView();\n }\n})();\n" }, { "path": "test/qunit-setup.js", "content": "(function() {\n QUnit.config.noglobals = true;\n}());\n" }, { "path": "test/treeshake.js", "content": "(function() {\n // Tests in this module only work in the node.js environment.\n if (typeof require !== 'function') return;\n\n var fixturePrefix = __dirname + '/../test-treeshake/';\n var moduleName = __dirname + '/../underscore-umd.js';\n var fs = require('fs');\n\n QUnit.module('Tree-shaking');\n\n QUnit.test('should have an effect', function(assert) {\n var done = assert.async();\n var fixtureName = fixturePrefix + 'map-umd.js';\n fs.stat(moduleName, function(error, moduleStats) {\n assert.equal(error, null);\n if (error) return done();\n fs.stat(fixtureName, function(error, fixtureStats) {\n assert.equal(error, null);\n if (error) return done();\n // _.template depends on the entire underscore object, so all of the\n // source code should be included.\n assert.ok(fixtureStats.size < moduleStats.size);\n done();\n });\n });\n });\n\n QUnit.test('should not be overzealous', function(assert) {\n var done = assert.async();\n var fixtureName = fixturePrefix + 'template-umd.js';\n fs.readFile(moduleName, {encoding: 'utf8'}, function(error, moduleData) {\n assert.equal(error, null);\n if (error) return done();\n fs.readFile(fixtureName, {encoding: 'utf8'}, function(error, fixtureData) {\n assert.equal(error, null);\n if (error) return done();\n var moduleLines = moduleData.split('\\n').length,\n fixtureLines = fixtureData.split('\\n').length;\n // _.template depends on the entire underscore object, so all of the\n // source code should be included. Allowing for up to 9 lines of\n // difference; this is the size of the noConflict logic plus the\n // copyright intro, both of which are present in the official module but\n // not in the fixture.\n assert.ok(moduleLines - fixtureLines <= 9);\n done();\n });\n });\n });\n}());\n" }, { "path": "test/utility.js", "content": "(function() {\n var _ = typeof require == 'function' ? require('..') : window._;\n var templateSettings;\n\n QUnit.module('Utility', {\n\n beforeEach: function() {\n templateSettings = _.clone(_.templateSettings);\n },\n\n afterEach: function() {\n _.templateSettings = templateSettings;\n }\n\n });\n\n if (typeof require != 'function') {\n QUnit.test('noConflict (browser)', function(assert) {\n var underscore = _.noConflict();\n assert.strictEqual(underscore.identity(1), 1);\n if (typeof require != 'function') {\n assert.strictEqual(this._, void 0, 'global underscore is removed');\n this._ = underscore;\n } else if (typeof global !== 'undefined') {\n delete global._;\n }\n });\n }\n\n if (typeof require == 'function') {\n QUnit.test('noConflict (node vm)', function(assert) {\n assert.expect(2);\n var done = assert.async();\n var fs = require('fs');\n var vm = require('vm');\n var filename = __dirname + '/../underscore-umd.js';\n fs.readFile(filename, function(err, content){\n var sandbox = vm.createScript(\n content + 'this.underscore = this._.noConflict();',\n filename\n );\n var context = {_: 'oldvalue'};\n sandbox.runInNewContext(context);\n assert.strictEqual(context._, 'oldvalue');\n assert.strictEqual(context.underscore.VERSION, _.VERSION);\n\n done();\n });\n });\n }\n\n if (typeof require == 'function') {\n QUnit.test('Legacy Node API', function(assert) {\n var filename = __dirname + '/../underscore-umd.js';\n var resolved = require(filename);\n assert.strictEqual(resolved, resolved._);\n });\n }\n\n QUnit.test('#750 - Return _ instance.', function(assert) {\n assert.expect(2);\n var instance = _([]);\n assert.strictEqual(_(instance), instance);\n assert.strictEqual(new _(instance), instance);\n });\n\n QUnit.test('identity', function(assert) {\n var stooge = {name: 'moe'};\n assert.strictEqual(_.identity(stooge), stooge, 'stooge is the same as his identity');\n });\n\n QUnit.test('constant', function(assert) {\n var stooge = {name: 'moe'};\n assert.strictEqual(_.constant(stooge)(), stooge, 'should create a function that returns stooge');\n });\n\n QUnit.test('noop', function(assert) {\n assert.strictEqual(_.noop('curly', 'larry', 'moe'), void 0, 'should always return undefined');\n });\n\n QUnit.test('toPath', function(assert) {\n var key = 'xyz';\n var path = [key];\n assert.deepEqual(_.toPath(key), path, 'bare strings are wrapped in a single-element array');\n assert.strictEqual(_.toPath(path), path, 'arrays are returned untouched');\n })\n\n QUnit.test('random', function(assert) {\n var array = _.range(1000);\n var min = Math.pow(2, 31);\n var max = Math.pow(2, 62);\n\n assert.ok(_.every(array, function() {\n return _.random(min, max) >= min;\n }), 'should produce a random number greater than or equal to the minimum number');\n\n assert.ok(_.some(array, function() {\n return _.random(Number.MAX_VALUE) > 0;\n }), 'should produce a random number when passed `Number.MAX_VALUE`');\n });\n\n QUnit.test('now', function(assert) {\n var diff = _.now() - new Date().getTime();\n assert.ok(diff <= 0 && diff > -5, 'Produces the correct time in milliseconds');//within 5ms\n });\n\n QUnit.test('uniqueId', function(assert) {\n var ids = [], i = 0;\n while (i++ < 100) ids.push(_.uniqueId());\n assert.strictEqual(_.uniq(ids).length, ids.length, 'can generate a globally-unique stream of ids');\n });\n\n QUnit.test('times', function(assert) {\n var vals = [];\n _.times(3, function(i) { vals.push(i); });\n assert.deepEqual(vals, [0, 1, 2], 'is 0 indexed');\n //\n vals = [];\n _(3).times(function(i) { vals.push(i); });\n assert.deepEqual(vals, [0, 1, 2], 'works as a wrapper');\n // collects return values\n assert.deepEqual([0, 1, 2], _.times(3, function(i) { return i; }), 'collects return values');\n\n assert.deepEqual(_.times(0, _.identity), []);\n assert.deepEqual(_.times(-1, _.identity), []);\n assert.deepEqual(_.times(parseFloat('-Infinity'), _.identity), []);\n });\n\n QUnit.test('mixin', function(assert) {\n var ret = _.mixin({\n myReverse: function(string) {\n return string.split('').reverse().join('');\n }\n });\n assert.strictEqual(ret, _, 'returns the _ object to facilitate chaining');\n assert.strictEqual(_.myReverse('panacea'), 'aecanap', 'mixed in a function to _');\n assert.strictEqual(_('champ').myReverse(), 'pmahc', 'mixed in a function to the OOP wrapper');\n });\n\n QUnit.test('_.escape', function(assert) {\n assert.strictEqual(_.escape(null), '');\n });\n\n QUnit.test('_.unescape', function(assert) {\n var string = 'Curly & Moe';\n assert.strictEqual(_.unescape(null), '');\n assert.strictEqual(_.unescape(_.escape(string)), string);\n assert.strictEqual(_.unescape(string), string, 'don\\'t unescape unnecessarily');\n });\n\n // Don't care what they escape them to just that they're escaped and can be unescaped\n QUnit.test('_.escape & unescape', function(assert) {\n // test & (&) separately obviously\n var escapeCharacters = ['<', '>', '\"', '\\'', '`'];\n\n _.each(escapeCharacters, function(escapeChar) {\n var s = 'a ' + escapeChar + ' string escaped';\n var e = _.escape(s);\n assert.notEqual(s, e, escapeChar + ' is escaped');\n assert.strictEqual(s, _.unescape(e), escapeChar + ' can be unescaped');\n\n s = 'a ' + escapeChar + escapeChar + escapeChar + 'some more string' + escapeChar;\n e = _.escape(s);\n\n assert.strictEqual(e.indexOf(escapeChar), -1, 'can escape multiple occurrences of ' + escapeChar);\n assert.strictEqual(_.unescape(e), s, 'multiple occurrences of ' + escapeChar + ' can be unescaped');\n });\n\n // handles multiple escape characters at once\n var joiner = ' other stuff ';\n var allUnescaped = escapeCharacters.join(joiner);\n allUnescaped += allUnescaped;\n var allEscaped = _.escape(allUnescaped);\n assert.ok(_.every(escapeCharacters), function(escapeChar) {\n return allEscaped.indexOf(escapeChar) === -1;\n }, 'replaces all occurrences');\n assert.strictEqual(_.unescape(allEscaped), allUnescaped, 'undos all replacements');\n\n // test & -> &\n var str = 'some string & another string & yet another';\n var escaped = _.escape(str);\n\n assert.notStrictEqual(escaped.indexOf('&'), -1, 'handles & aka &');\n assert.strictEqual(_.unescape(str), str, 'can unescape &');\n });\n\n QUnit.test('template', function(assert) {\n var basicTemplate = _.template(\"<%= thing %> is gettin' on my noives!\");\n var result = basicTemplate({thing: 'This'});\n assert.strictEqual(result, \"This is gettin' on my noives!\", 'can do basic attribute interpolation');\n\n var sansSemicolonTemplate = _.template('A <% this %> B');\n assert.strictEqual(sansSemicolonTemplate(), 'A B');\n\n var backslashTemplate = _.template('<%= thing %> is \\\\ridanculous');\n assert.strictEqual(backslashTemplate({thing: 'This'}), 'This is \\\\ridanculous');\n\n var escapeTemplate = _.template('<%= a ? \"checked=\\\\\"checked\\\\\"\" : \"\" %>');\n assert.strictEqual(escapeTemplate({a: true}), 'checked=\"checked\"', 'can handle slash escapes in interpolations.');\n\n var fancyTemplate = _.template('');\n result = fancyTemplate({people: {moe: 'Moe', larry: 'Larry', curly: 'Curly'}});\n assert.strictEqual(result, '', 'can run arbitrary javascript in templates');\n\n var escapedCharsInJavaScriptTemplate = _.template('');\n result = escapedCharsInJavaScriptTemplate({numbers: 'one\\ntwo\\nthree\\nfour'});\n assert.strictEqual(result, '', 'Can use escaped characters (e.g. \\\\n) in JavaScript');\n\n var namespaceCollisionTemplate = _.template('<%= pageCount %> <%= thumbnails[pageCount] %> <% _.each(thumbnails, function(p) { %>
\">
<% }); %>');\n result = namespaceCollisionTemplate({\n pageCount: 3,\n thumbnails: {\n 1: 'p1-thumbnail.gif',\n 2: 'p2-thumbnail.gif',\n 3: 'p3-thumbnail.gif'\n }\n });\n assert.strictEqual(result, '3 p3-thumbnail.gif
');\n\n var noInterpolateTemplate = _.template('

Just some text. Hey, I know this is silly but it aids consistency.

');\n result = noInterpolateTemplate();\n assert.strictEqual(result, '

Just some text. Hey, I know this is silly but it aids consistency.

');\n\n var quoteTemplate = _.template(\"It's its, not it's\");\n assert.strictEqual(quoteTemplate({}), \"It's its, not it's\");\n\n var quoteInStatementAndBody = _.template('<% ' +\n \" if(foo == 'bar'){ \" +\n \"%>Statement quotes and 'quotes'.<% } %>\");\n assert.strictEqual(quoteInStatementAndBody({foo: 'bar'}), \"Statement quotes and 'quotes'.\");\n\n var withNewlinesAndTabs = _.template('This\\n\\t\\tis: <%= x %>.\\n\\tok.\\nend.');\n assert.strictEqual(withNewlinesAndTabs({x: 'that'}), 'This\\n\\t\\tis: that.\\n\\tok.\\nend.');\n\n var template = _.template('<%- value %>');\n result = template({value: '