Repository: Zetawar/zetawar Branch: develop Commit: dc1ee8d27afc Files: 101 Total size: 1.1 MB Directory structure: gitextract_re31dpwt/ ├── .ctags ├── .dir-locals.el ├── .gitignore ├── .s3cfg ├── BACKERS.md ├── CHANGELOG.md ├── Jenkinsfile ├── LICENSE.txt ├── Makefile ├── README.md ├── assets/ │ ├── benchmarks.html │ ├── css/ │ │ └── highlight/ │ │ └── default.css │ ├── js/ │ │ ├── cli.cljs.edn │ │ ├── externs.js │ │ ├── highlight.pack.js │ │ ├── main.cljs.edn │ │ └── vendor/ │ │ ├── benchmark.js │ │ ├── lodash.js │ │ ├── platform.js │ │ └── rollbar-snippet.js │ └── workspaces.html ├── bin/ │ └── deploy ├── boot.properties ├── build.boot ├── circle.yml ├── default.nix ├── deps.edn ├── dev/ │ └── cljs/ │ └── user.cljs ├── dev.cljs.edn ├── npm-shrinkwrap.json ├── package.json ├── shadow-cljs.edn ├── site/ │ ├── pages/ │ │ ├── backers.markdown │ │ ├── creating-maps-and-scenarios.markdown │ │ ├── devcards.markdown │ │ ├── docs.markdown │ │ ├── roadmap.markdown │ │ └── writing-bots.markdown │ ├── perun.base.dev-builds.edn │ ├── perun.base.dev.edn │ ├── perun.base.prod.edn │ ├── perun.base.staging.edn │ ├── perun.base.test.edn │ └── posts/ │ ├── 2016-05-17-technology-choices.markdown │ ├── 2016-05-22-why-zetawar.markdown │ └── 2017-02-07-from-callbacks-to-reified-events.md ├── src/ │ ├── clj/ │ │ └── zetawar/ │ │ ├── subs.clj │ │ └── views/ │ │ └── site.clj │ ├── cljc/ │ │ └── zetawar/ │ │ ├── hex.cljc │ │ ├── site.cljc │ │ ├── util.cljc │ │ └── views/ │ │ └── common.cljc │ ├── cljs/ │ │ └── zetawar/ │ │ ├── app.cljs │ │ ├── benchmarks.cljs │ │ ├── cli.cljs │ │ ├── core.cljs │ │ ├── data.cljs │ │ ├── db.cljs │ │ ├── dev.cljs │ │ ├── devcards/ │ │ │ ├── data_formats.cljs │ │ │ ├── game_specs.cljs │ │ │ ├── maps_and_scenarios.cljs │ │ │ └── selection_and_target.cljs │ │ ├── devcards.cljs │ │ ├── doc.cljs │ │ ├── events/ │ │ │ ├── game.cljs │ │ │ ├── player.cljs │ │ │ └── ui.cljs │ │ ├── game/ │ │ │ └── spec.cljs │ │ ├── game.cljs │ │ ├── js/ │ │ │ ├── game.cljs │ │ │ └── hex.cljs │ │ ├── logging.cljs │ │ ├── players/ │ │ │ ├── ai/ │ │ │ │ ├── custom.cljs │ │ │ │ ├── custom_js.cljs │ │ │ │ └── reference.cljs │ │ │ ├── human.cljs │ │ │ └── simple_embedded.cljs │ │ ├── players.cljs │ │ ├── router/ │ │ │ └── reagent.cljs │ │ ├── router.cljs │ │ ├── serialization.cljs │ │ ├── subs.cljs │ │ ├── system/ │ │ │ ├── datascript.cljs │ │ │ ├── game.cljs │ │ │ ├── game_views.cljs │ │ │ ├── players.cljs │ │ │ ├── reagent.cljs │ │ │ ├── router.cljs │ │ │ └── spec.cljs │ │ ├── system.cljs │ │ ├── tiles.cljs │ │ ├── views.cljs │ │ └── workspaces/ │ │ └── test_cards.cljs │ ├── js/ │ │ ├── custom_ai.js │ │ └── lzw.js │ └── scss/ │ └── main.scss └── test/ └── cljs/ └── zetawar/ ├── game_test.cljs ├── subs_test.cljs ├── test_helper.cljs └── test_runner.cljs ================================================ FILE CONTENTS ================================================ ================================================ FILE: .ctags ================================================ --exclude=*.svg --exclude=*.yml --exclude=.cljs_rhino_repl --exclude=target --exclude=vendor ================================================ FILE: .dir-locals.el ================================================ ((nil . ((cider-preferred-build-tool . "clojure-cli") (cider-default-cljs-repl . node)))) ================================================ FILE: .gitignore ================================================ *.class *.jar .m2 /.cljs_rhino_repl /.cpcache /.nightlight.edn /.nrepl-* /.nyc_output /TAGS /node_modules /out /tags /target ================================================ FILE: .s3cfg ================================================ [default] access_key = acl_public = False bucket_location = US cloudfront_host = cloudfront.amazonaws.com cloudfront_resource = /2008-06-30/distribution default_mime_type = binary/octet-stream delete_removed = False dry_run = False encoding = UTF-8 encrypt = False force = False get_continue = False gpg_command = /usr/bin/gpg gpg_decrypt = %(gpg_command)s -d --verbose --no-use-agent --batch --yes --passphrase-fd %(passphrase_fd)s -o %(output_file)s %(input_file)s gpg_encrypt = %(gpg_command)s -c --verbose --no-use-agent --batch --yes --passphrase-fd %(passphrase_fd)s -o %(output_file)s %(input_file)s gpg_passphrase = guess_mime_type = True host_base = s3.amazonaws.com host_bucket = %(bucket)s.s3.amazonaws.com human_readable_sizes = False list_md5 = False preserve_attrs = True progress_meter = True proxy_host = proxy_port = 0 recursive = False recv_chunk = 4096 secret_key = send_chunk = 4096 simpledb_host = sdb.amazonaws.com skip_existing = False urlencoding_mode = normal use_https = False verbosity = WARNING ================================================ FILE: BACKERS.md ================================================ Listed below are the [Zetawar Kickstarter](https://www.kickstarter.com/projects/311016908/zetawar/) backers who chose to have their names listed and backed the project at or above the "Virtual Immortality" level. ### Sponsors [![Awesome Forms](https://awesomeforms.com/assets/logotype-0e39fee9805478f7769f0e25cb16b6e2.png)](https://awesomeforms.com) [Rowdy Labs](http://www.rowdylabs.com) ### Backers - -Toni- - Alex Eberts - Austin Haas - Ben and Anna Donovan - Benni Stauss - Benno Kittelmann - Bill Kratzer - Boris Kourtoukov - Brandon Mathis - Brent Hagany - Cameron Callahan - Carl T Kleihege - Chris Wasser - Coop - Dan Boykis - Dmitri Lobach - Dmitri Sotnikov - Greg Polander - Herb Bruss - Igor "McBell" Makaruks - J Johansen - JD Bell - James Reeves - Jarrod Doherty - Jeroen Lamain - Joel Martin - Jon M Dugan - Jonas Winje - Jonas lowery - Jonathan Boston - Joshua Miller - Juraj Martinka - Kephren - Kephren Newton - Kevin D. Saunders - Kevin Hutson (@mrjabba) - Koji Yusa - Lambda Island - Lloyd Goss - Loosetoes - Luke Ehresman - Markku Rontu - Martin Clausen - Max Juchheim - Mewmoomoo - Michael Dowden - Mikailos - Mikkel Gravgaard - Nate Jones - Nathan Ehresman - Nathan Powell - Nikita Prokopov - Nor Azman - Pasi Heikkinen - Pete - Phillip DiPuccio - Rob Balder - Ross Williams - RubyGeek LLC - Stonecrusher - The Griesbach Family - Tianxiang Xiong - Tim Folkers - Toby Nance - Tomi Kasurinen - Troy Bonneau - Ty Goss - Vovusique - Walton Hoops - Wasserlasser - Zach Erbaugh - gtoast - jclaggett - kika - lfn3 - peonicles - scientific-coder ================================================ FILE: CHANGELOG.md ================================================ # Unreleased * Use clickable cursor for clickable things on the map * Add new map ================================================ FILE: Jenkinsfile ================================================ // -*- mode: groovy; -*- node { currentBuild.result = 'SUCCESS' def commitHash def permaBuildPrefix try { stage('Checkout') { checkout scm sh 'git rev-parse HEAD > commit' commitHash = readFile('commit').trim() permaBuildPrefix = "/builds/${commitHash}" } stage('Prepare') { sh 'nix-shell . --run "npm install"' } stage('Test') { sh "nix-shell . --run 'boot --no-colors run-tests'" } stage('Build') { sh "ZETAWAR_BUILD='${commitHash}' nix-shell . --run 'boot --no-colors build-site -e ${ZETAWAR_ENV}'" sh "ZETAWAR_BUILD='${commitHash}' ZETAWAR_PREFIX=${permaBuildPrefix} nix-shell . --run 'boot --no-colors build-site -e ${ZETAWAR_ENV} -t target.permabuild'" } stage('Deploy') { sh "nix-shell . --run './bin/deploy -b ${S3_BUCKET} ${PUBLIC_FLAG}'" sh "nix-shell . --run './bin/deploy -s target.permabuild -b ${S3_BUCKET} -p ${permaBuildPrefix} ${PUBLIC_FLAG}'" } } catch (err) { currentBuild.result = 'FAILURE' throw err } finally { notifyBuild(currentBuild.result) } } def notifyBuild(String buildStatus = 'STARTED') { // build status of null means successful buildStatus = buildStatus ?: 'SUCCESS' // Default values def colorName = 'RED' def colorCode = '#FF0000' def recipients = UNSUCCESSFUL_RECIPIENTS def subject = "${env.JOB_NAME} - Build # ${env.BUILD_NUMBER} - ${buildStatus}!" def summary = "${subject} (${env.BUILD_URL})" def details = """\ ${env.JOB_NAME} - Build # ${env.BUILD_NUMBER} - ${buildStatus} Check console output at ${env.BUILD_URL} to view the results. """ // Override default values based on build status if (buildStatus == 'STARTED') { color = 'YELLOW' colorCode = '#FFFF00' } else if (buildStatus == 'SUCCESS') { color = 'GREEN' colorCode = '#00FF00' recipients = SUCCESS_RECIPIENTS if (BACKER_BUILD == 'true') { subject = "A new Zetawar build is available!" summary = "${subject} (http://dev.zetawar.com/)" urlDetails = "A new Zetawar build is available at http://dev.zetawar.com/." changeDetails = sh(script: 'git log --pretty="- %s" --since="7 days ago"', returnStdout: true) footerDetails = """\ You're getting this email because you indicated you would like to receive build notifications when you filled out the Zetawar Kickstarter survey. If you no longer want to receive build notifications, please email builds@zetawar.com. """.split("\n").join(" ") details = """\ ${urlDetails} Recent changes: ${changeDetails} ${footerDetails} """ } } else { color = 'RED' colorCode = '#FF0000' } // Send notifications if (SEND_NOTIFICATIONS == 'true' && (buildStatus != 'SUCCESS' || BACKER_BUILD == 'true')) { emailext ( to: recipients, replyTo: REPLY_TO, subject: subject, body: details, ) } } ================================================ FILE: LICENSE.txt ================================================ The MIT License Copyright (c) 2016 Arugaba LLC Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. ================================================ FILE: Makefile ================================================ .PHONY: build-staging build-prod deploy-staging deploy-prod build-staging: boot build-site -e staging build-prod: boot build-site -e prod deploy-staging: build-staging ./bin/deploy -b staging.zetawar.com -P deploy-prod: build-prod ./bin/deploy -b www.zetawar.com -P ================================================ FILE: README.md ================================================ # Zetawar [![CircleCI](https://circleci.com/gh/Zetawar/zetawar.svg?style=svg&circle-token=b630f4db37e3538b7c390856687648246468e98b)](https://circleci.com/gh/Zetawar/zetawar) Source code for [Zetawar](http://www.zetawar.com/). Zetawar is funded by the generous support of the [Zetawar Kickstarter](https://www.kickstarter.com/projects/djwhitt/zetawar) backers. ## Licenses Zetawar is Copyright 2016 Arugaba LLC licensed under the terms of the [MIT license](LICENSE.txt). Tiles and unit sprites are from Elite Command Copyright 2015 Chris Vincent under the [Creative Commons Attribution 4.0 International License](https://creativecommons.org/licenses/by/4.0/). Music is Copyright 2017 Chris Haislet licensed under the [Creative Commons Attribution-NonCommercial 4.0 International](https://creativecommons.org/licenses/by-nc/4.0/). AwesomeForms sponsor logo is Copyright 2015 Awesome Forms LLC 2015 all rights reserved. ================================================ FILE: assets/benchmarks.html ================================================ Zetawar Benchmarks ================================================ FILE: assets/css/highlight/default.css ================================================ /* Original highlight.js style (c) Ivan Sagalaev */ .hljs { display: block; overflow-x: auto; padding: 0.5em; background: #F0F0F0; } /* Base color: saturation 0; */ .hljs, .hljs-subst { color: #444; } .hljs-comment { color: #888888; } .hljs-keyword, .hljs-attribute, .hljs-selector-tag, .hljs-meta-keyword, .hljs-doctag, .hljs-name { font-weight: bold; } /* User color: hue: 0 */ .hljs-type, .hljs-string, .hljs-number, .hljs-selector-id, .hljs-selector-class, .hljs-quote, .hljs-template-tag, .hljs-deletion { color: #880000; } .hljs-title, .hljs-section { color: #880000; font-weight: bold; } .hljs-regexp, .hljs-symbol, .hljs-variable, .hljs-template-variable, .hljs-link, .hljs-selector-attr, .hljs-selector-pseudo { color: #BC6060; } /* Language color: hue: 90; */ .hljs-literal { color: #78A960; } .hljs-built_in, .hljs-bullet, .hljs-code, .hljs-addition { color: #397300; } /* Meta color: hue: 200 */ .hljs-meta { color: #1f7199; } .hljs-meta-string { color: #4d99bf; } /* Misc effects */ .hljs-emphasis { font-style: italic; } .hljs-strong { font-weight: bold; } ================================================ FILE: assets/js/cli.cljs.edn ================================================ {:require [zetawar.cli] :compiler-options {:target :nodejs}} ================================================ FILE: assets/js/externs.js ================================================ /** @return {string} */ var lzwEncode = function(s) {}; /** @return {string} */ var lzwDecode = function(s) {}; var ZetawarAI = { "makeActorContext": function() {}, "scoreActor": function() {}, "makeBaseActionContext": function() {}, "scoreBaseAction": function() {}, "makeUnitActionContext": function() {}, "scoreUnitAction": function() {}, }; ================================================ FILE: assets/js/highlight.pack.js ================================================ /*! highlight.js v9.9.0 | BSD3 License | git.io/hljslicense */ !function(e){var n="object"==typeof window&&window||"object"==typeof self&&self;"undefined"!=typeof exports?e(exports):n&&(n.hljs=e({}),"function"==typeof define&&define.amd&&define([],function(){return n.hljs}))}(function(e){function n(e){return e.replace(/[&<>]/gm,function(e){return I[e]})}function t(e){return e.nodeName.toLowerCase()}function r(e,n){var t=e&&e.exec(n);return t&&0===t.index}function i(e){return k.test(e)}function a(e){var n,t,r,a,o=e.className+" ";if(o+=e.parentNode?e.parentNode.className:"",t=B.exec(o))return R(t[1])?t[1]:"no-highlight";for(o=o.split(/\s+/),n=0,r=o.length;r>n;n++)if(a=o[n],i(a)||R(a))return a}function o(e,n){var t,r={};for(t in e)r[t]=e[t];if(n)for(t in n)r[t]=n[t];return r}function u(e){var n=[];return function r(e,i){for(var a=e.firstChild;a;a=a.nextSibling)3===a.nodeType?i+=a.nodeValue.length:1===a.nodeType&&(n.push({event:"start",offset:i,node:a}),i=r(a,i),t(a).match(/br|hr|img|input/)||n.push({event:"stop",offset:i,node:a}));return i}(e,0),n}function c(e,r,i){function a(){return e.length&&r.length?e[0].offset!==r[0].offset?e[0].offset"}function u(e){l+=""}function c(e){("start"===e.event?o:u)(e.node)}for(var s=0,l="",f=[];e.length||r.length;){var g=a();if(l+=n(i.substring(s,g[0].offset)),s=g[0].offset,g===e){f.reverse().forEach(u);do c(g.splice(0,1)[0]),g=a();while(g===e&&g.length&&g[0].offset===s);f.reverse().forEach(o)}else"start"===g[0].event?f.push(g[0].node):f.pop(),c(g.splice(0,1)[0])}return l+n(i.substr(s))}function s(e){function n(e){return e&&e.source||e}function t(t,r){return new RegExp(n(t),"m"+(e.cI?"i":"")+(r?"g":""))}function r(i,a){if(!i.compiled){if(i.compiled=!0,i.k=i.k||i.bK,i.k){var u={},c=function(n,t){e.cI&&(t=t.toLowerCase()),t.split(" ").forEach(function(e){var t=e.split("|");u[t[0]]=[n,t[1]?Number(t[1]):1]})};"string"==typeof i.k?c("keyword",i.k):E(i.k).forEach(function(e){c(e,i.k[e])}),i.k=u}i.lR=t(i.l||/\w+/,!0),a&&(i.bK&&(i.b="\\b("+i.bK.split(" ").join("|")+")\\b"),i.b||(i.b=/\B|\b/),i.bR=t(i.b),i.e||i.eW||(i.e=/\B|\b/),i.e&&(i.eR=t(i.e)),i.tE=n(i.e)||"",i.eW&&a.tE&&(i.tE+=(i.e?"|":"")+a.tE)),i.i&&(i.iR=t(i.i)),null==i.r&&(i.r=1),i.c||(i.c=[]);var s=[];i.c.forEach(function(e){e.v?e.v.forEach(function(n){s.push(o(e,n))}):s.push("self"===e?i:e)}),i.c=s,i.c.forEach(function(e){r(e,i)}),i.starts&&r(i.starts,a);var l=i.c.map(function(e){return e.bK?"\\.?("+e.b+")\\.?":e.b}).concat([i.tE,i.i]).map(n).filter(Boolean);i.t=l.length?t(l.join("|"),!0):{exec:function(){return null}}}}r(e)}function l(e,t,i,a){function o(e,n){var t,i;for(t=0,i=n.c.length;i>t;t++)if(r(n.c[t].bR,e))return n.c[t]}function u(e,n){if(r(e.eR,n)){for(;e.endsParent&&e.parent;)e=e.parent;return e}return e.eW?u(e.parent,n):void 0}function c(e,n){return!i&&r(n.iR,e)}function g(e,n){var t=N.cI?n[0].toLowerCase():n[0];return e.k.hasOwnProperty(t)&&e.k[t]}function h(e,n,t,r){var i=r?"":y.classPrefix,a='',a+n+o}function p(){var e,t,r,i;if(!E.k)return n(B);for(i="",t=0,E.lR.lastIndex=0,r=E.lR.exec(B);r;)i+=n(B.substring(t,r.index)),e=g(E,r),e?(M+=e[1],i+=h(e[0],n(r[0]))):i+=n(r[0]),t=E.lR.lastIndex,r=E.lR.exec(B);return i+n(B.substr(t))}function d(){var e="string"==typeof E.sL;if(e&&!x[E.sL])return n(B);var t=e?l(E.sL,B,!0,L[E.sL]):f(B,E.sL.length?E.sL:void 0);return E.r>0&&(M+=t.r),e&&(L[E.sL]=t.top),h(t.language,t.value,!1,!0)}function b(){k+=null!=E.sL?d():p(),B=""}function v(e){k+=e.cN?h(e.cN,"",!0):"",E=Object.create(e,{parent:{value:E}})}function m(e,n){if(B+=e,null==n)return b(),0;var t=o(n,E);if(t)return t.skip?B+=n:(t.eB&&(B+=n),b(),t.rB||t.eB||(B=n)),v(t,n),t.rB?0:n.length;var r=u(E,n);if(r){var i=E;i.skip?B+=n:(i.rE||i.eE||(B+=n),b(),i.eE&&(B=n));do E.cN&&(k+=C),E.skip||(M+=E.r),E=E.parent;while(E!==r.parent);return r.starts&&v(r.starts,""),i.rE?0:n.length}if(c(n,E))throw new Error('Illegal lexeme "'+n+'" for mode "'+(E.cN||"")+'"');return B+=n,n.length||1}var N=R(e);if(!N)throw new Error('Unknown language: "'+e+'"');s(N);var w,E=a||N,L={},k="";for(w=E;w!==N;w=w.parent)w.cN&&(k=h(w.cN,"",!0)+k);var B="",M=0;try{for(var I,j,O=0;;){if(E.t.lastIndex=O,I=E.t.exec(t),!I)break;j=m(t.substring(O,I.index),I[0]),O=I.index+j}for(m(t.substr(O)),w=E;w.parent;w=w.parent)w.cN&&(k+=C);return{r:M,value:k,language:e,top:E}}catch(T){if(T.message&&-1!==T.message.indexOf("Illegal"))return{r:0,value:n(t)};throw T}}function f(e,t){t=t||y.languages||E(x);var r={r:0,value:n(e)},i=r;return t.filter(R).forEach(function(n){var t=l(n,e,!1);t.language=n,t.r>i.r&&(i=t),t.r>r.r&&(i=r,r=t)}),i.language&&(r.second_best=i),r}function g(e){return y.tabReplace||y.useBR?e.replace(M,function(e,n){return y.useBR&&"\n"===e?"
":y.tabReplace?n.replace(/\t/g,y.tabReplace):void 0}):e}function h(e,n,t){var r=n?L[n]:t,i=[e.trim()];return e.match(/\bhljs\b/)||i.push("hljs"),-1===e.indexOf(r)&&i.push(r),i.join(" ").trim()}function p(e){var n,t,r,o,s,p=a(e);i(p)||(y.useBR?(n=document.createElementNS("http://www.w3.org/1999/xhtml","div"),n.innerHTML=e.innerHTML.replace(/\n/g,"").replace(//g,"\n")):n=e,s=n.textContent,r=p?l(p,s,!0):f(s),t=u(n),t.length&&(o=document.createElementNS("http://www.w3.org/1999/xhtml","div"),o.innerHTML=r.value,r.value=c(t,u(o),s)),r.value=g(r.value),e.innerHTML=r.value,e.className=h(e.className,p,r.language),e.result={language:r.language,re:r.r},r.second_best&&(e.second_best={language:r.second_best.language,re:r.second_best.r}))}function d(e){y=o(y,e)}function b(){if(!b.called){b.called=!0;var e=document.querySelectorAll("pre code");w.forEach.call(e,p)}}function v(){addEventListener("DOMContentLoaded",b,!1),addEventListener("load",b,!1)}function m(n,t){var r=x[n]=t(e);r.aliases&&r.aliases.forEach(function(e){L[e]=n})}function N(){return E(x)}function R(e){return e=(e||"").toLowerCase(),x[e]||x[L[e]]}var w=[],E=Object.keys,x={},L={},k=/^(no-?highlight|plain|text)$/i,B=/\blang(?:uage)?-([\w-]+)\b/i,M=/((^(<[^>]+>|\t|)+|(?:\n)))/gm,C="",y={classPrefix:"hljs-",tabReplace:null,useBR:!1,languages:void 0},I={"&":"&","<":"<",">":">"};return e.highlight=l,e.highlightAuto=f,e.fixMarkup=g,e.highlightBlock=p,e.configure=d,e.initHighlighting=b,e.initHighlightingOnLoad=v,e.registerLanguage=m,e.listLanguages=N,e.getLanguage=R,e.inherit=o,e.IR="[a-zA-Z]\\w*",e.UIR="[a-zA-Z_]\\w*",e.NR="\\b\\d+(\\.\\d+)?",e.CNR="(-?)(\\b0[xX][a-fA-F0-9]+|(\\b\\d+(\\.\\d*)?|\\.\\d+)([eE][-+]?\\d+)?)",e.BNR="\\b(0b[01]+)",e.RSR="!|!=|!==|%|%=|&|&&|&=|\\*|\\*=|\\+|\\+=|,|-|-=|/=|/|:|;|<<|<<=|<=|<|===|==|=|>>>=|>>=|>=|>>>|>>|>|\\?|\\[|\\{|\\(|\\^|\\^=|\\||\\|=|\\|\\||~",e.BE={b:"\\\\[\\s\\S]",r:0},e.ASM={cN:"string",b:"'",e:"'",i:"\\n",c:[e.BE]},e.QSM={cN:"string",b:'"',e:'"',i:"\\n",c:[e.BE]},e.PWM={b:/\b(a|an|the|are|I'm|isn't|don't|doesn't|won't|but|just|should|pretty|simply|enough|gonna|going|wtf|so|such|will|you|your|like)\b/},e.C=function(n,t,r){var i=e.inherit({cN:"comment",b:n,e:t,c:[]},r||{});return i.c.push(e.PWM),i.c.push({cN:"doctag",b:"(?:TODO|FIXME|NOTE|BUG|XXX):",r:0}),i},e.CLCM=e.C("//","$"),e.CBCM=e.C("/\\*","\\*/"),e.HCM=e.C("#","$"),e.NM={cN:"number",b:e.NR,r:0},e.CNM={cN:"number",b:e.CNR,r:0},e.BNM={cN:"number",b:e.BNR,r:0},e.CSSNM={cN:"number",b:e.NR+"(%|em|ex|ch|rem|vw|vh|vmin|vmax|cm|mm|in|pt|pc|px|deg|grad|rad|turn|s|ms|Hz|kHz|dpi|dpcm|dppx)?",r:0},e.RM={cN:"regexp",b:/\//,e:/\/[gimuy]*/,i:/\n/,c:[e.BE,{b:/\[/,e:/\]/,r:0,c:[e.BE]}]},e.TM={cN:"title",b:e.IR,r:0},e.UTM={cN:"title",b:e.UIR,r:0},e.METHOD_GUARD={b:"\\.\\s*"+e.UIR,r:0},e});hljs.registerLanguage("clojure",function(e){var t={"builtin-name":"def defonce cond apply if-not if-let if not not= = < > <= >= == + / * - rem quot neg? pos? delay? symbol? keyword? true? false? integer? empty? coll? list? set? ifn? fn? associative? sequential? sorted? counted? reversible? number? decimal? class? distinct? isa? float? rational? reduced? ratio? odd? even? char? seq? vector? string? map? nil? contains? zero? instance? not-every? not-any? libspec? -> ->> .. . inc compare do dotimes mapcat take remove take-while drop letfn drop-last take-last drop-while while intern condp case reduced cycle split-at split-with repeat replicate iterate range merge zipmap declare line-seq sort comparator sort-by dorun doall nthnext nthrest partition eval doseq await await-for let agent atom send send-off release-pending-sends add-watch mapv filterv remove-watch agent-error restart-agent set-error-handler error-handler set-error-mode! error-mode shutdown-agents quote var fn loop recur throw try monitor-enter monitor-exit defmacro defn defn- macroexpand macroexpand-1 for dosync and or when when-not when-let comp juxt partial sequence memoize constantly complement identity assert peek pop doto proxy defstruct first rest cons defprotocol cast coll deftype defrecord last butlast sigs reify second ffirst fnext nfirst nnext defmulti defmethod meta with-meta ns in-ns create-ns import refer keys select-keys vals key val rseq name namespace promise into transient persistent! conj! assoc! dissoc! pop! disj! use class type num float double short byte boolean bigint biginteger bigdec print-method print-dup throw-if printf format load compile get-in update-in pr pr-on newline flush read slurp read-line subvec with-open memfn time re-find re-groups rand-int rand mod locking assert-valid-fdecl alias resolve ref deref refset swap! reset! set-validator! compare-and-set! alter-meta! reset-meta! commute get-validator alter ref-set ref-history-count ref-min-history ref-max-history ensure sync io! new next conj set! to-array future future-call into-array aset gen-class reduce map filter find empty hash-map hash-set sorted-map sorted-map-by sorted-set sorted-set-by vec vector seq flatten reverse assoc dissoc list disj get union difference intersection extend extend-type extend-protocol int nth delay count concat chunk chunk-buffer chunk-append chunk-first chunk-rest max min dec unchecked-inc-int unchecked-inc unchecked-dec-inc unchecked-dec unchecked-negate unchecked-add-int unchecked-add unchecked-subtract-int unchecked-subtract chunk-next chunk-cons chunked-seq? prn vary-meta lazy-seq spread list* str find-keyword keyword symbol gensym force rationalize"},r="a-zA-Z_\\-!.?+*=<>&#'",n="["+r+"]["+r+"0-9/;:]*",a="[-+]?\\d+(\\.\\d+)?",o={b:n,r:0},s={cN:"number",b:a,r:0},i=e.inherit(e.QSM,{i:null}),c=e.C(";","$",{r:0}),d={cN:"literal",b:/\b(true|false|nil)\b/},l={b:"[\\[\\{]",e:"[\\]\\}]"},m={cN:"comment",b:"\\^"+n},p=e.C("\\^\\{","\\}"),u={cN:"symbol",b:"[:]{1,2}"+n},f={b:"\\(",e:"\\)"},h={eW:!0,r:0},y={k:t,l:n,cN:"name",b:n,starts:h},b=[f,i,m,p,c,u,l,s,d,o];return f.c=[e.C("comment",""),y,h],h.c=b,l.c=b,{aliases:["clj"],i:/\S/,c:[f,i,m,p,c,u,l,s,d]}}); ================================================ FILE: assets/js/main.cljs.edn ================================================ {:require [zetawar.core] :init-fns [zetawar.core/init] :modules {:devcards {:entries #{"zetawar.devcards"}}} :compiler-options {:devcards true :asset-path "/js/main.out" :externs ["js/externs.js"] :foreign-libs [{:file "lzw.js" :provides ["lzw"]} {:file "custom_ai.js" :provides ["zetawar-js-ai"]}]}} ================================================ FILE: assets/js/vendor/benchmark.js ================================================ /*! * Benchmark.js v2.1.0 * Copyright 2010-2016 Mathias Bynens * Based on JSLitmus.js, copyright Robert Kieffer * Modified by John-David Dalton * Available under MIT license */ ;(function() { 'use strict'; /** Used as a safe reference for `undefined` in pre ES5 environments. */ var undefined; /** Used to determine if values are of the language type Object. */ var objectTypes = { 'function': true, 'object': true }; /** Used as a reference to the global object. */ var root = (objectTypes[typeof window] && window) || this; /** Detect free variable `define`. */ var freeDefine = typeof define == 'function' && typeof define.amd == 'object' && define.amd && define; /** Detect free variable `exports`. */ var freeExports = objectTypes[typeof exports] && exports && !exports.nodeType && exports; /** Detect free variable `module`. */ var freeModule = objectTypes[typeof module] && module && !module.nodeType && module; /** Detect free variable `global` from Node.js or Browserified code and use it as `root`. */ var freeGlobal = freeExports && freeModule && typeof global == 'object' && global; if (freeGlobal && (freeGlobal.global === freeGlobal || freeGlobal.window === freeGlobal || freeGlobal.self === freeGlobal)) { root = freeGlobal; } /** Detect free variable `require`. */ var freeRequire = typeof require == 'function' && require; /** Used to assign each benchmark an incremented id. */ var counter = 0; /** Detect the popular CommonJS extension `module.exports`. */ var moduleExports = freeModule && freeModule.exports === freeExports && freeExports; /** Used to detect primitive types. */ var rePrimitive = /^(?:boolean|number|string|undefined)$/; /** Used to make every compiled test unique. */ var uidCounter = 0; /** Used to assign default `context` object properties. */ var contextProps = [ 'Array', 'Date', 'Function', 'Math', 'Object', 'RegExp', 'String', '_', 'clearTimeout', 'chrome', 'chromium', 'document', 'navigator', 'phantom', 'platform', 'process', 'runtime', 'setTimeout' ]; /** Used to avoid hz of Infinity. */ var divisors = { '1': 4096, '2': 512, '3': 64, '4': 8, '5': 0 }; /** * T-Distribution two-tailed critical values for 95% confidence. * For more info see http://www.itl.nist.gov/div898/handbook/eda/section3/eda3672.htm. */ var tTable = { '1': 12.706, '2': 4.303, '3': 3.182, '4': 2.776, '5': 2.571, '6': 2.447, '7': 2.365, '8': 2.306, '9': 2.262, '10': 2.228, '11': 2.201, '12': 2.179, '13': 2.16, '14': 2.145, '15': 2.131, '16': 2.12, '17': 2.11, '18': 2.101, '19': 2.093, '20': 2.086, '21': 2.08, '22': 2.074, '23': 2.069, '24': 2.064, '25': 2.06, '26': 2.056, '27': 2.052, '28': 2.048, '29': 2.045, '30': 2.042, 'infinity': 1.96 }; /** * Critical Mann-Whitney U-values for 95% confidence. * For more info see http://www.saburchill.com/IBbiology/stats/003.html. */ var uTable = { '5': [0, 1, 2], '6': [1, 2, 3, 5], '7': [1, 3, 5, 6, 8], '8': [2, 4, 6, 8, 10, 13], '9': [2, 4, 7, 10, 12, 15, 17], '10': [3, 5, 8, 11, 14, 17, 20, 23], '11': [3, 6, 9, 13, 16, 19, 23, 26, 30], '12': [4, 7, 11, 14, 18, 22, 26, 29, 33, 37], '13': [4, 8, 12, 16, 20, 24, 28, 33, 37, 41, 45], '14': [5, 9, 13, 17, 22, 26, 31, 36, 40, 45, 50, 55], '15': [5, 10, 14, 19, 24, 29, 34, 39, 44, 49, 54, 59, 64], '16': [6, 11, 15, 21, 26, 31, 37, 42, 47, 53, 59, 64, 70, 75], '17': [6, 11, 17, 22, 28, 34, 39, 45, 51, 57, 63, 67, 75, 81, 87], '18': [7, 12, 18, 24, 30, 36, 42, 48, 55, 61, 67, 74, 80, 86, 93, 99], '19': [7, 13, 19, 25, 32, 38, 45, 52, 58, 65, 72, 78, 85, 92, 99, 106, 113], '20': [8, 14, 20, 27, 34, 41, 48, 55, 62, 69, 76, 83, 90, 98, 105, 112, 119, 127], '21': [8, 15, 22, 29, 36, 43, 50, 58, 65, 73, 80, 88, 96, 103, 111, 119, 126, 134, 142], '22': [9, 16, 23, 30, 38, 45, 53, 61, 69, 77, 85, 93, 101, 109, 117, 125, 133, 141, 150, 158], '23': [9, 17, 24, 32, 40, 48, 56, 64, 73, 81, 89, 98, 106, 115, 123, 132, 140, 149, 157, 166, 175], '24': [10, 17, 25, 33, 42, 50, 59, 67, 76, 85, 94, 102, 111, 120, 129, 138, 147, 156, 165, 174, 183, 192], '25': [10, 18, 27, 35, 44, 53, 62, 71, 80, 89, 98, 107, 117, 126, 135, 145, 154, 163, 173, 182, 192, 201, 211], '26': [11, 19, 28, 37, 46, 55, 64, 74, 83, 93, 102, 112, 122, 132, 141, 151, 161, 171, 181, 191, 200, 210, 220, 230], '27': [11, 20, 29, 38, 48, 57, 67, 77, 87, 97, 107, 118, 125, 138, 147, 158, 168, 178, 188, 199, 209, 219, 230, 240, 250], '28': [12, 21, 30, 40, 50, 60, 70, 80, 90, 101, 111, 122, 132, 143, 154, 164, 175, 186, 196, 207, 218, 228, 239, 250, 261, 272], '29': [13, 22, 32, 42, 52, 62, 73, 83, 94, 105, 116, 127, 138, 149, 160, 171, 182, 193, 204, 215, 226, 238, 249, 260, 271, 282, 294], '30': [13, 23, 33, 43, 54, 65, 76, 87, 98, 109, 120, 131, 143, 154, 166, 177, 189, 200, 212, 223, 235, 247, 258, 270, 282, 293, 305, 317] }; /*--------------------------------------------------------------------------*/ /** * Create a new `Benchmark` function using the given `context` object. * * @static * @memberOf Benchmark * @param {Object} [context=root] The context object. * @returns {Function} Returns a new `Benchmark` function. */ function runInContext(context) { // Exit early if unable to acquire lodash. var _ = context && context._ || req('lodash') || root._; if (!_) { Benchmark.runInContext = runInContext; return Benchmark; } // Avoid issues with some ES3 environments that attempt to use values, named // after built-in constructors like `Object`, for the creation of literals. // ES5 clears this up by stating that literals must use built-in constructors. // See http://es5.github.io/#x11.1.5. context = context ? _.defaults(root.Object(), context, _.pick(root, contextProps)) : root; /** Native constructor references. */ var Array = context.Array, Date = context.Date, Function = context.Function, Math = context.Math, Object = context.Object, RegExp = context.RegExp, String = context.String; /** Used for `Array` and `Object` method references. */ var arrayRef = [], objectProto = Object.prototype; /** Native method shortcuts. */ var abs = Math.abs, clearTimeout = context.clearTimeout, floor = Math.floor, log = Math.log, max = Math.max, min = Math.min, pow = Math.pow, push = arrayRef.push, setTimeout = context.setTimeout, shift = arrayRef.shift, slice = arrayRef.slice, sqrt = Math.sqrt, toString = objectProto.toString, unshift = arrayRef.unshift; /** Detect DOM document object. */ var doc = isHostType(context, 'document') && context.document; /** Used to access Wade Simmons' Node.js `microtime` module. */ var microtimeObject = req('microtime'); /** Used to access Node.js's high resolution timer. */ var processObject = isHostType(context, 'process') && context.process; /** Used to prevent a `removeChild` memory leak in IE < 9. */ var trash = doc && doc.createElement('div'); /** Used to integrity check compiled tests. */ var uid = 'uid' + _.now(); /** Used to avoid infinite recursion when methods call each other. */ var calledBy = {}; /** * An object used to flag environments/features. * * @static * @memberOf Benchmark * @type Object */ var support = {}; (function() { /** * Detect if running in a browser environment. * * @memberOf Benchmark.support * @type boolean */ support.browser = doc && isHostType(context, 'navigator') && !isHostType(context, 'phantom'); /** * Detect if the Timers API exists. * * @memberOf Benchmark.support * @type boolean */ support.timeout = isHostType(context, 'setTimeout') && isHostType(context, 'clearTimeout'); /** * Detect if function decompilation is support. * * @name decompilation * @memberOf Benchmark.support * @type boolean */ try { // Safari 2.x removes commas in object literals from `Function#toString` results. // See http://webk.it/11609 for more details. // Firefox 3.6 and Opera 9.25 strip grouping parentheses from `Function#toString` results. // See http://bugzil.la/559438 for more details. support.decompilation = Function( ('return (' + (function(x) { return { 'x': '' + (1 + x) + '', 'y': 0 }; }) + ')') // Avoid issues with code added by Istanbul. .replace(/__cov__[^;]+;/g, '') )()(0).x === '1'; } catch(e) { support.decompilation = false; } }()); /** * Timer object used by `clock()` and `Deferred#resolve`. * * @private * @type Object */ var timer = { /** * The timer namespace object or constructor. * * @private * @memberOf timer * @type {Function|Object} */ 'ns': Date, /** * Starts the deferred timer. * * @private * @memberOf timer * @param {Object} deferred The deferred instance. */ 'start': null, // Lazy defined in `clock()`. /** * Stops the deferred timer. * * @private * @memberOf timer * @param {Object} deferred The deferred instance. */ 'stop': null // Lazy defined in `clock()`. }; /*------------------------------------------------------------------------*/ /** * The Benchmark constructor. * * Note: The Benchmark constructor exposes a handful of lodash methods to * make working with arrays, collections, and objects easier. The lodash * methods are: * [`each/forEach`](https://lodash.com/docs#forEach), [`forOwn`](https://lodash.com/docs#forOwn), * [`has`](https://lodash.com/docs#has), [`indexOf`](https://lodash.com/docs#indexOf), * [`map`](https://lodash.com/docs#map), and [`reduce`](https://lodash.com/docs#reduce) * * @constructor * @param {string} name A name to identify the benchmark. * @param {Function|string} fn The test to benchmark. * @param {Object} [options={}] Options object. * @example * * // basic usage (the `new` operator is optional) * var bench = new Benchmark(fn); * * // or using a name first * var bench = new Benchmark('foo', fn); * * // or with options * var bench = new Benchmark('foo', fn, { * * // displayed by `Benchmark#toString` if `name` is not available * 'id': 'xyz', * * // called when the benchmark starts running * 'onStart': onStart, * * // called after each run cycle * 'onCycle': onCycle, * * // called when aborted * 'onAbort': onAbort, * * // called when a test errors * 'onError': onError, * * // called when reset * 'onReset': onReset, * * // called when the benchmark completes running * 'onComplete': onComplete, * * // compiled/called before the test loop * 'setup': setup, * * // compiled/called after the test loop * 'teardown': teardown * }); * * // or name and options * var bench = new Benchmark('foo', { * * // a flag to indicate the benchmark is deferred * 'defer': true, * * // benchmark test function * 'fn': function(deferred) { * // call `Deferred#resolve` when the deferred test is finished * deferred.resolve(); * } * }); * * // or options only * var bench = new Benchmark({ * * // benchmark name * 'name': 'foo', * * // benchmark test as a string * 'fn': '[1,2,3,4].sort()' * }); * * // a test's `this` binding is set to the benchmark instance * var bench = new Benchmark('foo', function() { * 'My name is '.concat(this.name); // "My name is foo" * }); */ function Benchmark(name, fn, options) { var bench = this; // Allow instance creation without the `new` operator. if (!(bench instanceof Benchmark)) { return new Benchmark(name, fn, options); } // Juggle arguments. if (_.isPlainObject(name)) { // 1 argument (options). options = name; } else if (_.isFunction(name)) { // 2 arguments (fn, options). options = fn; fn = name; } else if (_.isPlainObject(fn)) { // 2 arguments (name, options). options = fn; fn = null; bench.name = name; } else { // 3 arguments (name, fn [, options]). bench.name = name; } setOptions(bench, options); bench.id || (bench.id = ++counter); bench.fn == null && (bench.fn = fn); bench.stats = cloneDeep(bench.stats); bench.times = cloneDeep(bench.times); } /** * The Deferred constructor. * * @constructor * @memberOf Benchmark * @param {Object} clone The cloned benchmark instance. */ function Deferred(clone) { var deferred = this; if (!(deferred instanceof Deferred)) { return new Deferred(clone); } deferred.benchmark = clone; clock(deferred); } /** * The Event constructor. * * @constructor * @memberOf Benchmark * @param {Object|string} type The event type. */ function Event(type) { var event = this; if (type instanceof Event) { return type; } return (event instanceof Event) ? _.assign(event, { 'timeStamp': _.now() }, typeof type == 'string' ? { 'type': type } : type) : new Event(type); } /** * The Suite constructor. * * Note: Each Suite instance has a handful of wrapped lodash methods to * make working with Suites easier. The wrapped lodash methods are: * [`each/forEach`](https://lodash.com/docs#forEach), [`indexOf`](https://lodash.com/docs#indexOf), * [`map`](https://lodash.com/docs#map), and [`reduce`](https://lodash.com/docs#reduce) * * @constructor * @memberOf Benchmark * @param {string} name A name to identify the suite. * @param {Object} [options={}] Options object. * @example * * // basic usage (the `new` operator is optional) * var suite = new Benchmark.Suite; * * // or using a name first * var suite = new Benchmark.Suite('foo'); * * // or with options * var suite = new Benchmark.Suite('foo', { * * // called when the suite starts running * 'onStart': onStart, * * // called between running benchmarks * 'onCycle': onCycle, * * // called when aborted * 'onAbort': onAbort, * * // called when a test errors * 'onError': onError, * * // called when reset * 'onReset': onReset, * * // called when the suite completes running * 'onComplete': onComplete * }); */ function Suite(name, options) { var suite = this; // Allow instance creation without the `new` operator. if (!(suite instanceof Suite)) { return new Suite(name, options); } // Juggle arguments. if (_.isPlainObject(name)) { // 1 argument (options). options = name; } else { // 2 arguments (name [, options]). suite.name = name; } setOptions(suite, options); } /*------------------------------------------------------------------------*/ /** * A specialized version of `_.cloneDeep` which only clones arrays and plain * objects assigning all other values by reference. * * @private * @param {*} value The value to clone. * @returns {*} The cloned value. */ var cloneDeep = _.partial(_.cloneDeepWith, _, function(value) { // Only clone primitives, arrays, and plain objects. return (_.isObject(value) && !_.isArray(value) && !_.isPlainObject(value)) ? value : undefined; }); /** * Creates a function from the given arguments string and body. * * @private * @param {string} args The comma separated function arguments. * @param {string} body The function body. * @returns {Function} The new function. */ function createFunction() { // Lazy define. createFunction = function(args, body) { var result, anchor = freeDefine ? freeDefine.amd : Benchmark, prop = uid + 'createFunction'; runScript((freeDefine ? 'define.amd.' : 'Benchmark.') + prop + '=function(' + args + '){' + body + '}'); result = anchor[prop]; delete anchor[prop]; return result; }; // Fix JaegerMonkey bug. // For more information see http://bugzil.la/639720. createFunction = support.browser && (createFunction('', 'return"' + uid + '"') || _.noop)() == uid ? createFunction : Function; return createFunction.apply(null, arguments); } /** * Delay the execution of a function based on the benchmark's `delay` property. * * @private * @param {Object} bench The benchmark instance. * @param {Object} fn The function to execute. */ function delay(bench, fn) { bench._timerId = _.delay(fn, bench.delay * 1e3); } /** * Destroys the given element. * * @private * @param {Element} element The element to destroy. */ function destroyElement(element) { trash.appendChild(element); trash.innerHTML = ''; } /** * Gets the name of the first argument from a function's source. * * @private * @param {Function} fn The function. * @returns {string} The argument name. */ function getFirstArgument(fn) { return (!_.has(fn, 'toString') && (/^[\s(]*function[^(]*\(([^\s,)]+)/.exec(fn) || 0)[1]) || ''; } /** * Computes the arithmetic mean of a sample. * * @private * @param {Array} sample The sample. * @returns {number} The mean. */ function getMean(sample) { return (_.reduce(sample, function(sum, x) { return sum + x; }) / sample.length) || 0; } /** * Gets the source code of a function. * * @private * @param {Function} fn The function. * @returns {string} The function's source code. */ function getSource(fn) { var result = ''; if (isStringable(fn)) { result = String(fn); } else if (support.decompilation) { // Escape the `{` for Firefox 1. result = _.result(/^[^{]+\{([\s\S]*)\}\s*$/.exec(fn), 1); } // Trim string. result = (result || '').replace(/^\s+|\s+$/g, ''); // Detect strings containing only the "use strict" directive. return /^(?:\/\*+[\w\W]*?\*\/|\/\/.*?[\n\r\u2028\u2029]|\s)*(["'])use strict\1;?$/.test(result) ? '' : result; } /** * Checks if an object is of the specified class. * * @private * @param {*} value The value to check. * @param {string} name The name of the class. * @returns {boolean} Returns `true` if the value is of the specified class, else `false`. */ function isClassOf(value, name) { return value != null && toString.call(value) == '[object ' + name + ']'; } /** * Host objects can return type values that are different from their actual * data type. The objects we are concerned with usually return non-primitive * types of "object", "function", or "unknown". * * @private * @param {*} object The owner of the property. * @param {string} property The property to check. * @returns {boolean} Returns `true` if the property value is a non-primitive, else `false`. */ function isHostType(object, property) { if (object == null) { return false; } var type = typeof object[property]; return !rePrimitive.test(type) && (type != 'object' || !!object[property]); } /** * Checks if a value can be safely coerced to a string. * * @private * @param {*} value The value to check. * @returns {boolean} Returns `true` if the value can be coerced, else `false`. */ function isStringable(value) { return _.isString(value) || (_.has(value, 'toString') && _.isFunction(value.toString)); } /** * A wrapper around `require` to suppress `module missing` errors. * * @private * @param {string} id The module id. * @returns {*} The exported module or `null`. */ function req(id) { try { var result = freeExports && freeRequire(id); } catch(e) {} return result || null; } /** * Runs a snippet of JavaScript via script injection. * * @private * @param {string} code The code to run. */ function runScript(code) { var anchor = freeDefine ? define.amd : Benchmark, script = doc.createElement('script'), sibling = doc.getElementsByTagName('script')[0], parent = sibling.parentNode, prop = uid + 'runScript', prefix = '(' + (freeDefine ? 'define.amd.' : 'Benchmark.') + prop + '||function(){})();'; // Firefox 2.0.0.2 cannot use script injection as intended because it executes // asynchronously, but that's OK because script injection is only used to avoid // the previously commented JaegerMonkey bug. try { // Remove the inserted script *before* running the code to avoid differences // in the expected script element count/order of the document. script.appendChild(doc.createTextNode(prefix + code)); anchor[prop] = function() { destroyElement(script); }; } catch(e) { parent = parent.cloneNode(false); sibling = null; script.text = code; } parent.insertBefore(script, sibling); delete anchor[prop]; } /** * A helper function for setting options/event handlers. * * @private * @param {Object} object The benchmark or suite instance. * @param {Object} [options={}] Options object. */ function setOptions(object, options) { options = object.options = _.assign({}, cloneDeep(object.constructor.options), cloneDeep(options)); _.forOwn(options, function(value, key) { if (value != null) { // Add event listeners. if (/^on[A-Z]/.test(key)) { _.each(key.split(' '), function(key) { object.on(key.slice(2).toLowerCase(), value); }); } else if (!_.has(object, key)) { object[key] = cloneDeep(value); } } }); } /*------------------------------------------------------------------------*/ /** * Handles cycling/completing the deferred benchmark. * * @memberOf Benchmark.Deferred */ function resolve() { var deferred = this, clone = deferred.benchmark, bench = clone._original; if (bench.aborted) { // cycle() -> clone cycle/complete event -> compute()'s invoked bench.run() cycle/complete. deferred.teardown(); clone.running = false; cycle(deferred); } else if (++deferred.cycles < clone.count) { clone.compiled.call(deferred, context, timer); } else { timer.stop(deferred); deferred.teardown(); delay(clone, function() { cycle(deferred); }); } } /*------------------------------------------------------------------------*/ /** * A generic `Array#filter` like method. * * @static * @memberOf Benchmark * @param {Array} array The array to iterate over. * @param {Function|string} callback The function/alias called per iteration. * @returns {Array} A new array of values that passed callback filter. * @example * * // get odd numbers * Benchmark.filter([1, 2, 3, 4, 5], function(n) { * return n % 2; * }); // -> [1, 3, 5]; * * // get fastest benchmarks * Benchmark.filter(benches, 'fastest'); * * // get slowest benchmarks * Benchmark.filter(benches, 'slowest'); * * // get benchmarks that completed without erroring * Benchmark.filter(benches, 'successful'); */ function filter(array, callback) { if (callback === 'successful') { // Callback to exclude those that are errored, unrun, or have hz of Infinity. callback = function(bench) { return bench.cycles && _.isFinite(bench.hz) && !bench.error; }; } else if (callback === 'fastest' || callback === 'slowest') { // Get successful, sort by period + margin of error, and filter fastest/slowest. var result = filter(array, 'successful').sort(function(a, b) { a = a.stats; b = b.stats; return (a.mean + a.moe > b.mean + b.moe ? 1 : -1) * (callback === 'fastest' ? 1 : -1); }); return _.filter(result, function(bench) { return result[0].compare(bench) == 0; }); } return _.filter(array, callback); } /** * Converts a number to a more readable comma-separated string representation. * * @static * @memberOf Benchmark * @param {number} number The number to convert. * @returns {string} The more readable string representation. */ function formatNumber(number) { number = String(number).split('.'); return number[0].replace(/(?=(?:\d{3})+$)(?!\b)/g, ',') + (number[1] ? '.' + number[1] : ''); } /** * Invokes a method on all items in an array. * * @static * @memberOf Benchmark * @param {Array} benches Array of benchmarks to iterate over. * @param {Object|string} name The name of the method to invoke OR options object. * @param {...*} [args] Arguments to invoke the method with. * @returns {Array} A new array of values returned from each method invoked. * @example * * // invoke `reset` on all benchmarks * Benchmark.invoke(benches, 'reset'); * * // invoke `emit` with arguments * Benchmark.invoke(benches, 'emit', 'complete', listener); * * // invoke `run(true)`, treat benchmarks as a queue, and register invoke callbacks * Benchmark.invoke(benches, { * * // invoke the `run` method * 'name': 'run', * * // pass a single argument * 'args': true, * * // treat as queue, removing benchmarks from front of `benches` until empty * 'queued': true, * * // called before any benchmarks have been invoked. * 'onStart': onStart, * * // called between invoking benchmarks * 'onCycle': onCycle, * * // called after all benchmarks have been invoked. * 'onComplete': onComplete * }); */ function invoke(benches, name) { var args, bench, queued, index = -1, eventProps = { 'currentTarget': benches }, options = { 'onStart': _.noop, 'onCycle': _.noop, 'onComplete': _.noop }, result = _.toArray(benches); /** * Invokes the method of the current object and if synchronous, fetches the next. */ function execute() { var listeners, async = isAsync(bench); if (async) { // Use `getNext` as the first listener. bench.on('complete', getNext); listeners = bench.events.complete; listeners.splice(0, 0, listeners.pop()); } // Execute method. result[index] = _.isFunction(bench && bench[name]) ? bench[name].apply(bench, args) : undefined; // If synchronous return `true` until finished. return !async && getNext(); } /** * Fetches the next bench or executes `onComplete` callback. */ function getNext(event) { var cycleEvent, last = bench, async = isAsync(last); if (async) { last.off('complete', getNext); last.emit('complete'); } // Emit "cycle" event. eventProps.type = 'cycle'; eventProps.target = last; cycleEvent = Event(eventProps); options.onCycle.call(benches, cycleEvent); // Choose next benchmark if not exiting early. if (!cycleEvent.aborted && raiseIndex() !== false) { bench = queued ? benches[0] : result[index]; if (isAsync(bench)) { delay(bench, execute); } else if (async) { // Resume execution if previously asynchronous but now synchronous. while (execute()) {} } else { // Continue synchronous execution. return true; } } else { // Emit "complete" event. eventProps.type = 'complete'; options.onComplete.call(benches, Event(eventProps)); } // When used as a listener `event.aborted = true` will cancel the rest of // the "complete" listeners because they were already called above and when // used as part of `getNext` the `return false` will exit the execution while-loop. if (event) { event.aborted = true; } else { return false; } } /** * Checks if invoking `Benchmark#run` with asynchronous cycles. */ function isAsync(object) { // Avoid using `instanceof` here because of IE memory leak issues with host objects. var async = args[0] && args[0].async; return name == 'run' && (object instanceof Benchmark) && ((async == null ? object.options.async : async) && support.timeout || object.defer); } /** * Raises `index` to the next defined index or returns `false`. */ function raiseIndex() { index++; // If queued remove the previous bench. if (queued && index > 0) { shift.call(benches); } // If we reached the last index then return `false`. return (queued ? benches.length : index < result.length) ? index : (index = false); } // Juggle arguments. if (_.isString(name)) { // 2 arguments (array, name). args = slice.call(arguments, 2); } else { // 2 arguments (array, options). options = _.assign(options, name); name = options.name; args = _.isArray(args = 'args' in options ? options.args : []) ? args : [args]; queued = options.queued; } // Start iterating over the array. if (raiseIndex() !== false) { // Emit "start" event. bench = result[index]; eventProps.type = 'start'; eventProps.target = bench; options.onStart.call(benches, Event(eventProps)); // End early if the suite was aborted in an "onStart" listener. if (name == 'run' && (benches instanceof Suite) && benches.aborted) { // Emit "cycle" event. eventProps.type = 'cycle'; options.onCycle.call(benches, Event(eventProps)); // Emit "complete" event. eventProps.type = 'complete'; options.onComplete.call(benches, Event(eventProps)); } // Start method execution. else { if (isAsync(bench)) { delay(bench, execute); } else { while (execute()) {} } } } return result; } /** * Creates a string of joined array values or object key-value pairs. * * @static * @memberOf Benchmark * @param {Array|Object} object The object to operate on. * @param {string} [separator1=','] The separator used between key-value pairs. * @param {string} [separator2=': '] The separator used between keys and values. * @returns {string} The joined result. */ function join(object, separator1, separator2) { var result = [], length = (object = Object(object)).length, arrayLike = length === length >>> 0; separator2 || (separator2 = ': '); _.each(object, function(value, key) { result.push(arrayLike ? value : key + separator2 + value); }); return result.join(separator1 || ','); } /*------------------------------------------------------------------------*/ /** * Aborts all benchmarks in the suite. * * @name abort * @memberOf Benchmark.Suite * @returns {Object} The suite instance. */ function abortSuite() { var event, suite = this, resetting = calledBy.resetSuite; if (suite.running) { event = Event('abort'); suite.emit(event); if (!event.cancelled || resetting) { // Avoid infinite recursion. calledBy.abortSuite = true; suite.reset(); delete calledBy.abortSuite; if (!resetting) { suite.aborted = true; invoke(suite, 'abort'); } } } return suite; } /** * Adds a test to the benchmark suite. * * @memberOf Benchmark.Suite * @param {string} name A name to identify the benchmark. * @param {Function|string} fn The test to benchmark. * @param {Object} [options={}] Options object. * @returns {Object} The benchmark instance. * @example * * // basic usage * suite.add(fn); * * // or using a name first * suite.add('foo', fn); * * // or with options * suite.add('foo', fn, { * 'onCycle': onCycle, * 'onComplete': onComplete * }); * * // or name and options * suite.add('foo', { * 'fn': fn, * 'onCycle': onCycle, * 'onComplete': onComplete * }); * * // or options only * suite.add({ * 'name': 'foo', * 'fn': fn, * 'onCycle': onCycle, * 'onComplete': onComplete * }); */ function add(name, fn, options) { var suite = this, bench = new Benchmark(name, fn, options), event = Event({ 'type': 'add', 'target': bench }); if (suite.emit(event), !event.cancelled) { suite.push(bench); } return suite; } /** * Creates a new suite with cloned benchmarks. * * @name clone * @memberOf Benchmark.Suite * @param {Object} options Options object to overwrite cloned options. * @returns {Object} The new suite instance. */ function cloneSuite(options) { var suite = this, result = new suite.constructor(_.assign({}, suite.options, options)); // Copy own properties. _.forOwn(suite, function(value, key) { if (!_.has(result, key)) { result[key] = value && _.isFunction(value.clone) ? value.clone() : cloneDeep(value); } }); return result; } /** * An `Array#filter` like method. * * @name filter * @memberOf Benchmark.Suite * @param {Function|string} callback The function/alias called per iteration. * @returns {Object} A new suite of benchmarks that passed callback filter. */ function filterSuite(callback) { var suite = this, result = new suite.constructor(suite.options); result.push.apply(result, filter(suite, callback)); return result; } /** * Resets all benchmarks in the suite. * * @name reset * @memberOf Benchmark.Suite * @returns {Object} The suite instance. */ function resetSuite() { var event, suite = this, aborting = calledBy.abortSuite; if (suite.running && !aborting) { // No worries, `resetSuite()` is called within `abortSuite()`. calledBy.resetSuite = true; suite.abort(); delete calledBy.resetSuite; } // Reset if the state has changed. else if ((suite.aborted || suite.running) && (suite.emit(event = Event('reset')), !event.cancelled)) { suite.aborted = suite.running = false; if (!aborting) { invoke(suite, 'reset'); } } return suite; } /** * Runs the suite. * * @name run * @memberOf Benchmark.Suite * @param {Object} [options={}] Options object. * @returns {Object} The suite instance. * @example * * // basic usage * suite.run(); * * // or with options * suite.run({ 'async': true, 'queued': true }); */ function runSuite(options) { var suite = this; suite.reset(); suite.running = true; options || (options = {}); invoke(suite, { 'name': 'run', 'args': options, 'queued': options.queued, 'onStart': function(event) { suite.emit(event); }, 'onCycle': function(event) { var bench = event.target; if (bench.error) { suite.emit({ 'type': 'error', 'target': bench }); } suite.emit(event); event.aborted = suite.aborted; }, 'onComplete': function(event) { suite.running = false; suite.emit(event); } }); return suite; } /*------------------------------------------------------------------------*/ /** * Executes all registered listeners of the specified event type. * * @memberOf Benchmark, Benchmark.Suite * @param {Object|string} type The event type or object. * @param {...*} [args] Arguments to invoke the listener with. * @returns {*} Returns the return value of the last listener executed. */ function emit(type) { var listeners, object = this, event = Event(type), events = object.events, args = (arguments[0] = event, arguments); event.currentTarget || (event.currentTarget = object); event.target || (event.target = object); delete event.result; if (events && (listeners = _.has(events, event.type) && events[event.type])) { _.each(listeners.slice(), function(listener) { if ((event.result = listener.apply(object, args)) === false) { event.cancelled = true; } return !event.aborted; }); } return event.result; } /** * Returns an array of event listeners for a given type that can be manipulated * to add or remove listeners. * * @memberOf Benchmark, Benchmark.Suite * @param {string} type The event type. * @returns {Array} The listeners array. */ function listeners(type) { var object = this, events = object.events || (object.events = {}); return _.has(events, type) ? events[type] : (events[type] = []); } /** * Unregisters a listener for the specified event type(s), * or unregisters all listeners for the specified event type(s), * or unregisters all listeners for all event types. * * @memberOf Benchmark, Benchmark.Suite * @param {string} [type] The event type. * @param {Function} [listener] The function to unregister. * @returns {Object} The benchmark instance. * @example * * // unregister a listener for an event type * bench.off('cycle', listener); * * // unregister a listener for multiple event types * bench.off('start cycle', listener); * * // unregister all listeners for an event type * bench.off('cycle'); * * // unregister all listeners for multiple event types * bench.off('start cycle complete'); * * // unregister all listeners for all event types * bench.off(); */ function off(type, listener) { var object = this, events = object.events; if (!events) { return object; } _.each(type ? type.split(' ') : events, function(listeners, type) { var index; if (typeof listeners == 'string') { type = listeners; listeners = _.has(events, type) && events[type]; } if (listeners) { if (listener) { index = _.indexOf(listeners, listener); if (index > -1) { listeners.splice(index, 1); } } else { listeners.length = 0; } } }); return object; } /** * Registers a listener for the specified event type(s). * * @memberOf Benchmark, Benchmark.Suite * @param {string} type The event type. * @param {Function} listener The function to register. * @returns {Object} The benchmark instance. * @example * * // register a listener for an event type * bench.on('cycle', listener); * * // register a listener for multiple event types * bench.on('start cycle', listener); */ function on(type, listener) { var object = this, events = object.events || (object.events = {}); _.each(type.split(' '), function(type) { (_.has(events, type) ? events[type] : (events[type] = []) ).push(listener); }); return object; } /*------------------------------------------------------------------------*/ /** * Aborts the benchmark without recording times. * * @memberOf Benchmark * @returns {Object} The benchmark instance. */ function abort() { var event, bench = this, resetting = calledBy.reset; if (bench.running) { event = Event('abort'); bench.emit(event); if (!event.cancelled || resetting) { // Avoid infinite recursion. calledBy.abort = true; bench.reset(); delete calledBy.abort; if (support.timeout) { clearTimeout(bench._timerId); delete bench._timerId; } if (!resetting) { bench.aborted = true; bench.running = false; } } } return bench; } /** * Creates a new benchmark using the same test and options. * * @memberOf Benchmark * @param {Object} options Options object to overwrite cloned options. * @returns {Object} The new benchmark instance. * @example * * var bizarro = bench.clone({ * 'name': 'doppelganger' * }); */ function clone(options) { var bench = this, result = new bench.constructor(_.assign({}, bench, options)); // Correct the `options` object. result.options = _.assign({}, cloneDeep(bench.options), cloneDeep(options)); // Copy own custom properties. _.forOwn(bench, function(value, key) { if (!_.has(result, key)) { result[key] = cloneDeep(value); } }); return result; } /** * Determines if a benchmark is faster than another. * * @memberOf Benchmark * @param {Object} other The benchmark to compare. * @returns {number} Returns `-1` if slower, `1` if faster, and `0` if indeterminate. */ function compare(other) { var bench = this; // Exit early if comparing the same benchmark. if (bench == other) { return 0; } var critical, zStat, sample1 = bench.stats.sample, sample2 = other.stats.sample, size1 = sample1.length, size2 = sample2.length, maxSize = max(size1, size2), minSize = min(size1, size2), u1 = getU(sample1, sample2), u2 = getU(sample2, sample1), u = min(u1, u2); function getScore(xA, sampleB) { return _.reduce(sampleB, function(total, xB) { return total + (xB > xA ? 0 : xB < xA ? 1 : 0.5); }, 0); } function getU(sampleA, sampleB) { return _.reduce(sampleA, function(total, xA) { return total + getScore(xA, sampleB); }, 0); } function getZ(u) { return (u - ((size1 * size2) / 2)) / sqrt((size1 * size2 * (size1 + size2 + 1)) / 12); } // Reject the null hypothesis the two samples come from the // same population (i.e. have the same median) if... if (size1 + size2 > 30) { // ...the z-stat is greater than 1.96 or less than -1.96 // http://www.statisticslectures.com/topics/mannwhitneyu/ zStat = getZ(u); return abs(zStat) > 1.96 ? (u == u1 ? 1 : -1) : 0; } // ...the U value is less than or equal the critical U value. critical = maxSize < 5 || minSize < 3 ? 0 : uTable[maxSize][minSize - 3]; return u <= critical ? (u == u1 ? 1 : -1) : 0; } /** * Reset properties and abort if running. * * @memberOf Benchmark * @returns {Object} The benchmark instance. */ function reset() { var bench = this; if (bench.running && !calledBy.abort) { // No worries, `reset()` is called within `abort()`. calledBy.reset = true; bench.abort(); delete calledBy.reset; return bench; } var event, index = 0, changes = [], queue = []; // A non-recursive solution to check if properties have changed. // For more information see http://www.jslab.dk/articles/non.recursive.preorder.traversal.part4. var data = { 'destination': bench, 'source': _.assign({}, cloneDeep(bench.constructor.prototype), cloneDeep(bench.options)) }; do { _.forOwn(data.source, function(value, key) { var changed, destination = data.destination, currValue = destination[key]; // Skip pseudo private properties like `_timerId` which could be a // Java object in environments like RingoJS. if (key.charAt(0) == '_') { return; } if (value && typeof value == 'object') { if (_.isArray(value)) { // Check if an array value has changed to a non-array value. if (!_.isArray(currValue)) { changed = currValue = []; } // Check if an array has changed its length. if (currValue.length != value.length) { changed = currValue = currValue.slice(0, value.length); currValue.length = value.length; } } // Check if an object has changed to a non-object value. else if (!currValue || typeof currValue != 'object') { changed = currValue = {}; } // Register a changed object. if (changed) { changes.push({ 'destination': destination, 'key': key, 'value': currValue }); } queue.push({ 'destination': currValue, 'source': value }); } // Register a changed primitive. else if (value !== currValue && !(value == null || _.isFunction(value))) { changes.push({ 'destination': destination, 'key': key, 'value': value }); } }); } while ((data = queue[index++])); // If changed emit the `reset` event and if it isn't cancelled reset the benchmark. if (changes.length && (bench.emit(event = Event('reset')), !event.cancelled)) { _.each(changes, function(data) { data.destination[data.key] = data.value; }); } return bench; } /** * Displays relevant benchmark information when coerced to a string. * * @name toString * @memberOf Benchmark * @returns {string} A string representation of the benchmark instance. */ function toStringBench() { var bench = this, error = bench.error, hz = bench.hz, id = bench.id, stats = bench.stats, size = stats.sample.length, pm = '\xb1', result = bench.name || (_.isNaN(id) ? id : ''); if (error) { result += ': ' + join(error); } else { result += ' x ' + formatNumber(hz.toFixed(hz < 100 ? 2 : 0)) + ' ops/sec ' + pm + stats.rme.toFixed(2) + '% (' + size + ' run' + (size == 1 ? '' : 's') + ' sampled)'; } return result; } /*------------------------------------------------------------------------*/ /** * Clocks the time taken to execute a test per cycle (secs). * * @private * @param {Object} bench The benchmark instance. * @returns {number} The time taken. */ function clock() { var options = Benchmark.options, templateData = {}, timers = [{ 'ns': timer.ns, 'res': max(0.0015, getRes('ms')), 'unit': 'ms' }]; // Lazy define for hi-res timers. clock = function(clone) { var deferred; if (clone instanceof Deferred) { deferred = clone; clone = deferred.benchmark; } var bench = clone._original, stringable = isStringable(bench.fn), count = bench.count = clone.count, decompilable = stringable || (support.decompilation && (clone.setup !== _.noop || clone.teardown !== _.noop)), id = bench.id, name = bench.name || (typeof id == 'number' ? '' : id), result = 0; // Init `minTime` if needed. clone.minTime = bench.minTime || (bench.minTime = bench.options.minTime = options.minTime); // Compile in setup/teardown functions and the test loop. // Create a new compiled test, instead of using the cached `bench.compiled`, // to avoid potential engine optimizations enabled over the life of the test. var funcBody = deferred ? 'var d#=this,${fnArg}=d#,m#=d#.benchmark._original,f#=m#.fn,su#=m#.setup,td#=m#.teardown;' + // When `deferred.cycles` is `0` then... 'if(!d#.cycles){' + // set `deferred.fn`, 'd#.fn=function(){var ${fnArg}=d#;if(typeof f#=="function"){try{${fn}\n}catch(e#){f#(d#)}}else{${fn}\n}};' + // set `deferred.teardown`, 'd#.teardown=function(){d#.cycles=0;if(typeof td#=="function"){try{${teardown}\n}catch(e#){td#()}}else{${teardown}\n}};' + // execute the benchmark's `setup`, 'if(typeof su#=="function"){try{${setup}\n}catch(e#){su#()}}else{${setup}\n};' + // start timer, 't#.start(d#);' + // and then execute `deferred.fn` and return a dummy object. '}d#.fn();return{uid:"${uid}"}' : 'var r#,s#,m#=this,f#=m#.fn,i#=m#.count,n#=t#.ns;${setup}\n${begin};' + 'while(i#--){${fn}\n}${end};${teardown}\nreturn{elapsed:r#,uid:"${uid}"}'; var compiled = bench.compiled = clone.compiled = createCompiled(bench, decompilable, deferred, funcBody), isEmpty = !(templateData.fn || stringable); try { if (isEmpty) { // Firefox may remove dead code from `Function#toString` results. // For more information see http://bugzil.la/536085. throw new Error('The test "' + name + '" is empty. This may be the result of dead code removal.'); } else if (!deferred) { // Pretest to determine if compiled code exits early, usually by a // rogue `return` statement, by checking for a return object with the uid. bench.count = 1; compiled = decompilable && (compiled.call(bench, context, timer) || {}).uid == templateData.uid && compiled; bench.count = count; } } catch(e) { compiled = null; clone.error = e || new Error(String(e)); bench.count = count; } // Fallback when a test exits early or errors during pretest. if (!compiled && !deferred && !isEmpty) { funcBody = ( stringable || (decompilable && !clone.error) ? 'function f#(){${fn}\n}var r#,s#,m#=this,i#=m#.count' : 'var r#,s#,m#=this,f#=m#.fn,i#=m#.count' ) + ',n#=t#.ns;${setup}\n${begin};m#.f#=f#;while(i#--){m#.f#()}${end};' + 'delete m#.f#;${teardown}\nreturn{elapsed:r#}'; compiled = createCompiled(bench, decompilable, deferred, funcBody); try { // Pretest one more time to check for errors. bench.count = 1; compiled.call(bench, context, timer); bench.count = count; delete clone.error; } catch(e) { bench.count = count; if (!clone.error) { clone.error = e || new Error(String(e)); } } } // If no errors run the full test loop. if (!clone.error) { compiled = bench.compiled = clone.compiled = createCompiled(bench, decompilable, deferred, funcBody); result = compiled.call(deferred || bench, context, timer).elapsed; } return result; }; /*----------------------------------------------------------------------*/ /** * Creates a compiled function from the given function `body`. */ function createCompiled(bench, decompilable, deferred, body) { var fn = bench.fn, fnArg = deferred ? getFirstArgument(fn) || 'deferred' : ''; templateData.uid = uid + uidCounter++; _.assign(templateData, { 'setup': decompilable ? getSource(bench.setup) : interpolate('m#.setup()'), 'fn': decompilable ? getSource(fn) : interpolate('m#.fn(' + fnArg + ')'), 'fnArg': fnArg, 'teardown': decompilable ? getSource(bench.teardown) : interpolate('m#.teardown()') }); // Use API of chosen timer. if (timer.unit == 'ns') { _.assign(templateData, { 'begin': interpolate('s#=n#()'), 'end': interpolate('r#=n#(s#);r#=r#[0]+(r#[1]/1e9)') }); } else if (timer.unit == 'us') { if (timer.ns.stop) { _.assign(templateData, { 'begin': interpolate('s#=n#.start()'), 'end': interpolate('r#=n#.microseconds()/1e6') }); } else { _.assign(templateData, { 'begin': interpolate('s#=n#()'), 'end': interpolate('r#=(n#()-s#)/1e6') }); } } else if (timer.ns.now) { _.assign(templateData, { 'begin': interpolate('s#=n#.now()'), 'end': interpolate('r#=(n#.now()-s#)/1e3') }); } else { _.assign(templateData, { 'begin': interpolate('s#=new n#().getTime()'), 'end': interpolate('r#=(new n#().getTime()-s#)/1e3') }); } // Define `timer` methods. timer.start = createFunction( interpolate('o#'), interpolate('var n#=this.ns,${begin};o#.elapsed=0;o#.timeStamp=s#') ); timer.stop = createFunction( interpolate('o#'), interpolate('var n#=this.ns,s#=o#.timeStamp,${end};o#.elapsed=r#') ); // Create compiled test. return createFunction( interpolate('window,t#'), 'var global = window, clearTimeout = global.clearTimeout, setTimeout = global.setTimeout;\n' + interpolate(body) ); } /** * Gets the current timer's minimum resolution (secs). */ function getRes(unit) { var measured, begin, count = 30, divisor = 1e3, ns = timer.ns, sample = []; // Get average smallest measurable time. while (count--) { if (unit == 'us') { divisor = 1e6; if (ns.stop) { ns.start(); while (!(measured = ns.microseconds())) {} } else { begin = ns(); while (!(measured = ns() - begin)) {} } } else if (unit == 'ns') { divisor = 1e9; begin = (begin = ns())[0] + (begin[1] / divisor); while (!(measured = ((measured = ns())[0] + (measured[1] / divisor)) - begin)) {} divisor = 1; } else if (ns.now) { begin = ns.now(); while (!(measured = ns.now() - begin)) {} } else { begin = new ns().getTime(); while (!(measured = new ns().getTime() - begin)) {} } // Check for broken timers. if (measured > 0) { sample.push(measured); } else { sample.push(Infinity); break; } } // Convert to seconds. return getMean(sample) / divisor; } /** * Interpolates a given template string. */ function interpolate(string) { // Replaces all occurrences of `#` with a unique number and template tokens with content. return _.template(string.replace(/\#/g, /\d+/.exec(templateData.uid)))(templateData); } /*----------------------------------------------------------------------*/ // Detect Chrome's microsecond timer: // enable benchmarking via the --enable-benchmarking command // line switch in at least Chrome 7 to use chrome.Interval try { if ((timer.ns = new (context.chrome || context.chromium).Interval)) { timers.push({ 'ns': timer.ns, 'res': getRes('us'), 'unit': 'us' }); } } catch(e) {} // Detect Node.js's nanosecond resolution timer available in Node.js >= 0.8. if (processObject && typeof (timer.ns = processObject.hrtime) == 'function') { timers.push({ 'ns': timer.ns, 'res': getRes('ns'), 'unit': 'ns' }); } // Detect Wade Simmons' Node.js `microtime` module. if (microtimeObject && typeof (timer.ns = microtimeObject.now) == 'function') { timers.push({ 'ns': timer.ns, 'res': getRes('us'), 'unit': 'us' }); } // Pick timer with highest resolution. timer = _.minBy(timers, 'res'); // Error if there are no working timers. if (timer.res == Infinity) { throw new Error('Benchmark.js was unable to find a working timer.'); } // Resolve time span required to achieve a percent uncertainty of at most 1%. // For more information see http://spiff.rit.edu/classes/phys273/uncert/uncert.html. options.minTime || (options.minTime = max(timer.res / 2 / 0.01, 0.05)); return clock.apply(null, arguments); } /*------------------------------------------------------------------------*/ /** * Computes stats on benchmark results. * * @private * @param {Object} bench The benchmark instance. * @param {Object} options The options object. */ function compute(bench, options) { options || (options = {}); var async = options.async, elapsed = 0, initCount = bench.initCount, minSamples = bench.minSamples, queue = [], sample = bench.stats.sample; /** * Adds a clone to the queue. */ function enqueue() { queue.push(bench.clone({ '_original': bench, 'events': { 'abort': [update], 'cycle': [update], 'error': [update], 'start': [update] } })); } /** * Updates the clone/original benchmarks to keep their data in sync. */ function update(event) { var clone = this, type = event.type; if (bench.running) { if (type == 'start') { // Note: `clone.minTime` prop is inited in `clock()`. clone.count = bench.initCount; } else { if (type == 'error') { bench.error = clone.error; } if (type == 'abort') { bench.abort(); bench.emit('cycle'); } else { event.currentTarget = event.target = bench; bench.emit(event); } } } else if (bench.aborted) { // Clear abort listeners to avoid triggering bench's abort/cycle again. clone.events.abort.length = 0; clone.abort(); } } /** * Determines if more clones should be queued or if cycling should stop. */ function evaluate(event) { var critical, df, mean, moe, rme, sd, sem, variance, clone = event.target, done = bench.aborted, now = _.now(), size = sample.push(clone.times.period), maxedOut = size >= minSamples && (elapsed += now - clone.times.timeStamp) / 1e3 > bench.maxTime, times = bench.times, varOf = function(sum, x) { return sum + pow(x - mean, 2); }; // Exit early for aborted or unclockable tests. if (done || clone.hz == Infinity) { maxedOut = !(size = sample.length = queue.length = 0); } if (!done) { // Compute the sample mean (estimate of the population mean). mean = getMean(sample); // Compute the sample variance (estimate of the population variance). variance = _.reduce(sample, varOf, 0) / (size - 1) || 0; // Compute the sample standard deviation (estimate of the population standard deviation). sd = sqrt(variance); // Compute the standard error of the mean (a.k.a. the standard deviation of the sampling distribution of the sample mean). sem = sd / sqrt(size); // Compute the degrees of freedom. df = size - 1; // Compute the critical value. critical = tTable[Math.round(df) || 1] || tTable.infinity; // Compute the margin of error. moe = sem * critical; // Compute the relative margin of error. rme = (moe / mean) * 100 || 0; _.assign(bench.stats, { 'deviation': sd, 'mean': mean, 'moe': moe, 'rme': rme, 'sem': sem, 'variance': variance }); // Abort the cycle loop when the minimum sample size has been collected // and the elapsed time exceeds the maximum time allowed per benchmark. // We don't count cycle delays toward the max time because delays may be // increased by browsers that clamp timeouts for inactive tabs. For more // information see https://developer.mozilla.org/en/window.setTimeout#Inactive_tabs. if (maxedOut) { // Reset the `initCount` in case the benchmark is rerun. bench.initCount = initCount; bench.running = false; done = true; times.elapsed = (now - times.timeStamp) / 1e3; } if (bench.hz != Infinity) { bench.hz = 1 / mean; times.cycle = mean * bench.count; times.period = mean; } } // If time permits, increase sample size to reduce the margin of error. if (queue.length < 2 && !maxedOut) { enqueue(); } // Abort the `invoke` cycle when done. event.aborted = done; } // Init queue and begin. enqueue(); invoke(queue, { 'name': 'run', 'args': { 'async': async }, 'queued': true, 'onCycle': evaluate, 'onComplete': function() { bench.emit('complete'); } }); } /*------------------------------------------------------------------------*/ /** * Cycles a benchmark until a run `count` can be established. * * @private * @param {Object} clone The cloned benchmark instance. * @param {Object} options The options object. */ function cycle(clone, options) { options || (options = {}); var deferred; if (clone instanceof Deferred) { deferred = clone; clone = clone.benchmark; } var clocked, cycles, divisor, event, minTime, period, async = options.async, bench = clone._original, count = clone.count, times = clone.times; // Continue, if not aborted between cycles. if (clone.running) { // `minTime` is set to `Benchmark.options.minTime` in `clock()`. cycles = ++clone.cycles; clocked = deferred ? deferred.elapsed : clock(clone); minTime = clone.minTime; if (cycles > bench.cycles) { bench.cycles = cycles; } if (clone.error) { event = Event('error'); event.message = clone.error; clone.emit(event); if (!event.cancelled) { clone.abort(); } } } // Continue, if not errored. if (clone.running) { // Compute the time taken to complete last test cycle. bench.times.cycle = times.cycle = clocked; // Compute the seconds per operation. period = bench.times.period = times.period = clocked / count; // Compute the ops per second. bench.hz = clone.hz = 1 / period; // Avoid working our way up to this next time. bench.initCount = clone.initCount = count; // Do we need to do another cycle? clone.running = clocked < minTime; if (clone.running) { // Tests may clock at `0` when `initCount` is a small number, // to avoid that we set its count to something a bit higher. if (!clocked && (divisor = divisors[clone.cycles]) != null) { count = floor(4e6 / divisor); } // Calculate how many more iterations it will take to achieve the `minTime`. if (count <= clone.count) { count += Math.ceil((minTime - clocked) / period); } clone.running = count != Infinity; } } // Should we exit early? event = Event('cycle'); clone.emit(event); if (event.aborted) { clone.abort(); } // Figure out what to do next. if (clone.running) { // Start a new cycle. clone.count = count; if (deferred) { clone.compiled.call(deferred, context, timer); } else if (async) { delay(clone, function() { cycle(clone, options); }); } else { cycle(clone); } } else { // Fix TraceMonkey bug associated with clock fallbacks. // For more information see http://bugzil.la/509069. if (support.browser) { runScript(uid + '=1;delete ' + uid); } // We're done. clone.emit('complete'); } } /*------------------------------------------------------------------------*/ /** * Runs the benchmark. * * @memberOf Benchmark * @param {Object} [options={}] Options object. * @returns {Object} The benchmark instance. * @example * * // basic usage * bench.run(); * * // or with options * bench.run({ 'async': true }); */ function run(options) { var bench = this, event = Event('start'); // Set `running` to `false` so `reset()` won't call `abort()`. bench.running = false; bench.reset(); bench.running = true; bench.count = bench.initCount; bench.times.timeStamp = _.now(); bench.emit(event); if (!event.cancelled) { options = { 'async': ((options = options && options.async) == null ? bench.async : options) && support.timeout }; // For clones created within `compute()`. if (bench._original) { if (bench.defer) { Deferred(bench); } else { cycle(bench, options); } } // For original benchmarks. else { compute(bench, options); } } return bench; } /*------------------------------------------------------------------------*/ // Firefox 1 erroneously defines variable and argument names of functions on // the function itself as non-configurable properties with `undefined` values. // The bugginess continues as the `Benchmark` constructor has an argument // named `options` and Firefox 1 will not assign a value to `Benchmark.options`, // making it non-writable in the process, unless it is the first property // assigned by for-in loop of `_.assign()`. _.assign(Benchmark, { /** * The default options copied by benchmark instances. * * @static * @memberOf Benchmark * @type Object */ 'options': { /** * A flag to indicate that benchmark cycles will execute asynchronously * by default. * * @memberOf Benchmark.options * @type boolean */ 'async': false, /** * A flag to indicate that the benchmark clock is deferred. * * @memberOf Benchmark.options * @type boolean */ 'defer': false, /** * The delay between test cycles (secs). * @memberOf Benchmark.options * @type number */ 'delay': 0.005, /** * Displayed by `Benchmark#toString` when a `name` is not available * (auto-generated if absent). * * @memberOf Benchmark.options * @type string */ 'id': undefined, /** * The default number of times to execute a test on a benchmark's first cycle. * * @memberOf Benchmark.options * @type number */ 'initCount': 1, /** * The maximum time a benchmark is allowed to run before finishing (secs). * * Note: Cycle delays aren't counted toward the maximum time. * * @memberOf Benchmark.options * @type number */ 'maxTime': 5, /** * The minimum sample size required to perform statistical analysis. * * @memberOf Benchmark.options * @type number */ 'minSamples': 5, /** * The time needed to reduce the percent uncertainty of measurement to 1% (secs). * * @memberOf Benchmark.options * @type number */ 'minTime': 0, /** * The name of the benchmark. * * @memberOf Benchmark.options * @type string */ 'name': undefined, /** * An event listener called when the benchmark is aborted. * * @memberOf Benchmark.options * @type Function */ 'onAbort': undefined, /** * An event listener called when the benchmark completes running. * * @memberOf Benchmark.options * @type Function */ 'onComplete': undefined, /** * An event listener called after each run cycle. * * @memberOf Benchmark.options * @type Function */ 'onCycle': undefined, /** * An event listener called when a test errors. * * @memberOf Benchmark.options * @type Function */ 'onError': undefined, /** * An event listener called when the benchmark is reset. * * @memberOf Benchmark.options * @type Function */ 'onReset': undefined, /** * An event listener called when the benchmark starts running. * * @memberOf Benchmark.options * @type Function */ 'onStart': undefined }, /** * Platform object with properties describing things like browser name, * version, and operating system. See [`platform.js`](https://mths.be/platform). * * @static * @memberOf Benchmark * @type Object */ 'platform': context.platform || req('platform') || ({ 'description': context.navigator && context.navigator.userAgent || null, 'layout': null, 'product': null, 'name': null, 'manufacturer': null, 'os': null, 'prerelease': null, 'version': null, 'toString': function() { return this.description || ''; } }), /** * The semantic version number. * * @static * @memberOf Benchmark * @type string */ 'version': '2.1.0' }); _.assign(Benchmark, { 'filter': filter, 'formatNumber': formatNumber, 'invoke': invoke, 'join': join, 'runInContext': runInContext, 'support': support }); // Add lodash methods to Benchmark. _.each(['each', 'forEach', 'forOwn', 'has', 'indexOf', 'map', 'reduce'], function(methodName) { Benchmark[methodName] = _[methodName]; }); /*------------------------------------------------------------------------*/ _.assign(Benchmark.prototype, { /** * The number of times a test was executed. * * @memberOf Benchmark * @type number */ 'count': 0, /** * The number of cycles performed while benchmarking. * * @memberOf Benchmark * @type number */ 'cycles': 0, /** * The number of executions per second. * * @memberOf Benchmark * @type number */ 'hz': 0, /** * The compiled test function. * * @memberOf Benchmark * @type {Function|string} */ 'compiled': undefined, /** * The error object if the test failed. * * @memberOf Benchmark * @type Object */ 'error': undefined, /** * The test to benchmark. * * @memberOf Benchmark * @type {Function|string} */ 'fn': undefined, /** * A flag to indicate if the benchmark is aborted. * * @memberOf Benchmark * @type boolean */ 'aborted': false, /** * A flag to indicate if the benchmark is running. * * @memberOf Benchmark * @type boolean */ 'running': false, /** * Compiled into the test and executed immediately **before** the test loop. * * @memberOf Benchmark * @type {Function|string} * @example * * // basic usage * var bench = Benchmark({ * 'setup': function() { * var c = this.count, * element = document.getElementById('container'); * while (c--) { * element.appendChild(document.createElement('div')); * } * }, * 'fn': function() { * element.removeChild(element.lastChild); * } * }); * * // compiles to something like: * var c = this.count, * element = document.getElementById('container'); * while (c--) { * element.appendChild(document.createElement('div')); * } * var start = new Date; * while (count--) { * element.removeChild(element.lastChild); * } * var end = new Date - start; * * // or using strings * var bench = Benchmark({ * 'setup': '\ * var a = 0;\n\ * (function() {\n\ * (function() {\n\ * (function() {', * 'fn': 'a += 1;', * 'teardown': '\ * }())\n\ * }())\n\ * }())' * }); * * // compiles to something like: * var a = 0; * (function() { * (function() { * (function() { * var start = new Date; * while (count--) { * a += 1; * } * var end = new Date - start; * }()) * }()) * }()) */ 'setup': _.noop, /** * Compiled into the test and executed immediately **after** the test loop. * * @memberOf Benchmark * @type {Function|string} */ 'teardown': _.noop, /** * An object of stats including mean, margin or error, and standard deviation. * * @memberOf Benchmark * @type Object */ 'stats': { /** * The margin of error. * * @memberOf Benchmark#stats * @type number */ 'moe': 0, /** * The relative margin of error (expressed as a percentage of the mean). * * @memberOf Benchmark#stats * @type number */ 'rme': 0, /** * The standard error of the mean. * * @memberOf Benchmark#stats * @type number */ 'sem': 0, /** * The sample standard deviation. * * @memberOf Benchmark#stats * @type number */ 'deviation': 0, /** * The sample arithmetic mean (secs). * * @memberOf Benchmark#stats * @type number */ 'mean': 0, /** * The array of sampled periods. * * @memberOf Benchmark#stats * @type Array */ 'sample': [], /** * The sample variance. * * @memberOf Benchmark#stats * @type number */ 'variance': 0 }, /** * An object of timing data including cycle, elapsed, period, start, and stop. * * @memberOf Benchmark * @type Object */ 'times': { /** * The time taken to complete the last cycle (secs). * * @memberOf Benchmark#times * @type number */ 'cycle': 0, /** * The time taken to complete the benchmark (secs). * * @memberOf Benchmark#times * @type number */ 'elapsed': 0, /** * The time taken to execute the test once (secs). * * @memberOf Benchmark#times * @type number */ 'period': 0, /** * A timestamp of when the benchmark started (ms). * * @memberOf Benchmark#times * @type number */ 'timeStamp': 0 } }); _.assign(Benchmark.prototype, { 'abort': abort, 'clone': clone, 'compare': compare, 'emit': emit, 'listeners': listeners, 'off': off, 'on': on, 'reset': reset, 'run': run, 'toString': toStringBench }); /*------------------------------------------------------------------------*/ _.assign(Deferred.prototype, { /** * The deferred benchmark instance. * * @memberOf Benchmark.Deferred * @type Object */ 'benchmark': null, /** * The number of deferred cycles performed while benchmarking. * * @memberOf Benchmark.Deferred * @type number */ 'cycles': 0, /** * The time taken to complete the deferred benchmark (secs). * * @memberOf Benchmark.Deferred * @type number */ 'elapsed': 0, /** * A timestamp of when the deferred benchmark started (ms). * * @memberOf Benchmark.Deferred * @type number */ 'timeStamp': 0 }); _.assign(Deferred.prototype, { 'resolve': resolve }); /*------------------------------------------------------------------------*/ _.assign(Event.prototype, { /** * A flag to indicate if the emitters listener iteration is aborted. * * @memberOf Benchmark.Event * @type boolean */ 'aborted': false, /** * A flag to indicate if the default action is cancelled. * * @memberOf Benchmark.Event * @type boolean */ 'cancelled': false, /** * The object whose listeners are currently being processed. * * @memberOf Benchmark.Event * @type Object */ 'currentTarget': undefined, /** * The return value of the last executed listener. * * @memberOf Benchmark.Event * @type Mixed */ 'result': undefined, /** * The object to which the event was originally emitted. * * @memberOf Benchmark.Event * @type Object */ 'target': undefined, /** * A timestamp of when the event was created (ms). * * @memberOf Benchmark.Event * @type number */ 'timeStamp': 0, /** * The event type. * * @memberOf Benchmark.Event * @type string */ 'type': '' }); /*------------------------------------------------------------------------*/ /** * The default options copied by suite instances. * * @static * @memberOf Benchmark.Suite * @type Object */ Suite.options = { /** * The name of the suite. * * @memberOf Benchmark.Suite.options * @type string */ 'name': undefined }; /*------------------------------------------------------------------------*/ _.assign(Suite.prototype, { /** * The number of benchmarks in the suite. * * @memberOf Benchmark.Suite * @type number */ 'length': 0, /** * A flag to indicate if the suite is aborted. * * @memberOf Benchmark.Suite * @type boolean */ 'aborted': false, /** * A flag to indicate if the suite is running. * * @memberOf Benchmark.Suite * @type boolean */ 'running': false }); _.assign(Suite.prototype, { 'abort': abortSuite, 'add': add, 'clone': cloneSuite, 'emit': emit, 'filter': filterSuite, 'join': arrayRef.join, 'listeners': listeners, 'off': off, 'on': on, 'pop': arrayRef.pop, 'push': push, 'reset': resetSuite, 'run': runSuite, 'reverse': arrayRef.reverse, 'shift': shift, 'slice': slice, 'sort': arrayRef.sort, 'splice': arrayRef.splice, 'unshift': unshift }); /*------------------------------------------------------------------------*/ // Expose Deferred, Event, and Suite. _.assign(Benchmark, { 'Deferred': Deferred, 'Event': Event, 'Suite': Suite }); /*------------------------------------------------------------------------*/ // Add lodash methods as Suite methods. _.each(['each', 'forEach', 'indexOf', 'map', 'reduce'], function(methodName) { var func = _[methodName]; Suite.prototype[methodName] = function() { var args = [this]; push.apply(args, arguments); return func.apply(_, args); }; }); // Avoid array-like object bugs with `Array#shift` and `Array#splice` // in Firefox < 10 and IE < 9. _.each(['pop', 'shift', 'splice'], function(methodName) { var func = arrayRef[methodName]; Suite.prototype[methodName] = function() { var value = this, result = func.apply(value, arguments); if (value.length === 0) { delete value[0]; } return result; }; }); // Avoid buggy `Array#unshift` in IE < 8 which doesn't return the new // length of the array. Suite.prototype.unshift = function() { var value = this; unshift.apply(value, arguments); return value.length; }; return Benchmark; } /*--------------------------------------------------------------------------*/ // Export Benchmark. // Some AMD build optimizers, like r.js, check for condition patterns like the following: if (typeof define == 'function' && typeof define.amd == 'object' && define.amd) { // Define as an anonymous module so, through path mapping, it can be aliased. define(['lodash', 'platform'], function(_, platform) { return runInContext({ '_': _, 'platform': platform }); }); } else { var Benchmark = runInContext(); // Check for `exports` after `define` in case a build optimizer adds an `exports` object. if (freeExports && freeModule) { // Export for Node.js. if (moduleExports) { (freeModule.exports = Benchmark).Benchmark = Benchmark; } // Export for CommonJS support. freeExports.Benchmark = Benchmark; } else { // Export to the global object. root.Benchmark = Benchmark; } } }.call(this)); ================================================ FILE: assets/js/vendor/lodash.js ================================================ /** * @license * lodash 4.11.1 (Custom Build) * Build: `lodash -o ./dist/lodash.js` * Copyright jQuery Foundation and other contributors * Released under MIT license * Based on Underscore.js 1.8.3 * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors */ ;(function() { /** Used as a safe reference for `undefined` in pre-ES5 environments. */ var undefined; /** Used as the semantic version number. */ var VERSION = '4.11.1'; /** Used as the size to enable large array optimizations. */ var LARGE_ARRAY_SIZE = 200; /** Used as the `TypeError` message for "Functions" methods. */ var FUNC_ERROR_TEXT = 'Expected a function'; /** Used to stand-in for `undefined` hash values. */ var HASH_UNDEFINED = '__lodash_hash_undefined__'; /** Used as the internal argument placeholder. */ var PLACEHOLDER = '__lodash_placeholder__'; /** Used to compose bitmasks for wrapper metadata. */ var BIND_FLAG = 1, BIND_KEY_FLAG = 2, CURRY_BOUND_FLAG = 4, CURRY_FLAG = 8, CURRY_RIGHT_FLAG = 16, PARTIAL_FLAG = 32, PARTIAL_RIGHT_FLAG = 64, ARY_FLAG = 128, REARG_FLAG = 256, FLIP_FLAG = 512; /** Used to compose bitmasks for comparison styles. */ var UNORDERED_COMPARE_FLAG = 1, PARTIAL_COMPARE_FLAG = 2; /** Used as default options for `_.truncate`. */ var DEFAULT_TRUNC_LENGTH = 30, DEFAULT_TRUNC_OMISSION = '...'; /** Used to detect hot functions by number of calls within a span of milliseconds. */ var HOT_COUNT = 150, HOT_SPAN = 16; /** Used to indicate the type of lazy iteratees. */ var LAZY_FILTER_FLAG = 1, LAZY_MAP_FLAG = 2, LAZY_WHILE_FLAG = 3; /** Used as references for various `Number` constants. */ var INFINITY = 1 / 0, MAX_SAFE_INTEGER = 9007199254740991, MAX_INTEGER = 1.7976931348623157e+308, NAN = 0 / 0; /** Used as references for the maximum length and index of an array. */ var MAX_ARRAY_LENGTH = 4294967295, MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1, HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1; /** `Object#toString` result references. */ var argsTag = '[object Arguments]', arrayTag = '[object Array]', boolTag = '[object Boolean]', dateTag = '[object Date]', errorTag = '[object Error]', funcTag = '[object Function]', genTag = '[object GeneratorFunction]', mapTag = '[object Map]', numberTag = '[object Number]', objectTag = '[object Object]', promiseTag = '[object Promise]', regexpTag = '[object RegExp]', setTag = '[object Set]', stringTag = '[object String]', symbolTag = '[object Symbol]', weakMapTag = '[object WeakMap]', weakSetTag = '[object WeakSet]'; var arrayBufferTag = '[object ArrayBuffer]', dataViewTag = '[object DataView]', float32Tag = '[object Float32Array]', float64Tag = '[object Float64Array]', int8Tag = '[object Int8Array]', int16Tag = '[object Int16Array]', int32Tag = '[object Int32Array]', uint8Tag = '[object Uint8Array]', uint8ClampedTag = '[object Uint8ClampedArray]', uint16Tag = '[object Uint16Array]', uint32Tag = '[object Uint32Array]'; /** Used to match empty string literals in compiled template source. */ var reEmptyStringLeading = /\b__p \+= '';/g, reEmptyStringMiddle = /\b(__p \+=) '' \+/g, reEmptyStringTrailing = /(__e\(.*?\)|\b__t\)) \+\n'';/g; /** Used to match HTML entities and HTML characters. */ var reEscapedHtml = /&(?:amp|lt|gt|quot|#39|#96);/g, reUnescapedHtml = /[&<>"'`]/g, reHasEscapedHtml = RegExp(reEscapedHtml.source), reHasUnescapedHtml = RegExp(reUnescapedHtml.source); /** Used to match template delimiters. */ var reEscape = /<%-([\s\S]+?)%>/g, reEvaluate = /<%([\s\S]+?)%>/g, reInterpolate = /<%=([\s\S]+?)%>/g; /** Used to match property names within property paths. */ var reIsDeepProp = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/, reIsPlainProp = /^\w*$/, rePropName = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]/g; /** * Used to match `RegExp` * [syntax characters](http://ecma-international.org/ecma-262/6.0/#sec-patterns). */ var reRegExpChar = /[\\^$.*+?()[\]{}|]/g, reHasRegExpChar = RegExp(reRegExpChar.source); /** Used to match leading and trailing whitespace. */ var reTrim = /^\s+|\s+$/g, reTrimStart = /^\s+/, reTrimEnd = /\s+$/; /** Used to match non-compound words composed of alphanumeric characters. */ var reBasicWord = /[a-zA-Z0-9]+/g; /** Used to match backslashes in property paths. */ var reEscapeChar = /\\(\\)?/g; /** * Used to match * [ES template delimiters](http://ecma-international.org/ecma-262/6.0/#sec-template-literal-lexical-components). */ var reEsTemplate = /\$\{([^\\}]*(?:\\.[^\\}]*)*)\}/g; /** Used to match `RegExp` flags from their coerced string values. */ var reFlags = /\w*$/; /** Used to detect hexadecimal string values. */ var reHasHexPrefix = /^0x/i; /** Used to detect bad signed hexadecimal string values. */ var reIsBadHex = /^[-+]0x[0-9a-f]+$/i; /** Used to detect binary string values. */ var reIsBinary = /^0b[01]+$/i; /** Used to detect host constructors (Safari). */ var reIsHostCtor = /^\[object .+?Constructor\]$/; /** Used to detect octal string values. */ var reIsOctal = /^0o[0-7]+$/i; /** Used to detect unsigned integer values. */ var reIsUint = /^(?:0|[1-9]\d*)$/; /** Used to match latin-1 supplementary letters (excluding mathematical operators). */ var reLatin1 = /[\xc0-\xd6\xd8-\xde\xdf-\xf6\xf8-\xff]/g; /** Used to ensure capturing order of template delimiters. */ var reNoMatch = /($^)/; /** Used to match unescaped characters in compiled string literals. */ var reUnescapedString = /['\n\r\u2028\u2029\\]/g; /** Used to compose unicode character classes. */ var rsAstralRange = '\\ud800-\\udfff', rsComboMarksRange = '\\u0300-\\u036f\\ufe20-\\ufe23', rsComboSymbolsRange = '\\u20d0-\\u20f0', rsDingbatRange = '\\u2700-\\u27bf', rsLowerRange = 'a-z\\xdf-\\xf6\\xf8-\\xff', rsMathOpRange = '\\xac\\xb1\\xd7\\xf7', rsNonCharRange = '\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\xbf', rsQuoteRange = '\\u2018\\u2019\\u201c\\u201d', rsSpaceRange = ' \\t\\x0b\\f\\xa0\\ufeff\\n\\r\\u2028\\u2029\\u1680\\u180e\\u2000\\u2001\\u2002\\u2003\\u2004\\u2005\\u2006\\u2007\\u2008\\u2009\\u200a\\u202f\\u205f\\u3000', rsUpperRange = 'A-Z\\xc0-\\xd6\\xd8-\\xde', rsVarRange = '\\ufe0e\\ufe0f', rsBreakRange = rsMathOpRange + rsNonCharRange + rsQuoteRange + rsSpaceRange; /** Used to compose unicode capture groups. */ var rsApos = "['\u2019]", rsAstral = '[' + rsAstralRange + ']', rsBreak = '[' + rsBreakRange + ']', rsCombo = '[' + rsComboMarksRange + rsComboSymbolsRange + ']', rsDigits = '\\d+', rsDingbat = '[' + rsDingbatRange + ']', rsLower = '[' + rsLowerRange + ']', rsMisc = '[^' + rsAstralRange + rsBreakRange + rsDigits + rsDingbatRange + rsLowerRange + rsUpperRange + ']', rsFitz = '\\ud83c[\\udffb-\\udfff]', rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')', rsNonAstral = '[^' + rsAstralRange + ']', rsRegional = '(?:\\ud83c[\\udde6-\\uddff]){2}', rsSurrPair = '[\\ud800-\\udbff][\\udc00-\\udfff]', rsUpper = '[' + rsUpperRange + ']', rsZWJ = '\\u200d'; /** Used to compose unicode regexes. */ var rsLowerMisc = '(?:' + rsLower + '|' + rsMisc + ')', rsUpperMisc = '(?:' + rsUpper + '|' + rsMisc + ')', rsOptLowerContr = '(?:' + rsApos + '(?:d|ll|m|re|s|t|ve))?', rsOptUpperContr = '(?:' + rsApos + '(?:D|LL|M|RE|S|T|VE))?', reOptMod = rsModifier + '?', rsOptVar = '[' + rsVarRange + ']?', rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*', rsSeq = rsOptVar + reOptMod + rsOptJoin, rsEmoji = '(?:' + [rsDingbat, rsRegional, rsSurrPair].join('|') + ')' + rsSeq, rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')'; /** Used to match apostrophes. */ var reApos = RegExp(rsApos, 'g'); /** * Used to match [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks) and * [combining diacritical marks for symbols](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks_for_Symbols). */ var reComboMark = RegExp(rsCombo, 'g'); /** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */ var reComplexSymbol = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g'); /** Used to match complex or compound words. */ var reComplexWord = RegExp([ rsUpper + '?' + rsLower + '+' + rsOptLowerContr + '(?=' + [rsBreak, rsUpper, '$'].join('|') + ')', rsUpperMisc + '+' + rsOptUpperContr + '(?=' + [rsBreak, rsUpper + rsLowerMisc, '$'].join('|') + ')', rsUpper + '?' + rsLowerMisc + '+' + rsOptLowerContr, rsUpper + '+' + rsOptUpperContr, rsDigits, rsEmoji ].join('|'), 'g'); /** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */ var reHasComplexSymbol = RegExp('[' + rsZWJ + rsAstralRange + rsComboMarksRange + rsComboSymbolsRange + rsVarRange + ']'); /** Used to detect strings that need a more robust regexp to match words. */ var reHasComplexWord = /[a-z][A-Z]|[A-Z]{2,}[a-z]|[0-9][a-zA-Z]|[a-zA-Z][0-9]|[^a-zA-Z0-9 ]/; /** Used to assign default `context` object properties. */ var contextProps = [ 'Array', 'Buffer', 'DataView', 'Date', 'Error', 'Float32Array', 'Float64Array', 'Function', 'Int8Array', 'Int16Array', 'Int32Array', 'Map', 'Math', 'Object', 'Promise', 'Reflect', 'RegExp', 'Set', 'String', 'Symbol', 'TypeError', 'Uint8Array', 'Uint8ClampedArray', 'Uint16Array', 'Uint32Array', 'WeakMap', '_', 'clearTimeout', 'isFinite', 'parseInt', 'setTimeout' ]; /** Used to make template sourceURLs easier to identify. */ var templateCounter = -1; /** Used to identify `toStringTag` values of typed arrays. */ var typedArrayTags = {}; typedArrayTags[float32Tag] = typedArrayTags[float64Tag] = typedArrayTags[int8Tag] = typedArrayTags[int16Tag] = typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] = typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] = typedArrayTags[uint32Tag] = true; typedArrayTags[argsTag] = typedArrayTags[arrayTag] = typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] = typedArrayTags[dataViewTag] = typedArrayTags[dateTag] = typedArrayTags[errorTag] = typedArrayTags[funcTag] = typedArrayTags[mapTag] = typedArrayTags[numberTag] = typedArrayTags[objectTag] = typedArrayTags[regexpTag] = typedArrayTags[setTag] = typedArrayTags[stringTag] = typedArrayTags[weakMapTag] = false; /** Used to identify `toStringTag` values supported by `_.clone`. */ var cloneableTags = {}; cloneableTags[argsTag] = cloneableTags[arrayTag] = cloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] = cloneableTags[boolTag] = cloneableTags[dateTag] = cloneableTags[float32Tag] = cloneableTags[float64Tag] = cloneableTags[int8Tag] = cloneableTags[int16Tag] = cloneableTags[int32Tag] = cloneableTags[mapTag] = cloneableTags[numberTag] = cloneableTags[objectTag] = cloneableTags[regexpTag] = cloneableTags[setTag] = cloneableTags[stringTag] = cloneableTags[symbolTag] = cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] = cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true; cloneableTags[errorTag] = cloneableTags[funcTag] = cloneableTags[weakMapTag] = false; /** Used to map latin-1 supplementary letters to basic latin letters. */ var deburredLetters = { '\xc0': 'A', '\xc1': 'A', '\xc2': 'A', '\xc3': 'A', '\xc4': 'A', '\xc5': 'A', '\xe0': 'a', '\xe1': 'a', '\xe2': 'a', '\xe3': 'a', '\xe4': 'a', '\xe5': 'a', '\xc7': 'C', '\xe7': 'c', '\xd0': 'D', '\xf0': 'd', '\xc8': 'E', '\xc9': 'E', '\xca': 'E', '\xcb': 'E', '\xe8': 'e', '\xe9': 'e', '\xea': 'e', '\xeb': 'e', '\xcC': 'I', '\xcd': 'I', '\xce': 'I', '\xcf': 'I', '\xeC': 'i', '\xed': 'i', '\xee': 'i', '\xef': 'i', '\xd1': 'N', '\xf1': 'n', '\xd2': 'O', '\xd3': 'O', '\xd4': 'O', '\xd5': 'O', '\xd6': 'O', '\xd8': 'O', '\xf2': 'o', '\xf3': 'o', '\xf4': 'o', '\xf5': 'o', '\xf6': 'o', '\xf8': 'o', '\xd9': 'U', '\xda': 'U', '\xdb': 'U', '\xdc': 'U', '\xf9': 'u', '\xfa': 'u', '\xfb': 'u', '\xfc': 'u', '\xdd': 'Y', '\xfd': 'y', '\xff': 'y', '\xc6': 'Ae', '\xe6': 'ae', '\xde': 'Th', '\xfe': 'th', '\xdf': 'ss' }; /** Used to map characters to HTML entities. */ var htmlEscapes = { '&': '&', '<': '<', '>': '>', '"': '"', "'": ''', '`': '`' }; /** Used to map HTML entities to characters. */ var htmlUnescapes = { '&': '&', '<': '<', '>': '>', '"': '"', ''': "'", '`': '`' }; /** Used to determine if values are of the language type `Object`. */ var objectTypes = { 'function': true, 'object': true }; /** Used to escape characters for inclusion in compiled string literals. */ var stringEscapes = { '\\': '\\', "'": "'", '\n': 'n', '\r': 'r', '\u2028': 'u2028', '\u2029': 'u2029' }; /** Built-in method references without a dependency on `root`. */ var freeParseFloat = parseFloat, freeParseInt = parseInt; /** Detect free variable `exports`. */ var freeExports = (objectTypes[typeof exports] && exports && !exports.nodeType) ? exports : undefined; /** Detect free variable `module`. */ var freeModule = (objectTypes[typeof module] && module && !module.nodeType) ? module : undefined; /** Detect the popular CommonJS extension `module.exports`. */ var moduleExports = (freeModule && freeModule.exports === freeExports) ? freeExports : undefined; /** Detect free variable `global` from Node.js. */ var freeGlobal = checkGlobal(freeExports && freeModule && typeof global == 'object' && global); /** Detect free variable `self`. */ var freeSelf = checkGlobal(objectTypes[typeof self] && self); /** Detect free variable `window`. */ var freeWindow = checkGlobal(objectTypes[typeof window] && window); /** Detect `this` as the global object. */ var thisGlobal = checkGlobal(objectTypes[typeof this] && this); /** * Used as a reference to the global object. * * The `this` value is used if it's the global object to avoid Greasemonkey's * restricted `window` object, otherwise the `window` object is used. */ var root = freeGlobal || ((freeWindow !== (thisGlobal && thisGlobal.window)) && freeWindow) || freeSelf || thisGlobal || Function('return this')(); /*--------------------------------------------------------------------------*/ /** * Adds the key-value `pair` to `map`. * * @private * @param {Object} map The map to modify. * @param {Array} pair The key-value pair to add. * @returns {Object} Returns `map`. */ function addMapEntry(map, pair) { // Don't return `Map#set` because it doesn't return the map instance in IE 11. map.set(pair[0], pair[1]); return map; } /** * Adds `value` to `set`. * * @private * @param {Object} set The set to modify. * @param {*} value The value to add. * @returns {Object} Returns `set`. */ function addSetEntry(set, value) { set.add(value); return set; } /** * A faster alternative to `Function#apply`, this function invokes `func` * with the `this` binding of `thisArg` and the arguments of `args`. * * @private * @param {Function} func The function to invoke. * @param {*} thisArg The `this` binding of `func`. * @param {Array} args The arguments to invoke `func` with. * @returns {*} Returns the result of `func`. */ function apply(func, thisArg, args) { var length = args.length; switch (length) { case 0: return func.call(thisArg); case 1: return func.call(thisArg, args[0]); case 2: return func.call(thisArg, args[0], args[1]); case 3: return func.call(thisArg, args[0], args[1], args[2]); } return func.apply(thisArg, args); } /** * A specialized version of `baseAggregator` for arrays. * * @private * @param {Array} array The array to iterate over. * @param {Function} setter The function to set `accumulator` values. * @param {Function} iteratee The iteratee to transform keys. * @param {Object} accumulator The initial aggregated object. * @returns {Function} Returns `accumulator`. */ function arrayAggregator(array, setter, iteratee, accumulator) { var index = -1, length = array.length; while (++index < length) { var value = array[index]; setter(accumulator, value, iteratee(value), array); } return accumulator; } /** * Creates a new array concatenating `array` with `other`. * * @private * @param {Array} array The first array to concatenate. * @param {Array} other The second array to concatenate. * @returns {Array} Returns the new concatenated array. */ function arrayConcat(array, other) { var index = -1, length = array.length, othIndex = -1, othLength = other.length, result = Array(length + othLength); while (++index < length) { result[index] = array[index]; } while (++othIndex < othLength) { result[index++] = other[othIndex]; } return result; } /** * A specialized version of `_.forEach` for arrays without support for * iteratee shorthands. * * @private * @param {Array} array The array to iterate over. * @param {Function} iteratee The function invoked per iteration. * @returns {Array} Returns `array`. */ function arrayEach(array, iteratee) { var index = -1, length = array.length; while (++index < length) { if (iteratee(array[index], index, array) === false) { break; } } return array; } /** * A specialized version of `_.forEachRight` for arrays without support for * iteratee shorthands. * * @private * @param {Array} array The array to iterate over. * @param {Function} iteratee The function invoked per iteration. * @returns {Array} Returns `array`. */ function arrayEachRight(array, iteratee) { var length = array.length; while (length--) { if (iteratee(array[length], length, array) === false) { break; } } return array; } /** * A specialized version of `_.every` for arrays without support for * iteratee shorthands. * * @private * @param {Array} array The array to iterate over. * @param {Function} predicate The function invoked per iteration. * @returns {boolean} Returns `true` if all elements pass the predicate check, * else `false`. */ function arrayEvery(array, predicate) { var index = -1, length = array.length; while (++index < length) { if (!predicate(array[index], index, array)) { return false; } } return true; } /** * A specialized version of `_.filter` for arrays without support for * iteratee shorthands. * * @private * @param {Array} array The array to iterate over. * @param {Function} predicate The function invoked per iteration. * @returns {Array} Returns the new filtered array. */ function arrayFilter(array, predicate) { var index = -1, length = array.length, resIndex = 0, result = []; while (++index < length) { var value = array[index]; if (predicate(value, index, array)) { result[resIndex++] = value; } } return result; } /** * A specialized version of `_.includes` for arrays without support for * specifying an index to search from. * * @private * @param {Array} array The array to search. * @param {*} target The value to search for. * @returns {boolean} Returns `true` if `target` is found, else `false`. */ function arrayIncludes(array, value) { return !!array.length && baseIndexOf(array, value, 0) > -1; } /** * This function is like `arrayIncludes` except that it accepts a comparator. * * @private * @param {Array} array The array to search. * @param {*} target The value to search for. * @param {Function} comparator The comparator invoked per element. * @returns {boolean} Returns `true` if `target` is found, else `false`. */ function arrayIncludesWith(array, value, comparator) { var index = -1, length = array.length; while (++index < length) { if (comparator(value, array[index])) { return true; } } return false; } /** * A specialized version of `_.map` for arrays without support for iteratee * shorthands. * * @private * @param {Array} array The array to iterate over. * @param {Function} iteratee The function invoked per iteration. * @returns {Array} Returns the new mapped array. */ function arrayMap(array, iteratee) { var index = -1, length = array.length, result = Array(length); while (++index < length) { result[index] = iteratee(array[index], index, array); } return result; } /** * Appends the elements of `values` to `array`. * * @private * @param {Array} array The array to modify. * @param {Array} values The values to append. * @returns {Array} Returns `array`. */ function arrayPush(array, values) { var index = -1, length = values.length, offset = array.length; while (++index < length) { array[offset + index] = values[index]; } return array; } /** * A specialized version of `_.reduce` for arrays without support for * iteratee shorthands. * * @private * @param {Array} array The array to iterate over. * @param {Function} iteratee The function invoked per iteration. * @param {*} [accumulator] The initial value. * @param {boolean} [initAccum] Specify using the first element of `array` as * the initial value. * @returns {*} Returns the accumulated value. */ function arrayReduce(array, iteratee, accumulator, initAccum) { var index = -1, length = array.length; if (initAccum && length) { accumulator = array[++index]; } while (++index < length) { accumulator = iteratee(accumulator, array[index], index, array); } return accumulator; } /** * A specialized version of `_.reduceRight` for arrays without support for * iteratee shorthands. * * @private * @param {Array} array The array to iterate over. * @param {Function} iteratee The function invoked per iteration. * @param {*} [accumulator] The initial value. * @param {boolean} [initAccum] Specify using the last element of `array` as * the initial value. * @returns {*} Returns the accumulated value. */ function arrayReduceRight(array, iteratee, accumulator, initAccum) { var length = array.length; if (initAccum && length) { accumulator = array[--length]; } while (length--) { accumulator = iteratee(accumulator, array[length], length, array); } return accumulator; } /** * A specialized version of `_.some` for arrays without support for iteratee * shorthands. * * @private * @param {Array} array The array to iterate over. * @param {Function} predicate The function invoked per iteration. * @returns {boolean} Returns `true` if any element passes the predicate check, * else `false`. */ function arraySome(array, predicate) { var index = -1, length = array.length; while (++index < length) { if (predicate(array[index], index, array)) { return true; } } return false; } /** * The base implementation of methods like `_.max` and `_.min` which accepts a * `comparator` to determine the extremum value. * * @private * @param {Array} array The array to iterate over. * @param {Function} iteratee The iteratee invoked per iteration. * @param {Function} comparator The comparator used to compare values. * @returns {*} Returns the extremum value. */ function baseExtremum(array, iteratee, comparator) { var index = -1, length = array.length; while (++index < length) { var value = array[index], current = iteratee(value); if (current != null && (computed === undefined ? current === current : comparator(current, computed) )) { var computed = current, result = value; } } return result; } /** * The base implementation of methods like `_.find` and `_.findKey`, without * support for iteratee shorthands, which iterates over `collection` using * `eachFunc`. * * @private * @param {Array|Object} collection The collection to search. * @param {Function} predicate The function invoked per iteration. * @param {Function} eachFunc The function to iterate over `collection`. * @param {boolean} [retKey] Specify returning the key of the found element * instead of the element itself. * @returns {*} Returns the found element or its key, else `undefined`. */ function baseFind(collection, predicate, eachFunc, retKey) { var result; eachFunc(collection, function(value, key, collection) { if (predicate(value, key, collection)) { result = retKey ? key : value; return false; } }); return result; } /** * The base implementation of `_.findIndex` and `_.findLastIndex` without * support for iteratee shorthands. * * @private * @param {Array} array The array to search. * @param {Function} predicate The function invoked per iteration. * @param {boolean} [fromRight] Specify iterating from right to left. * @returns {number} Returns the index of the matched value, else `-1`. */ function baseFindIndex(array, predicate, fromRight) { var length = array.length, index = fromRight ? length : -1; while ((fromRight ? index-- : ++index < length)) { if (predicate(array[index], index, array)) { return index; } } return -1; } /** * The base implementation of `_.indexOf` without `fromIndex` bounds checks. * * @private * @param {Array} array The array to search. * @param {*} value The value to search for. * @param {number} fromIndex The index to search from. * @returns {number} Returns the index of the matched value, else `-1`. */ function baseIndexOf(array, value, fromIndex) { if (value !== value) { return indexOfNaN(array, fromIndex); } var index = fromIndex - 1, length = array.length; while (++index < length) { if (array[index] === value) { return index; } } return -1; } /** * This function is like `baseIndexOf` except that it accepts a comparator. * * @private * @param {Array} array The array to search. * @param {*} value The value to search for. * @param {number} fromIndex The index to search from. * @param {Function} comparator The comparator invoked per element. * @returns {number} Returns the index of the matched value, else `-1`. */ function baseIndexOfWith(array, value, fromIndex, comparator) { var index = fromIndex - 1, length = array.length; while (++index < length) { if (comparator(array[index], value)) { return index; } } return -1; } /** * The base implementation of `_.mean` and `_.meanBy` without support for * iteratee shorthands. * * @private * @param {Array} array The array to iterate over. * @param {Function} iteratee The function invoked per iteration. * @returns {number} Returns the mean. */ function baseMean(array, iteratee) { var length = array ? array.length : 0; return length ? (baseSum(array, iteratee) / length) : NAN; } /** * The base implementation of `_.reduce` and `_.reduceRight`, without support * for iteratee shorthands, which iterates over `collection` using `eachFunc`. * * @private * @param {Array|Object} collection The collection to iterate over. * @param {Function} iteratee The function invoked per iteration. * @param {*} accumulator The initial value. * @param {boolean} initAccum Specify using the first or last element of * `collection` as the initial value. * @param {Function} eachFunc The function to iterate over `collection`. * @returns {*} Returns the accumulated value. */ function baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) { eachFunc(collection, function(value, index, collection) { accumulator = initAccum ? (initAccum = false, value) : iteratee(accumulator, value, index, collection); }); return accumulator; } /** * The base implementation of `_.sortBy` which uses `comparer` to define the * sort order of `array` and replaces criteria objects with their corresponding * values. * * @private * @param {Array} array The array to sort. * @param {Function} comparer The function to define sort order. * @returns {Array} Returns `array`. */ function baseSortBy(array, comparer) { var length = array.length; array.sort(comparer); while (length--) { array[length] = array[length].value; } return array; } /** * The base implementation of `_.sum` and `_.sumBy` without support for * iteratee shorthands. * * @private * @param {Array} array The array to iterate over. * @param {Function} iteratee The function invoked per iteration. * @returns {number} Returns the sum. */ function baseSum(array, iteratee) { var result, index = -1, length = array.length; while (++index < length) { var current = iteratee(array[index]); if (current !== undefined) { result = result === undefined ? current : (result + current); } } return result; } /** * The base implementation of `_.times` without support for iteratee shorthands * or max array length checks. * * @private * @param {number} n The number of times to invoke `iteratee`. * @param {Function} iteratee The function invoked per iteration. * @returns {Array} Returns the array of results. */ function baseTimes(n, iteratee) { var index = -1, result = Array(n); while (++index < n) { result[index] = iteratee(index); } return result; } /** * The base implementation of `_.toPairs` and `_.toPairsIn` which creates an array * of key-value pairs for `object` corresponding to the property names of `props`. * * @private * @param {Object} object The object to query. * @param {Array} props The property names to get values for. * @returns {Object} Returns the new array of key-value pairs. */ function baseToPairs(object, props) { return arrayMap(props, function(key) { return [key, object[key]]; }); } /** * The base implementation of `_.unary` without support for storing wrapper metadata. * * @private * @param {Function} func The function to cap arguments for. * @returns {Function} Returns the new function. */ function baseUnary(func) { return function(value) { return func(value); }; } /** * The base implementation of `_.values` and `_.valuesIn` which creates an * array of `object` property values corresponding to the property names * of `props`. * * @private * @param {Object} object The object to query. * @param {Array} props The property names to get values for. * @returns {Object} Returns the array of property values. */ function baseValues(object, props) { return arrayMap(props, function(key) { return object[key]; }); } /** * Used by `_.trim` and `_.trimStart` to get the index of the first string symbol * that is not found in the character symbols. * * @private * @param {Array} strSymbols The string symbols to inspect. * @param {Array} chrSymbols The character symbols to find. * @returns {number} Returns the index of the first unmatched string symbol. */ function charsStartIndex(strSymbols, chrSymbols) { var index = -1, length = strSymbols.length; while (++index < length && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {} return index; } /** * Used by `_.trim` and `_.trimEnd` to get the index of the last string symbol * that is not found in the character symbols. * * @private * @param {Array} strSymbols The string symbols to inspect. * @param {Array} chrSymbols The character symbols to find. * @returns {number} Returns the index of the last unmatched string symbol. */ function charsEndIndex(strSymbols, chrSymbols) { var index = strSymbols.length; while (index-- && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {} return index; } /** * Checks if `value` is a global object. * * @private * @param {*} value The value to check. * @returns {null|Object} Returns `value` if it's a global object, else `null`. */ function checkGlobal(value) { return (value && value.Object === Object) ? value : null; } /** * Compares values to sort them in ascending order. * * @private * @param {*} value The value to compare. * @param {*} other The other value to compare. * @returns {number} Returns the sort order indicator for `value`. */ function compareAscending(value, other) { if (value !== other) { var valIsNull = value === null, valIsUndef = value === undefined, valIsReflexive = value === value; var othIsNull = other === null, othIsUndef = other === undefined, othIsReflexive = other === other; if ((value > other && !othIsNull) || !valIsReflexive || (valIsNull && !othIsUndef && othIsReflexive) || (valIsUndef && othIsReflexive)) { return 1; } if ((value < other && !valIsNull) || !othIsReflexive || (othIsNull && !valIsUndef && valIsReflexive) || (othIsUndef && valIsReflexive)) { return -1; } } return 0; } /** * Used by `_.orderBy` to compare multiple properties of a value to another * and stable sort them. * * If `orders` is unspecified, all values are sorted in ascending order. Otherwise, * specify an order of "desc" for descending or "asc" for ascending sort order * of corresponding values. * * @private * @param {Object} object The object to compare. * @param {Object} other The other object to compare. * @param {boolean[]|string[]} orders The order to sort by for each property. * @returns {number} Returns the sort order indicator for `object`. */ function compareMultiple(object, other, orders) { var index = -1, objCriteria = object.criteria, othCriteria = other.criteria, length = objCriteria.length, ordersLength = orders.length; while (++index < length) { var result = compareAscending(objCriteria[index], othCriteria[index]); if (result) { if (index >= ordersLength) { return result; } var order = orders[index]; return result * (order == 'desc' ? -1 : 1); } } // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications // that causes it, under certain circumstances, to provide the same value for // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247 // for more details. // // This also ensures a stable sort in V8 and other engines. // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details. return object.index - other.index; } /** * Gets the number of `placeholder` occurrences in `array`. * * @private * @param {Array} array The array to inspect. * @param {*} placeholder The placeholder to search for. * @returns {number} Returns the placeholder count. */ function countHolders(array, placeholder) { var length = array.length, result = 0; while (length--) { if (array[length] === placeholder) { result++; } } return result; } /** * Creates a function that performs a mathematical operation on two values. * * @private * @param {Function} operator The function to perform the operation. * @returns {Function} Returns the new mathematical operation function. */ function createMathOperation(operator) { return function(value, other) { var result; if (value === undefined && other === undefined) { return 0; } if (value !== undefined) { result = value; } if (other !== undefined) { result = result === undefined ? other : operator(result, other); } return result; }; } /** * Used by `_.deburr` to convert latin-1 supplementary letters to basic latin letters. * * @private * @param {string} letter The matched letter to deburr. * @returns {string} Returns the deburred letter. */ function deburrLetter(letter) { return deburredLetters[letter]; } /** * Used by `_.escape` to convert characters to HTML entities. * * @private * @param {string} chr The matched character to escape. * @returns {string} Returns the escaped character. */ function escapeHtmlChar(chr) { return htmlEscapes[chr]; } /** * Used by `_.template` to escape characters for inclusion in compiled string literals. * * @private * @param {string} chr The matched character to escape. * @returns {string} Returns the escaped character. */ function escapeStringChar(chr) { return '\\' + stringEscapes[chr]; } /** * Gets the index at which the first occurrence of `NaN` is found in `array`. * * @private * @param {Array} array The array to search. * @param {number} fromIndex The index to search from. * @param {boolean} [fromRight] Specify iterating from right to left. * @returns {number} Returns the index of the matched `NaN`, else `-1`. */ function indexOfNaN(array, fromIndex, fromRight) { var length = array.length, index = fromIndex + (fromRight ? 0 : -1); while ((fromRight ? index-- : ++index < length)) { var other = array[index]; if (other !== other) { return index; } } return -1; } /** * Checks if `value` is a host object in IE < 9. * * @private * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a host object, else `false`. */ function isHostObject(value) { // Many host objects are `Object` objects that can coerce to strings // despite having improperly defined `toString` methods. var result = false; if (value != null && typeof value.toString != 'function') { try { result = !!(value + ''); } catch (e) {} } return result; } /** * Checks if `value` is a valid array-like index. * * @private * @param {*} value The value to check. * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index. * @returns {boolean} Returns `true` if `value` is a valid index, else `false`. */ function isIndex(value, length) { value = (typeof value == 'number' || reIsUint.test(value)) ? +value : -1; length = length == null ? MAX_SAFE_INTEGER : length; return value > -1 && value % 1 == 0 && value < length; } /** * Converts `iterator` to an array. * * @private * @param {Object} iterator The iterator to convert. * @returns {Array} Returns the converted array. */ function iteratorToArray(iterator) { var data, result = []; while (!(data = iterator.next()).done) { result.push(data.value); } return result; } /** * Converts `map` to an array. * * @private * @param {Object} map The map to convert. * @returns {Array} Returns the converted array. */ function mapToArray(map) { var index = -1, result = Array(map.size); map.forEach(function(value, key) { result[++index] = [key, value]; }); return result; } /** * Replaces all `placeholder` elements in `array` with an internal placeholder * and returns an array of their indexes. * * @private * @param {Array} array The array to modify. * @param {*} placeholder The placeholder to replace. * @returns {Array} Returns the new array of placeholder indexes. */ function replaceHolders(array, placeholder) { var index = -1, length = array.length, resIndex = 0, result = []; while (++index < length) { var value = array[index]; if (value === placeholder || value === PLACEHOLDER) { array[index] = PLACEHOLDER; result[resIndex++] = index; } } return result; } /** * Converts `set` to an array. * * @private * @param {Object} set The set to convert. * @returns {Array} Returns the converted array. */ function setToArray(set) { var index = -1, result = Array(set.size); set.forEach(function(value) { result[++index] = value; }); return result; } /** * Gets the number of symbols in `string`. * * @private * @param {string} string The string to inspect. * @returns {number} Returns the string size. */ function stringSize(string) { if (!(string && reHasComplexSymbol.test(string))) { return string.length; } var result = reComplexSymbol.lastIndex = 0; while (reComplexSymbol.test(string)) { result++; } return result; } /** * Converts `string` to an array. * * @private * @param {string} string The string to convert. * @returns {Array} Returns the converted array. */ function stringToArray(string) { return string.match(reComplexSymbol); } /** * Used by `_.unescape` to convert HTML entities to characters. * * @private * @param {string} chr The matched character to unescape. * @returns {string} Returns the unescaped character. */ function unescapeHtmlChar(chr) { return htmlUnescapes[chr]; } /*--------------------------------------------------------------------------*/ /** * Create a new pristine `lodash` function using the `context` object. * * @static * @memberOf _ * @since 1.1.0 * @category Util * @param {Object} [context=root] The context object. * @returns {Function} Returns a new `lodash` function. * @example * * _.mixin({ 'foo': _.constant('foo') }); * * var lodash = _.runInContext(); * lodash.mixin({ 'bar': lodash.constant('bar') }); * * _.isFunction(_.foo); * // => true * _.isFunction(_.bar); * // => false * * lodash.isFunction(lodash.foo); * // => false * lodash.isFunction(lodash.bar); * // => true * * // Use `context` to mock `Date#getTime` use in `_.now`. * var mock = _.runInContext({ * 'Date': function() { * return { 'getTime': getTimeMock }; * } * }); * * // Create a suped-up `defer` in Node.js. * var defer = _.runInContext({ 'setTimeout': setImmediate }).defer; */ function runInContext(context) { context = context ? _.defaults({}, context, _.pick(root, contextProps)) : root; /** Built-in constructor references. */ var Date = context.Date, Error = context.Error, Math = context.Math, RegExp = context.RegExp, TypeError = context.TypeError; /** Used for built-in method references. */ var arrayProto = context.Array.prototype, objectProto = context.Object.prototype, stringProto = context.String.prototype; /** Used to resolve the decompiled source of functions. */ var funcToString = context.Function.prototype.toString; /** Used to check objects for own properties. */ var hasOwnProperty = objectProto.hasOwnProperty; /** Used to generate unique IDs. */ var idCounter = 0; /** Used to infer the `Object` constructor. */ var objectCtorString = funcToString.call(Object); /** * Used to resolve the * [`toStringTag`](http://ecma-international.org/ecma-262/6.0/#sec-object.prototype.tostring) * of values. */ var objectToString = objectProto.toString; /** Used to restore the original `_` reference in `_.noConflict`. */ var oldDash = root._; /** Used to detect if a method is native. */ var reIsNative = RegExp('^' + funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\$&') .replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, '$1.*?') + '$' ); /** Built-in value references. */ var Buffer = moduleExports ? context.Buffer : undefined, Reflect = context.Reflect, Symbol = context.Symbol, Uint8Array = context.Uint8Array, clearTimeout = context.clearTimeout, enumerate = Reflect ? Reflect.enumerate : undefined, getOwnPropertySymbols = Object.getOwnPropertySymbols, iteratorSymbol = typeof (iteratorSymbol = Symbol && Symbol.iterator) == 'symbol' ? iteratorSymbol : undefined, objectCreate = Object.create, propertyIsEnumerable = objectProto.propertyIsEnumerable, setTimeout = context.setTimeout, splice = arrayProto.splice; /* Built-in method references for those with the same name as other `lodash` methods. */ var nativeCeil = Math.ceil, nativeFloor = Math.floor, nativeGetPrototype = Object.getPrototypeOf, nativeIsFinite = context.isFinite, nativeJoin = arrayProto.join, nativeKeys = Object.keys, nativeMax = Math.max, nativeMin = Math.min, nativeParseInt = context.parseInt, nativeRandom = Math.random, nativeReplace = stringProto.replace, nativeReverse = arrayProto.reverse, nativeSplit = stringProto.split; /* Built-in method references that are verified to be native. */ var DataView = getNative(context, 'DataView'), Map = getNative(context, 'Map'), Promise = getNative(context, 'Promise'), Set = getNative(context, 'Set'), WeakMap = getNative(context, 'WeakMap'), nativeCreate = getNative(Object, 'create'); /** Used to store function metadata. */ var metaMap = WeakMap && new WeakMap; /** Detect if properties shadowing those on `Object.prototype` are non-enumerable. */ var nonEnumShadows = !propertyIsEnumerable.call({ 'valueOf': 1 }, 'valueOf'); /** Used to lookup unminified function names. */ var realNames = {}; /** Used to detect maps, sets, and weakmaps. */ var dataViewCtorString = toSource(DataView), mapCtorString = toSource(Map), promiseCtorString = toSource(Promise), setCtorString = toSource(Set), weakMapCtorString = toSource(WeakMap); /** Used to convert symbols to primitives and strings. */ var symbolProto = Symbol ? Symbol.prototype : undefined, symbolValueOf = symbolProto ? symbolProto.valueOf : undefined, symbolToString = symbolProto ? symbolProto.toString : undefined; /*------------------------------------------------------------------------*/ /** * Creates a `lodash` object which wraps `value` to enable implicit method * chain sequences. Methods that operate on and return arrays, collections, * and functions can be chained together. Methods that retrieve a single value * or may return a primitive value will automatically end the chain sequence * and return the unwrapped value. Otherwise, the value must be unwrapped * with `_#value`. * * Explicit chain sequences, which must be unwrapped with `_#value`, may be * enabled using `_.chain`. * * The execution of chained methods is lazy, that is, it's deferred until * `_#value` is implicitly or explicitly called. * * Lazy evaluation allows several methods to support shortcut fusion. * Shortcut fusion is an optimization to merge iteratee calls; this avoids * the creation of intermediate arrays and can greatly reduce the number of * iteratee executions. Sections of a chain sequence qualify for shortcut * fusion if the section is applied to an array of at least `200` elements * and any iteratees accept only one argument. The heuristic for whether a * section qualifies for shortcut fusion is subject to change. * * Chaining is supported in custom builds as long as the `_#value` method is * directly or indirectly included in the build. * * In addition to lodash methods, wrappers have `Array` and `String` methods. * * The wrapper `Array` methods are: * `concat`, `join`, `pop`, `push`, `shift`, `sort`, `splice`, and `unshift` * * The wrapper `String` methods are: * `replace` and `split` * * The wrapper methods that support shortcut fusion are: * `at`, `compact`, `drop`, `dropRight`, `dropWhile`, `filter`, `find`, * `findLast`, `head`, `initial`, `last`, `map`, `reject`, `reverse`, `slice`, * `tail`, `take`, `takeRight`, `takeRightWhile`, `takeWhile`, and `toArray` * * The chainable wrapper methods are: * `after`, `ary`, `assign`, `assignIn`, `assignInWith`, `assignWith`, `at`, * `before`, `bind`, `bindAll`, `bindKey`, `castArray`, `chain`, `chunk`, * `commit`, `compact`, `concat`, `conforms`, `constant`, `countBy`, `create`, * `curry`, `debounce`, `defaults`, `defaultsDeep`, `defer`, `delay`, * `difference`, `differenceBy`, `differenceWith`, `drop`, `dropRight`, * `dropRightWhile`, `dropWhile`, `extend`, `extendWith`, `fill`, `filter`, * `flatMap`, `flatMapDeep`, `flatMapDepth`, `flatten`, `flattenDeep`, * `flattenDepth`, `flip`, `flow`, `flowRight`, `fromPairs`, `functions`, * `functionsIn`, `groupBy`, `initial`, `intersection`, `intersectionBy`, * `intersectionWith`, `invert`, `invertBy`, `invokeMap`, `iteratee`, `keyBy`, * `keys`, `keysIn`, `map`, `mapKeys`, `mapValues`, `matches`, `matchesProperty`, * `memoize`, `merge`, `mergeWith`, `method`, `methodOf`, `mixin`, `negate`, * `nthArg`, `omit`, `omitBy`, `once`, `orderBy`, `over`, `overArgs`, * `overEvery`, `overSome`, `partial`, `partialRight`, `partition`, `pick`, * `pickBy`, `plant`, `property`, `propertyOf`, `pull`, `pullAll`, `pullAllBy`, * `pullAllWith`, `pullAt`, `push`, `range`, `rangeRight`, `rearg`, `reject`, * `remove`, `rest`, `reverse`, `sampleSize`, `set`, `setWith`, `shuffle`, * `slice`, `sort`, `sortBy`, `splice`, `spread`, `tail`, `take`, `takeRight`, * `takeRightWhile`, `takeWhile`, `tap`, `throttle`, `thru`, `toArray`, * `toPairs`, `toPairsIn`, `toPath`, `toPlainObject`, `transform`, `unary`, * `union`, `unionBy`, `unionWith`, `uniq`, `uniqBy`, `uniqWith`, `unset`, * `unshift`, `unzip`, `unzipWith`, `update`, `updateWith`, `values`, * `valuesIn`, `without`, `wrap`, `xor`, `xorBy`, `xorWith`, `zip`, * `zipObject`, `zipObjectDeep`, and `zipWith` * * The wrapper methods that are **not** chainable by default are: * `add`, `attempt`, `camelCase`, `capitalize`, `ceil`, `clamp`, `clone`, * `cloneDeep`, `cloneDeepWith`, `cloneWith`, `deburr`, `divide`, `each`, * `eachRight`, `endsWith`, `eq`, `escape`, `escapeRegExp`, `every`, `find`, * `findIndex`, `findKey`, `findLast`, `findLastIndex`, `findLastKey`, `first`, * `floor`, `forEach`, `forEachRight`, `forIn`, `forInRight`, `forOwn`, * `forOwnRight`, `get`, `gt`, `gte`, `has`, `hasIn`, `head`, `identity`, * `includes`, `indexOf`, `inRange`, `invoke`, `isArguments`, `isArray`, * `isArrayBuffer`, `isArrayLike`, `isArrayLikeObject`, `isBoolean`, `isBuffer`, * `isDate`, `isElement`, `isEmpty`, `isEqual`, `isEqualWith`, `isError`, * `isFinite`, `isFunction`, `isInteger`, `isLength`, `isMap`, `isMatch`, * `isMatchWith`, `isNaN`, `isNative`, `isNil`, `isNull`, `isNumber`, * `isObject`, `isObjectLike`, `isPlainObject`, `isRegExp`, `isSafeInteger`, * `isSet`, `isString`, `isUndefined`, `isTypedArray`, `isWeakMap`, `isWeakSet`, * `join`, `kebabCase`, `last`, `lastIndexOf`, `lowerCase`, `lowerFirst`, * `lt`, `lte`, `max`, `maxBy`, `mean`, `meanBy`, `min`, `minBy`, `multiply`, * `noConflict`, `noop`, `now`, `nth`, `pad`, `padEnd`, `padStart`, `parseInt`, * `pop`, `random`, `reduce`, `reduceRight`, `repeat`, `result`, `round`, * `runInContext`, `sample`, `shift`, `size`, `snakeCase`, `some`, `sortedIndex`, * `sortedIndexBy`, `sortedLastIndex`, `sortedLastIndexBy`, `startCase`, * `startsWith`, `subtract`, `sum`, `sumBy`, `template`, `times`, `toInteger`, * `toJSON`, `toLength`, `toLower`, `toNumber`, `toSafeInteger`, `toString`, * `toUpper`, `trim`, `trimEnd`, `trimStart`, `truncate`, `unescape`, * `uniqueId`, `upperCase`, `upperFirst`, `value`, and `words` * * @name _ * @constructor * @category Seq * @param {*} value The value to wrap in a `lodash` instance. * @returns {Object} Returns the new `lodash` wrapper instance. * @example * * function square(n) { * return n * n; * } * * var wrapped = _([1, 2, 3]); * * // Returns an unwrapped value. * wrapped.reduce(_.add); * // => 6 * * // Returns a wrapped value. * var squares = wrapped.map(square); * * _.isArray(squares); * // => false * * _.isArray(squares.value()); * // => true */ function lodash(value) { if (isObjectLike(value) && !isArray(value) && !(value instanceof LazyWrapper)) { if (value instanceof LodashWrapper) { return value; } if (hasOwnProperty.call(value, '__wrapped__')) { return wrapperClone(value); } } return new LodashWrapper(value); } /** * The function whose prototype chain sequence wrappers inherit from. * * @private */ function baseLodash() { // No operation performed. } /** * The base constructor for creating `lodash` wrapper objects. * * @private * @param {*} value The value to wrap. * @param {boolean} [chainAll] Enable explicit method chain sequences. */ function LodashWrapper(value, chainAll) { this.__wrapped__ = value; this.__actions__ = []; this.__chain__ = !!chainAll; this.__index__ = 0; this.__values__ = undefined; } /** * By default, the template delimiters used by lodash are like those in * embedded Ruby (ERB). Change the following template settings to use * alternative delimiters. * * @static * @memberOf _ * @type {Object} */ lodash.templateSettings = { /** * Used to detect `data` property values to be HTML-escaped. * * @memberOf _.templateSettings * @type {RegExp} */ 'escape': reEscape, /** * Used to detect code to be evaluated. * * @memberOf _.templateSettings * @type {RegExp} */ 'evaluate': reEvaluate, /** * Used to detect `data` property values to inject. * * @memberOf _.templateSettings * @type {RegExp} */ 'interpolate': reInterpolate, /** * Used to reference the data object in the template text. * * @memberOf _.templateSettings * @type {string} */ 'variable': '', /** * Used to import variables into the compiled template. * * @memberOf _.templateSettings * @type {Object} */ 'imports': { /** * A reference to the `lodash` function. * * @memberOf _.templateSettings.imports * @type {Function} */ '_': lodash } }; // Ensure wrappers are instances of `baseLodash`. lodash.prototype = baseLodash.prototype; lodash.prototype.constructor = lodash; LodashWrapper.prototype = baseCreate(baseLodash.prototype); LodashWrapper.prototype.constructor = LodashWrapper; /*------------------------------------------------------------------------*/ /** * Creates a lazy wrapper object which wraps `value` to enable lazy evaluation. * * @private * @constructor * @param {*} value The value to wrap. */ function LazyWrapper(value) { this.__wrapped__ = value; this.__actions__ = []; this.__dir__ = 1; this.__filtered__ = false; this.__iteratees__ = []; this.__takeCount__ = MAX_ARRAY_LENGTH; this.__views__ = []; } /** * Creates a clone of the lazy wrapper object. * * @private * @name clone * @memberOf LazyWrapper * @returns {Object} Returns the cloned `LazyWrapper` object. */ function lazyClone() { var result = new LazyWrapper(this.__wrapped__); result.__actions__ = copyArray(this.__actions__); result.__dir__ = this.__dir__; result.__filtered__ = this.__filtered__; result.__iteratees__ = copyArray(this.__iteratees__); result.__takeCount__ = this.__takeCount__; result.__views__ = copyArray(this.__views__); return result; } /** * Reverses the direction of lazy iteration. * * @private * @name reverse * @memberOf LazyWrapper * @returns {Object} Returns the new reversed `LazyWrapper` object. */ function lazyReverse() { if (this.__filtered__) { var result = new LazyWrapper(this); result.__dir__ = -1; result.__filtered__ = true; } else { result = this.clone(); result.__dir__ *= -1; } return result; } /** * Extracts the unwrapped value from its lazy wrapper. * * @private * @name value * @memberOf LazyWrapper * @returns {*} Returns the unwrapped value. */ function lazyValue() { var array = this.__wrapped__.value(), dir = this.__dir__, isArr = isArray(array), isRight = dir < 0, arrLength = isArr ? array.length : 0, view = getView(0, arrLength, this.__views__), start = view.start, end = view.end, length = end - start, index = isRight ? end : (start - 1), iteratees = this.__iteratees__, iterLength = iteratees.length, resIndex = 0, takeCount = nativeMin(length, this.__takeCount__); if (!isArr || arrLength < LARGE_ARRAY_SIZE || (arrLength == length && takeCount == length)) { return baseWrapperValue(array, this.__actions__); } var result = []; outer: while (length-- && resIndex < takeCount) { index += dir; var iterIndex = -1, value = array[index]; while (++iterIndex < iterLength) { var data = iteratees[iterIndex], iteratee = data.iteratee, type = data.type, computed = iteratee(value); if (type == LAZY_MAP_FLAG) { value = computed; } else if (!computed) { if (type == LAZY_FILTER_FLAG) { continue outer; } else { break outer; } } } result[resIndex++] = value; } return result; } // Ensure `LazyWrapper` is an instance of `baseLodash`. LazyWrapper.prototype = baseCreate(baseLodash.prototype); LazyWrapper.prototype.constructor = LazyWrapper; /*------------------------------------------------------------------------*/ /** * Creates a hash object. * * @private * @constructor * @returns {Object} Returns the new hash object. */ function Hash() {} /** * Removes `key` and its value from the hash. * * @private * @param {Object} hash The hash to modify. * @param {string} key The key of the value to remove. * @returns {boolean} Returns `true` if the entry was removed, else `false`. */ function hashDelete(hash, key) { return hashHas(hash, key) && delete hash[key]; } /** * Gets the hash value for `key`. * * @private * @param {Object} hash The hash to query. * @param {string} key The key of the value to get. * @returns {*} Returns the entry value. */ function hashGet(hash, key) { if (nativeCreate) { var result = hash[key]; return result === HASH_UNDEFINED ? undefined : result; } return hasOwnProperty.call(hash, key) ? hash[key] : undefined; } /** * Checks if a hash value for `key` exists. * * @private * @param {Object} hash The hash to query. * @param {string} key The key of the entry to check. * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`. */ function hashHas(hash, key) { return nativeCreate ? hash[key] !== undefined : hasOwnProperty.call(hash, key); } /** * Sets the hash `key` to `value`. * * @private * @param {Object} hash The hash to modify. * @param {string} key The key of the value to set. * @param {*} value The value to set. */ function hashSet(hash, key, value) { hash[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value; } // Avoid inheriting from `Object.prototype` when possible. Hash.prototype = nativeCreate ? nativeCreate(null) : objectProto; /*------------------------------------------------------------------------*/ /** * Creates a map cache object to store key-value pairs. * * @private * @constructor * @param {Array} [values] The values to cache. */ function MapCache(values) { var index = -1, length = values ? values.length : 0; this.clear(); while (++index < length) { var entry = values[index]; this.set(entry[0], entry[1]); } } /** * Removes all key-value entries from the map. * * @private * @name clear * @memberOf MapCache */ function mapClear() { this.__data__ = { 'hash': new Hash, 'map': Map ? new Map : [], 'string': new Hash }; } /** * Removes `key` and its value from the map. * * @private * @name delete * @memberOf MapCache * @param {string} key The key of the value to remove. * @returns {boolean} Returns `true` if the entry was removed, else `false`. */ function mapDelete(key) { var data = this.__data__; if (isKeyable(key)) { return hashDelete(typeof key == 'string' ? data.string : data.hash, key); } return Map ? data.map['delete'](key) : assocDelete(data.map, key); } /** * Gets the map value for `key`. * * @private * @name get * @memberOf MapCache * @param {string} key The key of the value to get. * @returns {*} Returns the entry value. */ function mapGet(key) { var data = this.__data__; if (isKeyable(key)) { return hashGet(typeof key == 'string' ? data.string : data.hash, key); } return Map ? data.map.get(key) : assocGet(data.map, key); } /** * Checks if a map value for `key` exists. * * @private * @name has * @memberOf MapCache * @param {string} key The key of the entry to check. * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`. */ function mapHas(key) { var data = this.__data__; if (isKeyable(key)) { return hashHas(typeof key == 'string' ? data.string : data.hash, key); } return Map ? data.map.has(key) : assocHas(data.map, key); } /** * Sets the map `key` to `value`. * * @private * @name set * @memberOf MapCache * @param {string} key The key of the value to set. * @param {*} value The value to set. * @returns {Object} Returns the map cache instance. */ function mapSet(key, value) { var data = this.__data__; if (isKeyable(key)) { hashSet(typeof key == 'string' ? data.string : data.hash, key, value); } else if (Map) { data.map.set(key, value); } else { assocSet(data.map, key, value); } return this; } // Add methods to `MapCache`. MapCache.prototype.clear = mapClear; MapCache.prototype['delete'] = mapDelete; MapCache.prototype.get = mapGet; MapCache.prototype.has = mapHas; MapCache.prototype.set = mapSet; /*------------------------------------------------------------------------*/ /** * * Creates a set cache object to store unique values. * * @private * @constructor * @param {Array} [values] The values to cache. */ function SetCache(values) { var index = -1, length = values ? values.length : 0; this.__data__ = new MapCache; while (++index < length) { this.push(values[index]); } } /** * Checks if `value` is in `cache`. * * @private * @param {Object} cache The set cache to search. * @param {*} value The value to search for. * @returns {number} Returns `true` if `value` is found, else `false`. */ function cacheHas(cache, value) { var map = cache.__data__; if (isKeyable(value)) { var data = map.__data__, hash = typeof value == 'string' ? data.string : data.hash; return hash[value] === HASH_UNDEFINED; } return map.has(value); } /** * Adds `value` to the set cache. * * @private * @name push * @memberOf SetCache * @param {*} value The value to cache. */ function cachePush(value) { var map = this.__data__; if (isKeyable(value)) { var data = map.__data__, hash = typeof value == 'string' ? data.string : data.hash; hash[value] = HASH_UNDEFINED; } else { map.set(value, HASH_UNDEFINED); } } // Add methods to `SetCache`. SetCache.prototype.push = cachePush; /*------------------------------------------------------------------------*/ /** * Creates a stack cache object to store key-value pairs. * * @private * @constructor * @param {Array} [values] The values to cache. */ function Stack(values) { var index = -1, length = values ? values.length : 0; this.clear(); while (++index < length) { var entry = values[index]; this.set(entry[0], entry[1]); } } /** * Removes all key-value entries from the stack. * * @private * @name clear * @memberOf Stack */ function stackClear() { this.__data__ = { 'array': [], 'map': null }; } /** * Removes `key` and its value from the stack. * * @private * @name delete * @memberOf Stack * @param {string} key The key of the value to remove. * @returns {boolean} Returns `true` if the entry was removed, else `false`. */ function stackDelete(key) { var data = this.__data__, array = data.array; return array ? assocDelete(array, key) : data.map['delete'](key); } /** * Gets the stack value for `key`. * * @private * @name get * @memberOf Stack * @param {string} key The key of the value to get. * @returns {*} Returns the entry value. */ function stackGet(key) { var data = this.__data__, array = data.array; return array ? assocGet(array, key) : data.map.get(key); } /** * Checks if a stack value for `key` exists. * * @private * @name has * @memberOf Stack * @param {string} key The key of the entry to check. * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`. */ function stackHas(key) { var data = this.__data__, array = data.array; return array ? assocHas(array, key) : data.map.has(key); } /** * Sets the stack `key` to `value`. * * @private * @name set * @memberOf Stack * @param {string} key The key of the value to set. * @param {*} value The value to set. * @returns {Object} Returns the stack cache instance. */ function stackSet(key, value) { var data = this.__data__, array = data.array; if (array) { if (array.length < (LARGE_ARRAY_SIZE - 1)) { assocSet(array, key, value); } else { data.array = null; data.map = new MapCache(array); } } var map = data.map; if (map) { map.set(key, value); } return this; } // Add methods to `Stack`. Stack.prototype.clear = stackClear; Stack.prototype['delete'] = stackDelete; Stack.prototype.get = stackGet; Stack.prototype.has = stackHas; Stack.prototype.set = stackSet; /*------------------------------------------------------------------------*/ /** * Removes `key` and its value from the associative array. * * @private * @param {Array} array The array to modify. * @param {string} key The key of the value to remove. * @returns {boolean} Returns `true` if the entry was removed, else `false`. */ function assocDelete(array, key) { var index = assocIndexOf(array, key); if (index < 0) { return false; } var lastIndex = array.length - 1; if (index == lastIndex) { array.pop(); } else { splice.call(array, index, 1); } return true; } /** * Gets the associative array value for `key`. * * @private * @param {Array} array The array to query. * @param {string} key The key of the value to get. * @returns {*} Returns the entry value. */ function assocGet(array, key) { var index = assocIndexOf(array, key); return index < 0 ? undefined : array[index][1]; } /** * Checks if an associative array value for `key` exists. * * @private * @param {Array} array The array to query. * @param {string} key The key of the entry to check. * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`. */ function assocHas(array, key) { return assocIndexOf(array, key) > -1; } /** * Gets the index at which the `key` is found in `array` of key-value pairs. * * @private * @param {Array} array The array to search. * @param {*} key The key to search for. * @returns {number} Returns the index of the matched value, else `-1`. */ function assocIndexOf(array, key) { var length = array.length; while (length--) { if (eq(array[length][0], key)) { return length; } } return -1; } /** * Sets the associative array `key` to `value`. * * @private * @param {Array} array The array to modify. * @param {string} key The key of the value to set. * @param {*} value The value to set. */ function assocSet(array, key, value) { var index = assocIndexOf(array, key); if (index < 0) { array.push([key, value]); } else { array[index][1] = value; } } /*------------------------------------------------------------------------*/ /** * Used by `_.defaults` to customize its `_.assignIn` use. * * @private * @param {*} objValue The destination value. * @param {*} srcValue The source value. * @param {string} key The key of the property to assign. * @param {Object} object The parent object of `objValue`. * @returns {*} Returns the value to assign. */ function assignInDefaults(objValue, srcValue, key, object) { if (objValue === undefined || (eq(objValue, objectProto[key]) && !hasOwnProperty.call(object, key))) { return srcValue; } return objValue; } /** * This function is like `assignValue` except that it doesn't assign * `undefined` values. * * @private * @param {Object} object The object to modify. * @param {string} key The key of the property to assign. * @param {*} value The value to assign. */ function assignMergeValue(object, key, value) { if ((value !== undefined && !eq(object[key], value)) || (typeof key == 'number' && value === undefined && !(key in object))) { object[key] = value; } } /** * Assigns `value` to `key` of `object` if the existing value is not equivalent * using [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero) * for equality comparisons. * * @private * @param {Object} object The object to modify. * @param {string} key The key of the property to assign. * @param {*} value The value to assign. */ function assignValue(object, key, value) { var objValue = object[key]; if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) || (value === undefined && !(key in object))) { object[key] = value; } } /** * Aggregates elements of `collection` on `accumulator` with keys transformed * by `iteratee` and values set by `setter`. * * @private * @param {Array|Object} collection The collection to iterate over. * @param {Function} setter The function to set `accumulator` values. * @param {Function} iteratee The iteratee to transform keys. * @param {Object} accumulator The initial aggregated object. * @returns {Function} Returns `accumulator`. */ function baseAggregator(collection, setter, iteratee, accumulator) { baseEach(collection, function(value, key, collection) { setter(accumulator, value, iteratee(value), collection); }); return accumulator; } /** * The base implementation of `_.assign` without support for multiple sources * or `customizer` functions. * * @private * @param {Object} object The destination object. * @param {Object} source The source object. * @returns {Object} Returns `object`. */ function baseAssign(object, source) { return object && copyObject(source, keys(source), object); } /** * The base implementation of `_.at` without support for individual paths. * * @private * @param {Object} object The object to iterate over. * @param {string[]} paths The property paths of elements to pick. * @returns {Array} Returns the new array of picked elements. */ function baseAt(object, paths) { var index = -1, isNil = object == null, length = paths.length, result = Array(length); while (++index < length) { result[index] = isNil ? undefined : get(object, paths[index]); } return result; } /** * The base implementation of `_.clamp` which doesn't coerce arguments to numbers. * * @private * @param {number} number The number to clamp. * @param {number} [lower] The lower bound. * @param {number} upper The upper bound. * @returns {number} Returns the clamped number. */ function baseClamp(number, lower, upper) { if (number === number) { if (upper !== undefined) { number = number <= upper ? number : upper; } if (lower !== undefined) { number = number >= lower ? number : lower; } } return number; } /** * The base implementation of `_.clone` and `_.cloneDeep` which tracks * traversed objects. * * @private * @param {*} value The value to clone. * @param {boolean} [isDeep] Specify a deep clone. * @param {boolean} [isFull] Specify a clone including symbols. * @param {Function} [customizer] The function to customize cloning. * @param {string} [key] The key of `value`. * @param {Object} [object] The parent object of `value`. * @param {Object} [stack] Tracks traversed objects and their clone counterparts. * @returns {*} Returns the cloned value. */ function baseClone(value, isDeep, isFull, customizer, key, object, stack) { var result; if (customizer) { result = object ? customizer(value, key, object, stack) : customizer(value); } if (result !== undefined) { return result; } if (!isObject(value)) { return value; } var isArr = isArray(value); if (isArr) { result = initCloneArray(value); if (!isDeep) { return copyArray(value, result); } } else { var tag = getTag(value), isFunc = tag == funcTag || tag == genTag; if (isBuffer(value)) { return cloneBuffer(value, isDeep); } if (tag == objectTag || tag == argsTag || (isFunc && !object)) { if (isHostObject(value)) { return object ? value : {}; } result = initCloneObject(isFunc ? {} : value); if (!isDeep) { return copySymbols(value, baseAssign(result, value)); } } else { if (!cloneableTags[tag]) { return object ? value : {}; } result = initCloneByTag(value, tag, baseClone, isDeep); } } // Check for circular references and return its corresponding clone. stack || (stack = new Stack); var stacked = stack.get(value); if (stacked) { return stacked; } stack.set(value, result); if (!isArr) { var props = isFull ? getAllKeys(value) : keys(value); } // Recursively populate clone (susceptible to call stack limits). arrayEach(props || value, function(subValue, key) { if (props) { key = subValue; subValue = value[key]; } assignValue(result, key, baseClone(subValue, isDeep, isFull, customizer, key, value, stack)); }); return result; } /** * The base implementation of `_.conforms` which doesn't clone `source`. * * @private * @param {Object} source The object of property predicates to conform to. * @returns {Function} Returns the new function. */ function baseConforms(source) { var props = keys(source), length = props.length; return function(object) { if (object == null) { return !length; } var index = length; while (index--) { var key = props[index], predicate = source[key], value = object[key]; if ((value === undefined && !(key in Object(object))) || !predicate(value)) { return false; } } return true; }; } /** * The base implementation of `_.create` without support for assigning * properties to the created object. * * @private * @param {Object} prototype The object to inherit from. * @returns {Object} Returns the new object. */ function baseCreate(proto) { return isObject(proto) ? objectCreate(proto) : {}; } /** * The base implementation of `_.delay` and `_.defer` which accepts an array * of `func` arguments. * * @private * @param {Function} func The function to delay. * @param {number} wait The number of milliseconds to delay invocation. * @param {Object} args The arguments to provide to `func`. * @returns {number} Returns the timer id. */ function baseDelay(func, wait, args) { if (typeof func != 'function') { throw new TypeError(FUNC_ERROR_TEXT); } return setTimeout(function() { func.apply(undefined, args); }, wait); } /** * The base implementation of methods like `_.difference` without support * for excluding multiple arrays or iteratee shorthands. * * @private * @param {Array} array The array to inspect. * @param {Array} values The values to exclude. * @param {Function} [iteratee] The iteratee invoked per element. * @param {Function} [comparator] The comparator invoked per element. * @returns {Array} Returns the new array of filtered values. */ function baseDifference(array, values, iteratee, comparator) { var index = -1, includes = arrayIncludes, isCommon = true, length = array.length, result = [], valuesLength = values.length; if (!length) { return result; } if (iteratee) { values = arrayMap(values, baseUnary(iteratee)); } if (comparator) { includes = arrayIncludesWith; isCommon = false; } else if (values.length >= LARGE_ARRAY_SIZE) { includes = cacheHas; isCommon = false; values = new SetCache(values); } outer: while (++index < length) { var value = array[index], computed = iteratee ? iteratee(value) : value; if (isCommon && computed === computed) { var valuesIndex = valuesLength; while (valuesIndex--) { if (values[valuesIndex] === computed) { continue outer; } } result.push(value); } else if (!includes(values, computed, comparator)) { result.push(value); } } return result; } /** * The base implementation of `_.forEach` without support for iteratee shorthands. * * @private * @param {Array|Object} collection The collection to iterate over. * @param {Function} iteratee The function invoked per iteration. * @returns {Array|Object} Returns `collection`. */ var baseEach = createBaseEach(baseForOwn); /** * The base implementation of `_.forEachRight` without support for iteratee shorthands. * * @private * @param {Array|Object} collection The collection to iterate over. * @param {Function} iteratee The function invoked per iteration. * @returns {Array|Object} Returns `collection`. */ var baseEachRight = createBaseEach(baseForOwnRight, true); /** * The base implementation of `_.every` without support for iteratee shorthands. * * @private * @param {Array|Object} collection The collection to iterate over. * @param {Function} predicate The function invoked per iteration. * @returns {boolean} Returns `true` if all elements pass the predicate check, * else `false` */ function baseEvery(collection, predicate) { var result = true; baseEach(collection, function(value, index, collection) { result = !!predicate(value, index, collection); return result; }); return result; } /** * The base implementation of `_.fill` without an iteratee call guard. * * @private * @param {Array} array The array to fill. * @param {*} value The value to fill `array` with. * @param {number} [start=0] The start position. * @param {number} [end=array.length] The end position. * @returns {Array} Returns `array`. */ function baseFill(array, value, start, end) { var length = array.length; start = toInteger(start); if (start < 0) { start = -start > length ? 0 : (length + start); } end = (end === undefined || end > length) ? length : toInteger(end); if (end < 0) { end += length; } end = start > end ? 0 : toLength(end); while (start < end) { array[start++] = value; } return array; } /** * The base implementation of `_.filter` without support for iteratee shorthands. * * @private * @param {Array|Object} collection The collection to iterate over. * @param {Function} predicate The function invoked per iteration. * @returns {Array} Returns the new filtered array. */ function baseFilter(collection, predicate) { var result = []; baseEach(collection, function(value, index, collection) { if (predicate(value, index, collection)) { result.push(value); } }); return result; } /** * The base implementation of `_.flatten` with support for restricting flattening. * * @private * @param {Array} array The array to flatten. * @param {number} depth The maximum recursion depth. * @param {boolean} [predicate=isFlattenable] The function invoked per iteration. * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks. * @param {Array} [result=[]] The initial result value. * @returns {Array} Returns the new flattened array. */ function baseFlatten(array, depth, predicate, isStrict, result) { var index = -1, length = array.length; predicate || (predicate = isFlattenable); result || (result = []); while (++index < length) { var value = array[index]; if (depth > 0 && predicate(value)) { if (depth > 1) { // Recursively flatten arrays (susceptible to call stack limits). baseFlatten(value, depth - 1, predicate, isStrict, result); } else { arrayPush(result, value); } } else if (!isStrict) { result[result.length] = value; } } return result; } /** * The base implementation of `baseForOwn` which iterates over `object` * properties returned by `keysFunc` and invokes `iteratee` for each property. * Iteratee functions may exit iteration early by explicitly returning `false`. * * @private * @param {Object} object The object to iterate over. * @param {Function} iteratee The function invoked per iteration. * @param {Function} keysFunc The function to get the keys of `object`. * @returns {Object} Returns `object`. */ var baseFor = createBaseFor(); /** * This function is like `baseFor` except that it iterates over properties * in the opposite order. * * @private * @param {Object} object The object to iterate over. * @param {Function} iteratee The function invoked per iteration. * @param {Function} keysFunc The function to get the keys of `object`. * @returns {Object} Returns `object`. */ var baseForRight = createBaseFor(true); /** * The base implementation of `_.forOwn` without support for iteratee shorthands. * * @private * @param {Object} object The object to iterate over. * @param {Function} iteratee The function invoked per iteration. * @returns {Object} Returns `object`. */ function baseForOwn(object, iteratee) { return object && baseFor(object, iteratee, keys); } /** * The base implementation of `_.forOwnRight` without support for iteratee shorthands. * * @private * @param {Object} object The object to iterate over. * @param {Function} iteratee The function invoked per iteration. * @returns {Object} Returns `object`. */ function baseForOwnRight(object, iteratee) { return object && baseForRight(object, iteratee, keys); } /** * The base implementation of `_.functions` which creates an array of * `object` function property names filtered from `props`. * * @private * @param {Object} object The object to inspect. * @param {Array} props The property names to filter. * @returns {Array} Returns the new array of filtered property names. */ function baseFunctions(object, props) { return arrayFilter(props, function(key) { return isFunction(object[key]); }); } /** * The base implementation of `_.get` without support for default values. * * @private * @param {Object} object The object to query. * @param {Array|string} path The path of the property to get. * @returns {*} Returns the resolved value. */ function baseGet(object, path) { path = isKey(path, object) ? [path] : castPath(path); var index = 0, length = path.length; while (object != null && index < length) { object = object[path[index++]]; } return (index && index == length) ? object : undefined; } /** * The base implementation of `getAllKeys` and `getAllKeysIn` which uses * `keysFunc` and `symbolsFunc` to get the enumerable property names and * symbols of `object`. * * @private * @param {Object} object The object to query. * @param {Function} keysFunc The function to get the keys of `object`. * @param {Function} symbolsFunc The function to get the symbols of `object`. * @returns {Array} Returns the array of property names and symbols. */ function baseGetAllKeys(object, keysFunc, symbolsFunc) { var result = keysFunc(object); return isArray(object) ? result : arrayPush(result, symbolsFunc(object)); } /** * The base implementation of `_.has` without support for deep paths. * * @private * @param {Object} object The object to query. * @param {Array|string} key The key to check. * @returns {boolean} Returns `true` if `key` exists, else `false`. */ function baseHas(object, key) { // Avoid a bug in IE 10-11 where objects with a [[Prototype]] of `null`, // that are composed entirely of index properties, return `false` for // `hasOwnProperty` checks of them. return hasOwnProperty.call(object, key) || (typeof object == 'object' && key in object && getPrototype(object) === null); } /** * The base implementation of `_.hasIn` without support for deep paths. * * @private * @param {Object} object The object to query. * @param {Array|string} key The key to check. * @returns {boolean} Returns `true` if `key` exists, else `false`. */ function baseHasIn(object, key) { return key in Object(object); } /** * The base implementation of `_.inRange` which doesn't coerce arguments to numbers. * * @private * @param {number} number The number to check. * @param {number} start The start of the range. * @param {number} end The end of the range. * @returns {boolean} Returns `true` if `number` is in the range, else `false`. */ function baseInRange(number, start, end) { return number >= nativeMin(start, end) && number < nativeMax(start, end); } /** * The base implementation of methods like `_.intersection`, without support * for iteratee shorthands, that accepts an array of arrays to inspect. * * @private * @param {Array} arrays The arrays to inspect. * @param {Function} [iteratee] The iteratee invoked per element. * @param {Function} [comparator] The comparator invoked per element. * @returns {Array} Returns the new array of shared values. */ function baseIntersection(arrays, iteratee, comparator) { var includes = comparator ? arrayIncludesWith : arrayIncludes, length = arrays[0].length, othLength = arrays.length, othIndex = othLength, caches = Array(othLength), maxLength = Infinity, result = []; while (othIndex--) { var array = arrays[othIndex]; if (othIndex && iteratee) { array = arrayMap(array, baseUnary(iteratee)); } maxLength = nativeMin(array.length, maxLength); caches[othIndex] = !comparator && (iteratee || (length >= 120 && array.length >= 120)) ? new SetCache(othIndex && array) : undefined; } array = arrays[0]; var index = -1, seen = caches[0]; outer: while (++index < length && result.length < maxLength) { var value = array[index], computed = iteratee ? iteratee(value) : value; if (!(seen ? cacheHas(seen, computed) : includes(result, computed, comparator) )) { othIndex = othLength; while (--othIndex) { var cache = caches[othIndex]; if (!(cache ? cacheHas(cache, computed) : includes(arrays[othIndex], computed, comparator)) ) { continue outer; } } if (seen) { seen.push(computed); } result.push(value); } } return result; } /** * The base implementation of `_.invert` and `_.invertBy` which inverts * `object` with values transformed by `iteratee` and set by `setter`. * * @private * @param {Object} object The object to iterate over. * @param {Function} setter The function to set `accumulator` values. * @param {Function} iteratee The iteratee to transform values. * @param {Object} accumulator The initial inverted object. * @returns {Function} Returns `accumulator`. */ function baseInverter(object, setter, iteratee, accumulator) { baseForOwn(object, function(value, key, object) { setter(accumulator, iteratee(value), key, object); }); return accumulator; } /** * The base implementation of `_.invoke` without support for individual * method arguments. * * @private * @param {Object} object The object to query. * @param {Array|string} path The path of the method to invoke. * @param {Array} args The arguments to invoke the method with. * @returns {*} Returns the result of the invoked method. */ function baseInvoke(object, path, args) { if (!isKey(path, object)) { path = castPath(path); object = parent(object, path); path = last(path); } var func = object == null ? object : object[path]; return func == null ? undefined : apply(func, object, args); } /** * The base implementation of `_.isEqual` which supports partial comparisons * and tracks traversed objects. * * @private * @param {*} value The value to compare. * @param {*} other The other value to compare. * @param {Function} [customizer] The function to customize comparisons. * @param {boolean} [bitmask] The bitmask of comparison flags. * The bitmask may be composed of the following flags: * 1 - Unordered comparison * 2 - Partial comparison * @param {Object} [stack] Tracks traversed `value` and `other` objects. * @returns {boolean} Returns `true` if the values are equivalent, else `false`. */ function baseIsEqual(value, other, customizer, bitmask, stack) { if (value === other) { return true; } if (value == null || other == null || (!isObject(value) && !isObjectLike(other))) { return value !== value && other !== other; } return baseIsEqualDeep(value, other, baseIsEqual, customizer, bitmask, stack); } /** * A specialized version of `baseIsEqual` for arrays and objects which performs * deep comparisons and tracks traversed objects enabling objects with circular * references to be compared. * * @private * @param {Object} object The object to compare. * @param {Object} other The other object to compare. * @param {Function} equalFunc The function to determine equivalents of values. * @param {Function} [customizer] The function to customize comparisons. * @param {number} [bitmask] The bitmask of comparison flags. See `baseIsEqual` * for more details. * @param {Object} [stack] Tracks traversed `object` and `other` objects. * @returns {boolean} Returns `true` if the objects are equivalent, else `false`. */ function baseIsEqualDeep(object, other, equalFunc, customizer, bitmask, stack) { var objIsArr = isArray(object), othIsArr = isArray(other), objTag = arrayTag, othTag = arrayTag; if (!objIsArr) { objTag = getTag(object); objTag = objTag == argsTag ? objectTag : objTag; } if (!othIsArr) { othTag = getTag(other); othTag = othTag == argsTag ? objectTag : othTag; } var objIsObj = objTag == objectTag && !isHostObject(object), othIsObj = othTag == objectTag && !isHostObject(other), isSameTag = objTag == othTag; if (isSameTag && !objIsObj) { stack || (stack = new Stack); return (objIsArr || isTypedArray(object)) ? equalArrays(object, other, equalFunc, customizer, bitmask, stack) : equalByTag(object, other, objTag, equalFunc, customizer, bitmask, stack); } if (!(bitmask & PARTIAL_COMPARE_FLAG)) { var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'), othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__'); if (objIsWrapped || othIsWrapped) { var objUnwrapped = objIsWrapped ? object.value() : object, othUnwrapped = othIsWrapped ? other.value() : other; stack || (stack = new Stack); return equalFunc(objUnwrapped, othUnwrapped, customizer, bitmask, stack); } } if (!isSameTag) { return false; } stack || (stack = new Stack); return equalObjects(object, other, equalFunc, customizer, bitmask, stack); } /** * The base implementation of `_.isMatch` without support for iteratee shorthands. * * @private * @param {Object} object The object to inspect. * @param {Object} source The object of property values to match. * @param {Array} matchData The property names, values, and compare flags to match. * @param {Function} [customizer] The function to customize comparisons. * @returns {boolean} Returns `true` if `object` is a match, else `false`. */ function baseIsMatch(object, source, matchData, customizer) { var index = matchData.length, length = index, noCustomizer = !customizer; if (object == null) { return !length; } object = Object(object); while (index--) { var data = matchData[index]; if ((noCustomizer && data[2]) ? data[1] !== object[data[0]] : !(data[0] in object) ) { return false; } } while (++index < length) { data = matchData[index]; var key = data[0], objValue = object[key], srcValue = data[1]; if (noCustomizer && data[2]) { if (objValue === undefined && !(key in object)) { return false; } } else { var stack = new Stack; if (customizer) { var result = customizer(objValue, srcValue, key, object, source, stack); } if (!(result === undefined ? baseIsEqual(srcValue, objValue, customizer, UNORDERED_COMPARE_FLAG | PARTIAL_COMPARE_FLAG, stack) : result )) { return false; } } } return true; } /** * The base implementation of `_.iteratee`. * * @private * @param {*} [value=_.identity] The value to convert to an iteratee. * @returns {Function} Returns the iteratee. */ function baseIteratee(value) { // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9. // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details. if (typeof value == 'function') { return value; } if (value == null) { return identity; } if (typeof value == 'object') { return isArray(value) ? baseMatchesProperty(value[0], value[1]) : baseMatches(value); } return property(value); } /** * The base implementation of `_.keys` which doesn't skip the constructor * property of prototypes or treat sparse arrays as dense. * * @private * @param {Object} object The object to query. * @returns {Array} Returns the array of property names. */ function baseKeys(object) { return nativeKeys(Object(object)); } /** * The base implementation of `_.keysIn` which doesn't skip the constructor * property of prototypes or treat sparse arrays as dense. * * @private * @param {Object} object The object to query. * @returns {Array} Returns the array of property names. */ function baseKeysIn(object) { object = object == null ? object : Object(object); var result = []; for (var key in object) { result.push(key); } return result; } // Fallback for IE < 9 with es6-shim. if (enumerate && !propertyIsEnumerable.call({ 'valueOf': 1 }, 'valueOf')) { baseKeysIn = function(object) { return iteratorToArray(enumerate(object)); }; } /** * The base implementation of `_.map` without support for iteratee shorthands. * * @private * @param {Array|Object} collection The collection to iterate over. * @param {Function} iteratee The function invoked per iteration. * @returns {Array} Returns the new mapped array. */ function baseMap(collection, iteratee) { var index = -1, result = isArrayLike(collection) ? Array(collection.length) : []; baseEach(collection, function(value, key, collection) { result[++index] = iteratee(value, key, collection); }); return result; } /** * The base implementation of `_.matches` which doesn't clone `source`. * * @private * @param {Object} source The object of property values to match. * @returns {Function} Returns the new function. */ function baseMatches(source) { var matchData = getMatchData(source); if (matchData.length == 1 && matchData[0][2]) { return matchesStrictComparable(matchData[0][0], matchData[0][1]); } return function(object) { return object === source || baseIsMatch(object, source, matchData); }; } /** * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`. * * @private * @param {string} path The path of the property to get. * @param {*} srcValue The value to match. * @returns {Function} Returns the new function. */ function baseMatchesProperty(path, srcValue) { if (isKey(path) && isStrictComparable(srcValue)) { return matchesStrictComparable(path, srcValue); } return function(object) { var objValue = get(object, path); return (objValue === undefined && objValue === srcValue) ? hasIn(object, path) : baseIsEqual(srcValue, objValue, undefined, UNORDERED_COMPARE_FLAG | PARTIAL_COMPARE_FLAG); }; } /** * The base implementation of `_.merge` without support for multiple sources. * * @private * @param {Object} object The destination object. * @param {Object} source The source object. * @param {number} srcIndex The index of `source`. * @param {Function} [customizer] The function to customize merged values. * @param {Object} [stack] Tracks traversed source values and their merged * counterparts. */ function baseMerge(object, source, srcIndex, customizer, stack) { if (object === source) { return; } if (!(isArray(source) || isTypedArray(source))) { var props = keysIn(source); } arrayEach(props || source, function(srcValue, key) { if (props) { key = srcValue; srcValue = source[key]; } if (isObject(srcValue)) { stack || (stack = new Stack); baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack); } else { var newValue = customizer ? customizer(object[key], srcValue, (key + ''), object, source, stack) : undefined; if (newValue === undefined) { newValue = srcValue; } assignMergeValue(object, key, newValue); } }); } /** * A specialized version of `baseMerge` for arrays and objects which performs * deep merges and tracks traversed objects enabling objects with circular * references to be merged. * * @private * @param {Object} object The destination object. * @param {Object} source The source object. * @param {string} key The key of the value to merge. * @param {number} srcIndex The index of `source`. * @param {Function} mergeFunc The function to merge values. * @param {Function} [customizer] The function to customize assigned values. * @param {Object} [stack] Tracks traversed source values and their merged * counterparts. */ function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) { var objValue = object[key], srcValue = source[key], stacked = stack.get(srcValue); if (stacked) { assignMergeValue(object, key, stacked); return; } var newValue = customizer ? customizer(objValue, srcValue, (key + ''), object, source, stack) : undefined; var isCommon = newValue === undefined; if (isCommon) { newValue = srcValue; if (isArray(srcValue) || isTypedArray(srcValue)) { if (isArray(objValue)) { newValue = objValue; } else if (isArrayLikeObject(objValue)) { newValue = copyArray(objValue); } else { isCommon = false; newValue = baseClone(srcValue, true); } } else if (isPlainObject(srcValue) || isArguments(srcValue)) { if (isArguments(objValue)) { newValue = toPlainObject(objValue); } else if (!isObject(objValue) || (srcIndex && isFunction(objValue))) { isCommon = false; newValue = baseClone(srcValue, true); } else { newValue = objValue; } } else { isCommon = false; } } stack.set(srcValue, newValue); if (isCommon) { // Recursively merge objects and arrays (susceptible to call stack limits). mergeFunc(newValue, srcValue, srcIndex, customizer, stack); } stack['delete'](srcValue); assignMergeValue(object, key, newValue); } /** * The base implementation of `_.nth` which doesn't coerce `n` to an integer. * * @private * @param {Array} array The array to query. * @param {number} n The index of the element to return. * @returns {*} Returns the nth element of `array`. */ function baseNth(array, n) { var length = array.length; if (!length) { return; } n += n < 0 ? length : 0; return isIndex(n, length) ? array[n] : undefined; } /** * The base implementation of `_.orderBy` without param guards. * * @private * @param {Array|Object} collection The collection to iterate over. * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by. * @param {string[]} orders The sort orders of `iteratees`. * @returns {Array} Returns the new sorted array. */ function baseOrderBy(collection, iteratees, orders) { var index = -1; iteratees = arrayMap(iteratees.length ? iteratees : [identity], baseUnary(getIteratee())); var result = baseMap(collection, function(value, key, collection) { var criteria = arrayMap(iteratees, function(iteratee) { return iteratee(value); }); return { 'criteria': criteria, 'index': ++index, 'value': value }; }); return baseSortBy(result, function(object, other) { return compareMultiple(object, other, orders); }); } /** * The base implementation of `_.pick` without support for individual * property identifiers. * * @private * @param {Object} object The source object. * @param {string[]} props The property identifiers to pick. * @returns {Object} Returns the new object. */ function basePick(object, props) { object = Object(object); return arrayReduce(props, function(result, key) { if (key in object) { result[key] = object[key]; } return result; }, {}); } /** * The base implementation of `_.pickBy` without support for iteratee shorthands. * * @private * @param {Object} object The source object. * @param {Function} predicate The function invoked per property. * @returns {Object} Returns the new object. */ function basePickBy(object, predicate) { var index = -1, props = getAllKeysIn(object), length = props.length, result = {}; while (++index < length) { var key = props[index], value = object[key]; if (predicate(value, key)) { result[key] = value; } } return result; } /** * The base implementation of `_.property` without support for deep paths. * * @private * @param {string} key The key of the property to get. * @returns {Function} Returns the new function. */ function baseProperty(key) { return function(object) { return object == null ? undefined : object[key]; }; } /** * A specialized version of `baseProperty` which supports deep paths. * * @private * @param {Array|string} path The path of the property to get. * @returns {Function} Returns the new function. */ function basePropertyDeep(path) { return function(object) { return baseGet(object, path); }; } /** * The base implementation of `_.pullAllBy` without support for iteratee * shorthands. * * @private * @param {Array} array The array to modify. * @param {Array} values The values to remove. * @param {Function} [iteratee] The iteratee invoked per element. * @param {Function} [comparator] The comparator invoked per element. * @returns {Array} Returns `array`. */ function basePullAll(array, values, iteratee, comparator) { var indexOf = comparator ? baseIndexOfWith : baseIndexOf, index = -1, length = values.length, seen = array; if (iteratee) { seen = arrayMap(array, baseUnary(iteratee)); } while (++index < length) { var fromIndex = 0, value = values[index], computed = iteratee ? iteratee(value) : value; while ((fromIndex = indexOf(seen, computed, fromIndex, comparator)) > -1) { if (seen !== array) { splice.call(seen, fromIndex, 1); } splice.call(array, fromIndex, 1); } } return array; } /** * The base implementation of `_.pullAt` without support for individual * indexes or capturing the removed elements. * * @private * @param {Array} array The array to modify. * @param {number[]} indexes The indexes of elements to remove. * @returns {Array} Returns `array`. */ function basePullAt(array, indexes) { var length = array ? indexes.length : 0, lastIndex = length - 1; while (length--) { var index = indexes[length]; if (lastIndex == length || index != previous) { var previous = index; if (isIndex(index)) { splice.call(array, index, 1); } else if (!isKey(index, array)) { var path = castPath(index), object = parent(array, path); if (object != null) { delete object[last(path)]; } } else { delete array[index]; } } } return array; } /** * The base implementation of `_.random` without support for returning * floating-point numbers. * * @private * @param {number} lower The lower bound. * @param {number} upper The upper bound. * @returns {number} Returns the random number. */ function baseRandom(lower, upper) { return lower + nativeFloor(nativeRandom() * (upper - lower + 1)); } /** * The base implementation of `_.range` and `_.rangeRight` which doesn't * coerce arguments to numbers. * * @private * @param {number} start The start of the range. * @param {number} end The end of the range. * @param {number} step The value to increment or decrement by. * @param {boolean} [fromRight] Specify iterating from right to left. * @returns {Array} Returns the new array of numbers. */ function baseRange(start, end, step, fromRight) { var index = -1, length = nativeMax(nativeCeil((end - start) / (step || 1)), 0), result = Array(length); while (length--) { result[fromRight ? length : ++index] = start; start += step; } return result; } /** * The base implementation of `_.repeat` which doesn't coerce arguments. * * @private * @param {string} string The string to repeat. * @param {number} n The number of times to repeat the string. * @returns {string} Returns the repeated string. */ function baseRepeat(string, n) { var result = ''; if (!string || n < 1 || n > MAX_SAFE_INTEGER) { return result; } // Leverage the exponentiation by squaring algorithm for a faster repeat. // See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details. do { if (n % 2) { result += string; } n = nativeFloor(n / 2); if (n) { string += string; } } while (n); return result; } /** * The base implementation of `_.set`. * * @private * @param {Object} object The object to query. * @param {Array|string} path The path of the property to set. * @param {*} value The value to set. * @param {Function} [customizer] The function to customize path creation. * @returns {Object} Returns `object`. */ function baseSet(object, path, value, customizer) { path = isKey(path, object) ? [path] : castPath(path); var index = -1, length = path.length, lastIndex = length - 1, nested = object; while (nested != null && ++index < length) { var key = path[index]; if (isObject(nested)) { var newValue = value; if (index != lastIndex) { var objValue = nested[key]; newValue = customizer ? customizer(objValue, key, nested) : undefined; if (newValue === undefined) { newValue = objValue == null ? (isIndex(path[index + 1]) ? [] : {}) : objValue; } } assignValue(nested, key, newValue); } nested = nested[key]; } return object; } /** * The base implementation of `setData` without support for hot loop detection. * * @private * @param {Function} func The function to associate metadata with. * @param {*} data The metadata. * @returns {Function} Returns `func`. */ var baseSetData = !metaMap ? identity : function(func, data) { metaMap.set(func, data); return func; }; /** * The base implementation of `_.slice` without an iteratee call guard. * * @private * @param {Array} array The array to slice. * @param {number} [start=0] The start position. * @param {number} [end=array.length] The end position. * @returns {Array} Returns the slice of `array`. */ function baseSlice(array, start, end) { var index = -1, length = array.length; if (start < 0) { start = -start > length ? 0 : (length + start); } end = end > length ? length : end; if (end < 0) { end += length; } length = start > end ? 0 : ((end - start) >>> 0); start >>>= 0; var result = Array(length); while (++index < length) { result[index] = array[index + start]; } return result; } /** * The base implementation of `_.some` without support for iteratee shorthands. * * @private * @param {Array|Object} collection The collection to iterate over. * @param {Function} predicate The function invoked per iteration. * @returns {boolean} Returns `true` if any element passes the predicate check, * else `false`. */ function baseSome(collection, predicate) { var result; baseEach(collection, function(value, index, collection) { result = predicate(value, index, collection); return !result; }); return !!result; } /** * The base implementation of `_.sortedIndex` and `_.sortedLastIndex` which * performs a binary search of `array` to determine the index at which `value` * should be inserted into `array` in order to maintain its sort order. * * @private * @param {Array} array The sorted array to inspect. * @param {*} value The value to evaluate. * @param {boolean} [retHighest] Specify returning the highest qualified index. * @returns {number} Returns the index at which `value` should be inserted * into `array`. */ function baseSortedIndex(array, value, retHighest) { var low = 0, high = array ? array.length : low; if (typeof value == 'number' && value === value && high <= HALF_MAX_ARRAY_LENGTH) { while (low < high) { var mid = (low + high) >>> 1, computed = array[mid]; if ((retHighest ? (computed <= value) : (computed < value)) && computed !== null) { low = mid + 1; } else { high = mid; } } return high; } return baseSortedIndexBy(array, value, identity, retHighest); } /** * The base implementation of `_.sortedIndexBy` and `_.sortedLastIndexBy` * which invokes `iteratee` for `value` and each element of `array` to compute * their sort ranking. The iteratee is invoked with one argument; (value). * * @private * @param {Array} array The sorted array to inspect. * @param {*} value The value to evaluate. * @param {Function} iteratee The iteratee invoked per element. * @param {boolean} [retHighest] Specify returning the highest qualified index. * @returns {number} Returns the index at which `value` should be inserted * into `array`. */ function baseSortedIndexBy(array, value, iteratee, retHighest) { value = iteratee(value); var low = 0, high = array ? array.length : 0, valIsNaN = value !== value, valIsNull = value === null, valIsUndef = value === undefined; while (low < high) { var mid = nativeFloor((low + high) / 2), computed = iteratee(array[mid]), isDef = computed !== undefined, isReflexive = computed === computed; if (valIsNaN) { var setLow = isReflexive || retHighest; } else if (valIsNull) { setLow = isReflexive && isDef && (retHighest || computed != null); } else if (valIsUndef) { setLow = isReflexive && (retHighest || isDef); } else if (computed == null) { setLow = false; } else { setLow = retHighest ? (computed <= value) : (computed < value); } if (setLow) { low = mid + 1; } else { high = mid; } } return nativeMin(high, MAX_ARRAY_INDEX); } /** * The base implementation of `_.sortedUniq`. * * @private * @param {Array} array The array to inspect. * @returns {Array} Returns the new duplicate free array. */ function baseSortedUniq(array) { return baseSortedUniqBy(array); } /** * The base implementation of `_.sortedUniqBy` without support for iteratee * shorthands. * * @private * @param {Array} array The array to inspect. * @param {Function} [iteratee] The iteratee invoked per element. * @returns {Array} Returns the new duplicate free array. */ function baseSortedUniqBy(array, iteratee) { var index = 0, length = array.length, value = array[0], computed = iteratee ? iteratee(value) : value, seen = computed, resIndex = 1, result = [value]; while (++index < length) { value = array[index], computed = iteratee ? iteratee(value) : value; if (!eq(computed, seen)) { seen = computed; result[resIndex++] = value; } } return result; } /** * The base implementation of `_.uniqBy` without support for iteratee shorthands. * * @private * @param {Array} array The array to inspect. * @param {Function} [iteratee] The iteratee invoked per element. * @param {Function} [comparator] The comparator invoked per element. * @returns {Array} Returns the new duplicate free array. */ function baseUniq(array, iteratee, comparator) { var index = -1, includes = arrayIncludes, length = array.length, isCommon = true, result = [], seen = result; if (comparator) { isCommon = false; includes = arrayIncludesWith; } else if (length >= LARGE_ARRAY_SIZE) { var set = iteratee ? null : createSet(array); if (set) { return setToArray(set); } isCommon = false; includes = cacheHas; seen = new SetCache; } else { seen = iteratee ? [] : result; } outer: while (++index < length) { var value = array[index], computed = iteratee ? iteratee(value) : value; if (isCommon && computed === computed) { var seenIndex = seen.length; while (seenIndex--) { if (seen[seenIndex] === computed) { continue outer; } } if (iteratee) { seen.push(computed); } result.push(value); } else if (!includes(seen, computed, comparator)) { if (seen !== result) { seen.push(computed); } result.push(value); } } return result; } /** * The base implementation of `_.unset`. * * @private * @param {Object} object The object to modify. * @param {Array|string} path The path of the property to unset. * @returns {boolean} Returns `true` if the property is deleted, else `false`. */ function baseUnset(object, path) { path = isKey(path, object) ? [path] : castPath(path); object = parent(object, path); var key = last(path); return (object != null && has(object, key)) ? delete object[key] : true; } /** * The base implementation of `_.update`. * * @private * @param {Object} object The object to query. * @param {Array|string} path The path of the property to update. * @param {Function} updater The function to produce the updated value. * @param {Function} [customizer] The function to customize path creation. * @returns {Object} Returns `object`. */ function baseUpdate(object, path, updater, customizer) { return baseSet(object, path, updater(baseGet(object, path)), customizer); } /** * The base implementation of methods like `_.dropWhile` and `_.takeWhile` * without support for iteratee shorthands. * * @private * @param {Array} array The array to query. * @param {Function} predicate The function invoked per iteration. * @param {boolean} [isDrop] Specify dropping elements instead of taking them. * @param {boolean} [fromRight] Specify iterating from right to left. * @returns {Array} Returns the slice of `array`. */ function baseWhile(array, predicate, isDrop, fromRight) { var length = array.length, index = fromRight ? length : -1; while ((fromRight ? index-- : ++index < length) && predicate(array[index], index, array)) {} return isDrop ? baseSlice(array, (fromRight ? 0 : index), (fromRight ? index + 1 : length)) : baseSlice(array, (fromRight ? index + 1 : 0), (fromRight ? length : index)); } /** * The base implementation of `wrapperValue` which returns the result of * performing a sequence of actions on the unwrapped `value`, where each * successive action is supplied the return value of the previous. * * @private * @param {*} value The unwrapped value. * @param {Array} actions Actions to perform to resolve the unwrapped value. * @returns {*} Returns the resolved value. */ function baseWrapperValue(value, actions) { var result = value; if (result instanceof LazyWrapper) { result = result.value(); } return arrayReduce(actions, function(result, action) { return action.func.apply(action.thisArg, arrayPush([result], action.args)); }, result); } /** * The base implementation of methods like `_.xor`, without support for * iteratee shorthands, that accepts an array of arrays to inspect. * * @private * @param {Array} arrays The arrays to inspect. * @param {Function} [iteratee] The iteratee invoked per element. * @param {Function} [comparator] The comparator invoked per element. * @returns {Array} Returns the new array of values. */ function baseXor(arrays, iteratee, comparator) { var index = -1, length = arrays.length; while (++index < length) { var result = result ? arrayPush( baseDifference(result, arrays[index], iteratee, comparator), baseDifference(arrays[index], result, iteratee, comparator) ) : arrays[index]; } return (result && result.length) ? baseUniq(result, iteratee, comparator) : []; } /** * This base implementation of `_.zipObject` which assigns values using `assignFunc`. * * @private * @param {Array} props The property identifiers. * @param {Array} values The property values. * @param {Function} assignFunc The function to assign values. * @returns {Object} Returns the new object. */ function baseZipObject(props, values, assignFunc) { var index = -1, length = props.length, valsLength = values.length, result = {}; while (++index < length) { var value = index < valsLength ? values[index] : undefined; assignFunc(result, props[index], value); } return result; } /** * Casts `value` to an empty array if it's not an array like object. * * @private * @param {*} value The value to inspect. * @returns {Array|Object} Returns the cast array-like object. */ function castArrayLikeObject(value) { return isArrayLikeObject(value) ? value : []; } /** * Casts `value` to `identity` if it's not a function. * * @private * @param {*} value The value to inspect. * @returns {Function} Returns cast function. */ function castFunction(value) { return typeof value == 'function' ? value : identity; } /** * Casts `value` to a path array if it's not one. * * @private * @param {*} value The value to inspect. * @returns {Array} Returns the cast property path array. */ function castPath(value) { return isArray(value) ? value : stringToPath(value); } /** * Casts `array` to a slice if it's needed. * * @private * @param {Array} array The array to inspect. * @param {number} start The start position. * @param {number} [end=array.length] The end position. * @returns {Array} Returns the cast slice. */ function castSlice(array, start, end) { var length = array.length; end = end === undefined ? length : end; return (!start && end >= length) ? array : baseSlice(array, start, end); } /** * Creates a clone of `buffer`. * * @private * @param {Buffer} buffer The buffer to clone. * @param {boolean} [isDeep] Specify a deep clone. * @returns {Buffer} Returns the cloned buffer. */ function cloneBuffer(buffer, isDeep) { if (isDeep) { return buffer.slice(); } var result = new buffer.constructor(buffer.length); buffer.copy(result); return result; } /** * Creates a clone of `arrayBuffer`. * * @private * @param {ArrayBuffer} arrayBuffer The array buffer to clone. * @returns {ArrayBuffer} Returns the cloned array buffer. */ function cloneArrayBuffer(arrayBuffer) { var result = new arrayBuffer.constructor(arrayBuffer.byteLength); new Uint8Array(result).set(new Uint8Array(arrayBuffer)); return result; } /** * Creates a clone of `dataView`. * * @private * @param {Object} dataView The data view to clone. * @param {boolean} [isDeep] Specify a deep clone. * @returns {Object} Returns the cloned data view. */ function cloneDataView(dataView, isDeep) { var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer; return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength); } /** * Creates a clone of `map`. * * @private * @param {Object} map The map to clone. * @param {Function} cloneFunc The function to clone values. * @param {boolean} [isDeep] Specify a deep clone. * @returns {Object} Returns the cloned map. */ function cloneMap(map, isDeep, cloneFunc) { var array = isDeep ? cloneFunc(mapToArray(map), true) : mapToArray(map); return arrayReduce(array, addMapEntry, new map.constructor); } /** * Creates a clone of `regexp`. * * @private * @param {Object} regexp The regexp to clone. * @returns {Object} Returns the cloned regexp. */ function cloneRegExp(regexp) { var result = new regexp.constructor(regexp.source, reFlags.exec(regexp)); result.lastIndex = regexp.lastIndex; return result; } /** * Creates a clone of `set`. * * @private * @param {Object} set The set to clone. * @param {Function} cloneFunc The function to clone values. * @param {boolean} [isDeep] Specify a deep clone. * @returns {Object} Returns the cloned set. */ function cloneSet(set, isDeep, cloneFunc) { var array = isDeep ? cloneFunc(setToArray(set), true) : setToArray(set); return arrayReduce(array, addSetEntry, new set.constructor); } /** * Creates a clone of the `symbol` object. * * @private * @param {Object} symbol The symbol object to clone. * @returns {Object} Returns the cloned symbol object. */ function cloneSymbol(symbol) { return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {}; } /** * Creates a clone of `typedArray`. * * @private * @param {Object} typedArray The typed array to clone. * @param {boolean} [isDeep] Specify a deep clone. * @returns {Object} Returns the cloned typed array. */ function cloneTypedArray(typedArray, isDeep) { var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer; return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length); } /** * Creates an array that is the composition of partially applied arguments, * placeholders, and provided arguments into a single array of arguments. * * @private * @param {Array|Object} args The provided arguments. * @param {Array} partials The arguments to prepend to those provided. * @param {Array} holders The `partials` placeholder indexes. * @params {boolean} [isCurried] Specify composing for a curried function. * @returns {Array} Returns the new array of composed arguments. */ function composeArgs(args, partials, holders, isCurried) { var argsIndex = -1, argsLength = args.length, holdersLength = holders.length, leftIndex = -1, leftLength = partials.length, rangeLength = nativeMax(argsLength - holdersLength, 0), result = Array(leftLength + rangeLength), isUncurried = !isCurried; while (++leftIndex < leftLength) { result[leftIndex] = partials[leftIndex]; } while (++argsIndex < holdersLength) { if (isUncurried || argsIndex < argsLength) { result[holders[argsIndex]] = args[argsIndex]; } } while (rangeLength--) { result[leftIndex++] = args[argsIndex++]; } return result; } /** * This function is like `composeArgs` except that the arguments composition * is tailored for `_.partialRight`. * * @private * @param {Array|Object} args The provided arguments. * @param {Array} partials The arguments to append to those provided. * @param {Array} holders The `partials` placeholder indexes. * @params {boolean} [isCurried] Specify composing for a curried function. * @returns {Array} Returns the new array of composed arguments. */ function composeArgsRight(args, partials, holders, isCurried) { var argsIndex = -1, argsLength = args.length, holdersIndex = -1, holdersLength = holders.length, rightIndex = -1, rightLength = partials.length, rangeLength = nativeMax(argsLength - holdersLength, 0), result = Array(rangeLength + rightLength), isUncurried = !isCurried; while (++argsIndex < rangeLength) { result[argsIndex] = args[argsIndex]; } var offset = argsIndex; while (++rightIndex < rightLength) { result[offset + rightIndex] = partials[rightIndex]; } while (++holdersIndex < holdersLength) { if (isUncurried || argsIndex < argsLength) { result[offset + holders[holdersIndex]] = args[argsIndex++]; } } return result; } /** * Copies the values of `source` to `array`. * * @private * @param {Array} source The array to copy values from. * @param {Array} [array=[]] The array to copy values to. * @returns {Array} Returns `array`. */ function copyArray(source, array) { var index = -1, length = source.length; array || (array = Array(length)); while (++index < length) { array[index] = source[index]; } return array; } /** * Copies properties of `source` to `object`. * * @private * @param {Object} source The object to copy properties from. * @param {Array} props The property identifiers to copy. * @param {Object} [object={}] The object to copy properties to. * @param {Function} [customizer] The function to customize copied values. * @returns {Object} Returns `object`. */ function copyObject(source, props, object, customizer) { object || (object = {}); var index = -1, length = props.length; while (++index < length) { var key = props[index]; var newValue = customizer ? customizer(object[key], source[key], key, object, source) : source[key]; assignValue(object, key, newValue); } return object; } /** * Copies own symbol properties of `source` to `object`. * * @private * @param {Object} source The object to copy symbols from. * @param {Object} [object={}] The object to copy symbols to. * @returns {Object} Returns `object`. */ function copySymbols(source, object) { return copyObject(source, getSymbols(source), object); } /** * Creates a function like `_.groupBy`. * * @private * @param {Function} setter The function to set accumulator values. * @param {Function} [initializer] The accumulator object initializer. * @returns {Function} Returns the new aggregator function. */ function createAggregator(setter, initializer) { return function(collection, iteratee) { var func = isArray(collection) ? arrayAggregator : baseAggregator, accumulator = initializer ? initializer() : {}; return func(collection, setter, getIteratee(iteratee), accumulator); }; } /** * Creates a function like `_.assign`. * * @private * @param {Function} assigner The function to assign values. * @returns {Function} Returns the new assigner function. */ function createAssigner(assigner) { return rest(function(object, sources) { var index = -1, length = sources.length, customizer = length > 1 ? sources[length - 1] : undefined, guard = length > 2 ? sources[2] : undefined; customizer = typeof customizer == 'function' ? (length--, customizer) : undefined; if (guard && isIterateeCall(sources[0], sources[1], guard)) { customizer = length < 3 ? undefined : customizer; length = 1; } object = Object(object); while (++index < length) { var source = sources[index]; if (source) { assigner(object, source, index, customizer); } } return object; }); } /** * Creates a `baseEach` or `baseEachRight` function. * * @private * @param {Function} eachFunc The function to iterate over a collection. * @param {boolean} [fromRight] Specify iterating from right to left. * @returns {Function} Returns the new base function. */ function createBaseEach(eachFunc, fromRight) { return function(collection, iteratee) { if (collection == null) { return collection; } if (!isArrayLike(collection)) { return eachFunc(collection, iteratee); } var length = collection.length, index = fromRight ? length : -1, iterable = Object(collection); while ((fromRight ? index-- : ++index < length)) { if (iteratee(iterable[index], index, iterable) === false) { break; } } return collection; }; } /** * Creates a base function for methods like `_.forIn` and `_.forOwn`. * * @private * @param {boolean} [fromRight] Specify iterating from right to left. * @returns {Function} Returns the new base function. */ function createBaseFor(fromRight) { return function(object, iteratee, keysFunc) { var index = -1, iterable = Object(object), props = keysFunc(object), length = props.length; while (length--) { var key = props[fromRight ? length : ++index]; if (iteratee(iterable[key], key, iterable) === false) { break; } } return object; }; } /** * Creates a function that wraps `func` to invoke it with the optional `this` * binding of `thisArg`. * * @private * @param {Function} func The function to wrap. * @param {number} bitmask The bitmask of wrapper flags. See `createWrapper` * for more details. * @param {*} [thisArg] The `this` binding of `func`. * @returns {Function} Returns the new wrapped function. */ function createBaseWrapper(func, bitmask, thisArg) { var isBind = bitmask & BIND_FLAG, Ctor = createCtorWrapper(func); function wrapper() { var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func; return fn.apply(isBind ? thisArg : this, arguments); } return wrapper; } /** * Creates a function like `_.lowerFirst`. * * @private * @param {string} methodName The name of the `String` case method to use. * @returns {Function} Returns the new function. */ function createCaseFirst(methodName) { return function(string) { string = toString(string); var strSymbols = reHasComplexSymbol.test(string) ? stringToArray(string) : undefined; var chr = strSymbols ? strSymbols[0] : string.charAt(0); var trailing = strSymbols ? castSlice(strSymbols, 1).join('') : string.slice(1); return chr[methodName]() + trailing; }; } /** * Creates a function like `_.camelCase`. * * @private * @param {Function} callback The function to combine each word. * @returns {Function} Returns the new compounder function. */ function createCompounder(callback) { return function(string) { return arrayReduce(words(deburr(string).replace(reApos, '')), callback, ''); }; } /** * Creates a function that produces an instance of `Ctor` regardless of * whether it was invoked as part of a `new` expression or by `call` or `apply`. * * @private * @param {Function} Ctor The constructor to wrap. * @returns {Function} Returns the new wrapped function. */ function createCtorWrapper(Ctor) { return function() { // Use a `switch` statement to work with class constructors. See // http://ecma-international.org/ecma-262/6.0/#sec-ecmascript-function-objects-call-thisargument-argumentslist // for more details. var args = arguments; switch (args.length) { case 0: return new Ctor; case 1: return new Ctor(args[0]); case 2: return new Ctor(args[0], args[1]); case 3: return new Ctor(args[0], args[1], args[2]); case 4: return new Ctor(args[0], args[1], args[2], args[3]); case 5: return new Ctor(args[0], args[1], args[2], args[3], args[4]); case 6: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5]); case 7: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5], args[6]); } var thisBinding = baseCreate(Ctor.prototype), result = Ctor.apply(thisBinding, args); // Mimic the constructor's `return` behavior. // See https://es5.github.io/#x13.2.2 for more details. return isObject(result) ? result : thisBinding; }; } /** * Creates a function that wraps `func` to enable currying. * * @private * @param {Function} func The function to wrap. * @param {number} bitmask The bitmask of wrapper flags. See `createWrapper` * for more details. * @param {number} arity The arity of `func`. * @returns {Function} Returns the new wrapped function. */ function createCurryWrapper(func, bitmask, arity) { var Ctor = createCtorWrapper(func); function wrapper() { var length = arguments.length, args = Array(length), index = length, placeholder = getPlaceholder(wrapper); while (index--) { args[index] = arguments[index]; } var holders = (length < 3 && args[0] !== placeholder && args[length - 1] !== placeholder) ? [] : replaceHolders(args, placeholder); length -= holders.length; if (length < arity) { return createRecurryWrapper( func, bitmask, createHybridWrapper, wrapper.placeholder, undefined, args, holders, undefined, undefined, arity - length); } var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func; return apply(fn, this, args); } return wrapper; } /** * Creates a `_.flow` or `_.flowRight` function. * * @private * @param {boolean} [fromRight] Specify iterating from right to left. * @returns {Function} Returns the new flow function. */ function createFlow(fromRight) { return rest(function(funcs) { funcs = baseFlatten(funcs, 1); var length = funcs.length, index = length, prereq = LodashWrapper.prototype.thru; if (fromRight) { funcs.reverse(); } while (index--) { var func = funcs[index]; if (typeof func != 'function') { throw new TypeError(FUNC_ERROR_TEXT); } if (prereq && !wrapper && getFuncName(func) == 'wrapper') { var wrapper = new LodashWrapper([], true); } } index = wrapper ? index : length; while (++index < length) { func = funcs[index]; var funcName = getFuncName(func), data = funcName == 'wrapper' ? getData(func) : undefined; if (data && isLaziable(data[0]) && data[1] == (ARY_FLAG | CURRY_FLAG | PARTIAL_FLAG | REARG_FLAG) && !data[4].length && data[9] == 1 ) { wrapper = wrapper[getFuncName(data[0])].apply(wrapper, data[3]); } else { wrapper = (func.length == 1 && isLaziable(func)) ? wrapper[funcName]() : wrapper.thru(func); } } return function() { var args = arguments, value = args[0]; if (wrapper && args.length == 1 && isArray(value) && value.length >= LARGE_ARRAY_SIZE) { return wrapper.plant(value).value(); } var index = 0, result = length ? funcs[index].apply(this, args) : value; while (++index < length) { result = funcs[index].call(this, result); } return result; }; }); } /** * Creates a function that wraps `func` to invoke it with optional `this` * binding of `thisArg`, partial application, and currying. * * @private * @param {Function|string} func The function or method name to wrap. * @param {number} bitmask The bitmask of wrapper flags. See `createWrapper` * for more details. * @param {*} [thisArg] The `this` binding of `func`. * @param {Array} [partials] The arguments to prepend to those provided to * the new function. * @param {Array} [holders] The `partials` placeholder indexes. * @param {Array} [partialsRight] The arguments to append to those provided * to the new function. * @param {Array} [holdersRight] The `partialsRight` placeholder indexes. * @param {Array} [argPos] The argument positions of the new function. * @param {number} [ary] The arity cap of `func`. * @param {number} [arity] The arity of `func`. * @returns {Function} Returns the new wrapped function. */ function createHybridWrapper(func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary, arity) { var isAry = bitmask & ARY_FLAG, isBind = bitmask & BIND_FLAG, isBindKey = bitmask & BIND_KEY_FLAG, isCurried = bitmask & (CURRY_FLAG | CURRY_RIGHT_FLAG), isFlip = bitmask & FLIP_FLAG, Ctor = isBindKey ? undefined : createCtorWrapper(func); function wrapper() { var length = arguments.length, index = length, args = Array(length); while (index--) { args[index] = arguments[index]; } if (isCurried) { var placeholder = getPlaceholder(wrapper), holdersCount = countHolders(args, placeholder); } if (partials) { args = composeArgs(args, partials, holders, isCurried); } if (partialsRight) { args = composeArgsRight(args, partialsRight, holdersRight, isCurried); } length -= holdersCount; if (isCurried && length < arity) { var newHolders = replaceHolders(args, placeholder); return createRecurryWrapper( func, bitmask, createHybridWrapper, wrapper.placeholder, thisArg, args, newHolders, argPos, ary, arity - length ); } var thisBinding = isBind ? thisArg : this, fn = isBindKey ? thisBinding[func] : func; length = args.length; if (argPos) { args = reorder(args, argPos); } else if (isFlip && length > 1) { args.reverse(); } if (isAry && ary < length) { args.length = ary; } if (this && this !== root && this instanceof wrapper) { fn = Ctor || createCtorWrapper(fn); } return fn.apply(thisBinding, args); } return wrapper; } /** * Creates a function like `_.invertBy`. * * @private * @param {Function} setter The function to set accumulator values. * @param {Function} toIteratee The function to resolve iteratees. * @returns {Function} Returns the new inverter function. */ function createInverter(setter, toIteratee) { return function(object, iteratee) { return baseInverter(object, setter, toIteratee(iteratee), {}); }; } /** * Creates a function like `_.over`. * * @private * @param {Function} arrayFunc The function to iterate over iteratees. * @returns {Function} Returns the new invoker function. */ function createOver(arrayFunc) { return rest(function(iteratees) { iteratees = (iteratees.length == 1 && isArray(iteratees[0])) ? arrayMap(iteratees[0], baseUnary(getIteratee())) : arrayMap(baseFlatten(iteratees, 1, isFlattenableIteratee), baseUnary(getIteratee())); return rest(function(args) { var thisArg = this; return arrayFunc(iteratees, function(iteratee) { return apply(iteratee, thisArg, args); }); }); }); } /** * Creates the padding for `string` based on `length`. The `chars` string * is truncated if the number of characters exceeds `length`. * * @private * @param {number} length The padding length. * @param {string} [chars=' '] The string used as padding. * @returns {string} Returns the padding for `string`. */ function createPadding(length, chars) { chars = chars === undefined ? ' ' : (chars + ''); var charsLength = chars.length; if (charsLength < 2) { return charsLength ? baseRepeat(chars, length) : chars; } var result = baseRepeat(chars, nativeCeil(length / stringSize(chars))); return reHasComplexSymbol.test(chars) ? castSlice(stringToArray(result), 0, length).join('') : result.slice(0, length); } /** * Creates a function that wraps `func` to invoke it with the `this` binding * of `thisArg` and `partials` prepended to the arguments it receives. * * @private * @param {Function} func The function to wrap. * @param {number} bitmask The bitmask of wrapper flags. See `createWrapper` * for more details. * @param {*} thisArg The `this` binding of `func`. * @param {Array} partials The arguments to prepend to those provided to * the new function. * @returns {Function} Returns the new wrapped function. */ function createPartialWrapper(func, bitmask, thisArg, partials) { var isBind = bitmask & BIND_FLAG, Ctor = createCtorWrapper(func); function wrapper() { var argsIndex = -1, argsLength = arguments.length, leftIndex = -1, leftLength = partials.length, args = Array(leftLength + argsLength), fn = (this && this !== root && this instanceof wrapper) ? Ctor : func; while (++leftIndex < leftLength) { args[leftIndex] = partials[leftIndex]; } while (argsLength--) { args[leftIndex++] = arguments[++argsIndex]; } return apply(fn, isBind ? thisArg : this, args); } return wrapper; } /** * Creates a `_.range` or `_.rangeRight` function. * * @private * @param {boolean} [fromRight] Specify iterating from right to left. * @returns {Function} Returns the new range function. */ function createRange(fromRight) { return function(start, end, step) { if (step && typeof step != 'number' && isIterateeCall(start, end, step)) { end = step = undefined; } // Ensure the sign of `-0` is preserved. start = toNumber(start); start = start === start ? start : 0; if (end === undefined) { end = start; start = 0; } else { end = toNumber(end) || 0; } step = step === undefined ? (start < end ? 1 : -1) : (toNumber(step) || 0); return baseRange(start, end, step, fromRight); }; } /** * Creates a function that wraps `func` to continue currying. * * @private * @param {Function} func The function to wrap. * @param {number} bitmask The bitmask of wrapper flags. See `createWrapper` * for more details. * @param {Function} wrapFunc The function to create the `func` wrapper. * @param {*} placeholder The placeholder value. * @param {*} [thisArg] The `this` binding of `func`. * @param {Array} [partials] The arguments to prepend to those provided to * the new function. * @param {Array} [holders] The `partials` placeholder indexes. * @param {Array} [argPos] The argument positions of the new function. * @param {number} [ary] The arity cap of `func`. * @param {number} [arity] The arity of `func`. * @returns {Function} Returns the new wrapped function. */ function createRecurryWrapper(func, bitmask, wrapFunc, placeholder, thisArg, partials, holders, argPos, ary, arity) { var isCurry = bitmask & CURRY_FLAG, newHolders = isCurry ? holders : undefined, newHoldersRight = isCurry ? undefined : holders, newPartials = isCurry ? partials : undefined, newPartialsRight = isCurry ? undefined : partials; bitmask |= (isCurry ? PARTIAL_FLAG : PARTIAL_RIGHT_FLAG); bitmask &= ~(isCurry ? PARTIAL_RIGHT_FLAG : PARTIAL_FLAG); if (!(bitmask & CURRY_BOUND_FLAG)) { bitmask &= ~(BIND_FLAG | BIND_KEY_FLAG); } var newData = [ func, bitmask, thisArg, newPartials, newHolders, newPartialsRight, newHoldersRight, argPos, ary, arity ]; var result = wrapFunc.apply(undefined, newData); if (isLaziable(func)) { setData(result, newData); } result.placeholder = placeholder; return result; } /** * Creates a function like `_.round`. * * @private * @param {string} methodName The name of the `Math` method to use when rounding. * @returns {Function} Returns the new round function. */ function createRound(methodName) { var func = Math[methodName]; return function(number, precision) { number = toNumber(number); precision = toInteger(precision); if (precision) { // Shift with exponential notation to avoid floating-point issues. // See [MDN](https://mdn.io/round#Examples) for more details. var pair = (toString(number) + 'e').split('e'), value = func(pair[0] + 'e' + (+pair[1] + precision)); pair = (toString(value) + 'e').split('e'); return +(pair[0] + 'e' + (+pair[1] - precision)); } return func(number); }; } /** * Creates a set of `values`. * * @private * @param {Array} values The values to add to the set. * @returns {Object} Returns the new set. */ var createSet = !(Set && new Set([1, 2]).size === 2) ? noop : function(values) { return new Set(values); }; /** * Creates a function that either curries or invokes `func` with optional * `this` binding and partially applied arguments. * * @private * @param {Function|string} func The function or method name to wrap. * @param {number} bitmask The bitmask of wrapper flags. * The bitmask may be composed of the following flags: * 1 - `_.bind` * 2 - `_.bindKey` * 4 - `_.curry` or `_.curryRight` of a bound function * 8 - `_.curry` * 16 - `_.curryRight` * 32 - `_.partial` * 64 - `_.partialRight` * 128 - `_.rearg` * 256 - `_.ary` * @param {*} [thisArg] The `this` binding of `func`. * @param {Array} [partials] The arguments to be partially applied. * @param {Array} [holders] The `partials` placeholder indexes. * @param {Array} [argPos] The argument positions of the new function. * @param {number} [ary] The arity cap of `func`. * @param {number} [arity] The arity of `func`. * @returns {Function} Returns the new wrapped function. */ function createWrapper(func, bitmask, thisArg, partials, holders, argPos, ary, arity) { var isBindKey = bitmask & BIND_KEY_FLAG; if (!isBindKey && typeof func != 'function') { throw new TypeError(FUNC_ERROR_TEXT); } var length = partials ? partials.length : 0; if (!length) { bitmask &= ~(PARTIAL_FLAG | PARTIAL_RIGHT_FLAG); partials = holders = undefined; } ary = ary === undefined ? ary : nativeMax(toInteger(ary), 0); arity = arity === undefined ? arity : toInteger(arity); length -= holders ? holders.length : 0; if (bitmask & PARTIAL_RIGHT_FLAG) { var partialsRight = partials, holdersRight = holders; partials = holders = undefined; } var data = isBindKey ? undefined : getData(func); var newData = [ func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary, arity ]; if (data) { mergeData(newData, data); } func = newData[0]; bitmask = newData[1]; thisArg = newData[2]; partials = newData[3]; holders = newData[4]; arity = newData[9] = newData[9] == null ? (isBindKey ? 0 : func.length) : nativeMax(newData[9] - length, 0); if (!arity && bitmask & (CURRY_FLAG | CURRY_RIGHT_FLAG)) { bitmask &= ~(CURRY_FLAG | CURRY_RIGHT_FLAG); } if (!bitmask || bitmask == BIND_FLAG) { var result = createBaseWrapper(func, bitmask, thisArg); } else if (bitmask == CURRY_FLAG || bitmask == CURRY_RIGHT_FLAG) { result = createCurryWrapper(func, bitmask, arity); } else if ((bitmask == PARTIAL_FLAG || bitmask == (BIND_FLAG | PARTIAL_FLAG)) && !holders.length) { result = createPartialWrapper(func, bitmask, thisArg, partials); } else { result = createHybridWrapper.apply(undefined, newData); } var setter = data ? baseSetData : setData; return setter(result, newData); } /** * A specialized version of `baseIsEqualDeep` for arrays with support for * partial deep comparisons. * * @private * @param {Array} array The array to compare. * @param {Array} other The other array to compare. * @param {Function} equalFunc The function to determine equivalents of values. * @param {Function} customizer The function to customize comparisons. * @param {number} bitmask The bitmask of comparison flags. See `baseIsEqual` * for more details. * @param {Object} stack Tracks traversed `array` and `other` objects. * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`. */ function equalArrays(array, other, equalFunc, customizer, bitmask, stack) { var index = -1, isPartial = bitmask & PARTIAL_COMPARE_FLAG, isUnordered = bitmask & UNORDERED_COMPARE_FLAG, arrLength = array.length, othLength = other.length; if (arrLength != othLength && !(isPartial && othLength > arrLength)) { return false; } // Assume cyclic values are equal. var stacked = stack.get(array); if (stacked) { return stacked == other; } var result = true; stack.set(array, other); // Ignore non-index properties. while (++index < arrLength) { var arrValue = array[index], othValue = other[index]; if (customizer) { var compared = isPartial ? customizer(othValue, arrValue, index, other, array, stack) : customizer(arrValue, othValue, index, array, other, stack); } if (compared !== undefined) { if (compared) { continue; } result = false; break; } // Recursively compare arrays (susceptible to call stack limits). if (isUnordered) { if (!arraySome(other, function(othValue) { return arrValue === othValue || equalFunc(arrValue, othValue, customizer, bitmask, stack); })) { result = false; break; } } else if (!( arrValue === othValue || equalFunc(arrValue, othValue, customizer, bitmask, stack) )) { result = false; break; } } stack['delete'](array); return result; } /** * A specialized version of `baseIsEqualDeep` for comparing objects of * the same `toStringTag`. * * **Note:** This function only supports comparing values with tags of * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`. * * @private * @param {Object} object The object to compare. * @param {Object} other The other object to compare. * @param {string} tag The `toStringTag` of the objects to compare. * @param {Function} equalFunc The function to determine equivalents of values. * @param {Function} customizer The function to customize comparisons. * @param {number} bitmask The bitmask of comparison flags. See `baseIsEqual` * for more details. * @param {Object} stack Tracks traversed `object` and `other` objects. * @returns {boolean} Returns `true` if the objects are equivalent, else `false`. */ function equalByTag(object, other, tag, equalFunc, customizer, bitmask, stack) { switch (tag) { case dataViewTag: if ((object.byteLength != other.byteLength) || (object.byteOffset != other.byteOffset)) { return false; } object = object.buffer; other = other.buffer; case arrayBufferTag: if ((object.byteLength != other.byteLength) || !equalFunc(new Uint8Array(object), new Uint8Array(other))) { return false; } return true; case boolTag: case dateTag: // Coerce dates and booleans to numbers, dates to milliseconds and // booleans to `1` or `0` treating invalid dates coerced to `NaN` as // not equal. return +object == +other; case errorTag: return object.name == other.name && object.message == other.message; case numberTag: // Treat `NaN` vs. `NaN` as equal. return (object != +object) ? other != +other : object == +other; case regexpTag: case stringTag: // Coerce regexes to strings and treat strings, primitives and objects, // as equal. See http://www.ecma-international.org/ecma-262/6.0/#sec-regexp.prototype.tostring // for more details. return object == (other + ''); case mapTag: var convert = mapToArray; case setTag: var isPartial = bitmask & PARTIAL_COMPARE_FLAG; convert || (convert = setToArray); if (object.size != other.size && !isPartial) { return false; } // Assume cyclic values are equal. var stacked = stack.get(object); if (stacked) { return stacked == other; } bitmask |= UNORDERED_COMPARE_FLAG; stack.set(object, other); // Recursively compare objects (susceptible to call stack limits). return equalArrays(convert(object), convert(other), equalFunc, customizer, bitmask, stack); case symbolTag: if (symbolValueOf) { return symbolValueOf.call(object) == symbolValueOf.call(other); } } return false; } /** * A specialized version of `baseIsEqualDeep` for objects with support for * partial deep comparisons. * * @private * @param {Object} object The object to compare. * @param {Object} other The other object to compare. * @param {Function} equalFunc The function to determine equivalents of values. * @param {Function} customizer The function to customize comparisons. * @param {number} bitmask The bitmask of comparison flags. See `baseIsEqual` * for more details. * @param {Object} stack Tracks traversed `object` and `other` objects. * @returns {boolean} Returns `true` if the objects are equivalent, else `false`. */ function equalObjects(object, other, equalFunc, customizer, bitmask, stack) { var isPartial = bitmask & PARTIAL_COMPARE_FLAG, objProps = keys(object), objLength = objProps.length, othProps = keys(other), othLength = othProps.length; if (objLength != othLength && !isPartial) { return false; } var index = objLength; while (index--) { var key = objProps[index]; if (!(isPartial ? key in other : baseHas(other, key))) { return false; } } // Assume cyclic values are equal. var stacked = stack.get(object); if (stacked) { return stacked == other; } var result = true; stack.set(object, other); var skipCtor = isPartial; while (++index < objLength) { key = objProps[index]; var objValue = object[key], othValue = other[key]; if (customizer) { var compared = isPartial ? customizer(othValue, objValue, key, other, object, stack) : customizer(objValue, othValue, key, object, other, stack); } // Recursively compare objects (susceptible to call stack limits). if (!(compared === undefined ? (objValue === othValue || equalFunc(objValue, othValue, customizer, bitmask, stack)) : compared )) { result = false; break; } skipCtor || (skipCtor = key == 'constructor'); } if (result && !skipCtor) { var objCtor = object.constructor, othCtor = other.constructor; // Non `Object` object instances with different constructors are not equal. if (objCtor != othCtor && ('constructor' in object && 'constructor' in other) && !(typeof objCtor == 'function' && objCtor instanceof objCtor && typeof othCtor == 'function' && othCtor instanceof othCtor)) { result = false; } } stack['delete'](object); return result; } /** * Creates an array of own enumerable property names and symbols of `object`. * * @private * @param {Object} object The object to query. * @returns {Array} Returns the array of property names and symbols. */ function getAllKeys(object) { return baseGetAllKeys(object, keys, getSymbols); } /** * Creates an array of own and inherited enumerable property names and * symbols of `object`. * * @private * @param {Object} object The object to query. * @returns {Array} Returns the array of property names and symbols. */ function getAllKeysIn(object) { return baseGetAllKeys(object, keysIn, getSymbolsIn); } /** * Gets metadata for `func`. * * @private * @param {Function} func The function to query. * @returns {*} Returns the metadata for `func`. */ var getData = !metaMap ? noop : function(func) { return metaMap.get(func); }; /** * Gets the name of `func`. * * @private * @param {Function} func The function to query. * @returns {string} Returns the function name. */ function getFuncName(func) { var result = (func.name + ''), array = realNames[result], length = hasOwnProperty.call(realNames, result) ? array.length : 0; while (length--) { var data = array[length], otherFunc = data.func; if (otherFunc == null || otherFunc == func) { return data.name; } } return result; } /** * Gets the appropriate "iteratee" function. If `_.iteratee` is customized, * this function returns the custom method, otherwise it returns `baseIteratee`. * If arguments are provided, the chosen function is invoked with them and * its result is returned. * * @private * @param {*} [value] The value to convert to an iteratee. * @param {number} [arity] The arity of the created iteratee. * @returns {Function} Returns the chosen function or its result. */ function getIteratee() { var result = lodash.iteratee || iteratee; result = result === iteratee ? baseIteratee : result; return arguments.length ? result(arguments[0], arguments[1]) : result; } /** * Gets the "length" property value of `object`. * * **Note:** This function is used to avoid a * [JIT bug](https://bugs.webkit.org/show_bug.cgi?id=142792) that affects * Safari on at least iOS 8.1-8.3 ARM64. * * @private * @param {Object} object The object to query. * @returns {*} Returns the "length" value. */ var getLength = baseProperty('length'); /** * Gets the property names, values, and compare flags of `object`. * * @private * @param {Object} object The object to query. * @returns {Array} Returns the match data of `object`. */ function getMatchData(object) { var result = toPairs(object), length = result.length; while (length--) { result[length][2] = isStrictComparable(result[length][1]); } return result; } /** * Gets the native function at `key` of `object`. * * @private * @param {Object} object The object to query. * @param {string} key The key of the method to get. * @returns {*} Returns the function if it's native, else `undefined`. */ function getNative(object, key) { var value = object[key]; return isNative(value) ? value : undefined; } /** * Gets the argument placeholder value for `func`. * * @private * @param {Function} func The function to inspect. * @returns {*} Returns the placeholder value. */ function getPlaceholder(func) { var object = hasOwnProperty.call(lodash, 'placeholder') ? lodash : func; return object.placeholder; } /** * Gets the `[[Prototype]]` of `value`. * * @private * @param {*} value The value to query. * @returns {null|Object} Returns the `[[Prototype]]`. */ function getPrototype(value) { return nativeGetPrototype(Object(value)); } /** * Creates an array of the own enumerable symbol properties of `object`. * * @private * @param {Object} object The object to query. * @returns {Array} Returns the array of symbols. */ function getSymbols(object) { // Coerce `object` to an object to avoid non-object errors in V8. // See https://bugs.chromium.org/p/v8/issues/detail?id=3443 for more details. return getOwnPropertySymbols(Object(object)); } // Fallback for IE < 11. if (!getOwnPropertySymbols) { getSymbols = function() { return []; }; } /** * Creates an array of the own and inherited enumerable symbol properties * of `object`. * * @private * @param {Object} object The object to query. * @returns {Array} Returns the array of symbols. */ var getSymbolsIn = !getOwnPropertySymbols ? getSymbols : function(object) { var result = []; while (object) { arrayPush(result, getSymbols(object)); object = getPrototype(object); } return result; }; /** * Gets the `toStringTag` of `value`. * * @private * @param {*} value The value to query. * @returns {string} Returns the `toStringTag`. */ function getTag(value) { return objectToString.call(value); } // Fallback for data views, maps, sets, and weak maps in IE 11, // for data views in Edge, and promises in Node.js. if ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) || (Map && getTag(new Map) != mapTag) || (Promise && getTag(Promise.resolve()) != promiseTag) || (Set && getTag(new Set) != setTag) || (WeakMap && getTag(new WeakMap) != weakMapTag)) { getTag = function(value) { var result = objectToString.call(value), Ctor = result == objectTag ? value.constructor : undefined, ctorString = Ctor ? toSource(Ctor) : undefined; if (ctorString) { switch (ctorString) { case dataViewCtorString: return dataViewTag; case mapCtorString: return mapTag; case promiseCtorString: return promiseTag; case setCtorString: return setTag; case weakMapCtorString: return weakMapTag; } } return result; }; } /** * Gets the view, applying any `transforms` to the `start` and `end` positions. * * @private * @param {number} start The start of the view. * @param {number} end The end of the view. * @param {Array} transforms The transformations to apply to the view. * @returns {Object} Returns an object containing the `start` and `end` * positions of the view. */ function getView(start, end, transforms) { var index = -1, length = transforms.length; while (++index < length) { var data = transforms[index], size = data.size; switch (data.type) { case 'drop': start += size; break; case 'dropRight': end -= size; break; case 'take': end = nativeMin(end, start + size); break; case 'takeRight': start = nativeMax(start, end - size); break; } } return { 'start': start, 'end': end }; } /** * Checks if `path` exists on `object`. * * @private * @param {Object} object The object to query. * @param {Array|string} path The path to check. * @param {Function} hasFunc The function to check properties. * @returns {boolean} Returns `true` if `path` exists, else `false`. */ function hasPath(object, path, hasFunc) { path = isKey(path, object) ? [path] : castPath(path); var result, index = -1, length = path.length; while (++index < length) { var key = path[index]; if (!(result = object != null && hasFunc(object, key))) { break; } object = object[key]; } if (result) { return result; } var length = object ? object.length : 0; return !!length && isLength(length) && isIndex(key, length) && (isArray(object) || isString(object) || isArguments(object)); } /** * Initializes an array clone. * * @private * @param {Array} array The array to clone. * @returns {Array} Returns the initialized clone. */ function initCloneArray(array) { var length = array.length, result = array.constructor(length); // Add properties assigned by `RegExp#exec`. if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) { result.index = array.index; result.input = array.input; } return result; } /** * Initializes an object clone. * * @private * @param {Object} object The object to clone. * @returns {Object} Returns the initialized clone. */ function initCloneObject(object) { return (typeof object.constructor == 'function' && !isPrototype(object)) ? baseCreate(getPrototype(object)) : {}; } /** * Initializes an object clone based on its `toStringTag`. * * **Note:** This function only supports cloning values with tags of * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`. * * @private * @param {Object} object The object to clone. * @param {string} tag The `toStringTag` of the object to clone. * @param {Function} cloneFunc The function to clone values. * @param {boolean} [isDeep] Specify a deep clone. * @returns {Object} Returns the initialized clone. */ function initCloneByTag(object, tag, cloneFunc, isDeep) { var Ctor = object.constructor; switch (tag) { case arrayBufferTag: return cloneArrayBuffer(object); case boolTag: case dateTag: return new Ctor(+object); case dataViewTag: return cloneDataView(object, isDeep); case float32Tag: case float64Tag: case int8Tag: case int16Tag: case int32Tag: case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag: return cloneTypedArray(object, isDeep); case mapTag: return cloneMap(object, isDeep, cloneFunc); case numberTag: case stringTag: return new Ctor(object); case regexpTag: return cloneRegExp(object); case setTag: return cloneSet(object, isDeep, cloneFunc); case symbolTag: return cloneSymbol(object); } } /** * Creates an array of index keys for `object` values of arrays, * `arguments` objects, and strings, otherwise `null` is returned. * * @private * @param {Object} object The object to query. * @returns {Array|null} Returns index keys, else `null`. */ function indexKeys(object) { var length = object ? object.length : undefined; if (isLength(length) && (isArray(object) || isString(object) || isArguments(object))) { return baseTimes(length, String); } return null; } /** * Checks if `value` is a flattenable `arguments` object or array. * * @private * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is flattenable, else `false`. */ function isFlattenable(value) { return isArrayLikeObject(value) && (isArray(value) || isArguments(value)); } /** * Checks if `value` is a flattenable array and not a `_.matchesProperty` * iteratee shorthand. * * @private * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is flattenable, else `false`. */ function isFlattenableIteratee(value) { return isArray(value) && !(value.length == 2 && !isFunction(value[0])); } /** * Checks if the given arguments are from an iteratee call. * * @private * @param {*} value The potential iteratee value argument. * @param {*} index The potential iteratee index or key argument. * @param {*} object The potential iteratee object argument. * @returns {boolean} Returns `true` if the arguments are from an iteratee call, * else `false`. */ function isIterateeCall(value, index, object) { if (!isObject(object)) { return false; } var type = typeof index; if (type == 'number' ? (isArrayLike(object) && isIndex(index, object.length)) : (type == 'string' && index in object) ) { return eq(object[index], value); } return false; } /** * Checks if `value` is a property name and not a property path. * * @private * @param {*} value The value to check. * @param {Object} [object] The object to query keys on. * @returns {boolean} Returns `true` if `value` is a property name, else `false`. */ function isKey(value, object) { var type = typeof value; if (type == 'number' || type == 'symbol') { return true; } return !isArray(value) && (isSymbol(value) || reIsPlainProp.test(value) || !reIsDeepProp.test(value) || (object != null && value in Object(object))); } /** * Checks if `value` is suitable for use as unique object key. * * @private * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is suitable, else `false`. */ function isKeyable(value) { var type = typeof value; return type == 'number' || type == 'boolean' || (type == 'string' && value != '__proto__') || value == null; } /** * Checks if `func` has a lazy counterpart. * * @private * @param {Function} func The function to check. * @returns {boolean} Returns `true` if `func` has a lazy counterpart, * else `false`. */ function isLaziable(func) { var funcName = getFuncName(func), other = lodash[funcName]; if (typeof other != 'function' || !(funcName in LazyWrapper.prototype)) { return false; } if (func === other) { return true; } var data = getData(other); return !!data && func === data[0]; } /** * Checks if `value` is likely a prototype object. * * @private * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a prototype, else `false`. */ function isPrototype(value) { var Ctor = value && value.constructor, proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto; return value === proto; } /** * Checks if `value` is suitable for strict equality comparisons, i.e. `===`. * * @private * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` if suitable for strict * equality comparisons, else `false`. */ function isStrictComparable(value) { return value === value && !isObject(value); } /** * A specialized version of `matchesProperty` for source values suitable * for strict equality comparisons, i.e. `===`. * * @private * @param {string} key The key of the property to get. * @param {*} srcValue The value to match. * @returns {Function} Returns the new function. */ function matchesStrictComparable(key, srcValue) { return function(object) { if (object == null) { return false; } return object[key] === srcValue && (srcValue !== undefined || (key in Object(object))); }; } /** * Merges the function metadata of `source` into `data`. * * Merging metadata reduces the number of wrappers used to invoke a function. * This is possible because methods like `_.bind`, `_.curry`, and `_.partial` * may be applied regardless of execution order. Methods like `_.ary` and * `_.rearg` modify function arguments, making the order in which they are * executed important, preventing the merging of metadata. However, we make * an exception for a safe combined case where curried functions have `_.ary` * and or `_.rearg` applied. * * @private * @param {Array} data The destination metadata. * @param {Array} source The source metadata. * @returns {Array} Returns `data`. */ function mergeData(data, source) { var bitmask = data[1], srcBitmask = source[1], newBitmask = bitmask | srcBitmask, isCommon = newBitmask < (BIND_FLAG | BIND_KEY_FLAG | ARY_FLAG); var isCombo = ((srcBitmask == ARY_FLAG) && (bitmask == CURRY_FLAG)) || ((srcBitmask == ARY_FLAG) && (bitmask == REARG_FLAG) && (data[7].length <= source[8])) || ((srcBitmask == (ARY_FLAG | REARG_FLAG)) && (source[7].length <= source[8]) && (bitmask == CURRY_FLAG)); // Exit early if metadata can't be merged. if (!(isCommon || isCombo)) { return data; } // Use source `thisArg` if available. if (srcBitmask & BIND_FLAG) { data[2] = source[2]; // Set when currying a bound function. newBitmask |= bitmask & BIND_FLAG ? 0 : CURRY_BOUND_FLAG; } // Compose partial arguments. var value = source[3]; if (value) { var partials = data[3]; data[3] = partials ? composeArgs(partials, value, source[4]) : value; data[4] = partials ? replaceHolders(data[3], PLACEHOLDER) : source[4]; } // Compose partial right arguments. value = source[5]; if (value) { partials = data[5]; data[5] = partials ? composeArgsRight(partials, value, source[6]) : value; data[6] = partials ? replaceHolders(data[5], PLACEHOLDER) : source[6]; } // Use source `argPos` if available. value = source[7]; if (value) { data[7] = value; } // Use source `ary` if it's smaller. if (srcBitmask & ARY_FLAG) { data[8] = data[8] == null ? source[8] : nativeMin(data[8], source[8]); } // Use source `arity` if one is not provided. if (data[9] == null) { data[9] = source[9]; } // Use source `func` and merge bitmasks. data[0] = source[0]; data[1] = newBitmask; return data; } /** * Used by `_.defaultsDeep` to customize its `_.merge` use. * * @private * @param {*} objValue The destination value. * @param {*} srcValue The source value. * @param {string} key The key of the property to merge. * @param {Object} object The parent object of `objValue`. * @param {Object} source The parent object of `srcValue`. * @param {Object} [stack] Tracks traversed source values and their merged * counterparts. * @returns {*} Returns the value to assign. */ function mergeDefaults(objValue, srcValue, key, object, source, stack) { if (isObject(objValue) && isObject(srcValue)) { baseMerge(objValue, srcValue, undefined, mergeDefaults, stack.set(srcValue, objValue)); } return objValue; } /** * Gets the parent value at `path` of `object`. * * @private * @param {Object} object The object to query. * @param {Array} path The path to get the parent value of. * @returns {*} Returns the parent value. */ function parent(object, path) { return path.length == 1 ? object : baseGet(object, baseSlice(path, 0, -1)); } /** * Reorder `array` according to the specified indexes where the element at * the first index is assigned as the first element, the element at * the second index is assigned as the second element, and so on. * * @private * @param {Array} array The array to reorder. * @param {Array} indexes The arranged array indexes. * @returns {Array} Returns `array`. */ function reorder(array, indexes) { var arrLength = array.length, length = nativeMin(indexes.length, arrLength), oldArray = copyArray(array); while (length--) { var index = indexes[length]; array[length] = isIndex(index, arrLength) ? oldArray[index] : undefined; } return array; } /** * Sets metadata for `func`. * * **Note:** If this function becomes hot, i.e. is invoked a lot in a short * period of time, it will trip its breaker and transition to an identity * function to avoid garbage collection pauses in V8. See * [V8 issue 2070](https://bugs.chromium.org/p/v8/issues/detail?id=2070) * for more details. * * @private * @param {Function} func The function to associate metadata with. * @param {*} data The metadata. * @returns {Function} Returns `func`. */ var setData = (function() { var count = 0, lastCalled = 0; return function(key, value) { var stamp = now(), remaining = HOT_SPAN - (stamp - lastCalled); lastCalled = stamp; if (remaining > 0) { if (++count >= HOT_COUNT) { return key; } } else { count = 0; } return baseSetData(key, value); }; }()); /** * Converts `string` to a property path array. * * @private * @param {string} string The string to convert. * @returns {Array} Returns the property path array. */ var stringToPath = memoize(function(string) { var result = []; toString(string).replace(rePropName, function(match, number, quote, string) { result.push(quote ? string.replace(reEscapeChar, '$1') : (number || match)); }); return result; }); /** * Converts `value` to a string key if it's not a string or symbol. * * @private * @param {*} value The value to inspect. * @returns {string|symbol} Returns the key. */ function toKey(key) { return (typeof key == 'string' || isSymbol(key)) ? key : (key + ''); } /** * Converts `func` to its source code. * * @private * @param {Function} func The function to process. * @returns {string} Returns the source code. */ function toSource(func) { if (func != null) { try { return funcToString.call(func); } catch (e) {} try { return (func + ''); } catch (e) {} } return ''; } /** * Creates a clone of `wrapper`. * * @private * @param {Object} wrapper The wrapper to clone. * @returns {Object} Returns the cloned wrapper. */ function wrapperClone(wrapper) { if (wrapper instanceof LazyWrapper) { return wrapper.clone(); } var result = new LodashWrapper(wrapper.__wrapped__, wrapper.__chain__); result.__actions__ = copyArray(wrapper.__actions__); result.__index__ = wrapper.__index__; result.__values__ = wrapper.__values__; return result; } /*------------------------------------------------------------------------*/ /** * Creates an array of elements split into groups the length of `size`. * If `array` can't be split evenly, the final chunk will be the remaining * elements. * * @static * @memberOf _ * @since 3.0.0 * @category Array * @param {Array} array The array to process. * @param {number} [size=1] The length of each chunk * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. * @returns {Array} Returns the new array containing chunks. * @example * * _.chunk(['a', 'b', 'c', 'd'], 2); * // => [['a', 'b'], ['c', 'd']] * * _.chunk(['a', 'b', 'c', 'd'], 3); * // => [['a', 'b', 'c'], ['d']] */ function chunk(array, size, guard) { if ((guard ? isIterateeCall(array, size, guard) : size === undefined)) { size = 1; } else { size = nativeMax(toInteger(size), 0); } var length = array ? array.length : 0; if (!length || size < 1) { return []; } var index = 0, resIndex = 0, result = Array(nativeCeil(length / size)); while (index < length) { result[resIndex++] = baseSlice(array, index, (index += size)); } return result; } /** * Creates an array with all falsey values removed. The values `false`, `null`, * `0`, `""`, `undefined`, and `NaN` are falsey. * * @static * @memberOf _ * @since 0.1.0 * @category Array * @param {Array} array The array to compact. * @returns {Array} Returns the new array of filtered values. * @example * * _.compact([0, 1, false, 2, '', 3]); * // => [1, 2, 3] */ function compact(array) { var index = -1, length = array ? array.length : 0, resIndex = 0, result = []; while (++index < length) { var value = array[index]; if (value) { result[resIndex++] = value; } } return result; } /** * Creates a new array concatenating `array` with any additional arrays * and/or values. * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} array The array to concatenate. * @param {...*} [values] The values to concatenate. * @returns {Array} Returns the new concatenated array. * @example * * var array = [1]; * var other = _.concat(array, 2, [3], [[4]]); * * console.log(other); * // => [1, 2, 3, [4]] * * console.log(array); * // => [1] */ function concat() { var length = arguments.length, array = castArray(arguments[0]); if (length < 2) { return length ? copyArray(array) : []; } var args = Array(length - 1); while (length--) { args[length - 1] = arguments[length]; } return arrayConcat(array, baseFlatten(args, 1)); } /** * Creates an array of unique `array` values not included in the other given * arrays using [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero) * for equality comparisons. The order of result values is determined by the * order they occur in the first array. * * @static * @memberOf _ * @since 0.1.0 * @category Array * @param {Array} array The array to inspect. * @param {...Array} [values] The values to exclude. * @returns {Array} Returns the new array of filtered values. * @example * * _.difference([3, 2, 1], [4, 2]); * // => [3, 1] */ var difference = rest(function(array, values) { return isArrayLikeObject(array) ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true)) : []; }); /** * This method is like `_.difference` except that it accepts `iteratee` which * is invoked for each element of `array` and `values` to generate the criterion * by which they're compared. Result values are chosen from the first array. * The iteratee is invoked with one argument: (value). * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} array The array to inspect. * @param {...Array} [values] The values to exclude. * @param {Array|Function|Object|string} [iteratee=_.identity] * The iteratee invoked per element. * @returns {Array} Returns the new array of filtered values. * @example * * _.differenceBy([3.1, 2.2, 1.3], [4.4, 2.5], Math.floor); * // => [3.1, 1.3] * * // The `_.property` iteratee shorthand. * _.differenceBy([{ 'x': 2 }, { 'x': 1 }], [{ 'x': 1 }], 'x'); * // => [{ 'x': 2 }] */ var differenceBy = rest(function(array, values) { var iteratee = last(values); if (isArrayLikeObject(iteratee)) { iteratee = undefined; } return isArrayLikeObject(array) ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), getIteratee(iteratee)) : []; }); /** * This method is like `_.difference` except that it accepts `comparator` * which is invoked to compare elements of `array` to `values`. Result values * are chosen from the first array. The comparator is invoked with two arguments: * (arrVal, othVal). * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} array The array to inspect. * @param {...Array} [values] The values to exclude. * @param {Function} [comparator] The comparator invoked per element. * @returns {Array} Returns the new array of filtered values. * @example * * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]; * * _.differenceWith(objects, [{ 'x': 1, 'y': 2 }], _.isEqual); * // => [{ 'x': 2, 'y': 1 }] */ var differenceWith = rest(function(array, values) { var comparator = last(values); if (isArrayLikeObject(comparator)) { comparator = undefined; } return isArrayLikeObject(array) ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), undefined, comparator) : []; }); /** * Creates a slice of `array` with `n` elements dropped from the beginning. * * @static * @memberOf _ * @since 0.5.0 * @category Array * @param {Array} array The array to query. * @param {number} [n=1] The number of elements to drop. * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. * @returns {Array} Returns the slice of `array`. * @example * * _.drop([1, 2, 3]); * // => [2, 3] * * _.drop([1, 2, 3], 2); * // => [3] * * _.drop([1, 2, 3], 5); * // => [] * * _.drop([1, 2, 3], 0); * // => [1, 2, 3] */ function drop(array, n, guard) { var length = array ? array.length : 0; if (!length) { return []; } n = (guard || n === undefined) ? 1 : toInteger(n); return baseSlice(array, n < 0 ? 0 : n, length); } /** * Creates a slice of `array` with `n` elements dropped from the end. * * @static * @memberOf _ * @since 3.0.0 * @category Array * @param {Array} array The array to query. * @param {number} [n=1] The number of elements to drop. * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. * @returns {Array} Returns the slice of `array`. * @example * * _.dropRight([1, 2, 3]); * // => [1, 2] * * _.dropRight([1, 2, 3], 2); * // => [1] * * _.dropRight([1, 2, 3], 5); * // => [] * * _.dropRight([1, 2, 3], 0); * // => [1, 2, 3] */ function dropRight(array, n, guard) { var length = array ? array.length : 0; if (!length) { return []; } n = (guard || n === undefined) ? 1 : toInteger(n); n = length - n; return baseSlice(array, 0, n < 0 ? 0 : n); } /** * Creates a slice of `array` excluding elements dropped from the end. * Elements are dropped until `predicate` returns falsey. The predicate is * invoked with three arguments: (value, index, array). * * @static * @memberOf _ * @since 3.0.0 * @category Array * @param {Array} array The array to query. * @param {Array|Function|Object|string} [predicate=_.identity] * The function invoked per iteration. * @returns {Array} Returns the slice of `array`. * @example * * var users = [ * { 'user': 'barney', 'active': true }, * { 'user': 'fred', 'active': false }, * { 'user': 'pebbles', 'active': false } * ]; * * _.dropRightWhile(users, function(o) { return !o.active; }); * // => objects for ['barney'] * * // The `_.matches` iteratee shorthand. * _.dropRightWhile(users, { 'user': 'pebbles', 'active': false }); * // => objects for ['barney', 'fred'] * * // The `_.matchesProperty` iteratee shorthand. * _.dropRightWhile(users, ['active', false]); * // => objects for ['barney'] * * // The `_.property` iteratee shorthand. * _.dropRightWhile(users, 'active'); * // => objects for ['barney', 'fred', 'pebbles'] */ function dropRightWhile(array, predicate) { return (array && array.length) ? baseWhile(array, getIteratee(predicate, 3), true, true) : []; } /** * Creates a slice of `array` excluding elements dropped from the beginning. * Elements are dropped until `predicate` returns falsey. The predicate is * invoked with three arguments: (value, index, array). * * @static * @memberOf _ * @since 3.0.0 * @category Array * @param {Array} array The array to query. * @param {Array|Function|Object|string} [predicate=_.identity] * The function invoked per iteration. * @returns {Array} Returns the slice of `array`. * @example * * var users = [ * { 'user': 'barney', 'active': false }, * { 'user': 'fred', 'active': false }, * { 'user': 'pebbles', 'active': true } * ]; * * _.dropWhile(users, function(o) { return !o.active; }); * // => objects for ['pebbles'] * * // The `_.matches` iteratee shorthand. * _.dropWhile(users, { 'user': 'barney', 'active': false }); * // => objects for ['fred', 'pebbles'] * * // The `_.matchesProperty` iteratee shorthand. * _.dropWhile(users, ['active', false]); * // => objects for ['pebbles'] * * // The `_.property` iteratee shorthand. * _.dropWhile(users, 'active'); * // => objects for ['barney', 'fred', 'pebbles'] */ function dropWhile(array, predicate) { return (array && array.length) ? baseWhile(array, getIteratee(predicate, 3), true) : []; } /** * Fills elements of `array` with `value` from `start` up to, but not * including, `end`. * * **Note:** This method mutates `array`. * * @static * @memberOf _ * @since 3.2.0 * @category Array * @param {Array} array The array to fill. * @param {*} value The value to fill `array` with. * @param {number} [start=0] The start position. * @param {number} [end=array.length] The end position. * @returns {Array} Returns `array`. * @example * * var array = [1, 2, 3]; * * _.fill(array, 'a'); * console.log(array); * // => ['a', 'a', 'a'] * * _.fill(Array(3), 2); * // => [2, 2, 2] * * _.fill([4, 6, 8, 10], '*', 1, 3); * // => [4, '*', '*', 10] */ function fill(array, value, start, end) { var length = array ? array.length : 0; if (!length) { return []; } if (start && typeof start != 'number' && isIterateeCall(array, value, start)) { start = 0; end = length; } return baseFill(array, value, start, end); } /** * This method is like `_.find` except that it returns the index of the first * element `predicate` returns truthy for instead of the element itself. * * @static * @memberOf _ * @since 1.1.0 * @category Array * @param {Array} array The array to search. * @param {Array|Function|Object|string} [predicate=_.identity] * The function invoked per iteration. * @returns {number} Returns the index of the found element, else `-1`. * @example * * var users = [ * { 'user': 'barney', 'active': false }, * { 'user': 'fred', 'active': false }, * { 'user': 'pebbles', 'active': true } * ]; * * _.findIndex(users, function(o) { return o.user == 'barney'; }); * // => 0 * * // The `_.matches` iteratee shorthand. * _.findIndex(users, { 'user': 'fred', 'active': false }); * // => 1 * * // The `_.matchesProperty` iteratee shorthand. * _.findIndex(users, ['active', false]); * // => 0 * * // The `_.property` iteratee shorthand. * _.findIndex(users, 'active'); * // => 2 */ function findIndex(array, predicate) { return (array && array.length) ? baseFindIndex(array, getIteratee(predicate, 3)) : -1; } /** * This method is like `_.findIndex` except that it iterates over elements * of `collection` from right to left. * * @static * @memberOf _ * @since 2.0.0 * @category Array * @param {Array} array The array to search. * @param {Array|Function|Object|string} [predicate=_.identity] * The function invoked per iteration. * @returns {number} Returns the index of the found element, else `-1`. * @example * * var users = [ * { 'user': 'barney', 'active': true }, * { 'user': 'fred', 'active': false }, * { 'user': 'pebbles', 'active': false } * ]; * * _.findLastIndex(users, function(o) { return o.user == 'pebbles'; }); * // => 2 * * // The `_.matches` iteratee shorthand. * _.findLastIndex(users, { 'user': 'barney', 'active': true }); * // => 0 * * // The `_.matchesProperty` iteratee shorthand. * _.findLastIndex(users, ['active', false]); * // => 2 * * // The `_.property` iteratee shorthand. * _.findLastIndex(users, 'active'); * // => 0 */ function findLastIndex(array, predicate) { return (array && array.length) ? baseFindIndex(array, getIteratee(predicate, 3), true) : -1; } /** * Flattens `array` a single level deep. * * @static * @memberOf _ * @since 0.1.0 * @category Array * @param {Array} array The array to flatten. * @returns {Array} Returns the new flattened array. * @example * * _.flatten([1, [2, [3, [4]], 5]]); * // => [1, 2, [3, [4]], 5] */ function flatten(array) { var length = array ? array.length : 0; return length ? baseFlatten(array, 1) : []; } /** * Recursively flattens `array`. * * @static * @memberOf _ * @since 3.0.0 * @category Array * @param {Array} array The array to flatten. * @returns {Array} Returns the new flattened array. * @example * * _.flattenDeep([1, [2, [3, [4]], 5]]); * // => [1, 2, 3, 4, 5] */ function flattenDeep(array) { var length = array ? array.length : 0; return length ? baseFlatten(array, INFINITY) : []; } /** * Recursively flatten `array` up to `depth` times. * * @static * @memberOf _ * @since 4.4.0 * @category Array * @param {Array} array The array to flatten. * @param {number} [depth=1] The maximum recursion depth. * @returns {Array} Returns the new flattened array. * @example * * var array = [1, [2, [3, [4]], 5]]; * * _.flattenDepth(array, 1); * // => [1, 2, [3, [4]], 5] * * _.flattenDepth(array, 2); * // => [1, 2, 3, [4], 5] */ function flattenDepth(array, depth) { var length = array ? array.length : 0; if (!length) { return []; } depth = depth === undefined ? 1 : toInteger(depth); return baseFlatten(array, depth); } /** * The inverse of `_.toPairs`; this method returns an object composed * from key-value `pairs`. * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} pairs The key-value pairs. * @returns {Object} Returns the new object. * @example * * _.fromPairs([['fred', 30], ['barney', 40]]); * // => { 'fred': 30, 'barney': 40 } */ function fromPairs(pairs) { var index = -1, length = pairs ? pairs.length : 0, result = {}; while (++index < length) { var pair = pairs[index]; result[pair[0]] = pair[1]; } return result; } /** * Gets the first element of `array`. * * @static * @memberOf _ * @since 0.1.0 * @alias first * @category Array * @param {Array} array The array to query. * @returns {*} Returns the first element of `array`. * @example * * _.head([1, 2, 3]); * // => 1 * * _.head([]); * // => undefined */ function head(array) { return (array && array.length) ? array[0] : undefined; } /** * Gets the index at which the first occurrence of `value` is found in `array` * using [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero) * for equality comparisons. If `fromIndex` is negative, it's used as the * offset from the end of `array`. * * @static * @memberOf _ * @since 0.1.0 * @category Array * @param {Array} array The array to search. * @param {*} value The value to search for. * @param {number} [fromIndex=0] The index to search from. * @returns {number} Returns the index of the matched value, else `-1`. * @example * * _.indexOf([1, 2, 1, 2], 2); * // => 1 * * // Search from the `fromIndex`. * _.indexOf([1, 2, 1, 2], 2, 2); * // => 3 */ function indexOf(array, value, fromIndex) { var length = array ? array.length : 0; if (!length) { return -1; } fromIndex = toInteger(fromIndex); if (fromIndex < 0) { fromIndex = nativeMax(length + fromIndex, 0); } return baseIndexOf(array, value, fromIndex); } /** * Gets all but the last element of `array`. * * @static * @memberOf _ * @since 0.1.0 * @category Array * @param {Array} array The array to query. * @returns {Array} Returns the slice of `array`. * @example * * _.initial([1, 2, 3]); * // => [1, 2] */ function initial(array) { return dropRight(array, 1); } /** * Creates an array of unique values that are included in all given arrays * using [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero) * for equality comparisons. The order of result values is determined by the * order they occur in the first array. * * @static * @memberOf _ * @since 0.1.0 * @category Array * @param {...Array} [arrays] The arrays to inspect. * @returns {Array} Returns the new array of intersecting values. * @example * * _.intersection([2, 1], [4, 2], [1, 2]); * // => [2] */ var intersection = rest(function(arrays) { var mapped = arrayMap(arrays, castArrayLikeObject); return (mapped.length && mapped[0] === arrays[0]) ? baseIntersection(mapped) : []; }); /** * This method is like `_.intersection` except that it accepts `iteratee` * which is invoked for each element of each `arrays` to generate the criterion * by which they're compared. Result values are chosen from the first array. * The iteratee is invoked with one argument: (value). * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {...Array} [arrays] The arrays to inspect. * @param {Array|Function|Object|string} [iteratee=_.identity] * The iteratee invoked per element. * @returns {Array} Returns the new array of intersecting values. * @example * * _.intersectionBy([2.1, 1.2], [4.3, 2.4], Math.floor); * // => [2.1] * * // The `_.property` iteratee shorthand. * _.intersectionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x'); * // => [{ 'x': 1 }] */ var intersectionBy = rest(function(arrays) { var iteratee = last(arrays), mapped = arrayMap(arrays, castArrayLikeObject); if (iteratee === last(mapped)) { iteratee = undefined; } else { mapped.pop(); } return (mapped.length && mapped[0] === arrays[0]) ? baseIntersection(mapped, getIteratee(iteratee)) : []; }); /** * This method is like `_.intersection` except that it accepts `comparator` * which is invoked to compare elements of `arrays`. Result values are chosen * from the first array. The comparator is invoked with two arguments: * (arrVal, othVal). * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {...Array} [arrays] The arrays to inspect. * @param {Function} [comparator] The comparator invoked per element. * @returns {Array} Returns the new array of intersecting values. * @example * * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]; * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }]; * * _.intersectionWith(objects, others, _.isEqual); * // => [{ 'x': 1, 'y': 2 }] */ var intersectionWith = rest(function(arrays) { var comparator = last(arrays), mapped = arrayMap(arrays, castArrayLikeObject); if (comparator === last(mapped)) { comparator = undefined; } else { mapped.pop(); } return (mapped.length && mapped[0] === arrays[0]) ? baseIntersection(mapped, undefined, comparator) : []; }); /** * Converts all elements in `array` into a string separated by `separator`. * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} array The array to convert. * @param {string} [separator=','] The element separator. * @returns {string} Returns the joined string. * @example * * _.join(['a', 'b', 'c'], '~'); * // => 'a~b~c' */ function join(array, separator) { return array ? nativeJoin.call(array, separator) : ''; } /** * Gets the last element of `array`. * * @static * @memberOf _ * @since 0.1.0 * @category Array * @param {Array} array The array to query. * @returns {*} Returns the last element of `array`. * @example * * _.last([1, 2, 3]); * // => 3 */ function last(array) { var length = array ? array.length : 0; return length ? array[length - 1] : undefined; } /** * This method is like `_.indexOf` except that it iterates over elements of * `array` from right to left. * * @static * @memberOf _ * @since 0.1.0 * @category Array * @param {Array} array The array to search. * @param {*} value The value to search for. * @param {number} [fromIndex=array.length-1] The index to search from. * @returns {number} Returns the index of the matched value, else `-1`. * @example * * _.lastIndexOf([1, 2, 1, 2], 2); * // => 3 * * // Search from the `fromIndex`. * _.lastIndexOf([1, 2, 1, 2], 2, 2); * // => 1 */ function lastIndexOf(array, value, fromIndex) { var length = array ? array.length : 0; if (!length) { return -1; } var index = length; if (fromIndex !== undefined) { index = toInteger(fromIndex); index = ( index < 0 ? nativeMax(length + index, 0) : nativeMin(index, length - 1) ) + 1; } if (value !== value) { return indexOfNaN(array, index, true); } while (index--) { if (array[index] === value) { return index; } } return -1; } /** * Gets the nth element of `array`. If `n` is negative, the nth element * from the end is returned. * * @static * @memberOf _ * @since 4.11.0 * @category Array * @param {Array} array The array to query. * @param {number} [n=0] The index of the element to return. * @returns {*} Returns the nth element of `array`. * @example * * var array = ['a', 'b', 'c', 'd']; * * _.nth(array, 1); * // => 'b' * * _.nth(array, -2); * // => 'c'; */ function nth(array, n) { return (array && array.length) ? baseNth(array, toInteger(n)) : undefined; } /** * Removes all given values from `array` using * [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero) * for equality comparisons. * * **Note:** Unlike `_.without`, this method mutates `array`. Use `_.remove` * to remove elements from an array by predicate. * * @static * @memberOf _ * @since 2.0.0 * @category Array * @param {Array} array The array to modify. * @param {...*} [values] The values to remove. * @returns {Array} Returns `array`. * @example * * var array = [1, 2, 3, 1, 2, 3]; * * _.pull(array, 2, 3); * console.log(array); * // => [1, 1] */ var pull = rest(pullAll); /** * This method is like `_.pull` except that it accepts an array of values to remove. * * **Note:** Unlike `_.difference`, this method mutates `array`. * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} array The array to modify. * @param {Array} values The values to remove. * @returns {Array} Returns `array`. * @example * * var array = [1, 2, 3, 1, 2, 3]; * * _.pullAll(array, [2, 3]); * console.log(array); * // => [1, 1] */ function pullAll(array, values) { return (array && array.length && values && values.length) ? basePullAll(array, values) : array; } /** * This method is like `_.pullAll` except that it accepts `iteratee` which is * invoked for each element of `array` and `values` to generate the criterion * by which they're compared. The iteratee is invoked with one argument: (value). * * **Note:** Unlike `_.differenceBy`, this method mutates `array`. * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} array The array to modify. * @param {Array} values The values to remove. * @param {Array|Function|Object|string} [iteratee=_.identity] * The iteratee invoked per element. * @returns {Array} Returns `array`. * @example * * var array = [{ 'x': 1 }, { 'x': 2 }, { 'x': 3 }, { 'x': 1 }]; * * _.pullAllBy(array, [{ 'x': 1 }, { 'x': 3 }], 'x'); * console.log(array); * // => [{ 'x': 2 }] */ function pullAllBy(array, values, iteratee) { return (array && array.length && values && values.length) ? basePullAll(array, values, getIteratee(iteratee)) : array; } /** * This method is like `_.pullAll` except that it accepts `comparator` which * is invoked to compare elements of `array` to `values`. The comparator is * invoked with two arguments: (arrVal, othVal). * * **Note:** Unlike `_.differenceWith`, this method mutates `array`. * * @static * @memberOf _ * @since 4.6.0 * @category Array * @param {Array} array The array to modify. * @param {Array} values The values to remove. * @param {Function} [comparator] The comparator invoked per element. * @returns {Array} Returns `array`. * @example * * var array = [{ 'x': 1, 'y': 2 }, { 'x': 3, 'y': 4 }, { 'x': 5, 'y': 6 }]; * * _.pullAllWith(array, [{ 'x': 3, 'y': 4 }], _.isEqual); * console.log(array); * // => [{ 'x': 1, 'y': 2 }, { 'x': 5, 'y': 6 }] */ function pullAllWith(array, values, comparator) { return (array && array.length && values && values.length) ? basePullAll(array, values, undefined, comparator) : array; } /** * Removes elements from `array` corresponding to `indexes` and returns an * array of removed elements. * * **Note:** Unlike `_.at`, this method mutates `array`. * * @static * @memberOf _ * @since 3.0.0 * @category Array * @param {Array} array The array to modify. * @param {...(number|number[])} [indexes] The indexes of elements to remove. * @returns {Array} Returns the new array of removed elements. * @example * * var array = [5, 10, 15, 20]; * var evens = _.pullAt(array, 1, 3); * * console.log(array); * // => [5, 15] * * console.log(evens); * // => [10, 20] */ var pullAt = rest(function(array, indexes) { indexes = arrayMap(baseFlatten(indexes, 1), String); var result = baseAt(array, indexes); basePullAt(array, indexes.sort(compareAscending)); return result; }); /** * Removes all elements from `array` that `predicate` returns truthy for * and returns an array of the removed elements. The predicate is invoked * with three arguments: (value, index, array). * * **Note:** Unlike `_.filter`, this method mutates `array`. Use `_.pull` * to pull elements from an array by value. * * @static * @memberOf _ * @since 2.0.0 * @category Array * @param {Array} array The array to modify. * @param {Array|Function|Object|string} [predicate=_.identity] * The function invoked per iteration. * @returns {Array} Returns the new array of removed elements. * @example * * var array = [1, 2, 3, 4]; * var evens = _.remove(array, function(n) { * return n % 2 == 0; * }); * * console.log(array); * // => [1, 3] * * console.log(evens); * // => [2, 4] */ function remove(array, predicate) { var result = []; if (!(array && array.length)) { return result; } var index = -1, indexes = [], length = array.length; predicate = getIteratee(predicate, 3); while (++index < length) { var value = array[index]; if (predicate(value, index, array)) { result.push(value); indexes.push(index); } } basePullAt(array, indexes); return result; } /** * Reverses `array` so that the first element becomes the last, the second * element becomes the second to last, and so on. * * **Note:** This method mutates `array` and is based on * [`Array#reverse`](https://mdn.io/Array/reverse). * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} array The array to modify. * @returns {Array} Returns `array`. * @example * * var array = [1, 2, 3]; * * _.reverse(array); * // => [3, 2, 1] * * console.log(array); * // => [3, 2, 1] */ function reverse(array) { return array ? nativeReverse.call(array) : array; } /** * Creates a slice of `array` from `start` up to, but not including, `end`. * * **Note:** This method is used instead of * [`Array#slice`](https://mdn.io/Array/slice) to ensure dense arrays are * returned. * * @static * @memberOf _ * @since 3.0.0 * @category Array * @param {Array} array The array to slice. * @param {number} [start=0] The start position. * @param {number} [end=array.length] The end position. * @returns {Array} Returns the slice of `array`. */ function slice(array, start, end) { var length = array ? array.length : 0; if (!length) { return []; } if (end && typeof end != 'number' && isIterateeCall(array, start, end)) { start = 0; end = length; } else { start = start == null ? 0 : toInteger(start); end = end === undefined ? length : toInteger(end); } return baseSlice(array, start, end); } /** * Uses a binary search to determine the lowest index at which `value` * should be inserted into `array` in order to maintain its sort order. * * @static * @memberOf _ * @since 0.1.0 * @category Array * @param {Array} array The sorted array to inspect. * @param {*} value The value to evaluate. * @returns {number} Returns the index at which `value` should be inserted * into `array`. * @example * * _.sortedIndex([30, 50], 40); * // => 1 * * _.sortedIndex([4, 5], 4); * // => 0 */ function sortedIndex(array, value) { return baseSortedIndex(array, value); } /** * This method is like `_.sortedIndex` except that it accepts `iteratee` * which is invoked for `value` and each element of `array` to compute their * sort ranking. The iteratee is invoked with one argument: (value). * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} array The sorted array to inspect. * @param {*} value The value to evaluate. * @param {Array|Function|Object|string} [iteratee=_.identity] * The iteratee invoked per element. * @returns {number} Returns the index at which `value` should be inserted * into `array`. * @example * * var dict = { 'thirty': 30, 'forty': 40, 'fifty': 50 }; * * _.sortedIndexBy(['thirty', 'fifty'], 'forty', _.propertyOf(dict)); * // => 1 * * // The `_.property` iteratee shorthand. * _.sortedIndexBy([{ 'x': 4 }, { 'x': 5 }], { 'x': 4 }, 'x'); * // => 0 */ function sortedIndexBy(array, value, iteratee) { return baseSortedIndexBy(array, value, getIteratee(iteratee)); } /** * This method is like `_.indexOf` except that it performs a binary * search on a sorted `array`. * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} array The array to search. * @param {*} value The value to search for. * @returns {number} Returns the index of the matched value, else `-1`. * @example * * _.sortedIndexOf([1, 1, 2, 2], 2); * // => 2 */ function sortedIndexOf(array, value) { var length = array ? array.length : 0; if (length) { var index = baseSortedIndex(array, value); if (index < length && eq(array[index], value)) { return index; } } return -1; } /** * This method is like `_.sortedIndex` except that it returns the highest * index at which `value` should be inserted into `array` in order to * maintain its sort order. * * @static * @memberOf _ * @since 3.0.0 * @category Array * @param {Array} array The sorted array to inspect. * @param {*} value The value to evaluate. * @returns {number} Returns the index at which `value` should be inserted * into `array`. * @example * * _.sortedLastIndex([4, 5], 4); * // => 1 */ function sortedLastIndex(array, value) { return baseSortedIndex(array, value, true); } /** * This method is like `_.sortedLastIndex` except that it accepts `iteratee` * which is invoked for `value` and each element of `array` to compute their * sort ranking. The iteratee is invoked with one argument: (value). * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} array The sorted array to inspect. * @param {*} value The value to evaluate. * @param {Array|Function|Object|string} [iteratee=_.identity] * The iteratee invoked per element. * @returns {number} Returns the index at which `value` should be inserted * into `array`. * @example * * // The `_.property` iteratee shorthand. * _.sortedLastIndexBy([{ 'x': 4 }, { 'x': 5 }], { 'x': 4 }, 'x'); * // => 1 */ function sortedLastIndexBy(array, value, iteratee) { return baseSortedIndexBy(array, value, getIteratee(iteratee), true); } /** * This method is like `_.lastIndexOf` except that it performs a binary * search on a sorted `array`. * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} array The array to search. * @param {*} value The value to search for. * @returns {number} Returns the index of the matched value, else `-1`. * @example * * _.sortedLastIndexOf([1, 1, 2, 2], 2); * // => 3 */ function sortedLastIndexOf(array, value) { var length = array ? array.length : 0; if (length) { var index = baseSortedIndex(array, value, true) - 1; if (eq(array[index], value)) { return index; } } return -1; } /** * This method is like `_.uniq` except that it's designed and optimized * for sorted arrays. * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} array The array to inspect. * @returns {Array} Returns the new duplicate free array. * @example * * _.sortedUniq([1, 1, 2]); * // => [1, 2] */ function sortedUniq(array) { return (array && array.length) ? baseSortedUniq(array) : []; } /** * This method is like `_.uniqBy` except that it's designed and optimized * for sorted arrays. * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} array The array to inspect. * @param {Function} [iteratee] The iteratee invoked per element. * @returns {Array} Returns the new duplicate free array. * @example * * _.sortedUniqBy([1.1, 1.2, 2.3, 2.4], Math.floor); * // => [1.1, 2.3] */ function sortedUniqBy(array, iteratee) { return (array && array.length) ? baseSortedUniqBy(array, getIteratee(iteratee)) : []; } /** * Gets all but the first element of `array`. * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} array The array to query. * @returns {Array} Returns the slice of `array`. * @example * * _.tail([1, 2, 3]); * // => [2, 3] */ function tail(array) { return drop(array, 1); } /** * Creates a slice of `array` with `n` elements taken from the beginning. * * @static * @memberOf _ * @since 0.1.0 * @category Array * @param {Array} array The array to query. * @param {number} [n=1] The number of elements to take. * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. * @returns {Array} Returns the slice of `array`. * @example * * _.take([1, 2, 3]); * // => [1] * * _.take([1, 2, 3], 2); * // => [1, 2] * * _.take([1, 2, 3], 5); * // => [1, 2, 3] * * _.take([1, 2, 3], 0); * // => [] */ function take(array, n, guard) { if (!(array && array.length)) { return []; } n = (guard || n === undefined) ? 1 : toInteger(n); return baseSlice(array, 0, n < 0 ? 0 : n); } /** * Creates a slice of `array` with `n` elements taken from the end. * * @static * @memberOf _ * @since 3.0.0 * @category Array * @param {Array} array The array to query. * @param {number} [n=1] The number of elements to take. * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. * @returns {Array} Returns the slice of `array`. * @example * * _.takeRight([1, 2, 3]); * // => [3] * * _.takeRight([1, 2, 3], 2); * // => [2, 3] * * _.takeRight([1, 2, 3], 5); * // => [1, 2, 3] * * _.takeRight([1, 2, 3], 0); * // => [] */ function takeRight(array, n, guard) { var length = array ? array.length : 0; if (!length) { return []; } n = (guard || n === undefined) ? 1 : toInteger(n); n = length - n; return baseSlice(array, n < 0 ? 0 : n, length); } /** * Creates a slice of `array` with elements taken from the end. Elements are * taken until `predicate` returns falsey. The predicate is invoked with * three arguments: (value, index, array). * * @static * @memberOf _ * @since 3.0.0 * @category Array * @param {Array} array The array to query. * @param {Array|Function|Object|string} [predicate=_.identity] * The function invoked per iteration. * @returns {Array} Returns the slice of `array`. * @example * * var users = [ * { 'user': 'barney', 'active': true }, * { 'user': 'fred', 'active': false }, * { 'user': 'pebbles', 'active': false } * ]; * * _.takeRightWhile(users, function(o) { return !o.active; }); * // => objects for ['fred', 'pebbles'] * * // The `_.matches` iteratee shorthand. * _.takeRightWhile(users, { 'user': 'pebbles', 'active': false }); * // => objects for ['pebbles'] * * // The `_.matchesProperty` iteratee shorthand. * _.takeRightWhile(users, ['active', false]); * // => objects for ['fred', 'pebbles'] * * // The `_.property` iteratee shorthand. * _.takeRightWhile(users, 'active'); * // => [] */ function takeRightWhile(array, predicate) { return (array && array.length) ? baseWhile(array, getIteratee(predicate, 3), false, true) : []; } /** * Creates a slice of `array` with elements taken from the beginning. Elements * are taken until `predicate` returns falsey. The predicate is invoked with * three arguments: (value, index, array). * * @static * @memberOf _ * @since 3.0.0 * @category Array * @param {Array} array The array to query. * @param {Array|Function|Object|string} [predicate=_.identity] * The function invoked per iteration. * @returns {Array} Returns the slice of `array`. * @example * * var users = [ * { 'user': 'barney', 'active': false }, * { 'user': 'fred', 'active': false}, * { 'user': 'pebbles', 'active': true } * ]; * * _.takeWhile(users, function(o) { return !o.active; }); * // => objects for ['barney', 'fred'] * * // The `_.matches` iteratee shorthand. * _.takeWhile(users, { 'user': 'barney', 'active': false }); * // => objects for ['barney'] * * // The `_.matchesProperty` iteratee shorthand. * _.takeWhile(users, ['active', false]); * // => objects for ['barney', 'fred'] * * // The `_.property` iteratee shorthand. * _.takeWhile(users, 'active'); * // => [] */ function takeWhile(array, predicate) { return (array && array.length) ? baseWhile(array, getIteratee(predicate, 3)) : []; } /** * Creates an array of unique values, in order, from all given arrays using * [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero) * for equality comparisons. * * @static * @memberOf _ * @since 0.1.0 * @category Array * @param {...Array} [arrays] The arrays to inspect. * @returns {Array} Returns the new array of combined values. * @example * * _.union([2, 1], [4, 2], [1, 2]); * // => [2, 1, 4] */ var union = rest(function(arrays) { return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true)); }); /** * This method is like `_.union` except that it accepts `iteratee` which is * invoked for each element of each `arrays` to generate the criterion by * which uniqueness is computed. The iteratee is invoked with one argument: * (value). * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {...Array} [arrays] The arrays to inspect. * @param {Array|Function|Object|string} [iteratee=_.identity] * The iteratee invoked per element. * @returns {Array} Returns the new array of combined values. * @example * * _.unionBy([2.1, 1.2], [4.3, 2.4], Math.floor); * // => [2.1, 1.2, 4.3] * * // The `_.property` iteratee shorthand. * _.unionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x'); * // => [{ 'x': 1 }, { 'x': 2 }] */ var unionBy = rest(function(arrays) { var iteratee = last(arrays); if (isArrayLikeObject(iteratee)) { iteratee = undefined; } return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), getIteratee(iteratee)); }); /** * This method is like `_.union` except that it accepts `comparator` which * is invoked to compare elements of `arrays`. The comparator is invoked * with two arguments: (arrVal, othVal). * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {...Array} [arrays] The arrays to inspect. * @param {Function} [comparator] The comparator invoked per element. * @returns {Array} Returns the new array of combined values. * @example * * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]; * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }]; * * _.unionWith(objects, others, _.isEqual); * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }] */ var unionWith = rest(function(arrays) { var comparator = last(arrays); if (isArrayLikeObject(comparator)) { comparator = undefined; } return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), undefined, comparator); }); /** * Creates a duplicate-free version of an array, using * [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero) * for equality comparisons, in which only the first occurrence of each * element is kept. * * @static * @memberOf _ * @since 0.1.0 * @category Array * @param {Array} array The array to inspect. * @returns {Array} Returns the new duplicate free array. * @example * * _.uniq([2, 1, 2]); * // => [2, 1] */ function uniq(array) { return (array && array.length) ? baseUniq(array) : []; } /** * This method is like `_.uniq` except that it accepts `iteratee` which is * invoked for each element in `array` to generate the criterion by which * uniqueness is computed. The iteratee is invoked with one argument: (value). * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} array The array to inspect. * @param {Array|Function|Object|string} [iteratee=_.identity] * The iteratee invoked per element. * @returns {Array} Returns the new duplicate free array. * @example * * _.uniqBy([2.1, 1.2, 2.3], Math.floor); * // => [2.1, 1.2] * * // The `_.property` iteratee shorthand. * _.uniqBy([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x'); * // => [{ 'x': 1 }, { 'x': 2 }] */ function uniqBy(array, iteratee) { return (array && array.length) ? baseUniq(array, getIteratee(iteratee)) : []; } /** * This method is like `_.uniq` except that it accepts `comparator` which * is invoked to compare elements of `array`. The comparator is invoked with * two arguments: (arrVal, othVal). * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} array The array to inspect. * @param {Function} [comparator] The comparator invoked per element. * @returns {Array} Returns the new duplicate free array. * @example * * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 2 }]; * * _.uniqWith(objects, _.isEqual); * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }] */ function uniqWith(array, comparator) { return (array && array.length) ? baseUniq(array, undefined, comparator) : []; } /** * This method is like `_.zip` except that it accepts an array of grouped * elements and creates an array regrouping the elements to their pre-zip * configuration. * * @static * @memberOf _ * @since 1.2.0 * @category Array * @param {Array} array The array of grouped elements to process. * @returns {Array} Returns the new array of regrouped elements. * @example * * var zipped = _.zip(['fred', 'barney'], [30, 40], [true, false]); * // => [['fred', 30, true], ['barney', 40, false]] * * _.unzip(zipped); * // => [['fred', 'barney'], [30, 40], [true, false]] */ function unzip(array) { if (!(array && array.length)) { return []; } var length = 0; array = arrayFilter(array, function(group) { if (isArrayLikeObject(group)) { length = nativeMax(group.length, length); return true; } }); return baseTimes(length, function(index) { return arrayMap(array, baseProperty(index)); }); } /** * This method is like `_.unzip` except that it accepts `iteratee` to specify * how regrouped values should be combined. The iteratee is invoked with the * elements of each group: (...group). * * @static * @memberOf _ * @since 3.8.0 * @category Array * @param {Array} array The array of grouped elements to process. * @param {Function} [iteratee=_.identity] The function to combine * regrouped values. * @returns {Array} Returns the new array of regrouped elements. * @example * * var zipped = _.zip([1, 2], [10, 20], [100, 200]); * // => [[1, 10, 100], [2, 20, 200]] * * _.unzipWith(zipped, _.add); * // => [3, 30, 300] */ function unzipWith(array, iteratee) { if (!(array && array.length)) { return []; } var result = unzip(array); if (iteratee == null) { return result; } return arrayMap(result, function(group) { return apply(iteratee, undefined, group); }); } /** * Creates an array excluding all given values using * [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero) * for equality comparisons. * * @static * @memberOf _ * @since 0.1.0 * @category Array * @param {Array} array The array to filter. * @param {...*} [values] The values to exclude. * @returns {Array} Returns the new array of filtered values. * @example * * _.without([1, 2, 1, 3], 1, 2); * // => [3] */ var without = rest(function(array, values) { return isArrayLikeObject(array) ? baseDifference(array, values) : []; }); /** * Creates an array of unique values that is the * [symmetric difference](https://en.wikipedia.org/wiki/Symmetric_difference) * of the given arrays. The order of result values is determined by the order * they occur in the arrays. * * @static * @memberOf _ * @since 2.4.0 * @category Array * @param {...Array} [arrays] The arrays to inspect. * @returns {Array} Returns the new array of values. * @example * * _.xor([2, 1], [4, 2]); * // => [1, 4] */ var xor = rest(function(arrays) { return baseXor(arrayFilter(arrays, isArrayLikeObject)); }); /** * This method is like `_.xor` except that it accepts `iteratee` which is * invoked for each element of each `arrays` to generate the criterion by * which by which they're compared. The iteratee is invoked with one argument: * (value). * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {...Array} [arrays] The arrays to inspect. * @param {Array|Function|Object|string} [iteratee=_.identity] * The iteratee invoked per element. * @returns {Array} Returns the new array of values. * @example * * _.xorBy([2.1, 1.2], [4.3, 2.4], Math.floor); * // => [1.2, 4.3] * * // The `_.property` iteratee shorthand. * _.xorBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x'); * // => [{ 'x': 2 }] */ var xorBy = rest(function(arrays) { var iteratee = last(arrays); if (isArrayLikeObject(iteratee)) { iteratee = undefined; } return baseXor(arrayFilter(arrays, isArrayLikeObject), getIteratee(iteratee)); }); /** * This method is like `_.xor` except that it accepts `comparator` which is * invoked to compare elements of `arrays`. The comparator is invoked with * two arguments: (arrVal, othVal). * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {...Array} [arrays] The arrays to inspect. * @param {Function} [comparator] The comparator invoked per element. * @returns {Array} Returns the new array of values. * @example * * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]; * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }]; * * _.xorWith(objects, others, _.isEqual); * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }] */ var xorWith = rest(function(arrays) { var comparator = last(arrays); if (isArrayLikeObject(comparator)) { comparator = undefined; } return baseXor(arrayFilter(arrays, isArrayLikeObject), undefined, comparator); }); /** * Creates an array of grouped elements, the first of which contains the * first elements of the given arrays, the second of which contains the * second elements of the given arrays, and so on. * * @static * @memberOf _ * @since 0.1.0 * @category Array * @param {...Array} [arrays] The arrays to process. * @returns {Array} Returns the new array of grouped elements. * @example * * _.zip(['fred', 'barney'], [30, 40], [true, false]); * // => [['fred', 30, true], ['barney', 40, false]] */ var zip = rest(unzip); /** * This method is like `_.fromPairs` except that it accepts two arrays, * one of property identifiers and one of corresponding values. * * @static * @memberOf _ * @since 0.4.0 * @category Array * @param {Array} [props=[]] The property identifiers. * @param {Array} [values=[]] The property values. * @returns {Object} Returns the new object. * @example * * _.zipObject(['a', 'b'], [1, 2]); * // => { 'a': 1, 'b': 2 } */ function zipObject(props, values) { return baseZipObject(props || [], values || [], assignValue); } /** * This method is like `_.zipObject` except that it supports property paths. * * @static * @memberOf _ * @since 4.1.0 * @category Array * @param {Array} [props=[]] The property identifiers. * @param {Array} [values=[]] The property values. * @returns {Object} Returns the new object. * @example * * _.zipObjectDeep(['a.b[0].c', 'a.b[1].d'], [1, 2]); * // => { 'a': { 'b': [{ 'c': 1 }, { 'd': 2 }] } } */ function zipObjectDeep(props, values) { return baseZipObject(props || [], values || [], baseSet); } /** * This method is like `_.zip` except that it accepts `iteratee` to specify * how grouped values should be combined. The iteratee is invoked with the * elements of each group: (...group). * * @static * @memberOf _ * @since 3.8.0 * @category Array * @param {...Array} [arrays] The arrays to process. * @param {Function} [iteratee=_.identity] The function to combine grouped values. * @returns {Array} Returns the new array of grouped elements. * @example * * _.zipWith([1, 2], [10, 20], [100, 200], function(a, b, c) { * return a + b + c; * }); * // => [111, 222] */ var zipWith = rest(function(arrays) { var length = arrays.length, iteratee = length > 1 ? arrays[length - 1] : undefined; iteratee = typeof iteratee == 'function' ? (arrays.pop(), iteratee) : undefined; return unzipWith(arrays, iteratee); }); /*------------------------------------------------------------------------*/ /** * Creates a `lodash` wrapper instance that wraps `value` with explicit method * chain sequences enabled. The result of such sequences must be unwrapped * with `_#value`. * * @static * @memberOf _ * @since 1.3.0 * @category Seq * @param {*} value The value to wrap. * @returns {Object} Returns the new `lodash` wrapper instance. * @example * * var users = [ * { 'user': 'barney', 'age': 36 }, * { 'user': 'fred', 'age': 40 }, * { 'user': 'pebbles', 'age': 1 } * ]; * * var youngest = _ * .chain(users) * .sortBy('age') * .map(function(o) { * return o.user + ' is ' + o.age; * }) * .head() * .value(); * // => 'pebbles is 1' */ function chain(value) { var result = lodash(value); result.__chain__ = true; return result; } /** * This method invokes `interceptor` and returns `value`. The interceptor * is invoked with one argument; (value). The purpose of this method is to * "tap into" a method chain sequence in order to modify intermediate results. * * @static * @memberOf _ * @since 0.1.0 * @category Seq * @param {*} value The value to provide to `interceptor`. * @param {Function} interceptor The function to invoke. * @returns {*} Returns `value`. * @example * * _([1, 2, 3]) * .tap(function(array) { * // Mutate input array. * array.pop(); * }) * .reverse() * .value(); * // => [2, 1] */ function tap(value, interceptor) { interceptor(value); return value; } /** * This method is like `_.tap` except that it returns the result of `interceptor`. * The purpose of this method is to "pass thru" values replacing intermediate * results in a method chain sequence. * * @static * @memberOf _ * @since 3.0.0 * @category Seq * @param {*} value The value to provide to `interceptor`. * @param {Function} interceptor The function to invoke. * @returns {*} Returns the result of `interceptor`. * @example * * _(' abc ') * .chain() * .trim() * .thru(function(value) { * return [value]; * }) * .value(); * // => ['abc'] */ function thru(value, interceptor) { return interceptor(value); } /** * This method is the wrapper version of `_.at`. * * @name at * @memberOf _ * @since 1.0.0 * @category Seq * @param {...(string|string[])} [paths] The property paths of elements to pick. * @returns {Object} Returns the new `lodash` wrapper instance. * @example * * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] }; * * _(object).at(['a[0].b.c', 'a[1]']).value(); * // => [3, 4] * * _(['a', 'b', 'c']).at(0, 2).value(); * // => ['a', 'c'] */ var wrapperAt = rest(function(paths) { paths = baseFlatten(paths, 1); var length = paths.length, start = length ? paths[0] : 0, value = this.__wrapped__, interceptor = function(object) { return baseAt(object, paths); }; if (length > 1 || this.__actions__.length || !(value instanceof LazyWrapper) || !isIndex(start)) { return this.thru(interceptor); } value = value.slice(start, +start + (length ? 1 : 0)); value.__actions__.push({ 'func': thru, 'args': [interceptor], 'thisArg': undefined }); return new LodashWrapper(value, this.__chain__).thru(function(array) { if (length && !array.length) { array.push(undefined); } return array; }); }); /** * Creates a `lodash` wrapper instance with explicit method chain sequences enabled. * * @name chain * @memberOf _ * @since 0.1.0 * @category Seq * @returns {Object} Returns the new `lodash` wrapper instance. * @example * * var users = [ * { 'user': 'barney', 'age': 36 }, * { 'user': 'fred', 'age': 40 } * ]; * * // A sequence without explicit chaining. * _(users).head(); * // => { 'user': 'barney', 'age': 36 } * * // A sequence with explicit chaining. * _(users) * .chain() * .head() * .pick('user') * .value(); * // => { 'user': 'barney' } */ function wrapperChain() { return chain(this); } /** * Executes the chain sequence and returns the wrapped result. * * @name commit * @memberOf _ * @since 3.2.0 * @category Seq * @returns {Object} Returns the new `lodash` wrapper instance. * @example * * var array = [1, 2]; * var wrapped = _(array).push(3); * * console.log(array); * // => [1, 2] * * wrapped = wrapped.commit(); * console.log(array); * // => [1, 2, 3] * * wrapped.last(); * // => 3 * * console.log(array); * // => [1, 2, 3] */ function wrapperCommit() { return new LodashWrapper(this.value(), this.__chain__); } /** * Gets the next value on a wrapped object following the * [iterator protocol](https://mdn.io/iteration_protocols#iterator). * * @name next * @memberOf _ * @since 4.0.0 * @category Seq * @returns {Object} Returns the next iterator value. * @example * * var wrapped = _([1, 2]); * * wrapped.next(); * // => { 'done': false, 'value': 1 } * * wrapped.next(); * // => { 'done': false, 'value': 2 } * * wrapped.next(); * // => { 'done': true, 'value': undefined } */ function wrapperNext() { if (this.__values__ === undefined) { this.__values__ = toArray(this.value()); } var done = this.__index__ >= this.__values__.length, value = done ? undefined : this.__values__[this.__index__++]; return { 'done': done, 'value': value }; } /** * Enables the wrapper to be iterable. * * @name Symbol.iterator * @memberOf _ * @since 4.0.0 * @category Seq * @returns {Object} Returns the wrapper object. * @example * * var wrapped = _([1, 2]); * * wrapped[Symbol.iterator]() === wrapped; * // => true * * Array.from(wrapped); * // => [1, 2] */ function wrapperToIterator() { return this; } /** * Creates a clone of the chain sequence planting `value` as the wrapped value. * * @name plant * @memberOf _ * @since 3.2.0 * @category Seq * @param {*} value The value to plant. * @returns {Object} Returns the new `lodash` wrapper instance. * @example * * function square(n) { * return n * n; * } * * var wrapped = _([1, 2]).map(square); * var other = wrapped.plant([3, 4]); * * other.value(); * // => [9, 16] * * wrapped.value(); * // => [1, 4] */ function wrapperPlant(value) { var result, parent = this; while (parent instanceof baseLodash) { var clone = wrapperClone(parent); clone.__index__ = 0; clone.__values__ = undefined; if (result) { previous.__wrapped__ = clone; } else { result = clone; } var previous = clone; parent = parent.__wrapped__; } previous.__wrapped__ = value; return result; } /** * This method is the wrapper version of `_.reverse`. * * **Note:** This method mutates the wrapped array. * * @name reverse * @memberOf _ * @since 0.1.0 * @category Seq * @returns {Object} Returns the new `lodash` wrapper instance. * @example * * var array = [1, 2, 3]; * * _(array).reverse().value() * // => [3, 2, 1] * * console.log(array); * // => [3, 2, 1] */ function wrapperReverse() { var value = this.__wrapped__; if (value instanceof LazyWrapper) { var wrapped = value; if (this.__actions__.length) { wrapped = new LazyWrapper(this); } wrapped = wrapped.reverse(); wrapped.__actions__.push({ 'func': thru, 'args': [reverse], 'thisArg': undefined }); return new LodashWrapper(wrapped, this.__chain__); } return this.thru(reverse); } /** * Executes the chain sequence to resolve the unwrapped value. * * @name value * @memberOf _ * @since 0.1.0 * @alias toJSON, valueOf * @category Seq * @returns {*} Returns the resolved unwrapped value. * @example * * _([1, 2, 3]).value(); * // => [1, 2, 3] */ function wrapperValue() { return baseWrapperValue(this.__wrapped__, this.__actions__); } /*------------------------------------------------------------------------*/ /** * Creates an object composed of keys generated from the results of running * each element of `collection` thru `iteratee`. The corresponding value of * each key is the number of times the key was returned by `iteratee`. The * iteratee is invoked with one argument: (value). * * @static * @memberOf _ * @since 0.5.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Array|Function|Object|string} [iteratee=_.identity] * The iteratee to transform keys. * @returns {Object} Returns the composed aggregate object. * @example * * _.countBy([6.1, 4.2, 6.3], Math.floor); * // => { '4': 1, '6': 2 } * * _.countBy(['one', 'two', 'three'], 'length'); * // => { '3': 2, '5': 1 } */ var countBy = createAggregator(function(result, value, key) { hasOwnProperty.call(result, key) ? ++result[key] : (result[key] = 1); }); /** * Checks if `predicate` returns truthy for **all** elements of `collection`. * Iteration is stopped once `predicate` returns falsey. The predicate is * invoked with three arguments: (value, index|key, collection). * * @static * @memberOf _ * @since 0.1.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Array|Function|Object|string} [predicate=_.identity] * The function invoked per iteration. * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. * @returns {boolean} Returns `true` if all elements pass the predicate check, * else `false`. * @example * * _.every([true, 1, null, 'yes'], Boolean); * // => false * * var users = [ * { 'user': 'barney', 'age': 36, 'active': false }, * { 'user': 'fred', 'age': 40, 'active': false } * ]; * * // The `_.matches` iteratee shorthand. * _.every(users, { 'user': 'barney', 'active': false }); * // => false * * // The `_.matchesProperty` iteratee shorthand. * _.every(users, ['active', false]); * // => true * * // The `_.property` iteratee shorthand. * _.every(users, 'active'); * // => false */ function every(collection, predicate, guard) { var func = isArray(collection) ? arrayEvery : baseEvery; if (guard && isIterateeCall(collection, predicate, guard)) { predicate = undefined; } return func(collection, getIteratee(predicate, 3)); } /** * Iterates over elements of `collection`, returning an array of all elements * `predicate` returns truthy for. The predicate is invoked with three * arguments: (value, index|key, collection). * * @static * @memberOf _ * @since 0.1.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Array|Function|Object|string} [predicate=_.identity] * The function invoked per iteration. * @returns {Array} Returns the new filtered array. * @example * * var users = [ * { 'user': 'barney', 'age': 36, 'active': true }, * { 'user': 'fred', 'age': 40, 'active': false } * ]; * * _.filter(users, function(o) { return !o.active; }); * // => objects for ['fred'] * * // The `_.matches` iteratee shorthand. * _.filter(users, { 'age': 36, 'active': true }); * // => objects for ['barney'] * * // The `_.matchesProperty` iteratee shorthand. * _.filter(users, ['active', false]); * // => objects for ['fred'] * * // The `_.property` iteratee shorthand. * _.filter(users, 'active'); * // => objects for ['barney'] */ function filter(collection, predicate) { var func = isArray(collection) ? arrayFilter : baseFilter; return func(collection, getIteratee(predicate, 3)); } /** * Iterates over elements of `collection`, returning the first element * `predicate` returns truthy for. The predicate is invoked with three * arguments: (value, index|key, collection). * * @static * @memberOf _ * @since 0.1.0 * @category Collection * @param {Array|Object} collection The collection to search. * @param {Array|Function|Object|string} [predicate=_.identity] * The function invoked per iteration. * @returns {*} Returns the matched element, else `undefined`. * @example * * var users = [ * { 'user': 'barney', 'age': 36, 'active': true }, * { 'user': 'fred', 'age': 40, 'active': false }, * { 'user': 'pebbles', 'age': 1, 'active': true } * ]; * * _.find(users, function(o) { return o.age < 40; }); * // => object for 'barney' * * // The `_.matches` iteratee shorthand. * _.find(users, { 'age': 1, 'active': true }); * // => object for 'pebbles' * * // The `_.matchesProperty` iteratee shorthand. * _.find(users, ['active', false]); * // => object for 'fred' * * // The `_.property` iteratee shorthand. * _.find(users, 'active'); * // => object for 'barney' */ function find(collection, predicate) { predicate = getIteratee(predicate, 3); if (isArray(collection)) { var index = baseFindIndex(collection, predicate); return index > -1 ? collection[index] : undefined; } return baseFind(collection, predicate, baseEach); } /** * This method is like `_.find` except that it iterates over elements of * `collection` from right to left. * * @static * @memberOf _ * @since 2.0.0 * @category Collection * @param {Array|Object} collection The collection to search. * @param {Array|Function|Object|string} [predicate=_.identity] * The function invoked per iteration. * @returns {*} Returns the matched element, else `undefined`. * @example * * _.findLast([1, 2, 3, 4], function(n) { * return n % 2 == 1; * }); * // => 3 */ function findLast(collection, predicate) { predicate = getIteratee(predicate, 3); if (isArray(collection)) { var index = baseFindIndex(collection, predicate, true); return index > -1 ? collection[index] : undefined; } return baseFind(collection, predicate, baseEachRight); } /** * Creates a flattened array of values by running each element in `collection` * thru `iteratee` and flattening the mapped results. The iteratee is invoked * with three arguments: (value, index|key, collection). * * @static * @memberOf _ * @since 4.0.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Array|Function|Object|string} [iteratee=_.identity] * The function invoked per iteration. * @returns {Array} Returns the new flattened array. * @example * * function duplicate(n) { * return [n, n]; * } * * _.flatMap([1, 2], duplicate); * // => [1, 1, 2, 2] */ function flatMap(collection, iteratee) { return baseFlatten(map(collection, iteratee), 1); } /** * This method is like `_.flatMap` except that it recursively flattens the * mapped results. * * @static * @memberOf _ * @since 4.7.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Array|Function|Object|string} [iteratee=_.identity] * The function invoked per iteration. * @returns {Array} Returns the new flattened array. * @example * * function duplicate(n) { * return [[[n, n]]]; * } * * _.flatMapDeep([1, 2], duplicate); * // => [1, 1, 2, 2] */ function flatMapDeep(collection, iteratee) { return baseFlatten(map(collection, iteratee), INFINITY); } /** * This method is like `_.flatMap` except that it recursively flattens the * mapped results up to `depth` times. * * @static * @memberOf _ * @since 4.7.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Array|Function|Object|string} [iteratee=_.identity] * The function invoked per iteration. * @param {number} [depth=1] The maximum recursion depth. * @returns {Array} Returns the new flattened array. * @example * * function duplicate(n) { * return [[[n, n]]]; * } * * _.flatMapDepth([1, 2], duplicate, 2); * // => [[1, 1], [2, 2]] */ function flatMapDepth(collection, iteratee, depth) { depth = depth === undefined ? 1 : toInteger(depth); return baseFlatten(map(collection, iteratee), depth); } /** * Iterates over elements of `collection` and invokes `iteratee` for each element. * The iteratee is invoked with three arguments: (value, index|key, collection). * Iteratee functions may exit iteration early by explicitly returning `false`. * * **Note:** As with other "Collections" methods, objects with a "length" * property are iterated like arrays. To avoid this behavior use `_.forIn` * or `_.forOwn` for object iteration. * * @static * @memberOf _ * @since 0.1.0 * @alias each * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @returns {Array|Object} Returns `collection`. * @example * * _([1, 2]).forEach(function(value) { * console.log(value); * }); * // => Logs `1` then `2`. * * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) { * console.log(key); * }); * // => Logs 'a' then 'b' (iteration order is not guaranteed). */ function forEach(collection, iteratee) { return (typeof iteratee == 'function' && isArray(collection)) ? arrayEach(collection, iteratee) : baseEach(collection, getIteratee(iteratee)); } /** * This method is like `_.forEach` except that it iterates over elements of * `collection` from right to left. * * @static * @memberOf _ * @since 2.0.0 * @alias eachRight * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @returns {Array|Object} Returns `collection`. * @example * * _.forEachRight([1, 2], function(value) { * console.log(value); * }); * // => Logs `2` then `1`. */ function forEachRight(collection, iteratee) { return (typeof iteratee == 'function' && isArray(collection)) ? arrayEachRight(collection, iteratee) : baseEachRight(collection, getIteratee(iteratee)); } /** * Creates an object composed of keys generated from the results of running * each element of `collection` thru `iteratee`. The order of grouped values * is determined by the order they occur in `collection`. The corresponding * value of each key is an array of elements responsible for generating the * key. The iteratee is invoked with one argument: (value). * * @static * @memberOf _ * @since 0.1.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Array|Function|Object|string} [iteratee=_.identity] * The iteratee to transform keys. * @returns {Object} Returns the composed aggregate object. * @example * * _.groupBy([6.1, 4.2, 6.3], Math.floor); * // => { '4': [4.2], '6': [6.1, 6.3] } * * // The `_.property` iteratee shorthand. * _.groupBy(['one', 'two', 'three'], 'length'); * // => { '3': ['one', 'two'], '5': ['three'] } */ var groupBy = createAggregator(function(result, value, key) { if (hasOwnProperty.call(result, key)) { result[key].push(value); } else { result[key] = [value]; } }); /** * Checks if `value` is in `collection`. If `collection` is a string, it's * checked for a substring of `value`, otherwise * [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero) * is used for equality comparisons. If `fromIndex` is negative, it's used as * the offset from the end of `collection`. * * @static * @memberOf _ * @since 0.1.0 * @category Collection * @param {Array|Object|string} collection The collection to search. * @param {*} value The value to search for. * @param {number} [fromIndex=0] The index to search from. * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`. * @returns {boolean} Returns `true` if `value` is found, else `false`. * @example * * _.includes([1, 2, 3], 1); * // => true * * _.includes([1, 2, 3], 1, 2); * // => false * * _.includes({ 'user': 'fred', 'age': 40 }, 'fred'); * // => true * * _.includes('pebbles', 'eb'); * // => true */ function includes(collection, value, fromIndex, guard) { collection = isArrayLike(collection) ? collection : values(collection); fromIndex = (fromIndex && !guard) ? toInteger(fromIndex) : 0; var length = collection.length; if (fromIndex < 0) { fromIndex = nativeMax(length + fromIndex, 0); } return isString(collection) ? (fromIndex <= length && collection.indexOf(value, fromIndex) > -1) : (!!length && baseIndexOf(collection, value, fromIndex) > -1); } /** * Invokes the method at `path` of each element in `collection`, returning * an array of the results of each invoked method. Any additional arguments * are provided to each invoked method. If `methodName` is a function, it's * invoked for and `this` bound to, each element in `collection`. * * @static * @memberOf _ * @since 4.0.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Array|Function|string} path The path of the method to invoke or * the function invoked per iteration. * @param {...*} [args] The arguments to invoke each method with. * @returns {Array} Returns the array of results. * @example * * _.invokeMap([[5, 1, 7], [3, 2, 1]], 'sort'); * // => [[1, 5, 7], [1, 2, 3]] * * _.invokeMap([123, 456], String.prototype.split, ''); * // => [['1', '2', '3'], ['4', '5', '6']] */ var invokeMap = rest(function(collection, path, args) { var index = -1, isFunc = typeof path == 'function', isProp = isKey(path), result = isArrayLike(collection) ? Array(collection.length) : []; baseEach(collection, function(value) { var func = isFunc ? path : ((isProp && value != null) ? value[path] : undefined); result[++index] = func ? apply(func, value, args) : baseInvoke(value, path, args); }); return result; }); /** * Creates an object composed of keys generated from the results of running * each element of `collection` thru `iteratee`. The corresponding value of * each key is the last element responsible for generating the key. The * iteratee is invoked with one argument: (value). * * @static * @memberOf _ * @since 4.0.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Array|Function|Object|string} [iteratee=_.identity] * The iteratee to transform keys. * @returns {Object} Returns the composed aggregate object. * @example * * var array = [ * { 'dir': 'left', 'code': 97 }, * { 'dir': 'right', 'code': 100 } * ]; * * _.keyBy(array, function(o) { * return String.fromCharCode(o.code); * }); * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } } * * _.keyBy(array, 'dir'); * // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } } */ var keyBy = createAggregator(function(result, value, key) { result[key] = value; }); /** * Creates an array of values by running each element in `collection` thru * `iteratee`. The iteratee is invoked with three arguments: * (value, index|key, collection). * * Many lodash methods are guarded to work as iteratees for methods like * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`. * * The guarded methods are: * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`, * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`, * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`, * `template`, `trim`, `trimEnd`, `trimStart`, and `words` * * @static * @memberOf _ * @since 0.1.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Array|Function|Object|string} [iteratee=_.identity] * The function invoked per iteration. * @returns {Array} Returns the new mapped array. * @example * * function square(n) { * return n * n; * } * * _.map([4, 8], square); * // => [16, 64] * * _.map({ 'a': 4, 'b': 8 }, square); * // => [16, 64] (iteration order is not guaranteed) * * var users = [ * { 'user': 'barney' }, * { 'user': 'fred' } * ]; * * // The `_.property` iteratee shorthand. * _.map(users, 'user'); * // => ['barney', 'fred'] */ function map(collection, iteratee) { var func = isArray(collection) ? arrayMap : baseMap; return func(collection, getIteratee(iteratee, 3)); } /** * This method is like `_.sortBy` except that it allows specifying the sort * orders of the iteratees to sort by. If `orders` is unspecified, all values * are sorted in ascending order. Otherwise, specify an order of "desc" for * descending or "asc" for ascending sort order of corresponding values. * * @static * @memberOf _ * @since 4.0.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Array[]|Function[]|Object[]|string[]} [iteratees=[_.identity]] * The iteratees to sort by. * @param {string[]} [orders] The sort orders of `iteratees`. * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`. * @returns {Array} Returns the new sorted array. * @example * * var users = [ * { 'user': 'fred', 'age': 48 }, * { 'user': 'barney', 'age': 34 }, * { 'user': 'fred', 'age': 40 }, * { 'user': 'barney', 'age': 36 } * ]; * * // Sort by `user` in ascending order and by `age` in descending order. * _.orderBy(users, ['user', 'age'], ['asc', 'desc']); * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]] */ function orderBy(collection, iteratees, orders, guard) { if (collection == null) { return []; } if (!isArray(iteratees)) { iteratees = iteratees == null ? [] : [iteratees]; } orders = guard ? undefined : orders; if (!isArray(orders)) { orders = orders == null ? [] : [orders]; } return baseOrderBy(collection, iteratees, orders); } /** * Creates an array of elements split into two groups, the first of which * contains elements `predicate` returns truthy for, the second of which * contains elements `predicate` returns falsey for. The predicate is * invoked with one argument: (value). * * @static * @memberOf _ * @since 3.0.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Array|Function|Object|string} [predicate=_.identity] * The function invoked per iteration. * @returns {Array} Returns the array of grouped elements. * @example * * var users = [ * { 'user': 'barney', 'age': 36, 'active': false }, * { 'user': 'fred', 'age': 40, 'active': true }, * { 'user': 'pebbles', 'age': 1, 'active': false } * ]; * * _.partition(users, function(o) { return o.active; }); * // => objects for [['fred'], ['barney', 'pebbles']] * * // The `_.matches` iteratee shorthand. * _.partition(users, { 'age': 1, 'active': false }); * // => objects for [['pebbles'], ['barney', 'fred']] * * // The `_.matchesProperty` iteratee shorthand. * _.partition(users, ['active', false]); * // => objects for [['barney', 'pebbles'], ['fred']] * * // The `_.property` iteratee shorthand. * _.partition(users, 'active'); * // => objects for [['fred'], ['barney', 'pebbles']] */ var partition = createAggregator(function(result, value, key) { result[key ? 0 : 1].push(value); }, function() { return [[], []]; }); /** * Reduces `collection` to a value which is the accumulated result of running * each element in `collection` thru `iteratee`, where each successive * invocation is supplied the return value of the previous. If `accumulator` * is not given, the first element of `collection` is used as the initial * value. The iteratee is invoked with four arguments: * (accumulator, value, index|key, collection). * * Many lodash methods are guarded to work as iteratees for methods like * `_.reduce`, `_.reduceRight`, and `_.transform`. * * The guarded methods are: * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`, * and `sortBy` * * @static * @memberOf _ * @since 0.1.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @param {*} [accumulator] The initial value. * @returns {*} Returns the accumulated value. * @example * * _.reduce([1, 2], function(sum, n) { * return sum + n; * }, 0); * // => 3 * * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) { * (result[value] || (result[value] = [])).push(key); * return result; * }, {}); * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed) */ function reduce(collection, iteratee, accumulator) { var func = isArray(collection) ? arrayReduce : baseReduce, initAccum = arguments.length < 3; return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEach); } /** * This method is like `_.reduce` except that it iterates over elements of * `collection` from right to left. * * @static * @memberOf _ * @since 0.1.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @param {*} [accumulator] The initial value. * @returns {*} Returns the accumulated value. * @example * * var array = [[0, 1], [2, 3], [4, 5]]; * * _.reduceRight(array, function(flattened, other) { * return flattened.concat(other); * }, []); * // => [4, 5, 2, 3, 0, 1] */ function reduceRight(collection, iteratee, accumulator) { var func = isArray(collection) ? arrayReduceRight : baseReduce, initAccum = arguments.length < 3; return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEachRight); } /** * The opposite of `_.filter`; this method returns the elements of `collection` * that `predicate` does **not** return truthy for. * * @static * @memberOf _ * @since 0.1.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Array|Function|Object|string} [predicate=_.identity] * The function invoked per iteration. * @returns {Array} Returns the new filtered array. * @example * * var users = [ * { 'user': 'barney', 'age': 36, 'active': false }, * { 'user': 'fred', 'age': 40, 'active': true } * ]; * * _.reject(users, function(o) { return !o.active; }); * // => objects for ['fred'] * * // The `_.matches` iteratee shorthand. * _.reject(users, { 'age': 40, 'active': true }); * // => objects for ['barney'] * * // The `_.matchesProperty` iteratee shorthand. * _.reject(users, ['active', false]); * // => objects for ['fred'] * * // The `_.property` iteratee shorthand. * _.reject(users, 'active'); * // => objects for ['barney'] */ function reject(collection, predicate) { var func = isArray(collection) ? arrayFilter : baseFilter; predicate = getIteratee(predicate, 3); return func(collection, function(value, index, collection) { return !predicate(value, index, collection); }); } /** * Gets a random element from `collection`. * * @static * @memberOf _ * @since 2.0.0 * @category Collection * @param {Array|Object} collection The collection to sample. * @returns {*} Returns the random element. * @example * * _.sample([1, 2, 3, 4]); * // => 2 */ function sample(collection) { var array = isArrayLike(collection) ? collection : values(collection), length = array.length; return length > 0 ? array[baseRandom(0, length - 1)] : undefined; } /** * Gets `n` random elements at unique keys from `collection` up to the * size of `collection`. * * @static * @memberOf _ * @since 4.0.0 * @category Collection * @param {Array|Object} collection The collection to sample. * @param {number} [n=1] The number of elements to sample. * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. * @returns {Array} Returns the random elements. * @example * * _.sampleSize([1, 2, 3], 2); * // => [3, 1] * * _.sampleSize([1, 2, 3], 4); * // => [2, 3, 1] */ function sampleSize(collection, n, guard) { var index = -1, result = toArray(collection), length = result.length, lastIndex = length - 1; if ((guard ? isIterateeCall(collection, n, guard) : n === undefined)) { n = 1; } else { n = baseClamp(toInteger(n), 0, length); } while (++index < n) { var rand = baseRandom(index, lastIndex), value = result[rand]; result[rand] = result[index]; result[index] = value; } result.length = n; return result; } /** * Creates an array of shuffled values, using a version of the * [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher-Yates_shuffle). * * @static * @memberOf _ * @since 0.1.0 * @category Collection * @param {Array|Object} collection The collection to shuffle. * @returns {Array} Returns the new shuffled array. * @example * * _.shuffle([1, 2, 3, 4]); * // => [4, 1, 3, 2] */ function shuffle(collection) { return sampleSize(collection, MAX_ARRAY_LENGTH); } /** * Gets the size of `collection` by returning its length for array-like * values or the number of own enumerable string keyed properties for objects. * * @static * @memberOf _ * @since 0.1.0 * @category Collection * @param {Array|Object} collection The collection to inspect. * @returns {number} Returns the collection size. * @example * * _.size([1, 2, 3]); * // => 3 * * _.size({ 'a': 1, 'b': 2 }); * // => 2 * * _.size('pebbles'); * // => 7 */ function size(collection) { if (collection == null) { return 0; } if (isArrayLike(collection)) { var result = collection.length; return (result && isString(collection)) ? stringSize(collection) : result; } if (isObjectLike(collection)) { var tag = getTag(collection); if (tag == mapTag || tag == setTag) { return collection.size; } } return keys(collection).length; } /** * Checks if `predicate` returns truthy for **any** element of `collection`. * Iteration is stopped once `predicate` returns truthy. The predicate is * invoked with three arguments: (value, index|key, collection). * * @static * @memberOf _ * @since 0.1.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Array|Function|Object|string} [predicate=_.identity] * The function invoked per iteration. * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. * @returns {boolean} Returns `true` if any element passes the predicate check, * else `false`. * @example * * _.some([null, 0, 'yes', false], Boolean); * // => true * * var users = [ * { 'user': 'barney', 'active': true }, * { 'user': 'fred', 'active': false } * ]; * * // The `_.matches` iteratee shorthand. * _.some(users, { 'user': 'barney', 'active': false }); * // => false * * // The `_.matchesProperty` iteratee shorthand. * _.some(users, ['active', false]); * // => true * * // The `_.property` iteratee shorthand. * _.some(users, 'active'); * // => true */ function some(collection, predicate, guard) { var func = isArray(collection) ? arraySome : baseSome; if (guard && isIterateeCall(collection, predicate, guard)) { predicate = undefined; } return func(collection, getIteratee(predicate, 3)); } /** * Creates an array of elements, sorted in ascending order by the results of * running each element in a collection thru each iteratee. This method * performs a stable sort, that is, it preserves the original sort order of * equal elements. The iteratees are invoked with one argument: (value). * * @static * @memberOf _ * @since 0.1.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {...(Array|Array[]|Function|Function[]|Object|Object[]|string|string[])} * [iteratees=[_.identity]] The iteratees to sort by. * @returns {Array} Returns the new sorted array. * @example * * var users = [ * { 'user': 'fred', 'age': 48 }, * { 'user': 'barney', 'age': 36 }, * { 'user': 'fred', 'age': 40 }, * { 'user': 'barney', 'age': 34 } * ]; * * _.sortBy(users, function(o) { return o.user; }); * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]] * * _.sortBy(users, ['user', 'age']); * // => objects for [['barney', 34], ['barney', 36], ['fred', 40], ['fred', 48]] * * _.sortBy(users, 'user', function(o) { * return Math.floor(o.age / 10); * }); * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]] */ var sortBy = rest(function(collection, iteratees) { if (collection == null) { return []; } var length = iteratees.length; if (length > 1 && isIterateeCall(collection, iteratees[0], iteratees[1])) { iteratees = []; } else if (length > 2 && isIterateeCall(iteratees[0], iteratees[1], iteratees[2])) { iteratees = [iteratees[0]]; } iteratees = (iteratees.length == 1 && isArray(iteratees[0])) ? iteratees[0] : baseFlatten(iteratees, 1, isFlattenableIteratee); return baseOrderBy(collection, iteratees, []); }); /*------------------------------------------------------------------------*/ /** * Gets the timestamp of the number of milliseconds that have elapsed since * the Unix epoch (1 January 1970 00:00:00 UTC). * * @static * @memberOf _ * @since 2.4.0 * @type {Function} * @category Date * @returns {number} Returns the timestamp. * @example * * _.defer(function(stamp) { * console.log(_.now() - stamp); * }, _.now()); * // => Logs the number of milliseconds it took for the deferred function to be invoked. */ var now = Date.now; /*------------------------------------------------------------------------*/ /** * The opposite of `_.before`; this method creates a function that invokes * `func` once it's called `n` or more times. * * @static * @memberOf _ * @since 0.1.0 * @category Function * @param {number} n The number of calls before `func` is invoked. * @param {Function} func The function to restrict. * @returns {Function} Returns the new restricted function. * @example * * var saves = ['profile', 'settings']; * * var done = _.after(saves.length, function() { * console.log('done saving!'); * }); * * _.forEach(saves, function(type) { * asyncSave({ 'type': type, 'complete': done }); * }); * // => Logs 'done saving!' after the two async saves have completed. */ function after(n, func) { if (typeof func != 'function') { throw new TypeError(FUNC_ERROR_TEXT); } n = toInteger(n); return function() { if (--n < 1) { return func.apply(this, arguments); } }; } /** * Creates a function that invokes `func`, with up to `n` arguments, * ignoring any additional arguments. * * @static * @memberOf _ * @since 3.0.0 * @category Function * @param {Function} func The function to cap arguments for. * @param {number} [n=func.length] The arity cap. * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. * @returns {Function} Returns the new function. * @example * * _.map(['6', '8', '10'], _.ary(parseInt, 1)); * // => [6, 8, 10] */ function ary(func, n, guard) { n = guard ? undefined : n; n = (func && n == null) ? func.length : n; return createWrapper(func, ARY_FLAG, undefined, undefined, undefined, undefined, n); } /** * Creates a function that invokes `func`, with the `this` binding and arguments * of the created function, while it's called less than `n` times. Subsequent * calls to the created function return the result of the last `func` invocation. * * @static * @memberOf _ * @since 3.0.0 * @category Function * @param {number} n The number of calls at which `func` is no longer invoked. * @param {Function} func The function to restrict. * @returns {Function} Returns the new restricted function. * @example * * jQuery(element).on('click', _.before(5, addContactToList)); * // => allows adding up to 4 contacts to the list */ function before(n, func) { var result; if (typeof func != 'function') { throw new TypeError(FUNC_ERROR_TEXT); } n = toInteger(n); return function() { if (--n > 0) { result = func.apply(this, arguments); } if (n <= 1) { func = undefined; } return result; }; } /** * Creates a function that invokes `func` with the `this` binding of `thisArg` * and `partials` prepended to the arguments it receives. * * The `_.bind.placeholder` value, which defaults to `_` in monolithic builds, * may be used as a placeholder for partially applied arguments. * * **Note:** Unlike native `Function#bind` this method doesn't set the "length" * property of bound functions. * * @static * @memberOf _ * @since 0.1.0 * @category Function * @param {Function} func The function to bind. * @param {*} thisArg The `this` binding of `func`. * @param {...*} [partials] The arguments to be partially applied. * @returns {Function} Returns the new bound function. * @example * * var greet = function(greeting, punctuation) { * return greeting + ' ' + this.user + punctuation; * }; * * var object = { 'user': 'fred' }; * * var bound = _.bind(greet, object, 'hi'); * bound('!'); * // => 'hi fred!' * * // Bound with placeholders. * var bound = _.bind(greet, object, _, '!'); * bound('hi'); * // => 'hi fred!' */ var bind = rest(function(func, thisArg, partials) { var bitmask = BIND_FLAG; if (partials.length) { var holders = replaceHolders(partials, getPlaceholder(bind)); bitmask |= PARTIAL_FLAG; } return createWrapper(func, bitmask, thisArg, partials, holders); }); /** * Creates a function that invokes the method at `object[key]` with `partials` * prepended to the arguments it receives. * * This method differs from `_.bind` by allowing bound functions to reference * methods that may be redefined or don't yet exist. See * [Peter Michaux's article](http://peter.michaux.ca/articles/lazy-function-definition-pattern) * for more details. * * The `_.bindKey.placeholder` value, which defaults to `_` in monolithic * builds, may be used as a placeholder for partially applied arguments. * * @static * @memberOf _ * @since 0.10.0 * @category Function * @param {Object} object The object to invoke the method on. * @param {string} key The key of the method. * @param {...*} [partials] The arguments to be partially applied. * @returns {Function} Returns the new bound function. * @example * * var object = { * 'user': 'fred', * 'greet': function(greeting, punctuation) { * return greeting + ' ' + this.user + punctuation; * } * }; * * var bound = _.bindKey(object, 'greet', 'hi'); * bound('!'); * // => 'hi fred!' * * object.greet = function(greeting, punctuation) { * return greeting + 'ya ' + this.user + punctuation; * }; * * bound('!'); * // => 'hiya fred!' * * // Bound with placeholders. * var bound = _.bindKey(object, 'greet', _, '!'); * bound('hi'); * // => 'hiya fred!' */ var bindKey = rest(function(object, key, partials) { var bitmask = BIND_FLAG | BIND_KEY_FLAG; if (partials.length) { var holders = replaceHolders(partials, getPlaceholder(bindKey)); bitmask |= PARTIAL_FLAG; } return createWrapper(key, bitmask, object, partials, holders); }); /** * Creates a function that accepts arguments of `func` and either invokes * `func` returning its result, if at least `arity` number of arguments have * been provided, or returns a function that accepts the remaining `func` * arguments, and so on. The arity of `func` may be specified if `func.length` * is not sufficient. * * The `_.curry.placeholder` value, which defaults to `_` in monolithic builds, * may be used as a placeholder for provided arguments. * * **Note:** This method doesn't set the "length" property of curried functions. * * @static * @memberOf _ * @since 2.0.0 * @category Function * @param {Function} func The function to curry. * @param {number} [arity=func.length] The arity of `func`. * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. * @returns {Function} Returns the new curried function. * @example * * var abc = function(a, b, c) { * return [a, b, c]; * }; * * var curried = _.curry(abc); * * curried(1)(2)(3); * // => [1, 2, 3] * * curried(1, 2)(3); * // => [1, 2, 3] * * curried(1, 2, 3); * // => [1, 2, 3] * * // Curried with placeholders. * curried(1)(_, 3)(2); * // => [1, 2, 3] */ function curry(func, arity, guard) { arity = guard ? undefined : arity; var result = createWrapper(func, CURRY_FLAG, undefined, undefined, undefined, undefined, undefined, arity); result.placeholder = curry.placeholder; return result; } /** * This method is like `_.curry` except that arguments are applied to `func` * in the manner of `_.partialRight` instead of `_.partial`. * * The `_.curryRight.placeholder` value, which defaults to `_` in monolithic * builds, may be used as a placeholder for provided arguments. * * **Note:** This method doesn't set the "length" property of curried functions. * * @static * @memberOf _ * @since 3.0.0 * @category Function * @param {Function} func The function to curry. * @param {number} [arity=func.length] The arity of `func`. * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. * @returns {Function} Returns the new curried function. * @example * * var abc = function(a, b, c) { * return [a, b, c]; * }; * * var curried = _.curryRight(abc); * * curried(3)(2)(1); * // => [1, 2, 3] * * curried(2, 3)(1); * // => [1, 2, 3] * * curried(1, 2, 3); * // => [1, 2, 3] * * // Curried with placeholders. * curried(3)(1, _)(2); * // => [1, 2, 3] */ function curryRight(func, arity, guard) { arity = guard ? undefined : arity; var result = createWrapper(func, CURRY_RIGHT_FLAG, undefined, undefined, undefined, undefined, undefined, arity); result.placeholder = curryRight.placeholder; return result; } /** * Creates a debounced function that delays invoking `func` until after `wait` * milliseconds have elapsed since the last time the debounced function was * invoked. The debounced function comes with a `cancel` method to cancel * delayed `func` invocations and a `flush` method to immediately invoke them. * Provide an options object to indicate whether `func` should be invoked on * the leading and/or trailing edge of the `wait` timeout. The `func` is invoked * with the last arguments provided to the debounced function. Subsequent calls * to the debounced function return the result of the last `func` invocation. * * **Note:** If `leading` and `trailing` options are `true`, `func` is invoked * on the trailing edge of the timeout only if the debounced function is * invoked more than once during the `wait` timeout. * * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/) * for details over the differences between `_.debounce` and `_.throttle`. * * @static * @memberOf _ * @since 0.1.0 * @category Function * @param {Function} func The function to debounce. * @param {number} [wait=0] The number of milliseconds to delay. * @param {Object} [options={}] The options object. * @param {boolean} [options.leading=false] * Specify invoking on the leading edge of the timeout. * @param {number} [options.maxWait] * The maximum time `func` is allowed to be delayed before it's invoked. * @param {boolean} [options.trailing=true] * Specify invoking on the trailing edge of the timeout. * @returns {Function} Returns the new debounced function. * @example * * // Avoid costly calculations while the window size is in flux. * jQuery(window).on('resize', _.debounce(calculateLayout, 150)); * * // Invoke `sendMail` when clicked, debouncing subsequent calls. * jQuery(element).on('click', _.debounce(sendMail, 300, { * 'leading': true, * 'trailing': false * })); * * // Ensure `batchLog` is invoked once after 1 second of debounced calls. * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 }); * var source = new EventSource('/stream'); * jQuery(source).on('message', debounced); * * // Cancel the trailing debounced invocation. * jQuery(window).on('popstate', debounced.cancel); */ function debounce(func, wait, options) { var lastArgs, lastThis, maxWait, result, timerId, lastCallTime = 0, lastInvokeTime = 0, leading = false, maxing = false, trailing = true; if (typeof func != 'function') { throw new TypeError(FUNC_ERROR_TEXT); } wait = toNumber(wait) || 0; if (isObject(options)) { leading = !!options.leading; maxing = 'maxWait' in options; maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait; trailing = 'trailing' in options ? !!options.trailing : trailing; } function invokeFunc(time) { var args = lastArgs, thisArg = lastThis; lastArgs = lastThis = undefined; lastInvokeTime = time; result = func.apply(thisArg, args); return result; } function leadingEdge(time) { // Reset any `maxWait` timer. lastInvokeTime = time; // Start the timer for the trailing edge. timerId = setTimeout(timerExpired, wait); // Invoke the leading edge. return leading ? invokeFunc(time) : result; } function remainingWait(time) { var timeSinceLastCall = time - lastCallTime, timeSinceLastInvoke = time - lastInvokeTime, result = wait - timeSinceLastCall; return maxing ? nativeMin(result, maxWait - timeSinceLastInvoke) : result; } function shouldInvoke(time) { var timeSinceLastCall = time - lastCallTime, timeSinceLastInvoke = time - lastInvokeTime; // Either this is the first call, activity has stopped and we're at the // trailing edge, the system time has gone backwards and we're treating // it as the trailing edge, or we've hit the `maxWait` limit. return (!lastCallTime || (timeSinceLastCall >= wait) || (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait)); } function timerExpired() { var time = now(); if (shouldInvoke(time)) { return trailingEdge(time); } // Restart the timer. timerId = setTimeout(timerExpired, remainingWait(time)); } function trailingEdge(time) { clearTimeout(timerId); timerId = undefined; // Only invoke if we have `lastArgs` which means `func` has been // debounced at least once. if (trailing && lastArgs) { return invokeFunc(time); } lastArgs = lastThis = undefined; return result; } function cancel() { if (timerId !== undefined) { clearTimeout(timerId); } lastCallTime = lastInvokeTime = 0; lastArgs = lastThis = timerId = undefined; } function flush() { return timerId === undefined ? result : trailingEdge(now()); } function debounced() { var time = now(), isInvoking = shouldInvoke(time); lastArgs = arguments; lastThis = this; lastCallTime = time; if (isInvoking) { if (timerId === undefined) { return leadingEdge(lastCallTime); } if (maxing) { // Handle invocations in a tight loop. clearTimeout(timerId); timerId = setTimeout(timerExpired, wait); return invokeFunc(lastCallTime); } } if (timerId === undefined) { timerId = setTimeout(timerExpired, wait); } return result; } debounced.cancel = cancel; debounced.flush = flush; return debounced; } /** * Defers invoking the `func` until the current call stack has cleared. Any * additional arguments are provided to `func` when it's invoked. * * @static * @memberOf _ * @since 0.1.0 * @category Function * @param {Function} func The function to defer. * @param {...*} [args] The arguments to invoke `func` with. * @returns {number} Returns the timer id. * @example * * _.defer(function(text) { * console.log(text); * }, 'deferred'); * // => Logs 'deferred' after one or more milliseconds. */ var defer = rest(function(func, args) { return baseDelay(func, 1, args); }); /** * Invokes `func` after `wait` milliseconds. Any additional arguments are * provided to `func` when it's invoked. * * @static * @memberOf _ * @since 0.1.0 * @category Function * @param {Function} func The function to delay. * @param {number} wait The number of milliseconds to delay invocation. * @param {...*} [args] The arguments to invoke `func` with. * @returns {number} Returns the timer id. * @example * * _.delay(function(text) { * console.log(text); * }, 1000, 'later'); * // => Logs 'later' after one second. */ var delay = rest(function(func, wait, args) { return baseDelay(func, toNumber(wait) || 0, args); }); /** * Creates a function that invokes `func` with arguments reversed. * * @static * @memberOf _ * @since 4.0.0 * @category Function * @param {Function} func The function to flip arguments for. * @returns {Function} Returns the new function. * @example * * var flipped = _.flip(function() { * return _.toArray(arguments); * }); * * flipped('a', 'b', 'c', 'd'); * // => ['d', 'c', 'b', 'a'] */ function flip(func) { return createWrapper(func, FLIP_FLAG); } /** * Creates a function that memoizes the result of `func`. If `resolver` is * provided, it determines the cache key for storing the result based on the * arguments provided to the memoized function. By default, the first argument * provided to the memoized function is used as the map cache key. The `func` * is invoked with the `this` binding of the memoized function. * * **Note:** The cache is exposed as the `cache` property on the memoized * function. Its creation may be customized by replacing the `_.memoize.Cache` * constructor with one whose instances implement the * [`Map`](http://ecma-international.org/ecma-262/6.0/#sec-properties-of-the-map-prototype-object) * method interface of `delete`, `get`, `has`, and `set`. * * @static * @memberOf _ * @since 0.1.0 * @category Function * @param {Function} func The function to have its output memoized. * @param {Function} [resolver] The function to resolve the cache key. * @returns {Function} Returns the new memoizing function. * @example * * var object = { 'a': 1, 'b': 2 }; * var other = { 'c': 3, 'd': 4 }; * * var values = _.memoize(_.values); * values(object); * // => [1, 2] * * values(other); * // => [3, 4] * * object.a = 2; * values(object); * // => [1, 2] * * // Modify the result cache. * values.cache.set(object, ['a', 'b']); * values(object); * // => ['a', 'b'] * * // Replace `_.memoize.Cache`. * _.memoize.Cache = WeakMap; */ function memoize(func, resolver) { if (typeof func != 'function' || (resolver && typeof resolver != 'function')) { throw new TypeError(FUNC_ERROR_TEXT); } var memoized = function() { var args = arguments, key = resolver ? resolver.apply(this, args) : args[0], cache = memoized.cache; if (cache.has(key)) { return cache.get(key); } var result = func.apply(this, args); memoized.cache = cache.set(key, result); return result; }; memoized.cache = new (memoize.Cache || MapCache); return memoized; } // Assign cache to `_.memoize`. memoize.Cache = MapCache; /** * Creates a function that negates the result of the predicate `func`. The * `func` predicate is invoked with the `this` binding and arguments of the * created function. * * @static * @memberOf _ * @since 3.0.0 * @category Function * @param {Function} predicate The predicate to negate. * @returns {Function} Returns the new function. * @example * * function isEven(n) { * return n % 2 == 0; * } * * _.filter([1, 2, 3, 4, 5, 6], _.negate(isEven)); * // => [1, 3, 5] */ function negate(predicate) { if (typeof predicate != 'function') { throw new TypeError(FUNC_ERROR_TEXT); } return function() { return !predicate.apply(this, arguments); }; } /** * Creates a function that is restricted to invoking `func` once. Repeat calls * to the function return the value of the first invocation. The `func` is * invoked with the `this` binding and arguments of the created function. * * @static * @memberOf _ * @since 0.1.0 * @category Function * @param {Function} func The function to restrict. * @returns {Function} Returns the new restricted function. * @example * * var initialize = _.once(createApplication); * initialize(); * initialize(); * // `initialize` invokes `createApplication` once */ function once(func) { return before(2, func); } /** * Creates a function that invokes `func` with arguments transformed by * corresponding `transforms`. * * @static * @since 4.0.0 * @memberOf _ * @category Function * @param {Function} func The function to wrap. * @param {...(Array|Array[]|Function|Function[]|Object|Object[]|string|string[])} * [transforms[_.identity]] The functions to transform. * @returns {Function} Returns the new function. * @example * * function doubled(n) { * return n * 2; * } * * function square(n) { * return n * n; * } * * var func = _.overArgs(function(x, y) { * return [x, y]; * }, square, doubled); * * func(9, 3); * // => [81, 6] * * func(10, 5); * // => [100, 10] */ var overArgs = rest(function(func, transforms) { transforms = (transforms.length == 1 && isArray(transforms[0])) ? arrayMap(transforms[0], baseUnary(getIteratee())) : arrayMap(baseFlatten(transforms, 1, isFlattenableIteratee), baseUnary(getIteratee())); var funcsLength = transforms.length; return rest(function(args) { var index = -1, length = nativeMin(args.length, funcsLength); while (++index < length) { args[index] = transforms[index].call(this, args[index]); } return apply(func, this, args); }); }); /** * Creates a function that invokes `func` with `partials` prepended to the * arguments it receives. This method is like `_.bind` except it does **not** * alter the `this` binding. * * The `_.partial.placeholder` value, which defaults to `_` in monolithic * builds, may be used as a placeholder for partially applied arguments. * * **Note:** This method doesn't set the "length" property of partially * applied functions. * * @static * @memberOf _ * @since 0.2.0 * @category Function * @param {Function} func The function to partially apply arguments to. * @param {...*} [partials] The arguments to be partially applied. * @returns {Function} Returns the new partially applied function. * @example * * var greet = function(greeting, name) { * return greeting + ' ' + name; * }; * * var sayHelloTo = _.partial(greet, 'hello'); * sayHelloTo('fred'); * // => 'hello fred' * * // Partially applied with placeholders. * var greetFred = _.partial(greet, _, 'fred'); * greetFred('hi'); * // => 'hi fred' */ var partial = rest(function(func, partials) { var holders = replaceHolders(partials, getPlaceholder(partial)); return createWrapper(func, PARTIAL_FLAG, undefined, partials, holders); }); /** * This method is like `_.partial` except that partially applied arguments * are appended to the arguments it receives. * * The `_.partialRight.placeholder` value, which defaults to `_` in monolithic * builds, may be used as a placeholder for partially applied arguments. * * **Note:** This method doesn't set the "length" property of partially * applied functions. * * @static * @memberOf _ * @since 1.0.0 * @category Function * @param {Function} func The function to partially apply arguments to. * @param {...*} [partials] The arguments to be partially applied. * @returns {Function} Returns the new partially applied function. * @example * * var greet = function(greeting, name) { * return greeting + ' ' + name; * }; * * var greetFred = _.partialRight(greet, 'fred'); * greetFred('hi'); * // => 'hi fred' * * // Partially applied with placeholders. * var sayHelloTo = _.partialRight(greet, 'hello', _); * sayHelloTo('fred'); * // => 'hello fred' */ var partialRight = rest(function(func, partials) { var holders = replaceHolders(partials, getPlaceholder(partialRight)); return createWrapper(func, PARTIAL_RIGHT_FLAG, undefined, partials, holders); }); /** * Creates a function that invokes `func` with arguments arranged according * to the specified `indexes` where the argument value at the first index is * provided as the first argument, the argument value at the second index is * provided as the second argument, and so on. * * @static * @memberOf _ * @since 3.0.0 * @category Function * @param {Function} func The function to rearrange arguments for. * @param {...(number|number[])} indexes The arranged argument indexes. * @returns {Function} Returns the new function. * @example * * var rearged = _.rearg(function(a, b, c) { * return [a, b, c]; * }, 2, 0, 1); * * rearged('b', 'c', 'a') * // => ['a', 'b', 'c'] */ var rearg = rest(function(func, indexes) { return createWrapper(func, REARG_FLAG, undefined, undefined, undefined, baseFlatten(indexes, 1)); }); /** * Creates a function that invokes `func` with the `this` binding of the * created function and arguments from `start` and beyond provided as * an array. * * **Note:** This method is based on the * [rest parameter](https://mdn.io/rest_parameters). * * @static * @memberOf _ * @since 4.0.0 * @category Function * @param {Function} func The function to apply a rest parameter to. * @param {number} [start=func.length-1] The start position of the rest parameter. * @returns {Function} Returns the new function. * @example * * var say = _.rest(function(what, names) { * return what + ' ' + _.initial(names).join(', ') + * (_.size(names) > 1 ? ', & ' : '') + _.last(names); * }); * * say('hello', 'fred', 'barney', 'pebbles'); * // => 'hello fred, barney, & pebbles' */ function rest(func, start) { if (typeof func != 'function') { throw new TypeError(FUNC_ERROR_TEXT); } start = nativeMax(start === undefined ? (func.length - 1) : toInteger(start), 0); return function() { var args = arguments, index = -1, length = nativeMax(args.length - start, 0), array = Array(length); while (++index < length) { array[index] = args[start + index]; } switch (start) { case 0: return func.call(this, array); case 1: return func.call(this, args[0], array); case 2: return func.call(this, args[0], args[1], array); } var otherArgs = Array(start + 1); index = -1; while (++index < start) { otherArgs[index] = args[index]; } otherArgs[start] = array; return apply(func, this, otherArgs); }; } /** * Creates a function that invokes `func` with the `this` binding of the * create function and an array of arguments much like * [`Function#apply`](http://www.ecma-international.org/ecma-262/6.0/#sec-function.prototype.apply). * * **Note:** This method is based on the * [spread operator](https://mdn.io/spread_operator). * * @static * @memberOf _ * @since 3.2.0 * @category Function * @param {Function} func The function to spread arguments over. * @param {number} [start=0] The start position of the spread. * @returns {Function} Returns the new function. * @example * * var say = _.spread(function(who, what) { * return who + ' says ' + what; * }); * * say(['fred', 'hello']); * // => 'fred says hello' * * var numbers = Promise.all([ * Promise.resolve(40), * Promise.resolve(36) * ]); * * numbers.then(_.spread(function(x, y) { * return x + y; * })); * // => a Promise of 76 */ function spread(func, start) { if (typeof func != 'function') { throw new TypeError(FUNC_ERROR_TEXT); } start = start === undefined ? 0 : nativeMax(toInteger(start), 0); return rest(function(args) { var array = args[start], otherArgs = castSlice(args, 0, start); if (array) { arrayPush(otherArgs, array); } return apply(func, this, otherArgs); }); } /** * Creates a throttled function that only invokes `func` at most once per * every `wait` milliseconds. The throttled function comes with a `cancel` * method to cancel delayed `func` invocations and a `flush` method to * immediately invoke them. Provide an options object to indicate whether * `func` should be invoked on the leading and/or trailing edge of the `wait` * timeout. The `func` is invoked with the last arguments provided to the * throttled function. Subsequent calls to the throttled function return the * result of the last `func` invocation. * * **Note:** If `leading` and `trailing` options are `true`, `func` is * invoked on the trailing edge of the timeout only if the throttled function * is invoked more than once during the `wait` timeout. * * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/) * for details over the differences between `_.throttle` and `_.debounce`. * * @static * @memberOf _ * @since 0.1.0 * @category Function * @param {Function} func The function to throttle. * @param {number} [wait=0] The number of milliseconds to throttle invocations to. * @param {Object} [options={}] The options object. * @param {boolean} [options.leading=true] * Specify invoking on the leading edge of the timeout. * @param {boolean} [options.trailing=true] * Specify invoking on the trailing edge of the timeout. * @returns {Function} Returns the new throttled function. * @example * * // Avoid excessively updating the position while scrolling. * jQuery(window).on('scroll', _.throttle(updatePosition, 100)); * * // Invoke `renewToken` when the click event is fired, but not more than once every 5 minutes. * var throttled = _.throttle(renewToken, 300000, { 'trailing': false }); * jQuery(element).on('click', throttled); * * // Cancel the trailing throttled invocation. * jQuery(window).on('popstate', throttled.cancel); */ function throttle(func, wait, options) { var leading = true, trailing = true; if (typeof func != 'function') { throw new TypeError(FUNC_ERROR_TEXT); } if (isObject(options)) { leading = 'leading' in options ? !!options.leading : leading; trailing = 'trailing' in options ? !!options.trailing : trailing; } return debounce(func, wait, { 'leading': leading, 'maxWait': wait, 'trailing': trailing }); } /** * Creates a function that accepts up to one argument, ignoring any * additional arguments. * * @static * @memberOf _ * @since 4.0.0 * @category Function * @param {Function} func The function to cap arguments for. * @returns {Function} Returns the new function. * @example * * _.map(['6', '8', '10'], _.unary(parseInt)); * // => [6, 8, 10] */ function unary(func) { return ary(func, 1); } /** * Creates a function that provides `value` to the wrapper function as its * first argument. Any additional arguments provided to the function are * appended to those provided to the wrapper function. The wrapper is invoked * with the `this` binding of the created function. * * @static * @memberOf _ * @since 0.1.0 * @category Function * @param {*} value The value to wrap. * @param {Function} [wrapper=identity] The wrapper function. * @returns {Function} Returns the new function. * @example * * var p = _.wrap(_.escape, function(func, text) { * return '

' + func(text) + '

'; * }); * * p('fred, barney, & pebbles'); * // => '

fred, barney, & pebbles

' */ function wrap(value, wrapper) { wrapper = wrapper == null ? identity : wrapper; return partial(wrapper, value); } /*------------------------------------------------------------------------*/ /** * Casts `value` as an array if it's not one. * * @static * @memberOf _ * @since 4.4.0 * @category Lang * @param {*} value The value to inspect. * @returns {Array} Returns the cast array. * @example * * _.castArray(1); * // => [1] * * _.castArray({ 'a': 1 }); * // => [{ 'a': 1 }] * * _.castArray('abc'); * // => ['abc'] * * _.castArray(null); * // => [null] * * _.castArray(undefined); * // => [undefined] * * _.castArray(); * // => [] * * var array = [1, 2, 3]; * console.log(_.castArray(array) === array); * // => true */ function castArray() { if (!arguments.length) { return []; } var value = arguments[0]; return isArray(value) ? value : [value]; } /** * Creates a shallow clone of `value`. * * **Note:** This method is loosely based on the * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm) * and supports cloning arrays, array buffers, booleans, date objects, maps, * numbers, `Object` objects, regexes, sets, strings, symbols, and typed * arrays. The own enumerable properties of `arguments` objects are cloned * as plain objects. An empty object is returned for uncloneable values such * as error objects, functions, DOM nodes, and WeakMaps. * * @static * @memberOf _ * @since 0.1.0 * @category Lang * @param {*} value The value to clone. * @returns {*} Returns the cloned value. * @example * * var objects = [{ 'a': 1 }, { 'b': 2 }]; * * var shallow = _.clone(objects); * console.log(shallow[0] === objects[0]); * // => true */ function clone(value) { return baseClone(value, false, true); } /** * This method is like `_.clone` except that it accepts `customizer` which * is invoked to produce the cloned value. If `customizer` returns `undefined`, * cloning is handled by the method instead. The `customizer` is invoked with * up to four arguments; (value [, index|key, object, stack]). * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to clone. * @param {Function} [customizer] The function to customize cloning. * @returns {*} Returns the cloned value. * @example * * function customizer(value) { * if (_.isElement(value)) { * return value.cloneNode(false); * } * } * * var el = _.cloneWith(document.body, customizer); * * console.log(el === document.body); * // => false * console.log(el.nodeName); * // => 'BODY' * console.log(el.childNodes.length); * // => 0 */ function cloneWith(value, customizer) { return baseClone(value, false, true, customizer); } /** * This method is like `_.clone` except that it recursively clones `value`. * * @static * @memberOf _ * @since 1.0.0 * @category Lang * @param {*} value The value to recursively clone. * @returns {*} Returns the deep cloned value. * @example * * var objects = [{ 'a': 1 }, { 'b': 2 }]; * * var deep = _.cloneDeep(objects); * console.log(deep[0] === objects[0]); * // => false */ function cloneDeep(value) { return baseClone(value, true, true); } /** * This method is like `_.cloneWith` except that it recursively clones `value`. * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to recursively clone. * @param {Function} [customizer] The function to customize cloning. * @returns {*} Returns the deep cloned value. * @example * * function customizer(value) { * if (_.isElement(value)) { * return value.cloneNode(true); * } * } * * var el = _.cloneDeepWith(document.body, customizer); * * console.log(el === document.body); * // => false * console.log(el.nodeName); * // => 'BODY' * console.log(el.childNodes.length); * // => 20 */ function cloneDeepWith(value, customizer) { return baseClone(value, true, true, customizer); } /** * Performs a * [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero) * comparison between two values to determine if they are equivalent. * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to compare. * @param {*} other The other value to compare. * @returns {boolean} Returns `true` if the values are equivalent, else `false`. * @example * * var object = { 'user': 'fred' }; * var other = { 'user': 'fred' }; * * _.eq(object, object); * // => true * * _.eq(object, other); * // => false * * _.eq('a', 'a'); * // => true * * _.eq('a', Object('a')); * // => false * * _.eq(NaN, NaN); * // => true */ function eq(value, other) { return value === other || (value !== value && other !== other); } /** * Checks if `value` is greater than `other`. * * @static * @memberOf _ * @since 3.9.0 * @category Lang * @param {*} value The value to compare. * @param {*} other The other value to compare. * @returns {boolean} Returns `true` if `value` is greater than `other`, * else `false`. * @example * * _.gt(3, 1); * // => true * * _.gt(3, 3); * // => false * * _.gt(1, 3); * // => false */ function gt(value, other) { return value > other; } /** * Checks if `value` is greater than or equal to `other`. * * @static * @memberOf _ * @since 3.9.0 * @category Lang * @param {*} value The value to compare. * @param {*} other The other value to compare. * @returns {boolean} Returns `true` if `value` is greater than or equal to * `other`, else `false`. * @example * * _.gte(3, 1); * // => true * * _.gte(3, 3); * // => true * * _.gte(1, 3); * // => false */ function gte(value, other) { return value >= other; } /** * Checks if `value` is likely an `arguments` object. * * @static * @memberOf _ * @since 0.1.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is correctly classified, * else `false`. * @example * * _.isArguments(function() { return arguments; }()); * // => true * * _.isArguments([1, 2, 3]); * // => false */ function isArguments(value) { // Safari 8.1 incorrectly makes `arguments.callee` enumerable in strict mode. return isArrayLikeObject(value) && hasOwnProperty.call(value, 'callee') && (!propertyIsEnumerable.call(value, 'callee') || objectToString.call(value) == argsTag); } /** * Checks if `value` is classified as an `Array` object. * * @static * @memberOf _ * @since 0.1.0 * @type {Function} * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is correctly classified, * else `false`. * @example * * _.isArray([1, 2, 3]); * // => true * * _.isArray(document.body.children); * // => false * * _.isArray('abc'); * // => false * * _.isArray(_.noop); * // => false */ var isArray = Array.isArray; /** * Checks if `value` is classified as an `ArrayBuffer` object. * * @static * @memberOf _ * @since 4.3.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is correctly classified, * else `false`. * @example * * _.isArrayBuffer(new ArrayBuffer(2)); * // => true * * _.isArrayBuffer(new Array(2)); * // => false */ function isArrayBuffer(value) { return isObjectLike(value) && objectToString.call(value) == arrayBufferTag; } /** * Checks if `value` is array-like. A value is considered array-like if it's * not a function and has a `value.length` that's an integer greater than or * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`. * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is array-like, else `false`. * @example * * _.isArrayLike([1, 2, 3]); * // => true * * _.isArrayLike(document.body.children); * // => true * * _.isArrayLike('abc'); * // => true * * _.isArrayLike(_.noop); * // => false */ function isArrayLike(value) { return value != null && isLength(getLength(value)) && !isFunction(value); } /** * This method is like `_.isArrayLike` except that it also checks if `value` * is an object. * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is an array-like object, * else `false`. * @example * * _.isArrayLikeObject([1, 2, 3]); * // => true * * _.isArrayLikeObject(document.body.children); * // => true * * _.isArrayLikeObject('abc'); * // => false * * _.isArrayLikeObject(_.noop); * // => false */ function isArrayLikeObject(value) { return isObjectLike(value) && isArrayLike(value); } /** * Checks if `value` is classified as a boolean primitive or object. * * @static * @memberOf _ * @since 0.1.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is correctly classified, * else `false`. * @example * * _.isBoolean(false); * // => true * * _.isBoolean(null); * // => false */ function isBoolean(value) { return value === true || value === false || (isObjectLike(value) && objectToString.call(value) == boolTag); } /** * Checks if `value` is a buffer. * * @static * @memberOf _ * @since 4.3.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a buffer, else `false`. * @example * * _.isBuffer(new Buffer(2)); * // => true * * _.isBuffer(new Uint8Array(2)); * // => false */ var isBuffer = !Buffer ? constant(false) : function(value) { return value instanceof Buffer; }; /** * Checks if `value` is classified as a `Date` object. * * @static * @memberOf _ * @since 0.1.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is correctly classified, * else `false`. * @example * * _.isDate(new Date); * // => true * * _.isDate('Mon April 23 2012'); * // => false */ function isDate(value) { return isObjectLike(value) && objectToString.call(value) == dateTag; } /** * Checks if `value` is likely a DOM element. * * @static * @memberOf _ * @since 0.1.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a DOM element, * else `false`. * @example * * _.isElement(document.body); * // => true * * _.isElement(''); * // => false */ function isElement(value) { return !!value && value.nodeType === 1 && isObjectLike(value) && !isPlainObject(value); } /** * Checks if `value` is an empty object, collection, map, or set. * * Objects are considered empty if they have no own enumerable string keyed * properties. * * Array-like values such as `arguments` objects, arrays, buffers, strings, or * jQuery-like collections are considered empty if they have a `length` of `0`. * Similarly, maps and sets are considered empty if they have a `size` of `0`. * * @static * @memberOf _ * @since 0.1.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is empty, else `false`. * @example * * _.isEmpty(null); * // => true * * _.isEmpty(true); * // => true * * _.isEmpty(1); * // => true * * _.isEmpty([1, 2, 3]); * // => false * * _.isEmpty({ 'a': 1 }); * // => false */ function isEmpty(value) { if (isArrayLike(value) && (isArray(value) || isString(value) || isFunction(value.splice) || isArguments(value) || isBuffer(value))) { return !value.length; } if (isObjectLike(value)) { var tag = getTag(value); if (tag == mapTag || tag == setTag) { return !value.size; } } for (var key in value) { if (hasOwnProperty.call(value, key)) { return false; } } return !(nonEnumShadows && keys(value).length); } /** * Performs a deep comparison between two values to determine if they are * equivalent. * * **Note:** This method supports comparing arrays, array buffers, booleans, * date objects, error objects, maps, numbers, `Object` objects, regexes, * sets, strings, symbols, and typed arrays. `Object` objects are compared * by their own, not inherited, enumerable properties. Functions and DOM * nodes are **not** supported. * * @static * @memberOf _ * @since 0.1.0 * @category Lang * @param {*} value The value to compare. * @param {*} other The other value to compare. * @returns {boolean} Returns `true` if the values are equivalent, * else `false`. * @example * * var object = { 'user': 'fred' }; * var other = { 'user': 'fred' }; * * _.isEqual(object, other); * // => true * * object === other; * // => false */ function isEqual(value, other) { return baseIsEqual(value, other); } /** * This method is like `_.isEqual` except that it accepts `customizer` which * is invoked to compare values. If `customizer` returns `undefined`, comparisons * are handled by the method instead. The `customizer` is invoked with up to * six arguments: (objValue, othValue [, index|key, object, other, stack]). * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to compare. * @param {*} other The other value to compare. * @param {Function} [customizer] The function to customize comparisons. * @returns {boolean} Returns `true` if the values are equivalent, * else `false`. * @example * * function isGreeting(value) { * return /^h(?:i|ello)$/.test(value); * } * * function customizer(objValue, othValue) { * if (isGreeting(objValue) && isGreeting(othValue)) { * return true; * } * } * * var array = ['hello', 'goodbye']; * var other = ['hi', 'goodbye']; * * _.isEqualWith(array, other, customizer); * // => true */ function isEqualWith(value, other, customizer) { customizer = typeof customizer == 'function' ? customizer : undefined; var result = customizer ? customizer(value, other) : undefined; return result === undefined ? baseIsEqual(value, other, customizer) : !!result; } /** * Checks if `value` is an `Error`, `EvalError`, `RangeError`, `ReferenceError`, * `SyntaxError`, `TypeError`, or `URIError` object. * * @static * @memberOf _ * @since 3.0.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is an error object, * else `false`. * @example * * _.isError(new Error); * // => true * * _.isError(Error); * // => false */ function isError(value) { if (!isObjectLike(value)) { return false; } return (objectToString.call(value) == errorTag) || (typeof value.message == 'string' && typeof value.name == 'string'); } /** * Checks if `value` is a finite primitive number. * * **Note:** This method is based on * [`Number.isFinite`](https://mdn.io/Number/isFinite). * * @static * @memberOf _ * @since 0.1.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a finite number, * else `false`. * @example * * _.isFinite(3); * // => true * * _.isFinite(Number.MAX_VALUE); * // => true * * _.isFinite(3.14); * // => true * * _.isFinite(Infinity); * // => false */ function isFinite(value) { return typeof value == 'number' && nativeIsFinite(value); } /** * Checks if `value` is classified as a `Function` object. * * @static * @memberOf _ * @since 0.1.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is correctly classified, * else `false`. * @example * * _.isFunction(_); * // => true * * _.isFunction(/abc/); * // => false */ function isFunction(value) { // The use of `Object#toString` avoids issues with the `typeof` operator // in Safari 8 which returns 'object' for typed array and weak map constructors, // and PhantomJS 1.9 which returns 'function' for `NodeList` instances. var tag = isObject(value) ? objectToString.call(value) : ''; return tag == funcTag || tag == genTag; } /** * Checks if `value` is an integer. * * **Note:** This method is based on * [`Number.isInteger`](https://mdn.io/Number/isInteger). * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is an integer, else `false`. * @example * * _.isInteger(3); * // => true * * _.isInteger(Number.MIN_VALUE); * // => false * * _.isInteger(Infinity); * // => false * * _.isInteger('3'); * // => false */ function isInteger(value) { return typeof value == 'number' && value == toInteger(value); } /** * Checks if `value` is a valid array-like length. * * **Note:** This function is loosely based on * [`ToLength`](http://ecma-international.org/ecma-262/6.0/#sec-tolength). * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a valid length, * else `false`. * @example * * _.isLength(3); * // => true * * _.isLength(Number.MIN_VALUE); * // => false * * _.isLength(Infinity); * // => false * * _.isLength('3'); * // => false */ function isLength(value) { return typeof value == 'number' && value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER; } /** * Checks if `value` is the * [language type](http://www.ecma-international.org/ecma-262/6.0/#sec-ecmascript-language-types) * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`) * * @static * @memberOf _ * @since 0.1.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is an object, else `false`. * @example * * _.isObject({}); * // => true * * _.isObject([1, 2, 3]); * // => true * * _.isObject(_.noop); * // => true * * _.isObject(null); * // => false */ function isObject(value) { var type = typeof value; return !!value && (type == 'object' || type == 'function'); } /** * Checks if `value` is object-like. A value is object-like if it's not `null` * and has a `typeof` result of "object". * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is object-like, else `false`. * @example * * _.isObjectLike({}); * // => true * * _.isObjectLike([1, 2, 3]); * // => true * * _.isObjectLike(_.noop); * // => false * * _.isObjectLike(null); * // => false */ function isObjectLike(value) { return !!value && typeof value == 'object'; } /** * Checks if `value` is classified as a `Map` object. * * @static * @memberOf _ * @since 4.3.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is correctly classified, * else `false`. * @example * * _.isMap(new Map); * // => true * * _.isMap(new WeakMap); * // => false */ function isMap(value) { return isObjectLike(value) && getTag(value) == mapTag; } /** * Performs a partial deep comparison between `object` and `source` to * determine if `object` contains equivalent property values. This method is * equivalent to a `_.matches` function when `source` is partially applied. * * **Note:** This method supports comparing the same values as `_.isEqual`. * * @static * @memberOf _ * @since 3.0.0 * @category Lang * @param {Object} object The object to inspect. * @param {Object} source The object of property values to match. * @returns {boolean} Returns `true` if `object` is a match, else `false`. * @example * * var object = { 'user': 'fred', 'age': 40 }; * * _.isMatch(object, { 'age': 40 }); * // => true * * _.isMatch(object, { 'age': 36 }); * // => false */ function isMatch(object, source) { return object === source || baseIsMatch(object, source, getMatchData(source)); } /** * This method is like `_.isMatch` except that it accepts `customizer` which * is invoked to compare values. If `customizer` returns `undefined`, comparisons * are handled by the method instead. The `customizer` is invoked with five * arguments: (objValue, srcValue, index|key, object, source). * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {Object} object The object to inspect. * @param {Object} source The object of property values to match. * @param {Function} [customizer] The function to customize comparisons. * @returns {boolean} Returns `true` if `object` is a match, else `false`. * @example * * function isGreeting(value) { * return /^h(?:i|ello)$/.test(value); * } * * function customizer(objValue, srcValue) { * if (isGreeting(objValue) && isGreeting(srcValue)) { * return true; * } * } * * var object = { 'greeting': 'hello' }; * var source = { 'greeting': 'hi' }; * * _.isMatchWith(object, source, customizer); * // => true */ function isMatchWith(object, source, customizer) { customizer = typeof customizer == 'function' ? customizer : undefined; return baseIsMatch(object, source, getMatchData(source), customizer); } /** * Checks if `value` is `NaN`. * * **Note:** This method is based on * [`Number.isNaN`](https://mdn.io/Number/isNaN) and is not the same as * global [`isNaN`](https://mdn.io/isNaN) which returns `true` for * `undefined` and other non-number values. * * @static * @memberOf _ * @since 0.1.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`. * @example * * _.isNaN(NaN); * // => true * * _.isNaN(new Number(NaN)); * // => true * * isNaN(undefined); * // => true * * _.isNaN(undefined); * // => false */ function isNaN(value) { // An `NaN` primitive is the only value that is not equal to itself. // Perform the `toStringTag` check first to avoid errors with some // ActiveX objects in IE. return isNumber(value) && value != +value; } /** * Checks if `value` is a native function. * * @static * @memberOf _ * @since 3.0.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a native function, * else `false`. * @example * * _.isNative(Array.prototype.push); * // => true * * _.isNative(_); * // => false */ function isNative(value) { if (!isObject(value)) { return false; } var pattern = (isFunction(value) || isHostObject(value)) ? reIsNative : reIsHostCtor; return pattern.test(toSource(value)); } /** * Checks if `value` is `null`. * * @static * @memberOf _ * @since 0.1.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is `null`, else `false`. * @example * * _.isNull(null); * // => true * * _.isNull(void 0); * // => false */ function isNull(value) { return value === null; } /** * Checks if `value` is `null` or `undefined`. * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is nullish, else `false`. * @example * * _.isNil(null); * // => true * * _.isNil(void 0); * // => true * * _.isNil(NaN); * // => false */ function isNil(value) { return value == null; } /** * Checks if `value` is classified as a `Number` primitive or object. * * **Note:** To exclude `Infinity`, `-Infinity`, and `NaN`, which are * classified as numbers, use the `_.isFinite` method. * * @static * @memberOf _ * @since 0.1.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is correctly classified, * else `false`. * @example * * _.isNumber(3); * // => true * * _.isNumber(Number.MIN_VALUE); * // => true * * _.isNumber(Infinity); * // => true * * _.isNumber('3'); * // => false */ function isNumber(value) { return typeof value == 'number' || (isObjectLike(value) && objectToString.call(value) == numberTag); } /** * Checks if `value` is a plain object, that is, an object created by the * `Object` constructor or one with a `[[Prototype]]` of `null`. * * @static * @memberOf _ * @since 0.8.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a plain object, * else `false`. * @example * * function Foo() { * this.a = 1; * } * * _.isPlainObject(new Foo); * // => false * * _.isPlainObject([1, 2, 3]); * // => false * * _.isPlainObject({ 'x': 0, 'y': 0 }); * // => true * * _.isPlainObject(Object.create(null)); * // => true */ function isPlainObject(value) { if (!isObjectLike(value) || objectToString.call(value) != objectTag || isHostObject(value)) { return false; } var proto = getPrototype(value); if (proto === null) { return true; } var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor; return (typeof Ctor == 'function' && Ctor instanceof Ctor && funcToString.call(Ctor) == objectCtorString); } /** * Checks if `value` is classified as a `RegExp` object. * * @static * @memberOf _ * @since 0.1.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is correctly classified, * else `false`. * @example * * _.isRegExp(/abc/); * // => true * * _.isRegExp('/abc/'); * // => false */ function isRegExp(value) { return isObject(value) && objectToString.call(value) == regexpTag; } /** * Checks if `value` is a safe integer. An integer is safe if it's an IEEE-754 * double precision number which isn't the result of a rounded unsafe integer. * * **Note:** This method is based on * [`Number.isSafeInteger`](https://mdn.io/Number/isSafeInteger). * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a safe integer, * else `false`. * @example * * _.isSafeInteger(3); * // => true * * _.isSafeInteger(Number.MIN_VALUE); * // => false * * _.isSafeInteger(Infinity); * // => false * * _.isSafeInteger('3'); * // => false */ function isSafeInteger(value) { return isInteger(value) && value >= -MAX_SAFE_INTEGER && value <= MAX_SAFE_INTEGER; } /** * Checks if `value` is classified as a `Set` object. * * @static * @memberOf _ * @since 4.3.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is correctly classified, * else `false`. * @example * * _.isSet(new Set); * // => true * * _.isSet(new WeakSet); * // => false */ function isSet(value) { return isObjectLike(value) && getTag(value) == setTag; } /** * Checks if `value` is classified as a `String` primitive or object. * * @static * @since 0.1.0 * @memberOf _ * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is correctly classified, * else `false`. * @example * * _.isString('abc'); * // => true * * _.isString(1); * // => false */ function isString(value) { return typeof value == 'string' || (!isArray(value) && isObjectLike(value) && objectToString.call(value) == stringTag); } /** * Checks if `value` is classified as a `Symbol` primitive or object. * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is correctly classified, * else `false`. * @example * * _.isSymbol(Symbol.iterator); * // => true * * _.isSymbol('abc'); * // => false */ function isSymbol(value) { return typeof value == 'symbol' || (isObjectLike(value) && objectToString.call(value) == symbolTag); } /** * Checks if `value` is classified as a typed array. * * @static * @memberOf _ * @since 3.0.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is correctly classified, * else `false`. * @example * * _.isTypedArray(new Uint8Array); * // => true * * _.isTypedArray([]); * // => false */ function isTypedArray(value) { return isObjectLike(value) && isLength(value.length) && !!typedArrayTags[objectToString.call(value)]; } /** * Checks if `value` is `undefined`. * * @static * @since 0.1.0 * @memberOf _ * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is `undefined`, else `false`. * @example * * _.isUndefined(void 0); * // => true * * _.isUndefined(null); * // => false */ function isUndefined(value) { return value === undefined; } /** * Checks if `value` is classified as a `WeakMap` object. * * @static * @memberOf _ * @since 4.3.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is correctly classified, * else `false`. * @example * * _.isWeakMap(new WeakMap); * // => true * * _.isWeakMap(new Map); * // => false */ function isWeakMap(value) { return isObjectLike(value) && getTag(value) == weakMapTag; } /** * Checks if `value` is classified as a `WeakSet` object. * * @static * @memberOf _ * @since 4.3.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is correctly classified, * else `false`. * @example * * _.isWeakSet(new WeakSet); * // => true * * _.isWeakSet(new Set); * // => false */ function isWeakSet(value) { return isObjectLike(value) && objectToString.call(value) == weakSetTag; } /** * Checks if `value` is less than `other`. * * @static * @memberOf _ * @since 3.9.0 * @category Lang * @param {*} value The value to compare. * @param {*} other The other value to compare. * @returns {boolean} Returns `true` if `value` is less than `other`, * else `false`. * @example * * _.lt(1, 3); * // => true * * _.lt(3, 3); * // => false * * _.lt(3, 1); * // => false */ function lt(value, other) { return value < other; } /** * Checks if `value` is less than or equal to `other`. * * @static * @memberOf _ * @since 3.9.0 * @category Lang * @param {*} value The value to compare. * @param {*} other The other value to compare. * @returns {boolean} Returns `true` if `value` is less than or equal to * `other`, else `false`. * @example * * _.lte(1, 3); * // => true * * _.lte(3, 3); * // => true * * _.lte(3, 1); * // => false */ function lte(value, other) { return value <= other; } /** * Converts `value` to an array. * * @static * @since 0.1.0 * @memberOf _ * @category Lang * @param {*} value The value to convert. * @returns {Array} Returns the converted array. * @example * * _.toArray({ 'a': 1, 'b': 2 }); * // => [1, 2] * * _.toArray('abc'); * // => ['a', 'b', 'c'] * * _.toArray(1); * // => [] * * _.toArray(null); * // => [] */ function toArray(value) { if (!value) { return []; } if (isArrayLike(value)) { return isString(value) ? stringToArray(value) : copyArray(value); } if (iteratorSymbol && value[iteratorSymbol]) { return iteratorToArray(value[iteratorSymbol]()); } var tag = getTag(value), func = tag == mapTag ? mapToArray : (tag == setTag ? setToArray : values); return func(value); } /** * Converts `value` to an integer. * * **Note:** This function is loosely based on * [`ToInteger`](http://www.ecma-international.org/ecma-262/6.0/#sec-tointeger). * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to convert. * @returns {number} Returns the converted integer. * @example * * _.toInteger(3); * // => 3 * * _.toInteger(Number.MIN_VALUE); * // => 0 * * _.toInteger(Infinity); * // => 1.7976931348623157e+308 * * _.toInteger('3'); * // => 3 */ function toInteger(value) { if (!value) { return value === 0 ? value : 0; } value = toNumber(value); if (value === INFINITY || value === -INFINITY) { var sign = (value < 0 ? -1 : 1); return sign * MAX_INTEGER; } var remainder = value % 1; return value === value ? (remainder ? value - remainder : value) : 0; } /** * Converts `value` to an integer suitable for use as the length of an * array-like object. * * **Note:** This method is based on * [`ToLength`](http://ecma-international.org/ecma-262/6.0/#sec-tolength). * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to convert. * @returns {number} Returns the converted integer. * @example * * _.toLength(3); * // => 3 * * _.toLength(Number.MIN_VALUE); * // => 0 * * _.toLength(Infinity); * // => 4294967295 * * _.toLength('3'); * // => 3 */ function toLength(value) { return value ? baseClamp(toInteger(value), 0, MAX_ARRAY_LENGTH) : 0; } /** * Converts `value` to a number. * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to process. * @returns {number} Returns the number. * @example * * _.toNumber(3); * // => 3 * * _.toNumber(Number.MIN_VALUE); * // => 5e-324 * * _.toNumber(Infinity); * // => Infinity * * _.toNumber('3'); * // => 3 */ function toNumber(value) { if (typeof value == 'number') { return value; } if (isSymbol(value)) { return NAN; } if (isObject(value)) { var other = isFunction(value.valueOf) ? value.valueOf() : value; value = isObject(other) ? (other + '') : other; } if (typeof value != 'string') { return value === 0 ? value : +value; } value = value.replace(reTrim, ''); var isBinary = reIsBinary.test(value); return (isBinary || reIsOctal.test(value)) ? freeParseInt(value.slice(2), isBinary ? 2 : 8) : (reIsBadHex.test(value) ? NAN : +value); } /** * Converts `value` to a plain object flattening inherited enumerable string * keyed properties of `value` to own properties of the plain object. * * @static * @memberOf _ * @since 3.0.0 * @category Lang * @param {*} value The value to convert. * @returns {Object} Returns the converted plain object. * @example * * function Foo() { * this.b = 2; * } * * Foo.prototype.c = 3; * * _.assign({ 'a': 1 }, new Foo); * // => { 'a': 1, 'b': 2 } * * _.assign({ 'a': 1 }, _.toPlainObject(new Foo)); * // => { 'a': 1, 'b': 2, 'c': 3 } */ function toPlainObject(value) { return copyObject(value, keysIn(value)); } /** * Converts `value` to a safe integer. A safe integer can be compared and * represented correctly. * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to convert. * @returns {number} Returns the converted integer. * @example * * _.toSafeInteger(3); * // => 3 * * _.toSafeInteger(Number.MIN_VALUE); * // => 0 * * _.toSafeInteger(Infinity); * // => 9007199254740991 * * _.toSafeInteger('3'); * // => 3 */ function toSafeInteger(value) { return baseClamp(toInteger(value), -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER); } /** * Converts `value` to a string. An empty string is returned for `null` * and `undefined` values. The sign of `-0` is preserved. * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to process. * @returns {string} Returns the string. * @example * * _.toString(null); * // => '' * * _.toString(-0); * // => '-0' * * _.toString([1, 2, 3]); * // => '1,2,3' */ function toString(value) { // Exit early for strings to avoid a performance hit in some environments. if (typeof value == 'string') { return value; } if (value == null) { return ''; } if (isSymbol(value)) { return symbolToString ? symbolToString.call(value) : ''; } var result = (value + ''); return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result; } /*------------------------------------------------------------------------*/ /** * Assigns own enumerable string keyed properties of source objects to the * destination object. Source objects are applied from left to right. * Subsequent sources overwrite property assignments of previous sources. * * **Note:** This method mutates `object` and is loosely based on * [`Object.assign`](https://mdn.io/Object/assign). * * @static * @memberOf _ * @since 0.10.0 * @category Object * @param {Object} object The destination object. * @param {...Object} [sources] The source objects. * @returns {Object} Returns `object`. * @example * * function Foo() { * this.c = 3; * } * * function Bar() { * this.e = 5; * } * * Foo.prototype.d = 4; * Bar.prototype.f = 6; * * _.assign({ 'a': 1 }, new Foo, new Bar); * // => { 'a': 1, 'c': 3, 'e': 5 } */ var assign = createAssigner(function(object, source) { if (nonEnumShadows || isPrototype(source) || isArrayLike(source)) { copyObject(source, keys(source), object); return; } for (var key in source) { if (hasOwnProperty.call(source, key)) { assignValue(object, key, source[key]); } } }); /** * This method is like `_.assign` except that it iterates over own and * inherited source properties. * * **Note:** This method mutates `object`. * * @static * @memberOf _ * @since 4.0.0 * @alias extend * @category Object * @param {Object} object The destination object. * @param {...Object} [sources] The source objects. * @returns {Object} Returns `object`. * @example * * function Foo() { * this.b = 2; * } * * function Bar() { * this.d = 4; * } * * Foo.prototype.c = 3; * Bar.prototype.e = 5; * * _.assignIn({ 'a': 1 }, new Foo, new Bar); * // => { 'a': 1, 'b': 2, 'c': 3, 'd': 4, 'e': 5 } */ var assignIn = createAssigner(function(object, source) { if (nonEnumShadows || isPrototype(source) || isArrayLike(source)) { copyObject(source, keysIn(source), object); return; } for (var key in source) { assignValue(object, key, source[key]); } }); /** * This method is like `_.assignIn` except that it accepts `customizer` * which is invoked to produce the assigned values. If `customizer` returns * `undefined`, assignment is handled by the method instead. The `customizer` * is invoked with five arguments: (objValue, srcValue, key, object, source). * * **Note:** This method mutates `object`. * * @static * @memberOf _ * @since 4.0.0 * @alias extendWith * @category Object * @param {Object} object The destination object. * @param {...Object} sources The source objects. * @param {Function} [customizer] The function to customize assigned values. * @returns {Object} Returns `object`. * @example * * function customizer(objValue, srcValue) { * return _.isUndefined(objValue) ? srcValue : objValue; * } * * var defaults = _.partialRight(_.assignInWith, customizer); * * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 }); * // => { 'a': 1, 'b': 2 } */ var assignInWith = createAssigner(function(object, source, srcIndex, customizer) { copyObject(source, keysIn(source), object, customizer); }); /** * This method is like `_.assign` except that it accepts `customizer` * which is invoked to produce the assigned values. If `customizer` returns * `undefined`, assignment is handled by the method instead. The `customizer` * is invoked with five arguments: (objValue, srcValue, key, object, source). * * **Note:** This method mutates `object`. * * @static * @memberOf _ * @since 4.0.0 * @category Object * @param {Object} object The destination object. * @param {...Object} sources The source objects. * @param {Function} [customizer] The function to customize assigned values. * @returns {Object} Returns `object`. * @example * * function customizer(objValue, srcValue) { * return _.isUndefined(objValue) ? srcValue : objValue; * } * * var defaults = _.partialRight(_.assignWith, customizer); * * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 }); * // => { 'a': 1, 'b': 2 } */ var assignWith = createAssigner(function(object, source, srcIndex, customizer) { copyObject(source, keys(source), object, customizer); }); /** * Creates an array of values corresponding to `paths` of `object`. * * @static * @memberOf _ * @since 1.0.0 * @category Object * @param {Object} object The object to iterate over. * @param {...(string|string[])} [paths] The property paths of elements to pick. * @returns {Array} Returns the new array of picked elements. * @example * * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] }; * * _.at(object, ['a[0].b.c', 'a[1]']); * // => [3, 4] * * _.at(['a', 'b', 'c'], 0, 2); * // => ['a', 'c'] */ var at = rest(function(object, paths) { return baseAt(object, baseFlatten(paths, 1)); }); /** * Creates an object that inherits from the `prototype` object. If a * `properties` object is given, its own enumerable string keyed properties * are assigned to the created object. * * @static * @memberOf _ * @since 2.3.0 * @category Object * @param {Object} prototype The object to inherit from. * @param {Object} [properties] The properties to assign to the object. * @returns {Object} Returns the new object. * @example * * function Shape() { * this.x = 0; * this.y = 0; * } * * function Circle() { * Shape.call(this); * } * * Circle.prototype = _.create(Shape.prototype, { * 'constructor': Circle * }); * * var circle = new Circle; * circle instanceof Circle; * // => true * * circle instanceof Shape; * // => true */ function create(prototype, properties) { var result = baseCreate(prototype); return properties ? baseAssign(result, properties) : result; } /** * Assigns own and inherited enumerable string keyed properties of source * objects to the destination object for all destination properties that * resolve to `undefined`. Source objects are applied from left to right. * Once a property is set, additional values of the same property are ignored. * * **Note:** This method mutates `object`. * * @static * @since 0.1.0 * @memberOf _ * @category Object * @param {Object} object The destination object. * @param {...Object} [sources] The source objects. * @returns {Object} Returns `object`. * @example * * _.defaults({ 'user': 'barney' }, { 'age': 36 }, { 'user': 'fred' }); * // => { 'user': 'barney', 'age': 36 } */ var defaults = rest(function(args) { args.push(undefined, assignInDefaults); return apply(assignInWith, undefined, args); }); /** * This method is like `_.defaults` except that it recursively assigns * default properties. * * **Note:** This method mutates `object`. * * @static * @memberOf _ * @since 3.10.0 * @category Object * @param {Object} object The destination object. * @param {...Object} [sources] The source objects. * @returns {Object} Returns `object`. * @example * * _.defaultsDeep({ 'user': { 'name': 'barney' } }, { 'user': { 'name': 'fred', 'age': 36 } }); * // => { 'user': { 'name': 'barney', 'age': 36 } } * */ var defaultsDeep = rest(function(args) { args.push(undefined, mergeDefaults); return apply(mergeWith, undefined, args); }); /** * This method is like `_.find` except that it returns the key of the first * element `predicate` returns truthy for instead of the element itself. * * @static * @memberOf _ * @since 1.1.0 * @category Object * @param {Object} object The object to search. * @param {Array|Function|Object|string} [predicate=_.identity] * The function invoked per iteration. * @returns {string|undefined} Returns the key of the matched element, * else `undefined`. * @example * * var users = { * 'barney': { 'age': 36, 'active': true }, * 'fred': { 'age': 40, 'active': false }, * 'pebbles': { 'age': 1, 'active': true } * }; * * _.findKey(users, function(o) { return o.age < 40; }); * // => 'barney' (iteration order is not guaranteed) * * // The `_.matches` iteratee shorthand. * _.findKey(users, { 'age': 1, 'active': true }); * // => 'pebbles' * * // The `_.matchesProperty` iteratee shorthand. * _.findKey(users, ['active', false]); * // => 'fred' * * // The `_.property` iteratee shorthand. * _.findKey(users, 'active'); * // => 'barney' */ function findKey(object, predicate) { return baseFind(object, getIteratee(predicate, 3), baseForOwn, true); } /** * This method is like `_.findKey` except that it iterates over elements of * a collection in the opposite order. * * @static * @memberOf _ * @since 2.0.0 * @category Object * @param {Object} object The object to search. * @param {Array|Function|Object|string} [predicate=_.identity] * The function invoked per iteration. * @returns {string|undefined} Returns the key of the matched element, * else `undefined`. * @example * * var users = { * 'barney': { 'age': 36, 'active': true }, * 'fred': { 'age': 40, 'active': false }, * 'pebbles': { 'age': 1, 'active': true } * }; * * _.findLastKey(users, function(o) { return o.age < 40; }); * // => returns 'pebbles' assuming `_.findKey` returns 'barney' * * // The `_.matches` iteratee shorthand. * _.findLastKey(users, { 'age': 36, 'active': true }); * // => 'barney' * * // The `_.matchesProperty` iteratee shorthand. * _.findLastKey(users, ['active', false]); * // => 'fred' * * // The `_.property` iteratee shorthand. * _.findLastKey(users, 'active'); * // => 'pebbles' */ function findLastKey(object, predicate) { return baseFind(object, getIteratee(predicate, 3), baseForOwnRight, true); } /** * Iterates over own and inherited enumerable string keyed properties of an * object and invokes `iteratee` for each property. The iteratee is invoked * with three arguments: (value, key, object). Iteratee functions may exit * iteration early by explicitly returning `false`. * * @static * @memberOf _ * @since 0.3.0 * @category Object * @param {Object} object The object to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @returns {Object} Returns `object`. * @example * * function Foo() { * this.a = 1; * this.b = 2; * } * * Foo.prototype.c = 3; * * _.forIn(new Foo, function(value, key) { * console.log(key); * }); * // => Logs 'a', 'b', then 'c' (iteration order is not guaranteed). */ function forIn(object, iteratee) { return object == null ? object : baseFor(object, getIteratee(iteratee), keysIn); } /** * This method is like `_.forIn` except that it iterates over properties of * `object` in the opposite order. * * @static * @memberOf _ * @since 2.0.0 * @category Object * @param {Object} object The object to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @returns {Object} Returns `object`. * @example * * function Foo() { * this.a = 1; * this.b = 2; * } * * Foo.prototype.c = 3; * * _.forInRight(new Foo, function(value, key) { * console.log(key); * }); * // => Logs 'c', 'b', then 'a' assuming `_.forIn` logs 'a', 'b', then 'c'. */ function forInRight(object, iteratee) { return object == null ? object : baseForRight(object, getIteratee(iteratee), keysIn); } /** * Iterates over own enumerable string keyed properties of an object and * invokes `iteratee` for each property. The iteratee is invoked with three * arguments: (value, key, object). Iteratee functions may exit iteration * early by explicitly returning `false`. * * @static * @memberOf _ * @since 0.3.0 * @category Object * @param {Object} object The object to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @returns {Object} Returns `object`. * @example * * function Foo() { * this.a = 1; * this.b = 2; * } * * Foo.prototype.c = 3; * * _.forOwn(new Foo, function(value, key) { * console.log(key); * }); * // => Logs 'a' then 'b' (iteration order is not guaranteed). */ function forOwn(object, iteratee) { return object && baseForOwn(object, getIteratee(iteratee)); } /** * This method is like `_.forOwn` except that it iterates over properties of * `object` in the opposite order. * * @static * @memberOf _ * @since 2.0.0 * @category Object * @param {Object} object The object to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @returns {Object} Returns `object`. * @example * * function Foo() { * this.a = 1; * this.b = 2; * } * * Foo.prototype.c = 3; * * _.forOwnRight(new Foo, function(value, key) { * console.log(key); * }); * // => Logs 'b' then 'a' assuming `_.forOwn` logs 'a' then 'b'. */ function forOwnRight(object, iteratee) { return object && baseForOwnRight(object, getIteratee(iteratee)); } /** * Creates an array of function property names from own enumerable properties * of `object`. * * @static * @since 0.1.0 * @memberOf _ * @category Object * @param {Object} object The object to inspect. * @returns {Array} Returns the new array of property names. * @example * * function Foo() { * this.a = _.constant('a'); * this.b = _.constant('b'); * } * * Foo.prototype.c = _.constant('c'); * * _.functions(new Foo); * // => ['a', 'b'] */ function functions(object) { return object == null ? [] : baseFunctions(object, keys(object)); } /** * Creates an array of function property names from own and inherited * enumerable properties of `object`. * * @static * @memberOf _ * @since 4.0.0 * @category Object * @param {Object} object The object to inspect. * @returns {Array} Returns the new array of property names. * @example * * function Foo() { * this.a = _.constant('a'); * this.b = _.constant('b'); * } * * Foo.prototype.c = _.constant('c'); * * _.functionsIn(new Foo); * // => ['a', 'b', 'c'] */ function functionsIn(object) { return object == null ? [] : baseFunctions(object, keysIn(object)); } /** * Gets the value at `path` of `object`. If the resolved value is * `undefined`, the `defaultValue` is used in its place. * * @static * @memberOf _ * @since 3.7.0 * @category Object * @param {Object} object The object to query. * @param {Array|string} path The path of the property to get. * @param {*} [defaultValue] The value returned for `undefined` resolved values. * @returns {*} Returns the resolved value. * @example * * var object = { 'a': [{ 'b': { 'c': 3 } }] }; * * _.get(object, 'a[0].b.c'); * // => 3 * * _.get(object, ['a', '0', 'b', 'c']); * // => 3 * * _.get(object, 'a.b.c', 'default'); * // => 'default' */ function get(object, path, defaultValue) { var result = object == null ? undefined : baseGet(object, path); return result === undefined ? defaultValue : result; } /** * Checks if `path` is a direct property of `object`. * * @static * @since 0.1.0 * @memberOf _ * @category Object * @param {Object} object The object to query. * @param {Array|string} path The path to check. * @returns {boolean} Returns `true` if `path` exists, else `false`. * @example * * var object = { 'a': { 'b': 2 } }; * var other = _.create({ 'a': _.create({ 'b': 2 }) }); * * _.has(object, 'a'); * // => true * * _.has(object, 'a.b'); * // => true * * _.has(object, ['a', 'b']); * // => true * * _.has(other, 'a'); * // => false */ function has(object, path) { return object != null && hasPath(object, path, baseHas); } /** * Checks if `path` is a direct or inherited property of `object`. * * @static * @memberOf _ * @since 4.0.0 * @category Object * @param {Object} object The object to query. * @param {Array|string} path The path to check. * @returns {boolean} Returns `true` if `path` exists, else `false`. * @example * * var object = _.create({ 'a': _.create({ 'b': 2 }) }); * * _.hasIn(object, 'a'); * // => true * * _.hasIn(object, 'a.b'); * // => true * * _.hasIn(object, ['a', 'b']); * // => true * * _.hasIn(object, 'b'); * // => false */ function hasIn(object, path) { return object != null && hasPath(object, path, baseHasIn); } /** * Creates an object composed of the inverted keys and values of `object`. * If `object` contains duplicate values, subsequent values overwrite * property assignments of previous values. * * @static * @memberOf _ * @since 0.7.0 * @category Object * @param {Object} object The object to invert. * @returns {Object} Returns the new inverted object. * @example * * var object = { 'a': 1, 'b': 2, 'c': 1 }; * * _.invert(object); * // => { '1': 'c', '2': 'b' } */ var invert = createInverter(function(result, value, key) { result[value] = key; }, constant(identity)); /** * This method is like `_.invert` except that the inverted object is generated * from the results of running each element of `object` thru `iteratee`. The * corresponding inverted value of each inverted key is an array of keys * responsible for generating the inverted value. The iteratee is invoked * with one argument: (value). * * @static * @memberOf _ * @since 4.1.0 * @category Object * @param {Object} object The object to invert. * @param {Array|Function|Object|string} [iteratee=_.identity] * The iteratee invoked per element. * @returns {Object} Returns the new inverted object. * @example * * var object = { 'a': 1, 'b': 2, 'c': 1 }; * * _.invertBy(object); * // => { '1': ['a', 'c'], '2': ['b'] } * * _.invertBy(object, function(value) { * return 'group' + value; * }); * // => { 'group1': ['a', 'c'], 'group2': ['b'] } */ var invertBy = createInverter(function(result, value, key) { if (hasOwnProperty.call(result, value)) { result[value].push(key); } else { result[value] = [key]; } }, getIteratee); /** * Invokes the method at `path` of `object`. * * @static * @memberOf _ * @since 4.0.0 * @category Object * @param {Object} object The object to query. * @param {Array|string} path The path of the method to invoke. * @param {...*} [args] The arguments to invoke the method with. * @returns {*} Returns the result of the invoked method. * @example * * var object = { 'a': [{ 'b': { 'c': [1, 2, 3, 4] } }] }; * * _.invoke(object, 'a[0].b.c.slice', 1, 3); * // => [2, 3] */ var invoke = rest(baseInvoke); /** * Creates an array of the own enumerable property names of `object`. * * **Note:** Non-object values are coerced to objects. See the * [ES spec](http://ecma-international.org/ecma-262/6.0/#sec-object.keys) * for more details. * * @static * @since 0.1.0 * @memberOf _ * @category Object * @param {Object} object The object to query. * @returns {Array} Returns the array of property names. * @example * * function Foo() { * this.a = 1; * this.b = 2; * } * * Foo.prototype.c = 3; * * _.keys(new Foo); * // => ['a', 'b'] (iteration order is not guaranteed) * * _.keys('hi'); * // => ['0', '1'] */ function keys(object) { var isProto = isPrototype(object); if (!(isProto || isArrayLike(object))) { return baseKeys(object); } var indexes = indexKeys(object), skipIndexes = !!indexes, result = indexes || [], length = result.length; for (var key in object) { if (baseHas(object, key) && !(skipIndexes && (key == 'length' || isIndex(key, length))) && !(isProto && key == 'constructor')) { result.push(key); } } return result; } /** * Creates an array of the own and inherited enumerable property names of `object`. * * **Note:** Non-object values are coerced to objects. * * @static * @memberOf _ * @since 3.0.0 * @category Object * @param {Object} object The object to query. * @returns {Array} Returns the array of property names. * @example * * function Foo() { * this.a = 1; * this.b = 2; * } * * Foo.prototype.c = 3; * * _.keysIn(new Foo); * // => ['a', 'b', 'c'] (iteration order is not guaranteed) */ function keysIn(object) { var index = -1, isProto = isPrototype(object), props = baseKeysIn(object), propsLength = props.length, indexes = indexKeys(object), skipIndexes = !!indexes, result = indexes || [], length = result.length; while (++index < propsLength) { var key = props[index]; if (!(skipIndexes && (key == 'length' || isIndex(key, length))) && !(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) { result.push(key); } } return result; } /** * The opposite of `_.mapValues`; this method creates an object with the * same values as `object` and keys generated by running each own enumerable * string keyed property of `object` thru `iteratee`. The iteratee is invoked * with three arguments: (value, key, object). * * @static * @memberOf _ * @since 3.8.0 * @category Object * @param {Object} object The object to iterate over. * @param {Array|Function|Object|string} [iteratee=_.identity] * The function invoked per iteration. * @returns {Object} Returns the new mapped object. * @example * * _.mapKeys({ 'a': 1, 'b': 2 }, function(value, key) { * return key + value; * }); * // => { 'a1': 1, 'b2': 2 } */ function mapKeys(object, iteratee) { var result = {}; iteratee = getIteratee(iteratee, 3); baseForOwn(object, function(value, key, object) { result[iteratee(value, key, object)] = value; }); return result; } /** * Creates an object with the same keys as `object` and values generated * by running each own enumerable string keyed property of `object` thru * `iteratee`. The iteratee is invoked with three arguments: * (value, key, object). * * @static * @memberOf _ * @since 2.4.0 * @category Object * @param {Object} object The object to iterate over. * @param {Array|Function|Object|string} [iteratee=_.identity] * The function invoked per iteration. * @returns {Object} Returns the new mapped object. * @example * * var users = { * 'fred': { 'user': 'fred', 'age': 40 }, * 'pebbles': { 'user': 'pebbles', 'age': 1 } * }; * * _.mapValues(users, function(o) { return o.age; }); * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed) * * // The `_.property` iteratee shorthand. * _.mapValues(users, 'age'); * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed) */ function mapValues(object, iteratee) { var result = {}; iteratee = getIteratee(iteratee, 3); baseForOwn(object, function(value, key, object) { result[key] = iteratee(value, key, object); }); return result; } /** * This method is like `_.assign` except that it recursively merges own and * inherited enumerable string keyed properties of source objects into the * destination object. Source properties that resolve to `undefined` are * skipped if a destination value exists. Array and plain object properties * are merged recursively.Other objects and value types are overridden by * assignment. Source objects are applied from left to right. Subsequent * sources overwrite property assignments of previous sources. * * **Note:** This method mutates `object`. * * @static * @memberOf _ * @since 0.5.0 * @category Object * @param {Object} object The destination object. * @param {...Object} [sources] The source objects. * @returns {Object} Returns `object`. * @example * * var users = { * 'data': [{ 'user': 'barney' }, { 'user': 'fred' }] * }; * * var ages = { * 'data': [{ 'age': 36 }, { 'age': 40 }] * }; * * _.merge(users, ages); * // => { 'data': [{ 'user': 'barney', 'age': 36 }, { 'user': 'fred', 'age': 40 }] } */ var merge = createAssigner(function(object, source, srcIndex) { baseMerge(object, source, srcIndex); }); /** * This method is like `_.merge` except that it accepts `customizer` which * is invoked to produce the merged values of the destination and source * properties. If `customizer` returns `undefined`, merging is handled by the * method instead. The `customizer` is invoked with seven arguments: * (objValue, srcValue, key, object, source, stack). * * **Note:** This method mutates `object`. * * @static * @memberOf _ * @since 4.0.0 * @category Object * @param {Object} object The destination object. * @param {...Object} sources The source objects. * @param {Function} customizer The function to customize assigned values. * @returns {Object} Returns `object`. * @example * * function customizer(objValue, srcValue) { * if (_.isArray(objValue)) { * return objValue.concat(srcValue); * } * } * * var object = { * 'fruits': ['apple'], * 'vegetables': ['beet'] * }; * * var other = { * 'fruits': ['banana'], * 'vegetables': ['carrot'] * }; * * _.mergeWith(object, other, customizer); * // => { 'fruits': ['apple', 'banana'], 'vegetables': ['beet', 'carrot'] } */ var mergeWith = createAssigner(function(object, source, srcIndex, customizer) { baseMerge(object, source, srcIndex, customizer); }); /** * The opposite of `_.pick`; this method creates an object composed of the * own and inherited enumerable string keyed properties of `object` that are * not omitted. * * @static * @since 0.1.0 * @memberOf _ * @category Object * @param {Object} object The source object. * @param {...(string|string[])} [props] The property identifiers to omit. * @returns {Object} Returns the new object. * @example * * var object = { 'a': 1, 'b': '2', 'c': 3 }; * * _.omit(object, ['a', 'c']); * // => { 'b': '2' } */ var omit = rest(function(object, props) { if (object == null) { return {}; } props = arrayMap(baseFlatten(props, 1), toKey); return basePick(object, baseDifference(getAllKeysIn(object), props)); }); /** * The opposite of `_.pickBy`; this method creates an object composed of * the own and inherited enumerable string keyed properties of `object` that * `predicate` doesn't return truthy for. The predicate is invoked with two * arguments: (value, key). * * @static * @memberOf _ * @since 4.0.0 * @category Object * @param {Object} object The source object. * @param {Array|Function|Object|string} [predicate=_.identity] * The function invoked per property. * @returns {Object} Returns the new object. * @example * * var object = { 'a': 1, 'b': '2', 'c': 3 }; * * _.omitBy(object, _.isNumber); * // => { 'b': '2' } */ function omitBy(object, predicate) { predicate = getIteratee(predicate); return basePickBy(object, function(value, key) { return !predicate(value, key); }); } /** * Creates an object composed of the picked `object` properties. * * @static * @since 0.1.0 * @memberOf _ * @category Object * @param {Object} object The source object. * @param {...(string|string[])} [props] The property identifiers to pick. * @returns {Object} Returns the new object. * @example * * var object = { 'a': 1, 'b': '2', 'c': 3 }; * * _.pick(object, ['a', 'c']); * // => { 'a': 1, 'c': 3 } */ var pick = rest(function(object, props) { return object == null ? {} : basePick(object, baseFlatten(props, 1)); }); /** * Creates an object composed of the `object` properties `predicate` returns * truthy for. The predicate is invoked with two arguments: (value, key). * * @static * @memberOf _ * @since 4.0.0 * @category Object * @param {Object} object The source object. * @param {Array|Function|Object|string} [predicate=_.identity] * The function invoked per property. * @returns {Object} Returns the new object. * @example * * var object = { 'a': 1, 'b': '2', 'c': 3 }; * * _.pickBy(object, _.isNumber); * // => { 'a': 1, 'c': 3 } */ function pickBy(object, predicate) { return object == null ? {} : basePickBy(object, getIteratee(predicate)); } /** * This method is like `_.get` except that if the resolved value is a * function it's invoked with the `this` binding of its parent object and * its result is returned. * * @static * @since 0.1.0 * @memberOf _ * @category Object * @param {Object} object The object to query. * @param {Array|string} path The path of the property to resolve. * @param {*} [defaultValue] The value returned for `undefined` resolved values. * @returns {*} Returns the resolved value. * @example * * var object = { 'a': [{ 'b': { 'c1': 3, 'c2': _.constant(4) } }] }; * * _.result(object, 'a[0].b.c1'); * // => 3 * * _.result(object, 'a[0].b.c2'); * // => 4 * * _.result(object, 'a[0].b.c3', 'default'); * // => 'default' * * _.result(object, 'a[0].b.c3', _.constant('default')); * // => 'default' */ function result(object, path, defaultValue) { path = isKey(path, object) ? [path] : castPath(path); var index = -1, length = path.length; // Ensure the loop is entered when path is empty. if (!length) { object = undefined; length = 1; } while (++index < length) { var value = object == null ? undefined : object[path[index]]; if (value === undefined) { index = length; value = defaultValue; } object = isFunction(value) ? value.call(object) : value; } return object; } /** * Sets the value at `path` of `object`. If a portion of `path` doesn't exist, * it's created. Arrays are created for missing index properties while objects * are created for all other missing properties. Use `_.setWith` to customize * `path` creation. * * **Note:** This method mutates `object`. * * @static * @memberOf _ * @since 3.7.0 * @category Object * @param {Object} object The object to modify. * @param {Array|string} path The path of the property to set. * @param {*} value The value to set. * @returns {Object} Returns `object`. * @example * * var object = { 'a': [{ 'b': { 'c': 3 } }] }; * * _.set(object, 'a[0].b.c', 4); * console.log(object.a[0].b.c); * // => 4 * * _.set(object, ['x', '0', 'y', 'z'], 5); * console.log(object.x[0].y.z); * // => 5 */ function set(object, path, value) { return object == null ? object : baseSet(object, path, value); } /** * This method is like `_.set` except that it accepts `customizer` which is * invoked to produce the objects of `path`. If `customizer` returns `undefined` * path creation is handled by the method instead. The `customizer` is invoked * with three arguments: (nsValue, key, nsObject). * * **Note:** This method mutates `object`. * * @static * @memberOf _ * @since 4.0.0 * @category Object * @param {Object} object The object to modify. * @param {Array|string} path The path of the property to set. * @param {*} value The value to set. * @param {Function} [customizer] The function to customize assigned values. * @returns {Object} Returns `object`. * @example * * var object = {}; * * _.setWith(object, '[0][1]', 'a', Object); * // => { '0': { '1': 'a' } } */ function setWith(object, path, value, customizer) { customizer = typeof customizer == 'function' ? customizer : undefined; return object == null ? object : baseSet(object, path, value, customizer); } /** * Creates an array of own enumerable string keyed-value pairs for `object` * which can be consumed by `_.fromPairs`. * * @static * @memberOf _ * @since 4.0.0 * @alias entries * @category Object * @param {Object} object The object to query. * @returns {Array} Returns the new array of key-value pairs. * @example * * function Foo() { * this.a = 1; * this.b = 2; * } * * Foo.prototype.c = 3; * * _.toPairs(new Foo); * // => [['a', 1], ['b', 2]] (iteration order is not guaranteed) */ function toPairs(object) { return baseToPairs(object, keys(object)); } /** * Creates an array of own and inherited enumerable string keyed-value pairs * for `object` which can be consumed by `_.fromPairs`. * * @static * @memberOf _ * @since 4.0.0 * @alias entriesIn * @category Object * @param {Object} object The object to query. * @returns {Array} Returns the new array of key-value pairs. * @example * * function Foo() { * this.a = 1; * this.b = 2; * } * * Foo.prototype.c = 3; * * _.toPairsIn(new Foo); * // => [['a', 1], ['b', 2], ['c', 1]] (iteration order is not guaranteed) */ function toPairsIn(object) { return baseToPairs(object, keysIn(object)); } /** * An alternative to `_.reduce`; this method transforms `object` to a new * `accumulator` object which is the result of running each of its own * enumerable string keyed properties thru `iteratee`, with each invocation * potentially mutating the `accumulator` object. The iteratee is invoked * with four arguments: (accumulator, value, key, object). Iteratee functions * may exit iteration early by explicitly returning `false`. * * @static * @memberOf _ * @since 1.3.0 * @category Object * @param {Array|Object} object The object to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @param {*} [accumulator] The custom accumulator value. * @returns {*} Returns the accumulated value. * @example * * _.transform([2, 3, 4], function(result, n) { * result.push(n *= n); * return n % 2 == 0; * }, []); * // => [4, 9] * * _.transform({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) { * (result[value] || (result[value] = [])).push(key); * }, {}); * // => { '1': ['a', 'c'], '2': ['b'] } */ function transform(object, iteratee, accumulator) { var isArr = isArray(object) || isTypedArray(object); iteratee = getIteratee(iteratee, 4); if (accumulator == null) { if (isArr || isObject(object)) { var Ctor = object.constructor; if (isArr) { accumulator = isArray(object) ? new Ctor : []; } else { accumulator = isFunction(Ctor) ? baseCreate(getPrototype(object)) : {}; } } else { accumulator = {}; } } (isArr ? arrayEach : baseForOwn)(object, function(value, index, object) { return iteratee(accumulator, value, index, object); }); return accumulator; } /** * Removes the property at `path` of `object`. * * **Note:** This method mutates `object`. * * @static * @memberOf _ * @since 4.0.0 * @category Object * @param {Object} object The object to modify. * @param {Array|string} path The path of the property to unset. * @returns {boolean} Returns `true` if the property is deleted, else `false`. * @example * * var object = { 'a': [{ 'b': { 'c': 7 } }] }; * _.unset(object, 'a[0].b.c'); * // => true * * console.log(object); * // => { 'a': [{ 'b': {} }] }; * * _.unset(object, ['a', '0', 'b', 'c']); * // => true * * console.log(object); * // => { 'a': [{ 'b': {} }] }; */ function unset(object, path) { return object == null ? true : baseUnset(object, path); } /** * This method is like `_.set` except that accepts `updater` to produce the * value to set. Use `_.updateWith` to customize `path` creation. The `updater` * is invoked with one argument: (value). * * **Note:** This method mutates `object`. * * @static * @memberOf _ * @since 4.6.0 * @category Object * @param {Object} object The object to modify. * @param {Array|string} path The path of the property to set. * @param {Function} updater The function to produce the updated value. * @returns {Object} Returns `object`. * @example * * var object = { 'a': [{ 'b': { 'c': 3 } }] }; * * _.update(object, 'a[0].b.c', function(n) { return n * n; }); * console.log(object.a[0].b.c); * // => 9 * * _.update(object, 'x[0].y.z', function(n) { return n ? n + 1 : 0; }); * console.log(object.x[0].y.z); * // => 0 */ function update(object, path, updater) { return object == null ? object : baseUpdate(object, path, castFunction(updater)); } /** * This method is like `_.update` except that it accepts `customizer` which is * invoked to produce the objects of `path`. If `customizer` returns `undefined` * path creation is handled by the method instead. The `customizer` is invoked * with three arguments: (nsValue, key, nsObject). * * **Note:** This method mutates `object`. * * @static * @memberOf _ * @since 4.6.0 * @category Object * @param {Object} object The object to modify. * @param {Array|string} path The path of the property to set. * @param {Function} updater The function to produce the updated value. * @param {Function} [customizer] The function to customize assigned values. * @returns {Object} Returns `object`. * @example * * var object = {}; * * _.updateWith(object, '[0][1]', _.constant('a'), Object); * // => { '0': { '1': 'a' } } */ function updateWith(object, path, updater, customizer) { customizer = typeof customizer == 'function' ? customizer : undefined; return object == null ? object : baseUpdate(object, path, castFunction(updater), customizer); } /** * Creates an array of the own enumerable string keyed property values of `object`. * * **Note:** Non-object values are coerced to objects. * * @static * @since 0.1.0 * @memberOf _ * @category Object * @param {Object} object The object to query. * @returns {Array} Returns the array of property values. * @example * * function Foo() { * this.a = 1; * this.b = 2; * } * * Foo.prototype.c = 3; * * _.values(new Foo); * // => [1, 2] (iteration order is not guaranteed) * * _.values('hi'); * // => ['h', 'i'] */ function values(object) { return object ? baseValues(object, keys(object)) : []; } /** * Creates an array of the own and inherited enumerable string keyed property * values of `object`. * * **Note:** Non-object values are coerced to objects. * * @static * @memberOf _ * @since 3.0.0 * @category Object * @param {Object} object The object to query. * @returns {Array} Returns the array of property values. * @example * * function Foo() { * this.a = 1; * this.b = 2; * } * * Foo.prototype.c = 3; * * _.valuesIn(new Foo); * // => [1, 2, 3] (iteration order is not guaranteed) */ function valuesIn(object) { return object == null ? [] : baseValues(object, keysIn(object)); } /*------------------------------------------------------------------------*/ /** * Clamps `number` within the inclusive `lower` and `upper` bounds. * * @static * @memberOf _ * @since 4.0.0 * @category Number * @param {number} number The number to clamp. * @param {number} [lower] The lower bound. * @param {number} upper The upper bound. * @returns {number} Returns the clamped number. * @example * * _.clamp(-10, -5, 5); * // => -5 * * _.clamp(10, -5, 5); * // => 5 */ function clamp(number, lower, upper) { if (upper === undefined) { upper = lower; lower = undefined; } if (upper !== undefined) { upper = toNumber(upper); upper = upper === upper ? upper : 0; } if (lower !== undefined) { lower = toNumber(lower); lower = lower === lower ? lower : 0; } return baseClamp(toNumber(number), lower, upper); } /** * Checks if `n` is between `start` and up to but not including, `end`. If * `end` is not specified, it's set to `start` with `start` then set to `0`. * If `start` is greater than `end` the params are swapped to support * negative ranges. * * @static * @memberOf _ * @since 3.3.0 * @category Number * @param {number} number The number to check. * @param {number} [start=0] The start of the range. * @param {number} end The end of the range. * @returns {boolean} Returns `true` if `number` is in the range, else `false`. * @example * * _.inRange(3, 2, 4); * // => true * * _.inRange(4, 8); * // => true * * _.inRange(4, 2); * // => false * * _.inRange(2, 2); * // => false * * _.inRange(1.2, 2); * // => true * * _.inRange(5.2, 4); * // => false * * _.inRange(-3, -2, -6); * // => true */ function inRange(number, start, end) { start = toNumber(start) || 0; if (end === undefined) { end = start; start = 0; } else { end = toNumber(end) || 0; } number = toNumber(number); return baseInRange(number, start, end); } /** * Produces a random number between the inclusive `lower` and `upper` bounds. * If only one argument is provided a number between `0` and the given number * is returned. If `floating` is `true`, or either `lower` or `upper` are * floats, a floating-point number is returned instead of an integer. * * **Note:** JavaScript follows the IEEE-754 standard for resolving * floating-point values which can produce unexpected results. * * @static * @memberOf _ * @since 0.7.0 * @category Number * @param {number} [lower=0] The lower bound. * @param {number} [upper=1] The upper bound. * @param {boolean} [floating] Specify returning a floating-point number. * @returns {number} Returns the random number. * @example * * _.random(0, 5); * // => an integer between 0 and 5 * * _.random(5); * // => also an integer between 0 and 5 * * _.random(5, true); * // => a floating-point number between 0 and 5 * * _.random(1.2, 5.2); * // => a floating-point number between 1.2 and 5.2 */ function random(lower, upper, floating) { if (floating && typeof floating != 'boolean' && isIterateeCall(lower, upper, floating)) { upper = floating = undefined; } if (floating === undefined) { if (typeof upper == 'boolean') { floating = upper; upper = undefined; } else if (typeof lower == 'boolean') { floating = lower; lower = undefined; } } if (lower === undefined && upper === undefined) { lower = 0; upper = 1; } else { lower = toNumber(lower) || 0; if (upper === undefined) { upper = lower; lower = 0; } else { upper = toNumber(upper) || 0; } } if (lower > upper) { var temp = lower; lower = upper; upper = temp; } if (floating || lower % 1 || upper % 1) { var rand = nativeRandom(); return nativeMin(lower + (rand * (upper - lower + freeParseFloat('1e-' + ((rand + '').length - 1)))), upper); } return baseRandom(lower, upper); } /*------------------------------------------------------------------------*/ /** * Converts `string` to [camel case](https://en.wikipedia.org/wiki/CamelCase). * * @static * @memberOf _ * @since 3.0.0 * @category String * @param {string} [string=''] The string to convert. * @returns {string} Returns the camel cased string. * @example * * _.camelCase('Foo Bar'); * // => 'fooBar' * * _.camelCase('--foo-bar--'); * // => 'fooBar' * * _.camelCase('__FOO_BAR__'); * // => 'fooBar' */ var camelCase = createCompounder(function(result, word, index) { word = word.toLowerCase(); return result + (index ? capitalize(word) : word); }); /** * Converts the first character of `string` to upper case and the remaining * to lower case. * * @static * @memberOf _ * @since 3.0.0 * @category String * @param {string} [string=''] The string to capitalize. * @returns {string} Returns the capitalized string. * @example * * _.capitalize('FRED'); * // => 'Fred' */ function capitalize(string) { return upperFirst(toString(string).toLowerCase()); } /** * Deburrs `string` by converting * [latin-1 supplementary letters](https://en.wikipedia.org/wiki/Latin-1_Supplement_(Unicode_block)#Character_table) * to basic latin letters and removing * [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks). * * @static * @memberOf _ * @since 3.0.0 * @category String * @param {string} [string=''] The string to deburr. * @returns {string} Returns the deburred string. * @example * * _.deburr('déjà vu'); * // => 'deja vu' */ function deburr(string) { string = toString(string); return string && string.replace(reLatin1, deburrLetter).replace(reComboMark, ''); } /** * Checks if `string` ends with the given target string. * * @static * @memberOf _ * @since 3.0.0 * @category String * @param {string} [string=''] The string to search. * @param {string} [target] The string to search for. * @param {number} [position=string.length] The position to search from. * @returns {boolean} Returns `true` if `string` ends with `target`, * else `false`. * @example * * _.endsWith('abc', 'c'); * // => true * * _.endsWith('abc', 'b'); * // => false * * _.endsWith('abc', 'b', 2); * // => true */ function endsWith(string, target, position) { string = toString(string); target = typeof target == 'string' ? target : (target + ''); var length = string.length; position = position === undefined ? length : baseClamp(toInteger(position), 0, length); position -= target.length; return position >= 0 && string.indexOf(target, position) == position; } /** * Converts the characters "&", "<", ">", '"', "'", and "\`" in `string` to * their corresponding HTML entities. * * **Note:** No other characters are escaped. To escape additional * characters use a third-party library like [_he_](https://mths.be/he). * * Though the ">" character is escaped for symmetry, characters like * ">" and "/" don't need escaping in HTML and have no special meaning * unless they're part of a tag or unquoted attribute value. See * [Mathias Bynens's article](https://mathiasbynens.be/notes/ambiguous-ampersands) * (under "semi-related fun fact") for more details. * * Backticks are escaped because in IE < 9, they can break out of * attribute values or HTML comments. See [#59](https://html5sec.org/#59), * [#102](https://html5sec.org/#102), [#108](https://html5sec.org/#108), and * [#133](https://html5sec.org/#133) of the * [HTML5 Security Cheatsheet](https://html5sec.org/) for more details. * * When working with HTML you should always * [quote attribute values](http://wonko.com/post/html-escaping) to reduce * XSS vectors. * * @static * @since 0.1.0 * @memberOf _ * @category String * @param {string} [string=''] The string to escape. * @returns {string} Returns the escaped string. * @example * * _.escape('fred, barney, & pebbles'); * // => 'fred, barney, & pebbles' */ function escape(string) { string = toString(string); return (string && reHasUnescapedHtml.test(string)) ? string.replace(reUnescapedHtml, escapeHtmlChar) : string; } /** * Escapes the `RegExp` special characters "^", "$", "\", ".", "*", "+", * "?", "(", ")", "[", "]", "{", "}", and "|" in `string`. * * @static * @memberOf _ * @since 3.0.0 * @category String * @param {string} [string=''] The string to escape. * @returns {string} Returns the escaped string. * @example * * _.escapeRegExp('[lodash](https://lodash.com/)'); * // => '\[lodash\]\(https://lodash\.com/\)' */ function escapeRegExp(string) { string = toString(string); return (string && reHasRegExpChar.test(string)) ? string.replace(reRegExpChar, '\\$&') : string; } /** * Converts `string` to * [kebab case](https://en.wikipedia.org/wiki/Letter_case#Special_case_styles). * * @static * @memberOf _ * @since 3.0.0 * @category String * @param {string} [string=''] The string to convert. * @returns {string} Returns the kebab cased string. * @example * * _.kebabCase('Foo Bar'); * // => 'foo-bar' * * _.kebabCase('fooBar'); * // => 'foo-bar' * * _.kebabCase('__FOO_BAR__'); * // => 'foo-bar' */ var kebabCase = createCompounder(function(result, word, index) { return result + (index ? '-' : '') + word.toLowerCase(); }); /** * Converts `string`, as space separated words, to lower case. * * @static * @memberOf _ * @since 4.0.0 * @category String * @param {string} [string=''] The string to convert. * @returns {string} Returns the lower cased string. * @example * * _.lowerCase('--Foo-Bar--'); * // => 'foo bar' * * _.lowerCase('fooBar'); * // => 'foo bar' * * _.lowerCase('__FOO_BAR__'); * // => 'foo bar' */ var lowerCase = createCompounder(function(result, word, index) { return result + (index ? ' ' : '') + word.toLowerCase(); }); /** * Converts the first character of `string` to lower case. * * @static * @memberOf _ * @since 4.0.0 * @category String * @param {string} [string=''] The string to convert. * @returns {string} Returns the converted string. * @example * * _.lowerFirst('Fred'); * // => 'fred' * * _.lowerFirst('FRED'); * // => 'fRED' */ var lowerFirst = createCaseFirst('toLowerCase'); /** * Pads `string` on the left and right sides if it's shorter than `length`. * Padding characters are truncated if they can't be evenly divided by `length`. * * @static * @memberOf _ * @since 3.0.0 * @category String * @param {string} [string=''] The string to pad. * @param {number} [length=0] The padding length. * @param {string} [chars=' '] The string used as padding. * @returns {string} Returns the padded string. * @example * * _.pad('abc', 8); * // => ' abc ' * * _.pad('abc', 8, '_-'); * // => '_-abc_-_' * * _.pad('abc', 3); * // => 'abc' */ function pad(string, length, chars) { string = toString(string); length = toInteger(length); var strLength = length ? stringSize(string) : 0; if (!length || strLength >= length) { return string; } var mid = (length - strLength) / 2; return ( createPadding(nativeFloor(mid), chars) + string + createPadding(nativeCeil(mid), chars) ); } /** * Pads `string` on the right side if it's shorter than `length`. Padding * characters are truncated if they exceed `length`. * * @static * @memberOf _ * @since 4.0.0 * @category String * @param {string} [string=''] The string to pad. * @param {number} [length=0] The padding length. * @param {string} [chars=' '] The string used as padding. * @returns {string} Returns the padded string. * @example * * _.padEnd('abc', 6); * // => 'abc ' * * _.padEnd('abc', 6, '_-'); * // => 'abc_-_' * * _.padEnd('abc', 3); * // => 'abc' */ function padEnd(string, length, chars) { string = toString(string); length = toInteger(length); var strLength = length ? stringSize(string) : 0; return (length && strLength < length) ? (string + createPadding(length - strLength, chars)) : string; } /** * Pads `string` on the left side if it's shorter than `length`. Padding * characters are truncated if they exceed `length`. * * @static * @memberOf _ * @since 4.0.0 * @category String * @param {string} [string=''] The string to pad. * @param {number} [length=0] The padding length. * @param {string} [chars=' '] The string used as padding. * @returns {string} Returns the padded string. * @example * * _.padStart('abc', 6); * // => ' abc' * * _.padStart('abc', 6, '_-'); * // => '_-_abc' * * _.padStart('abc', 3); * // => 'abc' */ function padStart(string, length, chars) { string = toString(string); length = toInteger(length); var strLength = length ? stringSize(string) : 0; return (length && strLength < length) ? (createPadding(length - strLength, chars) + string) : string; } /** * Converts `string` to an integer of the specified radix. If `radix` is * `undefined` or `0`, a `radix` of `10` is used unless `value` is a * hexadecimal, in which case a `radix` of `16` is used. * * **Note:** This method aligns with the * [ES5 implementation](https://es5.github.io/#x15.1.2.2) of `parseInt`. * * @static * @memberOf _ * @since 1.1.0 * @category String * @param {string} string The string to convert. * @param {number} [radix=10] The radix to interpret `value` by. * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. * @returns {number} Returns the converted integer. * @example * * _.parseInt('08'); * // => 8 * * _.map(['6', '08', '10'], _.parseInt); * // => [6, 8, 10] */ function parseInt(string, radix, guard) { // Chrome fails to trim leading whitespace characters. // See https://bugs.chromium.org/p/v8/issues/detail?id=3109 for more details. if (guard || radix == null) { radix = 0; } else if (radix) { radix = +radix; } string = toString(string).replace(reTrim, ''); return nativeParseInt(string, radix || (reHasHexPrefix.test(string) ? 16 : 10)); } /** * Repeats the given string `n` times. * * @static * @memberOf _ * @since 3.0.0 * @category String * @param {string} [string=''] The string to repeat. * @param {number} [n=1] The number of times to repeat the string. * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. * @returns {string} Returns the repeated string. * @example * * _.repeat('*', 3); * // => '***' * * _.repeat('abc', 2); * // => 'abcabc' * * _.repeat('abc', 0); * // => '' */ function repeat(string, n, guard) { if ((guard ? isIterateeCall(string, n, guard) : n === undefined)) { n = 1; } else { n = toInteger(n); } return baseRepeat(toString(string), n); } /** * Replaces matches for `pattern` in `string` with `replacement`. * * **Note:** This method is based on * [`String#replace`](https://mdn.io/String/replace). * * @static * @memberOf _ * @since 4.0.0 * @category String * @param {string} [string=''] The string to modify. * @param {RegExp|string} pattern The pattern to replace. * @param {Function|string} replacement The match replacement. * @returns {string} Returns the modified string. * @example * * _.replace('Hi Fred', 'Fred', 'Barney'); * // => 'Hi Barney' */ function replace() { var args = arguments, string = toString(args[0]); return args.length < 3 ? string : nativeReplace.call(string, args[1], args[2]); } /** * Converts `string` to * [snake case](https://en.wikipedia.org/wiki/Snake_case). * * @static * @memberOf _ * @since 3.0.0 * @category String * @param {string} [string=''] The string to convert. * @returns {string} Returns the snake cased string. * @example * * _.snakeCase('Foo Bar'); * // => 'foo_bar' * * _.snakeCase('fooBar'); * // => 'foo_bar' * * _.snakeCase('--FOO-BAR--'); * // => 'foo_bar' */ var snakeCase = createCompounder(function(result, word, index) { return result + (index ? '_' : '') + word.toLowerCase(); }); /** * Splits `string` by `separator`. * * **Note:** This method is based on * [`String#split`](https://mdn.io/String/split). * * @static * @memberOf _ * @since 4.0.0 * @category String * @param {string} [string=''] The string to split. * @param {RegExp|string} separator The separator pattern to split by. * @param {number} [limit] The length to truncate results to. * @returns {Array} Returns the new array of string segments. * @example * * _.split('a-b-c', '-', 2); * // => ['a', 'b'] */ function split(string, separator, limit) { if (limit && typeof limit != 'number' && isIterateeCall(string, separator, limit)) { separator = limit = undefined; } limit = limit === undefined ? MAX_ARRAY_LENGTH : limit >>> 0; if (!limit) { return []; } string = toString(string); if (string && ( typeof separator == 'string' || (separator != null && !isRegExp(separator)) )) { separator += ''; if (separator == '' && reHasComplexSymbol.test(string)) { return castSlice(stringToArray(string), 0, limit); } } return nativeSplit.call(string, separator, limit); } /** * Converts `string` to * [start case](https://en.wikipedia.org/wiki/Letter_case#Stylistic_or_specialised_usage). * * @static * @memberOf _ * @since 3.1.0 * @category String * @param {string} [string=''] The string to convert. * @returns {string} Returns the start cased string. * @example * * _.startCase('--foo-bar--'); * // => 'Foo Bar' * * _.startCase('fooBar'); * // => 'Foo Bar' * * _.startCase('__FOO_BAR__'); * // => 'FOO BAR' */ var startCase = createCompounder(function(result, word, index) { return result + (index ? ' ' : '') + upperFirst(word); }); /** * Checks if `string` starts with the given target string. * * @static * @memberOf _ * @since 3.0.0 * @category String * @param {string} [string=''] The string to search. * @param {string} [target] The string to search for. * @param {number} [position=0] The position to search from. * @returns {boolean} Returns `true` if `string` starts with `target`, * else `false`. * @example * * _.startsWith('abc', 'a'); * // => true * * _.startsWith('abc', 'b'); * // => false * * _.startsWith('abc', 'b', 1); * // => true */ function startsWith(string, target, position) { string = toString(string); position = baseClamp(toInteger(position), 0, string.length); return string.lastIndexOf(target, position) == position; } /** * Creates a compiled template function that can interpolate data properties * in "interpolate" delimiters, HTML-escape interpolated data properties in * "escape" delimiters, and execute JavaScript in "evaluate" delimiters. Data * properties may be accessed as free variables in the template. If a setting * object is given, it takes precedence over `_.templateSettings` values. * * **Note:** In the development build `_.template` utilizes * [sourceURLs](http://www.html5rocks.com/en/tutorials/developertools/sourcemaps/#toc-sourceurl) * for easier debugging. * * For more information on precompiling templates see * [lodash's custom builds documentation](https://lodash.com/custom-builds). * * For more information on Chrome extension sandboxes see * [Chrome's extensions documentation](https://developer.chrome.com/extensions/sandboxingEval). * * @static * @since 0.1.0 * @memberOf _ * @category String * @param {string} [string=''] The template string. * @param {Object} [options={}] The options object. * @param {RegExp} [options.escape=_.templateSettings.escape] * The HTML "escape" delimiter. * @param {RegExp} [options.evaluate=_.templateSettings.evaluate] * The "evaluate" delimiter. * @param {Object} [options.imports=_.templateSettings.imports] * An object to import into the template as free variables. * @param {RegExp} [options.interpolate=_.templateSettings.interpolate] * The "interpolate" delimiter. * @param {string} [options.sourceURL='lodash.templateSources[n]'] * The sourceURL of the compiled template. * @param {string} [options.variable='obj'] * The data object variable name. * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. * @returns {Function} Returns the compiled template function. * @example * * // Use the "interpolate" delimiter to create a compiled template. * var compiled = _.template('hello <%= user %>!'); * compiled({ 'user': 'fred' }); * // => 'hello fred!' * * // Use the HTML "escape" delimiter to escape data property values. * var compiled = _.template('<%- value %>'); * compiled({ 'value': ' ================================================ FILE: bin/deploy ================================================ #!/usr/bin/env bash progname=$(basename $0) function usage { echo "usage: $progname [-s SOURCE] -b BUCKET [-p PREFIX] [-P]" echo " -s SOURCE directory containing files to deploy" echo " -b BUCKET S3 bucket to deploy to" echo " -p PREFIX prefix within bucket" echo " -P make files public on S3" } source='target' while getopts ":s:b:p:P" opt; do case $opt in s) source="$OPTARG" ;; b) bucket="$OPTARG" ;; p) prefix="$OPTARG" ;; P) public_opt=--acl-public ;; \?) usage echo "error: invalid option: -$OPTARG" >&2 exit 1 ;; :) usage echo "error: option -$OPTARG requires an argument" >&2 exit 1 ;; esac done if [[ ! $bucket ]]; then usage echo "error: you must specify an S3 bucket" exit 1 fi destination="s3://$bucket" if [[ $prefix ]]; then destination="${destination}${prefix}/" fi gzip_opt="--add-header=Content-Encoding: gzip" cache_opt="--add-header=Cache-Control: max-age=86400" img_include_opts="--include '*.png' --include '*.jpg' --include '*.ico' --include '*.gif'" rexlude='(\.htpasswd|doc.*|builds.*)' s3cmd sync --exclude '*' --rinclude '^(?!doc/).*\.css$' -m 'text/css' $public_opt "$gzip_opt" $source/ $destination s3cmd sync --exclude '*' --rinclude '^(?!doc/).*\.js$' -m 'application/javascript' $public_opt "$gzip_opt" $source/ $destination s3cmd sync --exclude '*' --rinclude '^(?!doc/).*\.html$' -m 'text/html' $public_opt "$gzip_opt" $source/ $destination s3cmd sync --exclude '*' $img_include_opts $public_opt "$cache_opt" $source/ $destination s3cmd sync --exclude '*' --rinclude '^(?!doc/).*\.svg$' -m 'image/svg+xml' $public_opt "$cache_opt" $source/ $destination s3cmd sync --rexclude $rexclude --delete-removed $public_opt $source/ $destination s3cmd sync $public_opt $source/doc/ $destination/doc/ ================================================ FILE: boot.properties ================================================ BOOT_CLOJURE_VERSION=1.9.0-alpha14 BOOT_VERSION=2.7.1 ================================================ FILE: build.boot ================================================ (set-env! :source-paths #{"src/clj" "src/cljc" "src/cljs" "src/js" "src/scss" "test/cljs" "site"} :resource-paths #{"assets"} :dependencies '[;; Dev [adzerk/boot-cljs "2.0.0" :scope "test"] [adzerk/boot-cljs-repl "0.3.3" :scope "test"] [adzerk/boot-reload "0.5.1" :scope "test"] [binaryage/devtools "0.9.1" :scope "test"] [boot-codox "0.10.1" :scope "test"] [com.cemerick/piggieback "0.2.1" :scope "test"] [crisptrutski/boot-cljs-test "0.3.0" :scope "test"] [deraen/boot-sass "0.3.0" :scope "test"] [devcards "0.2.2" :scope "test"] [metosin/boot-alt-http "0.1.2" :scope "test"] [org.clojars.micha/boot-cp "1.0.1" :scope "test"] [org.clojure/tools.nrepl "0.2.12" :scope "test"] [org.martinklepsch/boot-gzip "0.1.3" :scope "test"] [org.slf4j/slf4j-nop "1.7.21" :scope "test"] [perun "0.4.1-SNAPSHOT" :scope "test"] [weasel "0.7.0" :scope "test"] ;; App [cljsjs/clipboard "1.5.9-0"] [cljsjs/raven "3.9.1-0"] [cljsjs/react "15.4.2-2"] [cljsjs/react-bootstrap "0.30.6-0"] [cljsjs/react-dom "15.4.2-2"] [cljsjs/react-dom-server "15.4.2-2"] [com.cognitect/transit-cljs "0.8.239"] [com.gfredericks/test.chuck "0.2.7"] [danielsz/boot-autoprefixer "0.0.9"] [datascript "0.15.5"] [hiccup "1.0.5"] [integrant "0.2.1"] [org.clojure/clojure "1.9.0-alpha14"] [org.clojure/clojurescript "1.9.293"] [org.clojure/core.async "0.2.395"] [org.clojure/test.check "0.9.0"] [org.webjars/bootstrap-sass "3.3.7"] [org.webjars/font-awesome "4.7.0"] [posh "0.5.5"] [reagent "0.6.1"] [tongue "0.2.0"]]) (require '[adzerk.boot-cljs :refer :all] '[adzerk.boot-cljs-repl :refer :all] '[adzerk.boot-reload :refer :all] '[clojure.edn :as edn] '[clojure.string :as string] '[codox.boot :refer [codox]] '[crisptrutski.boot-cljs-test :refer [test-cljs]] '[danielsz.autoprefixer :refer [autoprefixer]] '[deraen.boot-sass :refer :all] '[io.perun :refer :all] '[org.martinklepsch.boot-gzip :refer [gzip]] '[metosin.boot-alt-http :refer [serve]] '[zetawar.site] '[integrant.core]) (task-options! test-cljs {:js-env :phantom} autoprefixer {:files ["main.css"] :browsers "> 5%"}) (deftask build-css "Build Zetawar CSS." [] (comp (sift :add-jar {'org.webjars/bootstrap-sass #"META-INF/resources/webjars/bootstrap-sass/3\.3\.7/stylesheets/.*\.scss$" 'org.webjars/font-awesome #"META-INF/resources/webjars/font-awesome/4\.7\.0/(fonts|scss/.*\.scss)"}) (sift :move {#"META-INF/resources/webjars/bootstrap-sass/3\.3\.7/stylesheets" "bootstrap" #"META-INF/resources/webjars/font-awesome/4\.7\.0/fonts" "fonts" #"META-INF/resources/webjars/font-awesome/4\.7\.0/scss/(_.*\.scss)" "font-awesome/$1" #"META-INF/resources/webjars/font-awesome/4\.7\.0/scss/font-awesome.scss" "font-awesome/_font-awesome.scss"}) (sift :to-source #{#"bootstrap" #"font-awesome"} :to-resource #{#"fonts"}) (sass :options {:precision 8}) (autoprefixer :exec-path "node_modules/.bin/postcss") (sift :move {#"^main.css$" "css/main.css"}))) (deftask build-html "Build Zetawar HTML." [m metadata-file FILE str] (comp (global-metadata :filename metadata-file) (markdown) (slug :slug-fn zetawar.site/slug-fn) (permalink :permalink-fn zetawar.site/permalink-fn) (collection :renderer 'zetawar.views.site/render-index :out-dir "." :page "index.html") (collection :renderer 'zetawar.views.site/render-blog-index :filterer zetawar.site/post? :out-dir "." :page "blog/index.html") (render :renderer 'zetawar.views.site/render-page :filterer zetawar.site/page? :out-dir ".") (render :renderer 'zetawar.views.site/render-blog-post :filterer zetawar.site/post? :out-dir ".") (render :renderer 'zetawar.views.site/render-devcards :filterer zetawar.site/devcards? :out-dir "."))) (deftask build-cljs "Build Zetawar ClojureScript for deployment." [] (cljs :ids ["js/main"] :optimizations :advanced :source-map true :compiler-options {:asset-path (str (System/getenv "ZETAWAR_PREFIX") "/js/main.out") :parallel-build true})) (deftask build-site "Build Zetawar site for deployment." [e environment ENV str "Perun environment" t target-dir PATH str "Target directory"] (comp (build-cljs) (build-html :metadata-file (str "perun.base." environment ".edn")) (build-css) (gzip :regex #{#"\.html$" #"\.css$" #"^(?!.*main\.out).*\.js$"}) ;; Fileset gets confused without move to *.orig (sift :move {#"^(.*)\.html$" "$1.html.orig" #"^(.*)\.css$" "$1.css.orig" #"^(?!.*main\.out)(.*)\.js$" "$1.js.orig"}) (sift :to-source #{#"\.orig$"}) (sift :move {#"^(.*)\.html\.gz$" "$1.html" #"^(.*)\.css\.gz$" "$1.css" #"^(.*)\.js\.gz$" "$1.js"}) (codox :name "Zetawar" :language :clojurescript) (target :dir (when target-dir #{target-dir})))) (deftask build-cli "Build Zetawar CLI." [] (comp (cljs :ids ["js/cli"] :optimizations :simple :source-map true) (target))) (deftask dev "Run Zetawar dev environment." [_ http-host HOST str "HTTP server host" _ http-port HOST str "HTTP server port" _ reload-host HOST str "Reload WebSocket host" _ reload-port PORT int "Reload WebSocket port" _ cljs-repl-host HOST str "ClojureScript REPL host" _ cljs-repl-port PORT int "ClojureScript REPL port"] (comp (serve :ip (or http-host (System/getenv "ZETAWAR_DEV_HOST") "127.0.0.1") :port (Integer. (or http-port (System/getenv "ZETAWAR_HTTP_PORT") 3000)) :prefixes #{"."}) (repl) (watch) (notify :visual true) (build-html :metadata-file "perun.base.dev.edn") (build-css) (reload :on-jsload 'zetawar.core/reload :cljs-asset-path "" :ws-host (or reload-host (System/getenv "ZETAWAR_RELOAD_HOST") (System/getenv "ZETAWAR_DEV_HOST")) :ws-port (or reload-host (System/getenv "ZETAWAR_RELOAD_PORT"))) (cljs-repl-env :ws-host (or reload-host (System/getenv "ZETAWAR_CLJS_REPL_HOST") (System/getenv "ZETAWAR_DEV_HOST")) :port (or reload-host (System/getenv "ZETAWAR_CLJS_REPL_PORT"))) (cljs :ids ["js/main"] :optimizations :none :compiler-options {:preloads '[zetawar.dev] :parallel-build true}) (target))) (deftask dev-cli "Build Zetawar CLI dev environment." [] (comp (watch) (cljs :ids ["js/cli"] :optimizations :none :source-map true) (target))) (deftask run-tests "Run Zetawar tests." [] (test-cljs :exit? true :cljs-opts {:externs ["js/externs.js"] :foreign-libs [{:file "lzw.js" :provides ["lzw"]}]})) (deftask serve-target "Serve files in target (useful for checking builds)." [] (comp (serve :dir "target") (wait))) ================================================ FILE: circle.yml ================================================ general: artifacts: - "target" machine: java: version: oraclejdk8 node: version: 6.9.1 environment: _JAVA_OPTIONS: "-Xms512m -Xmx1024m" dependencies: cache_directories: - "node_modules" - "~/.boot/cache/bin" - "~/.boot/cache/lib" pre: - curl -L https://github.com/boot-clj/boot-bin/releases/download/latest/boot.sh -o ~/bin/boot - chmod +x ~/bin/boot - npm install override: - boot show -d test: override: - boot run-tests - boot build-site -e test ================================================ FILE: default.nix ================================================ with import {}; { sdlEnv = stdenv.mkDerivation { name = "zetawar"; buildInputs = [ boot git nodejs phantomjs2 s3cmd stdenv ]; LD_LIBRARY_PATH="${stdenv.cc.cc.lib}/lib"; }; } ================================================ FILE: deps.edn ================================================ {:paths ["assets" "src/clj" "src/cljc" "src/cljs"] :deps {com.cognitect/transit-cljs {:mvn/version "0.8.239"} datascript {:mvn/version "0.15.5"} integrant {:mvn/version "0.2.1"} org.clojure/clojurescript {:mvn/version "1.10.439"} org.clojure/core.async {:mvn/version "0.2.395"} org.clojure/tools.cli {:mvn/version "0.4.1"} posh {:mvn/version "0.5.5"} reagent {:mvn/version "0.6.1"}} :aliases {:build-dev {:extra-paths ["test/cljs"] :extra-deps {com.bhauman/figwheel-main {:mvn/version "0.1.9"} com.bhauman/rebel-readline-cljs {:mvn/version "0.1.4"} devcards {:mvn/version "0.2.2"}} :main-opts ["-m" "figwheel.main" "-b" "dev" "-r"]}}} ================================================ FILE: dev/cljs/user.cljs ================================================ (ns cljs.user (:require [datascript.core :as d] [zetawar.core :as core] [zetawar.game :as game] [zetawar.util :as util])) (comment ;; capturing units (doall (d/q '[:find ?u :in $ ?r :where [_ :game/current-faction ?f] [?f :faction/units ?u] [?u :unit/capturing true] [?u :unit/capture-round ?r]] @core/conn 1)) ) ================================================ FILE: dev.cljs.edn ================================================ ^{:connect-url "ws://penguin.linux.test:9500/figwheel-connect"} {:main zetawar.test-runner} ================================================ FILE: npm-shrinkwrap.json ================================================ { "name": "zetawar", "version": "0.1.0", "lockfileVersion": 1, "requires": true, "dependencies": { "ansi-regex": { "version": "2.0.0", "resolved": "http://registry.npmjs.org/ansi-regex/-/ansi-regex-2.0.0.tgz", "integrity": "sha1-xQYbbg74qBd15Q9dZhUb9r83EQc=", "dev": true }, "ansi-styles": { "version": "2.2.1", "resolved": "https://registry.npmjs.org/ansi-styles/-/ansi-styles-2.2.1.tgz", "integrity": "sha1-tDLdM1i2NM914eRmQ2gkBTPB3b4=", "dev": true }, "anymatch": { "version": "1.3.0", "resolved": "https://registry.npmjs.org/anymatch/-/anymatch-1.3.0.tgz", "integrity": "sha1-o+Uvo5FoyCX/V7AkgSbOWo/5VQc=", "dev": true, "optional": true, "requires": { "arrify": "^1.0.0", "micromatch": "^2.1.5" } }, "arr-diff": { "version": "2.0.0", "resolved": "https://registry.npmjs.org/arr-diff/-/arr-diff-2.0.0.tgz", "integrity": "sha1-jzuCf5Vai9ZpaX5KQlasPOrjVs8=", "dev": true, "optional": true, "requires": { "arr-flatten": "^1.0.1" } }, "arr-flatten": { "version": "1.0.1", "resolved": "https://registry.npmjs.org/arr-flatten/-/arr-flatten-1.0.1.tgz", "integrity": "sha1-5f/lTUXhnzLyFukeuZyM6JK7YEs=", "dev": true, "optional": true }, "array-union": { "version": "1.0.2", "resolved": "https://registry.npmjs.org/array-union/-/array-union-1.0.2.tgz", "integrity": "sha1-mjRBDk9OPaI96jdb5b5w8kd47Dk=", "dev": true, "requires": { "array-uniq": "^1.0.1" } }, "array-uniq": { "version": "1.0.3", "resolved": "https://registry.npmjs.org/array-uniq/-/array-uniq-1.0.3.tgz", "integrity": "sha1-r2rId6Jcx/dOBYiUdThY39sk/bY=", "dev": true }, "array-unique": { "version": "0.2.1", "resolved": "https://registry.npmjs.org/array-unique/-/array-unique-0.2.1.tgz", "integrity": "sha1-odl8yvy8JiXMcPrc6zalDFiwGlM=", "dev": true, "optional": true }, "arrify": { "version": "1.0.1", "resolved": "https://registry.npmjs.org/arrify/-/arrify-1.0.1.tgz", "integrity": "sha1-iYUI2iIm84DfkEcoRWhJwVAaSw0=", "dev": true }, "async-each": { "version": "1.0.1", "resolved": "https://registry.npmjs.org/async-each/-/async-each-1.0.1.tgz", "integrity": "sha1-GdOGodntxufByF04iu28xW0zYC0=", "dev": true, "optional": true }, "autoprefixer": { "version": "6.5.3", "resolved": "http://registry.npmjs.org/autoprefixer/-/autoprefixer-6.5.3.tgz", "integrity": "sha1-LYU69m0ERJ/PUNswZieatUw+SwE=", "dev": true, "requires": { "browserslist": "~1.4.0", "caniuse-db": "^1.0.30000578", "normalize-range": "^0.1.2", "num2fraction": "^1.2.2", "postcss": "^5.2.5", "postcss-value-parser": "^3.2.3" } }, "balanced-match": { "version": "0.4.2", "resolved": "https://registry.npmjs.org/balanced-match/-/balanced-match-0.4.2.tgz", "integrity": "sha1-yz8+PHMtwPAe5wtAPzAuYddwmDg=", "dev": true }, "binary-extensions": { "version": "1.8.0", "resolved": "http://registry.npmjs.org/binary-extensions/-/binary-extensions-1.8.0.tgz", "integrity": "sha1-SOyNFt9Dd+rl+liEaCSAr02Vx3Q=", "dev": true, "optional": true }, "brace-expansion": { "version": "1.1.6", "resolved": "https://registry.npmjs.org/brace-expansion/-/brace-expansion-1.1.6.tgz", "integrity": "sha1-cZfX6qm4fmSDkOph/GbIRCdCDfk=", "dev": true, "requires": { "balanced-match": "^0.4.1", "concat-map": "0.0.1" } }, "braces": { "version": "1.8.5", "resolved": "https://registry.npmjs.org/braces/-/braces-1.8.5.tgz", "integrity": "sha1-uneWLhLf+WnWt2cR6RS3N4V79qc=", "dev": true, "optional": true, "requires": { "expand-range": "^1.8.1", "preserve": "^0.2.0", "repeat-element": "^1.1.2" } }, "browserslist": { "version": "1.4.0", "resolved": "http://registry.npmjs.org/browserslist/-/browserslist-1.4.0.tgz", "integrity": "sha1-nP3PU4TZFY9bcNoqoAsw6P8BkEk=", "dev": true, "requires": { "caniuse-db": "^1.0.30000539" } }, "buffer-from": { "version": "1.1.1", "resolved": "https://registry.npmjs.org/buffer-from/-/buffer-from-1.1.1.tgz", "integrity": "sha512-MQcXEUbCKtEo7bhqEs6560Hyd4XaovZlO/k9V3hjVUF/zwW7KBVdSK4gIt/bzwS9MbR5qob+F5jusZsb0YQK2A==", "dev": true }, "buffer-shims": { "version": "1.0.0", "resolved": "https://registry.npmjs.org/buffer-shims/-/buffer-shims-1.0.0.tgz", "integrity": "sha1-mXjOMXOIxkmth5MCjDR37wRKi1E=", "dev": true, "optional": true }, "builtin-modules": { "version": "1.1.1", "resolved": "https://registry.npmjs.org/builtin-modules/-/builtin-modules-1.1.1.tgz", "integrity": "sha1-Jw8HbFpywC9bZaR9+Uxf46J4iS8=", "dev": true }, "camelcase": { "version": "3.0.0", "resolved": "https://registry.npmjs.org/camelcase/-/camelcase-3.0.0.tgz", "integrity": "sha1-MvxLn82vhF/N9+c7uXysImHwqwo=", "dev": true }, "caniuse-db": { "version": "1.0.30000591", "resolved": "http://registry.npmjs.org/caniuse-db/-/caniuse-db-1.0.30000591.tgz", "integrity": "sha1-dNe+fOIsi2sI869mR9GU5TSY25c=", "dev": true }, "chalk": { "version": "1.1.3", "resolved": "http://registry.npmjs.org/chalk/-/chalk-1.1.3.tgz", "integrity": "sha1-qBFcVeSnAv5NFQq9OHKCKn4J/Jg=", "dev": true, "requires": { "ansi-styles": "^2.2.1", "escape-string-regexp": "^1.0.2", "has-ansi": "^2.0.0", "strip-ansi": "^3.0.0", "supports-color": "^2.0.0" }, "dependencies": { "supports-color": { "version": "2.0.0", "resolved": "https://registry.npmjs.org/supports-color/-/supports-color-2.0.0.tgz", "integrity": "sha1-U10EXOa2Nj+kARcIRimZXp3zJMc=", "dev": true } } }, "chokidar": { "version": "1.6.1", "resolved": "http://registry.npmjs.org/chokidar/-/chokidar-1.6.1.tgz", "integrity": "sha1-L0RHq16W5Q+z14n9kNTHLg5McMI=", "dev": true, "optional": true, "requires": { "anymatch": "^1.3.0", "async-each": "^1.0.0", "fsevents": "^1.0.0", "glob-parent": "^2.0.0", "inherits": "^2.0.1", "is-binary-path": "^1.0.0", "is-glob": "^2.0.0", "path-is-absolute": "^1.0.0", "readdirp": "^2.0.0" } }, "cliui": { "version": "3.2.0", "resolved": "https://registry.npmjs.org/cliui/-/cliui-3.2.0.tgz", "integrity": "sha1-EgYBU3qRbSmUD5NNo7SNWFo5IT0=", "dev": true, "requires": { "string-width": "^1.0.1", "strip-ansi": "^3.0.1", "wrap-ansi": "^2.0.0" } }, "code-point-at": { "version": "1.1.0", "resolved": "https://registry.npmjs.org/code-point-at/-/code-point-at-1.1.0.tgz", "integrity": "sha1-DQcLTQQ6W+ozovGkDi7bPZpMz3c=", "dev": true }, "concat-map": { "version": "0.0.1", "resolved": "https://registry.npmjs.org/concat-map/-/concat-map-0.0.1.tgz", "integrity": "sha1-2Klr13/Wjfd5OnMDajug1UBdR3s=", "dev": true }, "core-util-is": { "version": "1.0.2", "resolved": "https://registry.npmjs.org/core-util-is/-/core-util-is-1.0.2.tgz", "integrity": "sha1-tf1UIgqivFq1eqtxQMlAdUUDwac=", "dev": true, "optional": true }, "decamelize": { "version": "1.2.0", "resolved": "https://registry.npmjs.org/decamelize/-/decamelize-1.2.0.tgz", "integrity": "sha1-9lNNFRSCabIDUue+4m9QH5oZEpA=", "dev": true }, "error-ex": { "version": "1.3.0", "resolved": "https://registry.npmjs.org/error-ex/-/error-ex-1.3.0.tgz", "integrity": "sha1-5ntD8+gsluo6WE/+4Ln8MyXYAtk=", "dev": true, "requires": { "is-arrayish": "^0.2.1" } }, "escape-string-regexp": { "version": "1.0.5", "resolved": "https://registry.npmjs.org/escape-string-regexp/-/escape-string-regexp-1.0.5.tgz", "integrity": "sha1-G2HAViGQqN/2rjuyzwIAyhMLhtQ=", "dev": true }, "expand-brackets": { "version": "0.1.5", "resolved": "https://registry.npmjs.org/expand-brackets/-/expand-brackets-0.1.5.tgz", "integrity": "sha1-3wcoTjQqgHzXM6xa9yQR5YHRF3s=", "dev": true, "optional": true, "requires": { "is-posix-bracket": "^0.1.0" } }, "expand-range": { "version": "1.8.2", "resolved": "https://registry.npmjs.org/expand-range/-/expand-range-1.8.2.tgz", "integrity": "sha1-opnv/TNf4nIeuujiV+x5ZE/IUzc=", "dev": true, "optional": true, "requires": { "fill-range": "^2.1.0" } }, "extglob": { "version": "0.3.2", "resolved": "https://registry.npmjs.org/extglob/-/extglob-0.3.2.tgz", "integrity": "sha1-Lhj/PS9JqydlzskCPwEdqo2DSaE=", "dev": true, "optional": true, "requires": { "is-extglob": "^1.0.0" } }, "filename-regex": { "version": "2.0.0", "resolved": "https://registry.npmjs.org/filename-regex/-/filename-regex-2.0.0.tgz", "integrity": "sha1-mW4+gEebmLmJfxWopYs9CE6SZ3U=", "dev": true, "optional": true }, "fill-range": { "version": "2.2.3", "resolved": "https://registry.npmjs.org/fill-range/-/fill-range-2.2.3.tgz", "integrity": "sha1-ULd9/X5Gm8dJJHCWNpn+eoSFpyM=", "dev": true, "optional": true, "requires": { "is-number": "^2.1.0", "isobject": "^2.0.0", "randomatic": "^1.1.3", "repeat-element": "^1.1.2", "repeat-string": "^1.5.2" } }, "find-up": { "version": "1.1.2", "resolved": "https://registry.npmjs.org/find-up/-/find-up-1.1.2.tgz", "integrity": "sha1-ay6YIrGizgpgq2TWEOzK1TyyTQ8=", "dev": true, "requires": { "path-exists": "^2.0.0", "pinkie-promise": "^2.0.0" } }, "for-in": { "version": "0.1.6", "resolved": "https://registry.npmjs.org/for-in/-/for-in-0.1.6.tgz", "integrity": "sha1-yfluib+tGKVFr17D7TUqHZ5bTcg=", "dev": true, "optional": true }, "for-own": { "version": "0.1.4", "resolved": "https://registry.npmjs.org/for-own/-/for-own-0.1.4.tgz", "integrity": "sha1-AUm0GjkIjHUV9R6+HBOG1F+TUHI=", "dev": true, "optional": true, "requires": { "for-in": "^0.1.5" } }, "fsevents": { "version": "1.2.4", "resolved": "https://registry.npmjs.org/fsevents/-/fsevents-1.2.4.tgz", "integrity": "sha512-z8H8/diyk76B7q5wg+Ud0+CqzcAF3mBBI/bA5ne5zrRUUIvNkJY//D3BqyH571KuAC4Nr7Rw7CjWX4r0y9DvNg==", "dev": true, "optional": true, "requires": { "nan": "^2.9.2", "node-pre-gyp": "^0.10.0" }, "dependencies": { "abbrev": { "version": "1.1.1", "bundled": true, "dev": true, "optional": true }, "ansi-regex": { "version": "2.1.1", "bundled": true, "dev": true }, "aproba": { "version": "1.2.0", "bundled": true, "dev": true, "optional": true }, "are-we-there-yet": { "version": "1.1.4", "bundled": true, "dev": true, "optional": true, "requires": { "delegates": "^1.0.0", "readable-stream": "^2.0.6" } }, "balanced-match": { "version": "1.0.0", "bundled": true, "dev": true }, "brace-expansion": { "version": "1.1.11", "bundled": true, "dev": true, "requires": { "balanced-match": "^1.0.0", "concat-map": "0.0.1" } }, "chownr": { "version": "1.0.1", "bundled": true, "dev": true, "optional": true }, "code-point-at": { "version": "1.1.0", "bundled": true, "dev": true }, "concat-map": { "version": "0.0.1", "bundled": true, "dev": true }, "console-control-strings": { "version": "1.1.0", "bundled": true, "dev": true }, "core-util-is": { "version": "1.0.2", "bundled": true, "dev": true, "optional": true }, "debug": { "version": "2.6.9", "bundled": true, "dev": true, "optional": true, "requires": { "ms": "2.0.0" } }, "deep-extend": { "version": "0.5.1", "bundled": true, "dev": true, "optional": true }, "delegates": { "version": "1.0.0", "bundled": true, "dev": true, "optional": true }, "detect-libc": { "version": "1.0.3", "bundled": true, "dev": true, "optional": true }, "fs-minipass": { "version": "1.2.5", "bundled": true, "dev": true, "optional": true, "requires": { "minipass": "^2.2.1" } }, "fs.realpath": { "version": "1.0.0", "bundled": true, "dev": true, "optional": true }, "gauge": { "version": "2.7.4", "bundled": true, "dev": true, "optional": true, "requires": { "aproba": "^1.0.3", "console-control-strings": "^1.0.0", "has-unicode": "^2.0.0", "object-assign": "^4.1.0", "signal-exit": "^3.0.0", "string-width": "^1.0.1", "strip-ansi": "^3.0.1", "wide-align": "^1.1.0" } }, "glob": { "version": "7.1.2", "bundled": true, "dev": true, "optional": true, "requires": { "fs.realpath": "^1.0.0", "inflight": "^1.0.4", "inherits": "2", "minimatch": "^3.0.4", "once": "^1.3.0", "path-is-absolute": "^1.0.0" } }, "has-unicode": { "version": "2.0.1", "bundled": true, "dev": true, "optional": true }, "iconv-lite": { "version": "0.4.21", "bundled": true, "dev": true, "optional": true, "requires": { "safer-buffer": "^2.1.0" } }, "ignore-walk": { "version": "3.0.1", "bundled": true, "dev": true, "optional": true, "requires": { "minimatch": "^3.0.4" } }, "inflight": { "version": "1.0.6", "bundled": true, "dev": true, "optional": true, "requires": { "once": "^1.3.0", "wrappy": "1" } }, "inherits": { "version": "2.0.3", "bundled": true, "dev": true }, "ini": { "version": "1.3.5", "bundled": true, "dev": true, "optional": true }, "is-fullwidth-code-point": { "version": "1.0.0", "bundled": true, "dev": true, "requires": { "number-is-nan": "^1.0.0" } }, "isarray": { "version": "1.0.0", "bundled": true, "dev": true, "optional": true }, "minimatch": { "version": "3.0.4", "bundled": true, "dev": true, "requires": { "brace-expansion": "^1.1.7" } }, "minimist": { "version": "0.0.8", "bundled": true, "dev": true }, "minipass": { "version": "2.2.4", "bundled": true, "dev": true, "requires": { "safe-buffer": "^5.1.1", "yallist": "^3.0.0" } }, "minizlib": { "version": "1.1.0", "bundled": true, "dev": true, "optional": true, "requires": { "minipass": "^2.2.1" } }, "mkdirp": { "version": "0.5.1", "bundled": true, "dev": true, "requires": { "minimist": "0.0.8" } }, "ms": { "version": "2.0.0", "bundled": true, "dev": true, "optional": true }, "needle": { "version": "2.2.0", "bundled": true, "dev": true, "optional": true, "requires": { "debug": "^2.1.2", "iconv-lite": "^0.4.4", "sax": "^1.2.4" } }, "node-pre-gyp": { "version": "0.10.0", "bundled": true, "dev": true, "optional": true, "requires": { "detect-libc": "^1.0.2", "mkdirp": "^0.5.1", "needle": "^2.2.0", "nopt": "^4.0.1", "npm-packlist": "^1.1.6", "npmlog": "^4.0.2", "rc": "^1.1.7", "rimraf": "^2.6.1", "semver": "^5.3.0", "tar": "^4" } }, "nopt": { "version": "4.0.1", "bundled": true, "dev": true, "optional": true, "requires": { "abbrev": "1", "osenv": "^0.1.4" } }, "npm-bundled": { "version": "1.0.3", "bundled": true, "dev": true, "optional": true }, "npm-packlist": { "version": "1.1.10", "bundled": true, "dev": true, "optional": true, "requires": { "ignore-walk": "^3.0.1", "npm-bundled": "^1.0.1" } }, "npmlog": { "version": "4.1.2", "bundled": true, "dev": true, "optional": true, "requires": { "are-we-there-yet": "~1.1.2", "console-control-strings": "~1.1.0", "gauge": "~2.7.3", "set-blocking": "~2.0.0" } }, "number-is-nan": { "version": "1.0.1", "bundled": true, "dev": true }, "object-assign": { "version": "4.1.1", "bundled": true, "dev": true, "optional": true }, "once": { "version": "1.4.0", "bundled": true, "dev": true, "requires": { "wrappy": "1" } }, "os-homedir": { "version": "1.0.2", "bundled": true, "dev": true, "optional": true }, "os-tmpdir": { "version": "1.0.2", "bundled": true, "dev": true, "optional": true }, "osenv": { "version": "0.1.5", "bundled": true, "dev": true, "optional": true, "requires": { "os-homedir": "^1.0.0", "os-tmpdir": "^1.0.0" } }, "path-is-absolute": { "version": "1.0.1", "bundled": true, "dev": true, "optional": true }, "process-nextick-args": { "version": "2.0.0", "bundled": true, "dev": true, "optional": true }, "rc": { "version": "1.2.7", "bundled": true, "dev": true, "optional": true, "requires": { "deep-extend": "^0.5.1", "ini": "~1.3.0", "minimist": "^1.2.0", "strip-json-comments": "~2.0.1" }, "dependencies": { "minimist": { "version": "1.2.0", "bundled": true, "dev": true, "optional": true } } }, "readable-stream": { "version": "2.3.6", "bundled": true, "dev": true, "optional": true, "requires": { "core-util-is": "~1.0.0", "inherits": "~2.0.3", "isarray": "~1.0.0", "process-nextick-args": "~2.0.0", "safe-buffer": "~5.1.1", "string_decoder": "~1.1.1", "util-deprecate": "~1.0.1" } }, "rimraf": { "version": "2.6.2", "bundled": true, "dev": true, "optional": true, "requires": { "glob": "^7.0.5" } }, "safe-buffer": { "version": "5.1.1", "bundled": true, "dev": true }, "safer-buffer": { "version": "2.1.2", "bundled": true, "dev": true, "optional": true }, "sax": { "version": "1.2.4", "bundled": true, "dev": true, "optional": true }, "semver": { "version": "5.5.0", "bundled": true, "dev": true, "optional": true }, "set-blocking": { "version": "2.0.0", "bundled": true, "dev": true, "optional": true }, "signal-exit": { "version": "3.0.2", "bundled": true, "dev": true, "optional": true }, "string-width": { "version": "1.0.2", "bundled": true, "dev": true, "requires": { "code-point-at": "^1.0.0", "is-fullwidth-code-point": "^1.0.0", "strip-ansi": "^3.0.0" } }, "string_decoder": { "version": "1.1.1", "bundled": true, "dev": true, "optional": true, "requires": { "safe-buffer": "~5.1.0" } }, "strip-ansi": { "version": "3.0.1", "bundled": true, "dev": true, "requires": { "ansi-regex": "^2.0.0" } }, "strip-json-comments": { "version": "2.0.1", "bundled": true, "dev": true, "optional": true }, "tar": { "version": "4.4.1", "bundled": true, "dev": true, "optional": true, "requires": { "chownr": "^1.0.1", "fs-minipass": "^1.2.5", "minipass": "^2.2.4", "minizlib": "^1.1.0", "mkdirp": "^0.5.0", "safe-buffer": "^5.1.1", "yallist": "^3.0.2" } }, "util-deprecate": { "version": "1.0.2", "bundled": true, "dev": true, "optional": true }, "wide-align": { "version": "1.1.2", "bundled": true, "dev": true, "optional": true, "requires": { "string-width": "^1.0.2" } }, "wrappy": { "version": "1.0.2", "bundled": true, "dev": true }, "yallist": { "version": "3.0.2", "bundled": true, "dev": true } } }, "gather-stream": { "version": "1.0.0", "resolved": "https://registry.npmjs.org/gather-stream/-/gather-stream-1.0.0.tgz", "integrity": "sha1-szmUr0V6gRVwDUEPMXczy+egkEs=", "dev": true }, "get-caller-file": { "version": "1.0.2", "resolved": "https://registry.npmjs.org/get-caller-file/-/get-caller-file-1.0.2.tgz", "integrity": "sha1-9wLmMSfn4jHBYKgMFVSstw1QR+U=", "dev": true }, "glob": { "version": "6.0.4", "resolved": "https://registry.npmjs.org/glob/-/glob-6.0.4.tgz", "integrity": "sha1-DwiGD2oVUSey+t1PnOJLGqtuTSI=", "dev": true, "requires": { "inflight": "^1.0.4", "inherits": "2", "minimatch": "2 || 3", "once": "^1.3.0", "path-is-absolute": "^1.0.0" } }, "glob-base": { "version": "0.3.0", "resolved": "https://registry.npmjs.org/glob-base/-/glob-base-0.3.0.tgz", "integrity": "sha1-27Fk9iIbHAscz4Kuoyi0l98Oo8Q=", "dev": true, "optional": true, "requires": { "glob-parent": "^2.0.0", "is-glob": "^2.0.0" } }, "glob-parent": { "version": "2.0.0", "resolved": "https://registry.npmjs.org/glob-parent/-/glob-parent-2.0.0.tgz", "integrity": "sha1-gTg9ctsFT8zPUzbaqQLxgvbtuyg=", "dev": true, "requires": { "is-glob": "^2.0.0" } }, "globby": { "version": "4.1.0", "resolved": "http://registry.npmjs.org/globby/-/globby-4.1.0.tgz", "integrity": "sha1-CA9UVJ7BuCpsYOYx/ILhIR2+lfg=", "dev": true, "requires": { "array-union": "^1.0.1", "arrify": "^1.0.0", "glob": "^6.0.1", "object-assign": "^4.0.1", "pify": "^2.0.0", "pinkie-promise": "^2.0.0" } }, "graceful-fs": { "version": "4.1.11", "resolved": "http://registry.npmjs.org/graceful-fs/-/graceful-fs-4.1.11.tgz", "integrity": "sha1-Dovf5NHduIVNZOBOp8AOKgJuVlg=", "dev": true }, "has-ansi": { "version": "2.0.0", "resolved": "https://registry.npmjs.org/has-ansi/-/has-ansi-2.0.0.tgz", "integrity": "sha1-NPUEnOHs3ysGSa8+8k5F7TVBbZE=", "dev": true, "requires": { "ansi-regex": "^2.0.0" } }, "has-flag": { "version": "1.0.0", "resolved": "https://registry.npmjs.org/has-flag/-/has-flag-1.0.0.tgz", "integrity": "sha1-nZ55MWXOAXoA8AQYxD+UKnsdEfo=", "dev": true }, "hosted-git-info": { "version": "2.1.5", "resolved": "https://registry.npmjs.org/hosted-git-info/-/hosted-git-info-2.1.5.tgz", "integrity": "sha1-C6gdkNouJas0ozLm7HeTbhWYEYs=", "dev": true }, "inflight": { "version": "1.0.6", "resolved": "https://registry.npmjs.org/inflight/-/inflight-1.0.6.tgz", "integrity": "sha1-Sb1jMdfQLQwJvJEKEHW6gWW1bfk=", "dev": true, "requires": { "once": "^1.3.0", "wrappy": "1" } }, "inherits": { "version": "2.0.3", "resolved": "https://registry.npmjs.org/inherits/-/inherits-2.0.3.tgz", "integrity": "sha1-Yzwsg+PaQqUC9SRmAiSA9CCCYd4=", "dev": true }, "invert-kv": { "version": "1.0.0", "resolved": "https://registry.npmjs.org/invert-kv/-/invert-kv-1.0.0.tgz", "integrity": "sha1-EEqOSqym09jNFXqO+L+rLXo//bY=", "dev": true }, "is-arrayish": { "version": "0.2.1", "resolved": "https://registry.npmjs.org/is-arrayish/-/is-arrayish-0.2.1.tgz", "integrity": "sha1-d8mYQFJ6qOyxqLppe4BkWnqSap0=", "dev": true }, "is-binary-path": { "version": "1.0.1", "resolved": "https://registry.npmjs.org/is-binary-path/-/is-binary-path-1.0.1.tgz", "integrity": "sha1-dfFmQrSA8YenEcgUFh/TpKdlWJg=", "dev": true, "optional": true, "requires": { "binary-extensions": "^1.0.0" } }, "is-buffer": { "version": "1.1.4", "resolved": "https://registry.npmjs.org/is-buffer/-/is-buffer-1.1.4.tgz", "integrity": "sha1-z8hszV3FpS+oBIkRHGkgxFfi2Ys=", "dev": true }, "is-builtin-module": { "version": "1.0.0", "resolved": "http://registry.npmjs.org/is-builtin-module/-/is-builtin-module-1.0.0.tgz", "integrity": "sha1-VAVy0096wxGfj3bDDLwbHgN6/74=", "dev": true, "requires": { "builtin-modules": "^1.0.0" } }, "is-dotfile": { "version": "1.0.2", "resolved": "https://registry.npmjs.org/is-dotfile/-/is-dotfile-1.0.2.tgz", "integrity": "sha1-LBMjg/ORmfjtwmjKAbmwB9IFzE0=", "dev": true, "optional": true }, "is-equal-shallow": { "version": "0.1.3", "resolved": "https://registry.npmjs.org/is-equal-shallow/-/is-equal-shallow-0.1.3.tgz", "integrity": "sha1-IjgJj8Ih3gvPpdnqxMRdY4qhxTQ=", "dev": true, "optional": true, "requires": { "is-primitive": "^2.0.0" } }, "is-extendable": { "version": "0.1.1", "resolved": "https://registry.npmjs.org/is-extendable/-/is-extendable-0.1.1.tgz", "integrity": "sha1-YrEQ4omkcUGOPsNqYX1HLjAd/Ik=", "dev": true, "optional": true }, "is-extglob": { "version": "1.0.0", "resolved": "https://registry.npmjs.org/is-extglob/-/is-extglob-1.0.0.tgz", "integrity": "sha1-rEaBd8SUNAWgkvyPKXYMb/xiBsA=", "dev": true }, "is-fullwidth-code-point": { "version": "1.0.0", "resolved": "https://registry.npmjs.org/is-fullwidth-code-point/-/is-fullwidth-code-point-1.0.0.tgz", "integrity": "sha1-754xOG8DGn8NZDr4L95QxFfvAMs=", "dev": true, "requires": { "number-is-nan": "^1.0.0" } }, "is-glob": { "version": "2.0.1", "resolved": "https://registry.npmjs.org/is-glob/-/is-glob-2.0.1.tgz", "integrity": "sha1-0Jb5JqPe1WAPP9/ZEZjLCIjC2GM=", "dev": true, "requires": { "is-extglob": "^1.0.0" } }, "is-number": { "version": "2.1.0", "resolved": "https://registry.npmjs.org/is-number/-/is-number-2.1.0.tgz", "integrity": "sha1-Afy7s5NGOlSPL0ZszhbezknbkI8=", "dev": true, "requires": { "kind-of": "^3.0.2" } }, "is-posix-bracket": { "version": "0.1.1", "resolved": "https://registry.npmjs.org/is-posix-bracket/-/is-posix-bracket-0.1.1.tgz", "integrity": "sha1-MzTceXdDaOkvAW5vvAqI9c1ua8Q=", "dev": true, "optional": true }, "is-primitive": { "version": "2.0.0", "resolved": "https://registry.npmjs.org/is-primitive/-/is-primitive-2.0.0.tgz", "integrity": "sha1-IHurkWOEmcB7Kt8kCkGochADRXU=", "dev": true }, "is-utf8": { "version": "0.2.1", "resolved": "https://registry.npmjs.org/is-utf8/-/is-utf8-0.2.1.tgz", "integrity": "sha1-Sw2hRCEE0bM2NA6AeX6GXPOffXI=", "dev": true }, "isarray": { "version": "1.0.0", "resolved": "https://registry.npmjs.org/isarray/-/isarray-1.0.0.tgz", "integrity": "sha1-u5NdSFgsuhaMBoNJV6VKPgcSTxE=", "dev": true }, "isobject": { "version": "2.1.0", "resolved": "https://registry.npmjs.org/isobject/-/isobject-2.1.0.tgz", "integrity": "sha1-8GVWEJaj8dou9GJy+BXIQNh+DIk=", "dev": true, "optional": true, "requires": { "isarray": "1.0.0" } }, "js-base64": { "version": "2.1.9", "resolved": "https://registry.npmjs.org/js-base64/-/js-base64-2.1.9.tgz", "integrity": "sha1-8OgK4DmkvWVLXygfyT8EqRSn/M4=", "dev": true }, "kind-of": { "version": "3.0.4", "resolved": "http://registry.npmjs.org/kind-of/-/kind-of-3.0.4.tgz", "integrity": "sha1-e47PGKThf4Jp1ztQHJ8jLJaIenQ=", "dev": true, "requires": { "is-buffer": "^1.0.2" } }, "lcid": { "version": "1.0.0", "resolved": "https://registry.npmjs.org/lcid/-/lcid-1.0.0.tgz", "integrity": "sha1-MIrMr6C8SDo4Z7S28rlQYlHRuDU=", "dev": true, "requires": { "invert-kv": "^1.0.0" } }, "load-json-file": { "version": "1.1.0", "resolved": "http://registry.npmjs.org/load-json-file/-/load-json-file-1.1.0.tgz", "integrity": "sha1-lWkFcI1YtLq0wiYbBPWfMcmTdMA=", "dev": true, "requires": { "graceful-fs": "^4.1.2", "parse-json": "^2.2.0", "pify": "^2.0.0", "pinkie-promise": "^2.0.0", "strip-bom": "^2.0.0" } }, "lodash.assign": { "version": "4.2.0", "resolved": "https://registry.npmjs.org/lodash.assign/-/lodash.assign-4.2.0.tgz", "integrity": "sha1-DZnzzNem0mHRm9rrkkUAXShYCOc=", "dev": true }, "micromatch": { "version": "2.3.11", "resolved": "https://registry.npmjs.org/micromatch/-/micromatch-2.3.11.tgz", "integrity": "sha1-hmd8l9FyCzY0MdBNDRUpO9OMFWU=", "dev": true, "optional": true, "requires": { "arr-diff": "^2.0.0", "array-unique": "^0.2.1", "braces": "^1.8.2", "expand-brackets": "^0.1.4", "extglob": "^0.3.1", "filename-regex": "^2.0.0", "is-extglob": "^1.0.0", "is-glob": "^2.0.1", "kind-of": "^3.0.2", "normalize-path": "^2.0.1", "object.omit": "^2.0.0", "parse-glob": "^3.0.4", "regex-cache": "^0.4.2" } }, "minimatch": { "version": "3.0.3", "resolved": "https://registry.npmjs.org/minimatch/-/minimatch-3.0.3.tgz", "integrity": "sha1-Kk5AkLlrLbBqnX3wEFWmKnfJt3Q=", "dev": true, "requires": { "brace-expansion": "^1.0.0" } }, "minimist": { "version": "0.0.8", "resolved": "http://registry.npmjs.org/minimist/-/minimist-0.0.8.tgz", "integrity": "sha1-hX/Kv8M5fSYluCKCYuhqp6ARsF0=", "dev": true }, "mkdirp": { "version": "0.5.1", "resolved": "http://registry.npmjs.org/mkdirp/-/mkdirp-0.5.1.tgz", "integrity": "sha1-MAV0OOrGz3+MR2fzhkjWaX11yQM=", "dev": true, "requires": { "minimist": "0.0.8" } }, "nan": { "version": "2.11.1", "resolved": "https://registry.npmjs.org/nan/-/nan-2.11.1.tgz", "integrity": "sha512-iji6k87OSXa0CcrLl9z+ZiYSuR2o+c0bGuNmXdrhTQTakxytAFsC56SArGYoiHlJlFoHSnvmhpceZJaXkVuOtA==", "dev": true, "optional": true }, "neo-async": { "version": "1.8.2", "resolved": "http://registry.npmjs.org/neo-async/-/neo-async-1.8.2.tgz", "integrity": "sha1-MXlYiLed0ENXp8UhE6ZRg+k7ZzU=", "dev": true }, "normalize-package-data": { "version": "2.3.5", "resolved": "https://registry.npmjs.org/normalize-package-data/-/normalize-package-data-2.3.5.tgz", "integrity": "sha1-jZJPFClg4Xd+f/4XBUNjHMfLAt8=", "dev": true, "requires": { "hosted-git-info": "^2.1.4", "is-builtin-module": "^1.0.0", "semver": "2 || 3 || 4 || 5", "validate-npm-package-license": "^3.0.1" } }, "normalize-path": { "version": "2.0.1", "resolved": "https://registry.npmjs.org/normalize-path/-/normalize-path-2.0.1.tgz", "integrity": "sha1-R4hqwWYnYNQmG32XnSQXCdPOP3o=", "dev": true, "optional": true }, "normalize-range": { "version": "0.1.2", "resolved": "https://registry.npmjs.org/normalize-range/-/normalize-range-0.1.2.tgz", "integrity": "sha1-LRDAa9/TEuqXd2laTShDlFa3WUI=", "dev": true }, "num2fraction": { "version": "1.2.2", "resolved": "https://registry.npmjs.org/num2fraction/-/num2fraction-1.2.2.tgz", "integrity": "sha1-b2gragJ6Tp3fpFZM0lidHU5mnt4=", "dev": true }, "number-is-nan": { "version": "1.0.1", "resolved": "https://registry.npmjs.org/number-is-nan/-/number-is-nan-1.0.1.tgz", "integrity": "sha1-CXtgK1NCKlIsGvuHkDGDNpQaAR0=", "dev": true }, "nyc": { "version": "11.9.0", "resolved": "https://registry.npmjs.org/nyc/-/nyc-11.9.0.tgz", "integrity": "sha512-w8OdJAhXL5izerzZMdqzYKMj/pgHJyY3qEPYBjLLxrhcVoHEY9pU5ENIiZyCgG9OR7x3VcUMoD40o6PtVpfR4g==", "dev": true, "requires": { "archy": "^1.0.0", "arrify": "^1.0.1", "caching-transform": "^1.0.0", "convert-source-map": "^1.5.1", "debug-log": "^1.0.1", "default-require-extensions": "^1.0.0", "find-cache-dir": "^0.1.1", "find-up": "^2.1.0", "foreground-child": "^1.5.3", "glob": "^7.0.6", "istanbul-lib-coverage": "^1.1.2", "istanbul-lib-hook": "^1.1.0", "istanbul-lib-instrument": "^1.10.0", "istanbul-lib-report": "^1.1.3", "istanbul-lib-source-maps": "^1.2.3", "istanbul-reports": "^1.4.0", "md5-hex": "^1.2.0", "merge-source-map": "^1.1.0", "micromatch": "^3.1.10", "mkdirp": "^0.5.0", "resolve-from": "^2.0.0", "rimraf": "^2.6.2", "signal-exit": "^3.0.1", "spawn-wrap": "^1.4.2", "test-exclude": "^4.2.0", "yargs": "11.1.0", "yargs-parser": "^8.0.0" }, "dependencies": { "align-text": { "version": "0.1.4", "bundled": true, "dev": true, "requires": { "kind-of": "^3.0.2", "longest": "^1.0.1", "repeat-string": "^1.5.2" } }, "amdefine": { "version": "1.0.1", "bundled": true, "dev": true }, "ansi-regex": { "version": "2.1.1", "bundled": true, "dev": true }, "ansi-styles": { "version": "2.2.1", "bundled": true, "dev": true }, "append-transform": { "version": "0.4.0", "bundled": true, "dev": true, "requires": { "default-require-extensions": "^1.0.0" } }, "archy": { "version": "1.0.0", "bundled": true, "dev": true }, "arr-diff": { "version": "4.0.0", "bundled": true, "dev": true }, "arr-flatten": { "version": "1.1.0", "bundled": true, "dev": true }, "arr-union": { "version": "3.1.0", "bundled": true, "dev": true }, "array-unique": { "version": "0.3.2", "bundled": true, "dev": true }, "arrify": { "version": "1.0.1", "bundled": true, "dev": true }, "assign-symbols": { "version": "1.0.0", "bundled": true, "dev": true }, "async": { "version": "1.5.2", "bundled": true, "dev": true }, "atob": { "version": "2.1.1", "bundled": true, "dev": true }, "babel-code-frame": { "version": "6.26.0", "bundled": true, "dev": true, "requires": { "chalk": "^1.1.3", "esutils": "^2.0.2", "js-tokens": "^3.0.2" } }, "babel-generator": { "version": "6.26.1", "bundled": true, "dev": true, "requires": { "babel-messages": "^6.23.0", "babel-runtime": "^6.26.0", "babel-types": "^6.26.0", "detect-indent": "^4.0.0", "jsesc": "^1.3.0", "lodash": "^4.17.4", "source-map": "^0.5.7", "trim-right": "^1.0.1" } }, "babel-messages": { "version": "6.23.0", "bundled": true, "dev": true, "requires": { "babel-runtime": "^6.22.0" } }, "babel-runtime": { "version": "6.26.0", "bundled": true, "dev": true, "requires": { "core-js": "^2.4.0", "regenerator-runtime": "^0.11.0" } }, "babel-template": { "version": "6.26.0", "bundled": true, "dev": true, "requires": { "babel-runtime": "^6.26.0", "babel-traverse": "^6.26.0", "babel-types": "^6.26.0", "babylon": "^6.18.0", "lodash": "^4.17.4" } }, "babel-traverse": { "version": "6.26.0", "bundled": true, "dev": true, "requires": { "babel-code-frame": "^6.26.0", "babel-messages": "^6.23.0", "babel-runtime": "^6.26.0", "babel-types": "^6.26.0", "babylon": "^6.18.0", "debug": "^2.6.8", "globals": "^9.18.0", "invariant": "^2.2.2", "lodash": "^4.17.4" } }, "babel-types": { "version": "6.26.0", "bundled": true, "dev": true, "requires": { "babel-runtime": "^6.26.0", "esutils": "^2.0.2", "lodash": "^4.17.4", "to-fast-properties": "^1.0.3" } }, "babylon": { "version": "6.18.0", "bundled": true, "dev": true }, "balanced-match": { "version": "1.0.0", "bundled": true, "dev": true }, "base": { "version": "0.11.2", "bundled": true, "dev": true, "requires": { "cache-base": "^1.0.1", "class-utils": "^0.3.5", "component-emitter": "^1.2.1", "define-property": "^1.0.0", "isobject": "^3.0.1", "mixin-deep": "^1.2.0", "pascalcase": "^0.1.1" }, "dependencies": { "define-property": { "version": "1.0.0", "bundled": true, "dev": true, "requires": { "is-descriptor": "^1.0.0" } }, "is-accessor-descriptor": { "version": "1.0.0", "bundled": true, "dev": true, "requires": { "kind-of": "^6.0.0" } }, "is-data-descriptor": { "version": "1.0.0", "bundled": true, "dev": true, "requires": { "kind-of": "^6.0.0" } }, "is-descriptor": { "version": "1.0.2", "bundled": true, "dev": true, "requires": { "is-accessor-descriptor": "^1.0.0", "is-data-descriptor": "^1.0.0", "kind-of": "^6.0.2" } }, "isobject": { "version": "3.0.1", "bundled": true, "dev": true }, "kind-of": { "version": "6.0.2", "bundled": true, "dev": true } } }, "brace-expansion": { "version": "1.1.11", "bundled": true, "dev": true, "requires": { "balanced-match": "^1.0.0", "concat-map": "0.0.1" } }, "braces": { "version": "2.3.2", "bundled": true, "dev": true, "requires": { "arr-flatten": "^1.1.0", "array-unique": "^0.3.2", "extend-shallow": "^2.0.1", "fill-range": "^4.0.0", "isobject": "^3.0.1", "repeat-element": "^1.1.2", "snapdragon": "^0.8.1", "snapdragon-node": "^2.0.1", "split-string": "^3.0.2", "to-regex": "^3.0.1" }, "dependencies": { "extend-shallow": { "version": "2.0.1", "bundled": true, "dev": true, "requires": { "is-extendable": "^0.1.0" } } } }, "builtin-modules": { "version": "1.1.1", "bundled": true, "dev": true }, "cache-base": { "version": "1.0.1", "bundled": true, "dev": true, "requires": { "collection-visit": "^1.0.0", "component-emitter": "^1.2.1", "get-value": "^2.0.6", "has-value": "^1.0.0", "isobject": "^3.0.1", "set-value": "^2.0.0", "to-object-path": "^0.3.0", "union-value": "^1.0.0", "unset-value": "^1.0.0" }, "dependencies": { "isobject": { "version": "3.0.1", "bundled": true, "dev": true } } }, "caching-transform": { "version": "1.0.1", "bundled": true, "dev": true, "requires": { "md5-hex": "^1.2.0", "mkdirp": "^0.5.1", "write-file-atomic": "^1.1.4" } }, "camelcase": { "version": "1.2.1", "bundled": true, "dev": true, "optional": true }, "center-align": { "version": "0.1.3", "bundled": true, "dev": true, "optional": true, "requires": { "align-text": "^0.1.3", "lazy-cache": "^1.0.3" } }, "chalk": { "version": "1.1.3", "bundled": true, "dev": true, "requires": { "ansi-styles": "^2.2.1", "escape-string-regexp": "^1.0.2", "has-ansi": "^2.0.0", "strip-ansi": "^3.0.0", "supports-color": "^2.0.0" } }, "class-utils": { "version": "0.3.6", "bundled": true, "dev": true, "requires": { "arr-union": "^3.1.0", "define-property": "^0.2.5", "isobject": "^3.0.0", "static-extend": "^0.1.1" }, "dependencies": { "define-property": { "version": "0.2.5", "bundled": true, "dev": true, "requires": { "is-descriptor": "^0.1.0" } }, "isobject": { "version": "3.0.1", "bundled": true, "dev": true } } }, "cliui": { "version": "2.1.0", "bundled": true, "dev": true, "optional": true, "requires": { "center-align": "^0.1.1", "right-align": "^0.1.1", "wordwrap": "0.0.2" }, "dependencies": { "wordwrap": { "version": "0.0.2", "bundled": true, "dev": true, "optional": true } } }, "code-point-at": { "version": "1.1.0", "bundled": true, "dev": true }, "collection-visit": { "version": "1.0.0", "bundled": true, "dev": true, "requires": { "map-visit": "^1.0.0", "object-visit": "^1.0.0" } }, "commondir": { "version": "1.0.1", "bundled": true, "dev": true }, "component-emitter": { "version": "1.2.1", "bundled": true, "dev": true }, "concat-map": { "version": "0.0.1", "bundled": true, "dev": true }, "convert-source-map": { "version": "1.5.1", "bundled": true, "dev": true }, "copy-descriptor": { "version": "0.1.1", "bundled": true, "dev": true }, "core-js": { "version": "2.5.6", "bundled": true, "dev": true }, "cross-spawn": { "version": "4.0.2", "bundled": true, "dev": true, "requires": { "lru-cache": "^4.0.1", "which": "^1.2.9" } }, "debug": { "version": "2.6.9", "bundled": true, "dev": true, "requires": { "ms": "2.0.0" } }, "debug-log": { "version": "1.0.1", "bundled": true, "dev": true }, "decamelize": { "version": "1.2.0", "bundled": true, "dev": true }, "decode-uri-component": { "version": "0.2.0", "bundled": true, "dev": true }, "default-require-extensions": { "version": "1.0.0", "bundled": true, "dev": true, "requires": { "strip-bom": "^2.0.0" } }, "define-property": { "version": "2.0.2", "bundled": true, "dev": true, "requires": { "is-descriptor": "^1.0.2", "isobject": "^3.0.1" }, "dependencies": { "is-accessor-descriptor": { "version": "1.0.0", "bundled": true, "dev": true, "requires": { "kind-of": "^6.0.0" } }, "is-data-descriptor": { "version": "1.0.0", "bundled": true, "dev": true, "requires": { "kind-of": "^6.0.0" } }, "is-descriptor": { "version": "1.0.2", "bundled": true, "dev": true, "requires": { "is-accessor-descriptor": "^1.0.0", "is-data-descriptor": "^1.0.0", "kind-of": "^6.0.2" } }, "isobject": { "version": "3.0.1", "bundled": true, "dev": true }, "kind-of": { "version": "6.0.2", "bundled": true, "dev": true } } }, "detect-indent": { "version": "4.0.0", "bundled": true, "dev": true, "requires": { "repeating": "^2.0.0" } }, "error-ex": { "version": "1.3.1", "bundled": true, "dev": true, "requires": { "is-arrayish": "^0.2.1" } }, "escape-string-regexp": { "version": "1.0.5", "bundled": true, "dev": true }, "esutils": { "version": "2.0.2", "bundled": true, "dev": true }, "execa": { "version": "0.7.0", "bundled": true, "dev": true, "requires": { "cross-spawn": "^5.0.1", "get-stream": "^3.0.0", "is-stream": "^1.1.0", "npm-run-path": "^2.0.0", "p-finally": "^1.0.0", "signal-exit": "^3.0.0", "strip-eof": "^1.0.0" }, "dependencies": { "cross-spawn": { "version": "5.1.0", "bundled": true, "dev": true, "requires": { "lru-cache": "^4.0.1", "shebang-command": "^1.2.0", "which": "^1.2.9" } } } }, "expand-brackets": { "version": "2.1.4", "bundled": true, "dev": true, "requires": { "debug": "^2.3.3", "define-property": "^0.2.5", "extend-shallow": "^2.0.1", "posix-character-classes": "^0.1.0", "regex-not": "^1.0.0", "snapdragon": "^0.8.1", "to-regex": "^3.0.1" }, "dependencies": { "define-property": { "version": "0.2.5", "bundled": true, "dev": true, "requires": { "is-descriptor": "^0.1.0" } }, "extend-shallow": { "version": "2.0.1", "bundled": true, "dev": true, "requires": { "is-extendable": "^0.1.0" } } } }, "extend-shallow": { "version": "3.0.2", "bundled": true, "dev": true, "requires": { "assign-symbols": "^1.0.0", "is-extendable": "^1.0.1" }, "dependencies": { "is-extendable": { "version": "1.0.1", "bundled": true, "dev": true, "requires": { "is-plain-object": "^2.0.4" } } } }, "extglob": { "version": "2.0.4", "bundled": true, "dev": true, "requires": { "array-unique": "^0.3.2", "define-property": "^1.0.0", "expand-brackets": "^2.1.4", "extend-shallow": "^2.0.1", "fragment-cache": "^0.2.1", "regex-not": "^1.0.0", "snapdragon": "^0.8.1", "to-regex": "^3.0.1" }, "dependencies": { "define-property": { "version": "1.0.0", "bundled": true, "dev": true, "requires": { "is-descriptor": "^1.0.0" } }, "extend-shallow": { "version": "2.0.1", "bundled": true, "dev": true, "requires": { "is-extendable": "^0.1.0" } }, "is-accessor-descriptor": { "version": "1.0.0", "bundled": true, "dev": true, "requires": { "kind-of": "^6.0.0" } }, "is-data-descriptor": { "version": "1.0.0", "bundled": true, "dev": true, "requires": { "kind-of": "^6.0.0" } }, "is-descriptor": { "version": "1.0.2", "bundled": true, "dev": true, "requires": { "is-accessor-descriptor": "^1.0.0", "is-data-descriptor": "^1.0.0", "kind-of": "^6.0.2" } }, "kind-of": { "version": "6.0.2", "bundled": true, "dev": true } } }, "fill-range": { "version": "4.0.0", "bundled": true, "dev": true, "requires": { "extend-shallow": "^2.0.1", "is-number": "^3.0.0", "repeat-string": "^1.6.1", "to-regex-range": "^2.1.0" }, "dependencies": { "extend-shallow": { "version": "2.0.1", "bundled": true, "dev": true, "requires": { "is-extendable": "^0.1.0" } } } }, "find-cache-dir": { "version": "0.1.1", "bundled": true, "dev": true, "requires": { "commondir": "^1.0.1", "mkdirp": "^0.5.1", "pkg-dir": "^1.0.0" } }, "find-up": { "version": "2.1.0", "bundled": true, "dev": true, "requires": { "locate-path": "^2.0.0" } }, "for-in": { "version": "1.0.2", "bundled": true, "dev": true }, "foreground-child": { "version": "1.5.6", "bundled": true, "dev": true, "requires": { "cross-spawn": "^4", "signal-exit": "^3.0.0" } }, "fragment-cache": { "version": "0.2.1", "bundled": true, "dev": true, "requires": { "map-cache": "^0.2.2" } }, "fs.realpath": { "version": "1.0.0", "bundled": true, "dev": true }, "get-caller-file": { "version": "1.0.2", "bundled": true, "dev": true }, "get-stream": { "version": "3.0.0", "bundled": true, "dev": true }, "get-value": { "version": "2.0.6", "bundled": true, "dev": true }, "glob": { "version": "7.1.2", "bundled": true, "dev": true, "requires": { "fs.realpath": "^1.0.0", "inflight": "^1.0.4", "inherits": "2", "minimatch": "^3.0.4", "once": "^1.3.0", "path-is-absolute": "^1.0.0" } }, "globals": { "version": "9.18.0", "bundled": true, "dev": true }, "graceful-fs": { "version": "4.1.11", "bundled": true, "dev": true }, "handlebars": { "version": "4.0.11", "bundled": true, "dev": true, "requires": { "async": "^1.4.0", "optimist": "^0.6.1", "source-map": "^0.4.4", "uglify-js": "^2.6" }, "dependencies": { "source-map": { "version": "0.4.4", "bundled": true, "dev": true, "requires": { "amdefine": ">=0.0.4" } } } }, "has-ansi": { "version": "2.0.0", "bundled": true, "dev": true, "requires": { "ansi-regex": "^2.0.0" } }, "has-flag": { "version": "1.0.0", "bundled": true, "dev": true }, "has-value": { "version": "1.0.0", "bundled": true, "dev": true, "requires": { "get-value": "^2.0.6", "has-values": "^1.0.0", "isobject": "^3.0.0" }, "dependencies": { "isobject": { "version": "3.0.1", "bundled": true, "dev": true } } }, "has-values": { "version": "1.0.0", "bundled": true, "dev": true, "requires": { "is-number": "^3.0.0", "kind-of": "^4.0.0" }, "dependencies": { "is-number": { "version": "3.0.0", "bundled": true, "dev": true, "requires": { "kind-of": "^3.0.2" }, "dependencies": { "kind-of": { "version": "3.2.2", "bundled": true, "dev": true, "requires": { "is-buffer": "^1.1.5" } } } }, "kind-of": { "version": "4.0.0", "bundled": true, "dev": true, "requires": { "is-buffer": "^1.1.5" } } } }, "hosted-git-info": { "version": "2.6.0", "bundled": true, "dev": true }, "imurmurhash": { "version": "0.1.4", "bundled": true, "dev": true }, "inflight": { "version": "1.0.6", "bundled": true, "dev": true, "requires": { "once": "^1.3.0", "wrappy": "1" } }, "inherits": { "version": "2.0.3", "bundled": true, "dev": true }, "invariant": { "version": "2.2.4", "bundled": true, "dev": true, "requires": { "loose-envify": "^1.0.0" } }, "invert-kv": { "version": "1.0.0", "bundled": true, "dev": true }, "is-accessor-descriptor": { "version": "0.1.6", "bundled": true, "dev": true, "requires": { "kind-of": "^3.0.2" } }, "is-arrayish": { "version": "0.2.1", "bundled": true, "dev": true }, "is-buffer": { "version": "1.1.6", "bundled": true, "dev": true }, "is-builtin-module": { "version": "1.0.0", "bundled": true, "dev": true, "requires": { "builtin-modules": "^1.0.0" } }, "is-data-descriptor": { "version": "0.1.4", "bundled": true, "dev": true, "requires": { "kind-of": "^3.0.2" } }, "is-descriptor": { "version": "0.1.6", "bundled": true, "dev": true, "requires": { "is-accessor-descriptor": "^0.1.6", "is-data-descriptor": "^0.1.4", "kind-of": "^5.0.0" }, "dependencies": { "kind-of": { "version": "5.1.0", "bundled": true, "dev": true } } }, "is-extendable": { "version": "0.1.1", "bundled": true, "dev": true }, "is-finite": { "version": "1.0.2", "bundled": true, "dev": true, "requires": { "number-is-nan": "^1.0.0" } }, "is-fullwidth-code-point": { "version": "2.0.0", "bundled": true, "dev": true }, "is-number": { "version": "3.0.0", "bundled": true, "dev": true, "requires": { "kind-of": "^3.0.2" } }, "is-odd": { "version": "2.0.0", "bundled": true, "dev": true, "requires": { "is-number": "^4.0.0" }, "dependencies": { "is-number": { "version": "4.0.0", "bundled": true, "dev": true } } }, "is-plain-object": { "version": "2.0.4", "bundled": true, "dev": true, "requires": { "isobject": "^3.0.1" }, "dependencies": { "isobject": { "version": "3.0.1", "bundled": true, "dev": true } } }, "is-stream": { "version": "1.1.0", "bundled": true, "dev": true }, "is-utf8": { "version": "0.2.1", "bundled": true, "dev": true }, "is-windows": { "version": "1.0.2", "bundled": true, "dev": true }, "isarray": { "version": "1.0.0", "bundled": true, "dev": true }, "isexe": { "version": "2.0.0", "bundled": true, "dev": true }, "isobject": { "version": "3.0.1", "bundled": true, "dev": true }, "istanbul-lib-coverage": { "version": "1.2.0", "bundled": true, "dev": true }, "istanbul-lib-hook": { "version": "1.1.0", "bundled": true, "dev": true, "requires": { "append-transform": "^0.4.0" } }, "istanbul-lib-instrument": { "version": "1.10.1", "bundled": true, "dev": true, "requires": { "babel-generator": "^6.18.0", "babel-template": "^6.16.0", "babel-traverse": "^6.18.0", "babel-types": "^6.18.0", "babylon": "^6.18.0", "istanbul-lib-coverage": "^1.2.0", "semver": "^5.3.0" } }, "istanbul-lib-report": { "version": "1.1.3", "bundled": true, "dev": true, "requires": { "istanbul-lib-coverage": "^1.1.2", "mkdirp": "^0.5.1", "path-parse": "^1.0.5", "supports-color": "^3.1.2" }, "dependencies": { "supports-color": { "version": "3.2.3", "bundled": true, "dev": true, "requires": { "has-flag": "^1.0.0" } } } }, "istanbul-lib-source-maps": { "version": "1.2.3", "bundled": true, "dev": true, "requires": { "debug": "^3.1.0", "istanbul-lib-coverage": "^1.1.2", "mkdirp": "^0.5.1", "rimraf": "^2.6.1", "source-map": "^0.5.3" }, "dependencies": { "debug": { "version": "3.1.0", "bundled": true, "dev": true, "requires": { "ms": "2.0.0" } } } }, "istanbul-reports": { "version": "1.4.0", "bundled": true, "dev": true, "requires": { "handlebars": "^4.0.3" } }, "js-tokens": { "version": "3.0.2", "bundled": true, "dev": true }, "jsesc": { "version": "1.3.0", "bundled": true, "dev": true }, "kind-of": { "version": "3.2.2", "bundled": true, "dev": true, "requires": { "is-buffer": "^1.1.5" } }, "lazy-cache": { "version": "1.0.4", "bundled": true, "dev": true, "optional": true }, "lcid": { "version": "1.0.0", "bundled": true, "dev": true, "requires": { "invert-kv": "^1.0.0" } }, "load-json-file": { "version": "1.1.0", "bundled": true, "dev": true, "requires": { "graceful-fs": "^4.1.2", "parse-json": "^2.2.0", "pify": "^2.0.0", "pinkie-promise": "^2.0.0", "strip-bom": "^2.0.0" } }, "locate-path": { "version": "2.0.0", "bundled": true, "dev": true, "requires": { "p-locate": "^2.0.0", "path-exists": "^3.0.0" }, "dependencies": { "path-exists": { "version": "3.0.0", "bundled": true, "dev": true } } }, "lodash": { "version": "4.17.10", "bundled": true, "dev": true }, "longest": { "version": "1.0.1", "bundled": true, "dev": true }, "loose-envify": { "version": "1.3.1", "bundled": true, "dev": true, "requires": { "js-tokens": "^3.0.0" } }, "lru-cache": { "version": "4.1.3", "bundled": true, "dev": true, "requires": { "pseudomap": "^1.0.2", "yallist": "^2.1.2" } }, "map-cache": { "version": "0.2.2", "bundled": true, "dev": true }, "map-visit": { "version": "1.0.0", "bundled": true, "dev": true, "requires": { "object-visit": "^1.0.0" } }, "md5-hex": { "version": "1.3.0", "bundled": true, "dev": true, "requires": { "md5-o-matic": "^0.1.1" } }, "md5-o-matic": { "version": "0.1.1", "bundled": true, "dev": true }, "mem": { "version": "1.1.0", "bundled": true, "dev": true, "requires": { "mimic-fn": "^1.0.0" } }, "merge-source-map": { "version": "1.1.0", "bundled": true, "dev": true, "requires": { "source-map": "^0.6.1" }, "dependencies": { "source-map": { "version": "0.6.1", "bundled": true, "dev": true } } }, "micromatch": { "version": "3.1.10", "bundled": true, "dev": true, "requires": { "arr-diff": "^4.0.0", "array-unique": "^0.3.2", "braces": "^2.3.1", "define-property": "^2.0.2", "extend-shallow": "^3.0.2", "extglob": "^2.0.4", "fragment-cache": "^0.2.1", "kind-of": "^6.0.2", "nanomatch": "^1.2.9", "object.pick": "^1.3.0", "regex-not": "^1.0.0", "snapdragon": "^0.8.1", "to-regex": "^3.0.2" }, "dependencies": { "kind-of": { "version": "6.0.2", "bundled": true, "dev": true } } }, "mimic-fn": { "version": "1.2.0", "bundled": true, "dev": true }, "minimatch": { "version": "3.0.4", "bundled": true, "dev": true, "requires": { "brace-expansion": "^1.1.7" } }, "minimist": { "version": "0.0.8", "bundled": true, "dev": true }, "mixin-deep": { "version": "1.3.1", "bundled": true, "dev": true, "requires": { "for-in": "^1.0.2", "is-extendable": "^1.0.1" }, "dependencies": { "is-extendable": { "version": "1.0.1", "bundled": true, "dev": true, "requires": { "is-plain-object": "^2.0.4" } } } }, "mkdirp": { "version": "0.5.1", "bundled": true, "dev": true, "requires": { "minimist": "0.0.8" } }, "ms": { "version": "2.0.0", "bundled": true, "dev": true }, "nanomatch": { "version": "1.2.9", "bundled": true, "dev": true, "requires": { "arr-diff": "^4.0.0", "array-unique": "^0.3.2", "define-property": "^2.0.2", "extend-shallow": "^3.0.2", "fragment-cache": "^0.2.1", "is-odd": "^2.0.0", "is-windows": "^1.0.2", "kind-of": "^6.0.2", "object.pick": "^1.3.0", "regex-not": "^1.0.0", "snapdragon": "^0.8.1", "to-regex": "^3.0.1" }, "dependencies": { "arr-diff": { "version": "4.0.0", "bundled": true, "dev": true }, "array-unique": { "version": "0.3.2", "bundled": true, "dev": true }, "kind-of": { "version": "6.0.2", "bundled": true, "dev": true } } }, "normalize-package-data": { "version": "2.4.0", "bundled": true, "dev": true, "requires": { "hosted-git-info": "^2.1.4", "is-builtin-module": "^1.0.0", "semver": "2 || 3 || 4 || 5", "validate-npm-package-license": "^3.0.1" } }, "npm-run-path": { "version": "2.0.2", "bundled": true, "dev": true, "requires": { "path-key": "^2.0.0" } }, "number-is-nan": { "version": "1.0.1", "bundled": true, "dev": true }, "object-assign": { "version": "4.1.1", "bundled": true, "dev": true }, "object-copy": { "version": "0.1.0", "bundled": true, "dev": true, "requires": { "copy-descriptor": "^0.1.0", "define-property": "^0.2.5", "kind-of": "^3.0.3" }, "dependencies": { "define-property": { "version": "0.2.5", "bundled": true, "dev": true, "requires": { "is-descriptor": "^0.1.0" } } } }, "object-visit": { "version": "1.0.1", "bundled": true, "dev": true, "requires": { "isobject": "^3.0.0" }, "dependencies": { "isobject": { "version": "3.0.1", "bundled": true, "dev": true } } }, "object.pick": { "version": "1.3.0", "bundled": true, "dev": true, "requires": { "isobject": "^3.0.1" }, "dependencies": { "isobject": { "version": "3.0.1", "bundled": true, "dev": true } } }, "once": { "version": "1.4.0", "bundled": true, "dev": true, "requires": { "wrappy": "1" } }, "optimist": { "version": "0.6.1", "bundled": true, "dev": true, "requires": { "minimist": "~0.0.1", "wordwrap": "~0.0.2" } }, "os-homedir": { "version": "1.0.2", "bundled": true, "dev": true }, "os-locale": { "version": "2.1.0", "bundled": true, "dev": true, "requires": { "execa": "^0.7.0", "lcid": "^1.0.0", "mem": "^1.1.0" } }, "p-finally": { "version": "1.0.0", "bundled": true, "dev": true }, "p-limit": { "version": "1.2.0", "bundled": true, "dev": true, "requires": { "p-try": "^1.0.0" } }, "p-locate": { "version": "2.0.0", "bundled": true, "dev": true, "requires": { "p-limit": "^1.1.0" } }, "p-try": { "version": "1.0.0", "bundled": true, "dev": true }, "parse-json": { "version": "2.2.0", "bundled": true, "dev": true, "requires": { "error-ex": "^1.2.0" } }, "pascalcase": { "version": "0.1.1", "bundled": true, "dev": true }, "path-exists": { "version": "2.1.0", "bundled": true, "dev": true, "requires": { "pinkie-promise": "^2.0.0" } }, "path-is-absolute": { "version": "1.0.1", "bundled": true, "dev": true }, "path-key": { "version": "2.0.1", "bundled": true, "dev": true }, "path-parse": { "version": "1.0.5", "bundled": true, "dev": true }, "path-type": { "version": "1.1.0", "bundled": true, "dev": true, "requires": { "graceful-fs": "^4.1.2", "pify": "^2.0.0", "pinkie-promise": "^2.0.0" } }, "pify": { "version": "2.3.0", "bundled": true, "dev": true }, "pinkie": { "version": "2.0.4", "bundled": true, "dev": true }, "pinkie-promise": { "version": "2.0.1", "bundled": true, "dev": true, "requires": { "pinkie": "^2.0.0" } }, "pkg-dir": { "version": "1.0.0", "bundled": true, "dev": true, "requires": { "find-up": "^1.0.0" }, "dependencies": { "find-up": { "version": "1.1.2", "bundled": true, "dev": true, "requires": { "path-exists": "^2.0.0", "pinkie-promise": "^2.0.0" } } } }, "posix-character-classes": { "version": "0.1.1", "bundled": true, "dev": true }, "pseudomap": { "version": "1.0.2", "bundled": true, "dev": true }, "read-pkg": { "version": "1.1.0", "bundled": true, "dev": true, "requires": { "load-json-file": "^1.0.0", "normalize-package-data": "^2.3.2", "path-type": "^1.0.0" } }, "read-pkg-up": { "version": "1.0.1", "bundled": true, "dev": true, "requires": { "find-up": "^1.0.0", "read-pkg": "^1.0.0" }, "dependencies": { "find-up": { "version": "1.1.2", "bundled": true, "dev": true, "requires": { "path-exists": "^2.0.0", "pinkie-promise": "^2.0.0" } } } }, "regenerator-runtime": { "version": "0.11.1", "bundled": true, "dev": true }, "regex-not": { "version": "1.0.2", "bundled": true, "dev": true, "requires": { "extend-shallow": "^3.0.2", "safe-regex": "^1.1.0" } }, "repeat-element": { "version": "1.1.2", "bundled": true, "dev": true }, "repeat-string": { "version": "1.6.1", "bundled": true, "dev": true }, "repeating": { "version": "2.0.1", "bundled": true, "dev": true, "requires": { "is-finite": "^1.0.0" } }, "require-directory": { "version": "2.1.1", "bundled": true, "dev": true }, "require-main-filename": { "version": "1.0.1", "bundled": true, "dev": true }, "resolve-from": { "version": "2.0.0", "bundled": true, "dev": true }, "resolve-url": { "version": "0.2.1", "bundled": true, "dev": true }, "ret": { "version": "0.1.15", "bundled": true, "dev": true }, "right-align": { "version": "0.1.3", "bundled": true, "dev": true, "optional": true, "requires": { "align-text": "^0.1.1" } }, "rimraf": { "version": "2.6.2", "bundled": true, "dev": true, "requires": { "glob": "^7.0.5" } }, "safe-regex": { "version": "1.1.0", "bundled": true, "dev": true, "requires": { "ret": "~0.1.10" } }, "semver": { "version": "5.5.0", "bundled": true, "dev": true }, "set-blocking": { "version": "2.0.0", "bundled": true, "dev": true }, "set-value": { "version": "2.0.0", "bundled": true, "dev": true, "requires": { "extend-shallow": "^2.0.1", "is-extendable": "^0.1.1", "is-plain-object": "^2.0.3", "split-string": "^3.0.1" }, "dependencies": { "extend-shallow": { "version": "2.0.1", "bundled": true, "dev": true, "requires": { "is-extendable": "^0.1.0" } } } }, "shebang-command": { "version": "1.2.0", "bundled": true, "dev": true, "requires": { "shebang-regex": "^1.0.0" } }, "shebang-regex": { "version": "1.0.0", "bundled": true, "dev": true }, "signal-exit": { "version": "3.0.2", "bundled": true, "dev": true }, "slide": { "version": "1.1.6", "bundled": true, "dev": true }, "snapdragon": { "version": "0.8.2", "bundled": true, "dev": true, "requires": { "base": "^0.11.1", "debug": "^2.2.0", "define-property": "^0.2.5", "extend-shallow": "^2.0.1", "map-cache": "^0.2.2", "source-map": "^0.5.6", "source-map-resolve": "^0.5.0", "use": "^3.1.0" }, "dependencies": { "define-property": { "version": "0.2.5", "bundled": true, "dev": true, "requires": { "is-descriptor": "^0.1.0" } }, "extend-shallow": { "version": "2.0.1", "bundled": true, "dev": true, "requires": { "is-extendable": "^0.1.0" } } } }, "snapdragon-node": { "version": "2.1.1", "bundled": true, "dev": true, "requires": { "define-property": "^1.0.0", "isobject": "^3.0.0", "snapdragon-util": "^3.0.1" }, "dependencies": { "define-property": { "version": "1.0.0", "bundled": true, "dev": true, "requires": { "is-descriptor": "^1.0.0" } }, "is-accessor-descriptor": { "version": "1.0.0", "bundled": true, "dev": true, "requires": { "kind-of": "^6.0.0" } }, "is-data-descriptor": { "version": "1.0.0", "bundled": true, "dev": true, "requires": { "kind-of": "^6.0.0" } }, "is-descriptor": { "version": "1.0.2", "bundled": true, "dev": true, "requires": { "is-accessor-descriptor": "^1.0.0", "is-data-descriptor": "^1.0.0", "kind-of": "^6.0.2" } }, "isobject": { "version": "3.0.1", "bundled": true, "dev": true }, "kind-of": { "version": "6.0.2", "bundled": true, "dev": true } } }, "snapdragon-util": { "version": "3.0.1", "bundled": true, "dev": true, "requires": { "kind-of": "^3.2.0" } }, "source-map": { "version": "0.5.7", "bundled": true, "dev": true }, "source-map-resolve": { "version": "0.5.1", "bundled": true, "dev": true, "requires": { "atob": "^2.0.0", "decode-uri-component": "^0.2.0", "resolve-url": "^0.2.1", "source-map-url": "^0.4.0", "urix": "^0.1.0" } }, "source-map-url": { "version": "0.4.0", "bundled": true, "dev": true }, "spawn-wrap": { "version": "1.4.2", "bundled": true, "dev": true, "requires": { "foreground-child": "^1.5.6", "mkdirp": "^0.5.0", "os-homedir": "^1.0.1", "rimraf": "^2.6.2", "signal-exit": "^3.0.2", "which": "^1.3.0" } }, "spdx-correct": { "version": "3.0.0", "bundled": true, "dev": true, "requires": { "spdx-expression-parse": "^3.0.0", "spdx-license-ids": "^3.0.0" } }, "spdx-exceptions": { "version": "2.1.0", "bundled": true, "dev": true }, "spdx-expression-parse": { "version": "3.0.0", "bundled": true, "dev": true, "requires": { "spdx-exceptions": "^2.1.0", "spdx-license-ids": "^3.0.0" } }, "spdx-license-ids": { "version": "3.0.0", "bundled": true, "dev": true }, "split-string": { "version": "3.1.0", "bundled": true, "dev": true, "requires": { "extend-shallow": "^3.0.0" } }, "static-extend": { "version": "0.1.2", "bundled": true, "dev": true, "requires": { "define-property": "^0.2.5", "object-copy": "^0.1.0" }, "dependencies": { "define-property": { "version": "0.2.5", "bundled": true, "dev": true, "requires": { "is-descriptor": "^0.1.0" } } } }, "string-width": { "version": "2.1.1", "bundled": true, "dev": true, "requires": { "is-fullwidth-code-point": "^2.0.0", "strip-ansi": "^4.0.0" }, "dependencies": { "ansi-regex": { "version": "3.0.0", "bundled": true, "dev": true }, "strip-ansi": { "version": "4.0.0", "bundled": true, "dev": true, "requires": { "ansi-regex": "^3.0.0" } } } }, "strip-ansi": { "version": "3.0.1", "bundled": true, "dev": true, "requires": { "ansi-regex": "^2.0.0" } }, "strip-bom": { "version": "2.0.0", "bundled": true, "dev": true, "requires": { "is-utf8": "^0.2.0" } }, "strip-eof": { "version": "1.0.0", "bundled": true, "dev": true }, "supports-color": { "version": "2.0.0", "bundled": true, "dev": true }, "test-exclude": { "version": "4.2.1", "bundled": true, "dev": true, "requires": { "arrify": "^1.0.1", "micromatch": "^3.1.8", "object-assign": "^4.1.0", "read-pkg-up": "^1.0.1", "require-main-filename": "^1.0.1" }, "dependencies": { "arr-diff": { "version": "4.0.0", "bundled": true, "dev": true }, "array-unique": { "version": "0.3.2", "bundled": true, "dev": true }, "braces": { "version": "2.3.2", "bundled": true, "dev": true, "requires": { "arr-flatten": "^1.1.0", "array-unique": "^0.3.2", "extend-shallow": "^2.0.1", "fill-range": "^4.0.0", "isobject": "^3.0.1", "repeat-element": "^1.1.2", "snapdragon": "^0.8.1", "snapdragon-node": "^2.0.1", "split-string": "^3.0.2", "to-regex": "^3.0.1" }, "dependencies": { "extend-shallow": { "version": "2.0.1", "bundled": true, "dev": true, "requires": { "is-extendable": "^0.1.0" } } } }, "expand-brackets": { "version": "2.1.4", "bundled": true, "dev": true, "requires": { "debug": "^2.3.3", "define-property": "^0.2.5", "extend-shallow": "^2.0.1", "posix-character-classes": "^0.1.0", "regex-not": "^1.0.0", "snapdragon": "^0.8.1", "to-regex": "^3.0.1" }, "dependencies": { "define-property": { "version": "0.2.5", "bundled": true, "dev": true, "requires": { "is-descriptor": "^0.1.0" } }, "extend-shallow": { "version": "2.0.1", "bundled": true, "dev": true, "requires": { "is-extendable": "^0.1.0" } }, "is-accessor-descriptor": { "version": "0.1.6", "bundled": true, "dev": true, "requires": { "kind-of": "^3.0.2" }, "dependencies": { "kind-of": { "version": "3.2.2", "bundled": true, "dev": true, "requires": { "is-buffer": "^1.1.5" } } } }, "is-data-descriptor": { "version": "0.1.4", "bundled": true, "dev": true, "requires": { "kind-of": "^3.0.2" }, "dependencies": { "kind-of": { "version": "3.2.2", "bundled": true, "dev": true, "requires": { "is-buffer": "^1.1.5" } } } }, "is-descriptor": { "version": "0.1.6", "bundled": true, "dev": true, "requires": { "is-accessor-descriptor": "^0.1.6", "is-data-descriptor": "^0.1.4", "kind-of": "^5.0.0" } }, "kind-of": { "version": "5.1.0", "bundled": true, "dev": true } } }, "extglob": { "version": "2.0.4", "bundled": true, "dev": true, "requires": { "array-unique": "^0.3.2", "define-property": "^1.0.0", "expand-brackets": "^2.1.4", "extend-shallow": "^2.0.1", "fragment-cache": "^0.2.1", "regex-not": "^1.0.0", "snapdragon": "^0.8.1", "to-regex": "^3.0.1" }, "dependencies": { "define-property": { "version": "1.0.0", "bundled": true, "dev": true, "requires": { "is-descriptor": "^1.0.0" } }, "extend-shallow": { "version": "2.0.1", "bundled": true, "dev": true, "requires": { "is-extendable": "^0.1.0" } } } }, "fill-range": { "version": "4.0.0", "bundled": true, "dev": true, "requires": { "extend-shallow": "^2.0.1", "is-number": "^3.0.0", "repeat-string": "^1.6.1", "to-regex-range": "^2.1.0" }, "dependencies": { "extend-shallow": { "version": "2.0.1", "bundled": true, "dev": true, "requires": { "is-extendable": "^0.1.0" } } } }, "is-accessor-descriptor": { "version": "1.0.0", "bundled": true, "dev": true, "requires": { "kind-of": "^6.0.0" } }, "is-data-descriptor": { "version": "1.0.0", "bundled": true, "dev": true, "requires": { "kind-of": "^6.0.0" } }, "is-descriptor": { "version": "1.0.2", "bundled": true, "dev": true, "requires": { "is-accessor-descriptor": "^1.0.0", "is-data-descriptor": "^1.0.0", "kind-of": "^6.0.2" } }, "is-number": { "version": "3.0.0", "bundled": true, "dev": true, "requires": { "kind-of": "^3.0.2" }, "dependencies": { "kind-of": { "version": "3.2.2", "bundled": true, "dev": true, "requires": { "is-buffer": "^1.1.5" } } } }, "isobject": { "version": "3.0.1", "bundled": true, "dev": true }, "kind-of": { "version": "6.0.2", "bundled": true, "dev": true }, "micromatch": { "version": "3.1.10", "bundled": true, "dev": true, "requires": { "arr-diff": "^4.0.0", "array-unique": "^0.3.2", "braces": "^2.3.1", "define-property": "^2.0.2", "extend-shallow": "^3.0.2", "extglob": "^2.0.4", "fragment-cache": "^0.2.1", "kind-of": "^6.0.2", "nanomatch": "^1.2.9", "object.pick": "^1.3.0", "regex-not": "^1.0.0", "snapdragon": "^0.8.1", "to-regex": "^3.0.2" } } } }, "to-fast-properties": { "version": "1.0.3", "bundled": true, "dev": true }, "to-object-path": { "version": "0.3.0", "bundled": true, "dev": true, "requires": { "kind-of": "^3.0.2" } }, "to-regex": { "version": "3.0.2", "bundled": true, "dev": true, "requires": { "define-property": "^2.0.2", "extend-shallow": "^3.0.2", "regex-not": "^1.0.2", "safe-regex": "^1.1.0" } }, "to-regex-range": { "version": "2.1.1", "bundled": true, "dev": true, "requires": { "is-number": "^3.0.0", "repeat-string": "^1.6.1" }, "dependencies": { "is-number": { "version": "3.0.0", "bundled": true, "dev": true, "requires": { "kind-of": "^3.0.2" } } } }, "trim-right": { "version": "1.0.1", "bundled": true, "dev": true }, "uglify-js": { "version": "2.8.29", "bundled": true, "dev": true, "optional": true, "requires": { "source-map": "~0.5.1", "uglify-to-browserify": "~1.0.0", "yargs": "~3.10.0" }, "dependencies": { "yargs": { "version": "3.10.0", "bundled": true, "dev": true, "optional": true, "requires": { "camelcase": "^1.0.2", "cliui": "^2.1.0", "decamelize": "^1.0.0", "window-size": "0.1.0" } } } }, "uglify-to-browserify": { "version": "1.0.2", "bundled": true, "dev": true, "optional": true }, "union-value": { "version": "1.0.0", "bundled": true, "dev": true, "requires": { "arr-union": "^3.1.0", "get-value": "^2.0.6", "is-extendable": "^0.1.1", "set-value": "^0.4.3" }, "dependencies": { "extend-shallow": { "version": "2.0.1", "bundled": true, "dev": true, "requires": { "is-extendable": "^0.1.0" } }, "set-value": { "version": "0.4.3", "bundled": true, "dev": true, "requires": { "extend-shallow": "^2.0.1", "is-extendable": "^0.1.1", "is-plain-object": "^2.0.1", "to-object-path": "^0.3.0" } } } }, "unset-value": { "version": "1.0.0", "bundled": true, "dev": true, "requires": { "has-value": "^0.3.1", "isobject": "^3.0.0" }, "dependencies": { "has-value": { "version": "0.3.1", "bundled": true, "dev": true, "requires": { "get-value": "^2.0.3", "has-values": "^0.1.4", "isobject": "^2.0.0" }, "dependencies": { "isobject": { "version": "2.1.0", "bundled": true, "dev": true, "requires": { "isarray": "1.0.0" } } } }, "has-values": { "version": "0.1.4", "bundled": true, "dev": true }, "isobject": { "version": "3.0.1", "bundled": true, "dev": true } } }, "urix": { "version": "0.1.0", "bundled": true, "dev": true }, "use": { "version": "3.1.0", "bundled": true, "dev": true, "requires": { "kind-of": "^6.0.2" }, "dependencies": { "kind-of": { "version": "6.0.2", "bundled": true, "dev": true } } }, "validate-npm-package-license": { "version": "3.0.3", "bundled": true, "dev": true, "requires": { "spdx-correct": "^3.0.0", "spdx-expression-parse": "^3.0.0" } }, "which": { "version": "1.3.0", "bundled": true, "dev": true, "requires": { "isexe": "^2.0.0" } }, "which-module": { "version": "2.0.0", "bundled": true, "dev": true }, "window-size": { "version": "0.1.0", "bundled": true, "dev": true, "optional": true }, "wordwrap": { "version": "0.0.3", "bundled": true, "dev": true }, "wrap-ansi": { "version": "2.1.0", "bundled": true, "dev": true, "requires": { "string-width": "^1.0.1", "strip-ansi": "^3.0.1" }, "dependencies": { "is-fullwidth-code-point": { "version": "1.0.0", "bundled": true, "dev": true, "requires": { "number-is-nan": "^1.0.0" } }, "string-width": { "version": "1.0.2", "bundled": true, "dev": true, "requires": { "code-point-at": "^1.0.0", "is-fullwidth-code-point": "^1.0.0", "strip-ansi": "^3.0.0" } } } }, "wrappy": { "version": "1.0.2", "bundled": true, "dev": true }, "write-file-atomic": { "version": "1.3.4", "bundled": true, "dev": true, "requires": { "graceful-fs": "^4.1.11", "imurmurhash": "^0.1.4", "slide": "^1.1.5" } }, "y18n": { "version": "3.2.1", "bundled": true, "dev": true }, "yallist": { "version": "2.1.2", "bundled": true, "dev": true }, "yargs": { "version": "11.1.0", "bundled": true, "dev": true, "requires": { "cliui": "^4.0.0", "decamelize": "^1.1.1", "find-up": "^2.1.0", "get-caller-file": "^1.0.1", "os-locale": "^2.0.0", "require-directory": "^2.1.1", "require-main-filename": "^1.0.1", "set-blocking": "^2.0.0", "string-width": "^2.0.0", "which-module": "^2.0.0", "y18n": "^3.2.1", "yargs-parser": "^9.0.2" }, "dependencies": { "ansi-regex": { "version": "3.0.0", "bundled": true, "dev": true }, "camelcase": { "version": "4.1.0", "bundled": true, "dev": true }, "cliui": { "version": "4.1.0", "bundled": true, "dev": true, "requires": { "string-width": "^2.1.1", "strip-ansi": "^4.0.0", "wrap-ansi": "^2.0.0" } }, "strip-ansi": { "version": "4.0.0", "bundled": true, "dev": true, "requires": { "ansi-regex": "^3.0.0" } }, "yargs-parser": { "version": "9.0.2", "bundled": true, "dev": true, "requires": { "camelcase": "^4.1.0" } } } }, "yargs-parser": { "version": "8.1.0", "bundled": true, "dev": true, "requires": { "camelcase": "^4.1.0" }, "dependencies": { "camelcase": { "version": "4.1.0", "bundled": true, "dev": true } } } } }, "object-assign": { "version": "4.1.0", "resolved": "https://registry.npmjs.org/object-assign/-/object-assign-4.1.0.tgz", "integrity": "sha1-ejs9DpgGPUP0wD8uiubNUahog6A=", "dev": true }, "object.omit": { "version": "2.0.1", "resolved": "https://registry.npmjs.org/object.omit/-/object.omit-2.0.1.tgz", "integrity": "sha1-Gpx0SCnznbuFjHbKNXmuKlTr0fo=", "dev": true, "optional": true, "requires": { "for-own": "^0.1.4", "is-extendable": "^0.1.1" } }, "once": { "version": "1.4.0", "resolved": "https://registry.npmjs.org/once/-/once-1.4.0.tgz", "integrity": "sha1-WDsap3WWHUsROsF9nFC6753Xa9E=", "dev": true, "requires": { "wrappy": "1" } }, "os-locale": { "version": "1.4.0", "resolved": "http://registry.npmjs.org/os-locale/-/os-locale-1.4.0.tgz", "integrity": "sha1-IPnxeuKe00XoveWDsT0gCYA8FNk=", "dev": true, "requires": { "lcid": "^1.0.0" } }, "parse-glob": { "version": "3.0.4", "resolved": "https://registry.npmjs.org/parse-glob/-/parse-glob-3.0.4.tgz", "integrity": "sha1-ssN2z7EfNVE7rdFz7wu246OIORw=", "dev": true, "optional": true, "requires": { "glob-base": "^0.3.0", "is-dotfile": "^1.0.0", "is-extglob": "^1.0.0", "is-glob": "^2.0.0" } }, "parse-json": { "version": "2.2.0", "resolved": "https://registry.npmjs.org/parse-json/-/parse-json-2.2.0.tgz", "integrity": "sha1-9ID0BDTvgHQfhGkJn43qGPVaTck=", "dev": true, "requires": { "error-ex": "^1.2.0" } }, "path-exists": { "version": "2.1.0", "resolved": "https://registry.npmjs.org/path-exists/-/path-exists-2.1.0.tgz", "integrity": "sha1-D+tsZPD8UY2adU3V77YscCJ2H0s=", "dev": true, "requires": { "pinkie-promise": "^2.0.0" } }, "path-is-absolute": { "version": "1.0.1", "resolved": "http://registry.npmjs.org/path-is-absolute/-/path-is-absolute-1.0.1.tgz", "integrity": "sha1-F0uSaHNVNP+8es5r9TpanhtcX18=", "dev": true }, "path-type": { "version": "1.1.0", "resolved": "https://registry.npmjs.org/path-type/-/path-type-1.1.0.tgz", "integrity": "sha1-WcRPfuSR2nBNpBXaWkBwuk+P5EE=", "dev": true, "requires": { "graceful-fs": "^4.1.2", "pify": "^2.0.0", "pinkie-promise": "^2.0.0" } }, "pify": { "version": "2.3.0", "resolved": "http://registry.npmjs.org/pify/-/pify-2.3.0.tgz", "integrity": "sha1-7RQaasBDqEnqWISY59yosVMw6Qw=", "dev": true }, "pinkie": { "version": "2.0.4", "resolved": "https://registry.npmjs.org/pinkie/-/pinkie-2.0.4.tgz", "integrity": "sha1-clVrgM+g1IqXToDnckjoDtT3+HA=", "dev": true }, "pinkie-promise": { "version": "2.0.1", "resolved": "https://registry.npmjs.org/pinkie-promise/-/pinkie-promise-2.0.1.tgz", "integrity": "sha1-ITXW36ejWMBprJsXh3YogihFD/o=", "dev": true, "requires": { "pinkie": "^2.0.0" } }, "postcss": { "version": "5.2.6", "resolved": "http://registry.npmjs.org/postcss/-/postcss-5.2.6.tgz", "integrity": "sha1-olLNZ81SWFA18X6a0Ss1E3p73Z4=", "dev": true, "requires": { "chalk": "^1.1.3", "js-base64": "^2.1.9", "source-map": "^0.5.6", "supports-color": "^3.1.2" } }, "postcss-cli": { "version": "2.6.0", "resolved": "http://registry.npmjs.org/postcss-cli/-/postcss-cli-2.6.0.tgz", "integrity": "sha1-8N45PKoCb8/BsUeYIpia9QjtUV0=", "dev": true, "requires": { "chokidar": "^1.5.1", "globby": "^4.1.0", "mkdirp": "^0.5.1", "neo-async": "^1.0.0", "postcss": "^5.0.0", "read-file-stdin": "^0.2.0", "resolve": "^1.1.6", "yargs": "^4.7.1" } }, "postcss-value-parser": { "version": "3.3.0", "resolved": "http://registry.npmjs.org/postcss-value-parser/-/postcss-value-parser-3.3.0.tgz", "integrity": "sha1-h/OPnxj3dKSrTIojL1xc6IcqnRU=", "dev": true }, "preserve": { "version": "0.2.0", "resolved": "https://registry.npmjs.org/preserve/-/preserve-0.2.0.tgz", "integrity": "sha1-gV7R9uvGWSb4ZbMQwHE7yzMVzks=", "dev": true, "optional": true }, "process-nextick-args": { "version": "1.0.7", "resolved": "https://registry.npmjs.org/process-nextick-args/-/process-nextick-args-1.0.7.tgz", "integrity": "sha1-FQ4gt1ZZCtP5EJPyWk8q2L/zC6M=", "dev": true, "optional": true }, "randomatic": { "version": "1.1.6", "resolved": "http://registry.npmjs.org/randomatic/-/randomatic-1.1.6.tgz", "integrity": "sha1-EQ3Kv/OX6dz/fAeJzMCkmt8exbs=", "dev": true, "optional": true, "requires": { "is-number": "^2.0.2", "kind-of": "^3.0.2" } }, "read-file-stdin": { "version": "0.2.1", "resolved": "https://registry.npmjs.org/read-file-stdin/-/read-file-stdin-0.2.1.tgz", "integrity": "sha1-JezP86FTtoCa+ssj7hU4fbng7mE=", "dev": true, "requires": { "gather-stream": "^1.0.0" } }, "read-pkg": { "version": "1.1.0", "resolved": "https://registry.npmjs.org/read-pkg/-/read-pkg-1.1.0.tgz", "integrity": "sha1-9f+qXs0pyzHAR0vKfXVra7KePyg=", "dev": true, "requires": { "load-json-file": "^1.0.0", "normalize-package-data": "^2.3.2", "path-type": "^1.0.0" } }, "read-pkg-up": { "version": "1.0.1", "resolved": "https://registry.npmjs.org/read-pkg-up/-/read-pkg-up-1.0.1.tgz", "integrity": "sha1-nWPBMnbAZZGNV/ACpX9AobZD+wI=", "dev": true, "requires": { "find-up": "^1.0.0", "read-pkg": "^1.0.0" } }, "readable-stream": { "version": "2.2.2", "resolved": "http://registry.npmjs.org/readable-stream/-/readable-stream-2.2.2.tgz", "integrity": "sha1-qeb+w8fdqF+LsbO6cChgRVb8gl4=", "dev": true, "optional": true, "requires": { "buffer-shims": "^1.0.0", "core-util-is": "~1.0.0", "inherits": "~2.0.1", "isarray": "~1.0.0", "process-nextick-args": "~1.0.6", "string_decoder": "~0.10.x", "util-deprecate": "~1.0.1" } }, "readdirp": { "version": "2.1.0", "resolved": "http://registry.npmjs.org/readdirp/-/readdirp-2.1.0.tgz", "integrity": "sha1-TtCtBg3zBzMAxIRANz9y0cxkLXg=", "dev": true, "optional": true, "requires": { "graceful-fs": "^4.1.2", "minimatch": "^3.0.2", "readable-stream": "^2.0.2", "set-immediate-shim": "^1.0.1" } }, "regex-cache": { "version": "0.4.3", "resolved": "https://registry.npmjs.org/regex-cache/-/regex-cache-0.4.3.tgz", "integrity": "sha1-mxpsNdTQ3871cRrmUejp09cRQUU=", "dev": true, "optional": true, "requires": { "is-equal-shallow": "^0.1.3", "is-primitive": "^2.0.0" } }, "repeat-element": { "version": "1.1.2", "resolved": "https://registry.npmjs.org/repeat-element/-/repeat-element-1.1.2.tgz", "integrity": "sha1-7wiaF40Ug7quTZPrmLT55OEdmQo=", "dev": true }, "repeat-string": { "version": "1.6.1", "resolved": "https://registry.npmjs.org/repeat-string/-/repeat-string-1.6.1.tgz", "integrity": "sha1-jcrkcOHIirwtYA//Sndihtp15jc=", "dev": true, "optional": true }, "require-directory": { "version": "2.1.1", "resolved": "https://registry.npmjs.org/require-directory/-/require-directory-2.1.1.tgz", "integrity": "sha1-jGStX9MNqxyXbiNE/+f3kqam30I=", "dev": true }, "require-main-filename": { "version": "1.0.1", "resolved": "https://registry.npmjs.org/require-main-filename/-/require-main-filename-1.0.1.tgz", "integrity": "sha1-l/cXtp1IeE9fUmpsWqj/3aBVpNE=", "dev": true }, "resolve": { "version": "1.1.7", "resolved": "https://registry.npmjs.org/resolve/-/resolve-1.1.7.tgz", "integrity": "sha1-IDEU2CrSxe2ejgQRs5ModeiJ6Xs=", "dev": true }, "semver": { "version": "5.3.0", "resolved": "http://registry.npmjs.org/semver/-/semver-5.3.0.tgz", "integrity": "sha1-myzl094C0XxgEq0yaqa00M9U+U8=", "dev": true }, "set-blocking": { "version": "2.0.0", "resolved": "https://registry.npmjs.org/set-blocking/-/set-blocking-2.0.0.tgz", "integrity": "sha1-BF+XgtARrppoA93TgrJDkrPYkPc=", "dev": true }, "set-immediate-shim": { "version": "1.0.1", "resolved": "https://registry.npmjs.org/set-immediate-shim/-/set-immediate-shim-1.0.1.tgz", "integrity": "sha1-SysbJ+uAip+NzEgaWOXlb1mfP2E=", "dev": true, "optional": true }, "source-map": { "version": "0.5.6", "resolved": "http://registry.npmjs.org/source-map/-/source-map-0.5.6.tgz", "integrity": "sha1-dc449SvwczxafwwRjYEzSiu19BI=", "dev": true }, "source-map-support": { "version": "0.5.9", "resolved": "https://registry.npmjs.org/source-map-support/-/source-map-support-0.5.9.tgz", "integrity": "sha512-gR6Rw4MvUlYy83vP0vxoVNzM6t8MUXqNuRsuBmBHQDu1Fh6X015FrLdgoDKcNdkwGubozq0P4N0Q37UyFVr1EA==", "dev": true, "requires": { "buffer-from": "^1.0.0", "source-map": "^0.6.0" }, "dependencies": { "source-map": { "version": "0.6.1", "resolved": "https://registry.npmjs.org/source-map/-/source-map-0.6.1.tgz", "integrity": "sha512-UjgapumWlbMhkBgzT7Ykc5YXUT46F0iKu8SGXq0bcwP5dz/h0Plj6enJqjz1Zbq2l5WaqYnrVbwWOWMyF3F47g==", "dev": true } } }, "spdx-correct": { "version": "1.0.2", "resolved": "http://registry.npmjs.org/spdx-correct/-/spdx-correct-1.0.2.tgz", "integrity": "sha1-SzBz2TP/UfORLwOsVRlJikFQ20A=", "dev": true, "requires": { "spdx-license-ids": "^1.0.2" } }, "spdx-expression-parse": { "version": "1.0.4", "resolved": "https://registry.npmjs.org/spdx-expression-parse/-/spdx-expression-parse-1.0.4.tgz", "integrity": "sha1-m98vIOH0DtRH++JzJmGR/O1RYmw=", "dev": true }, "spdx-license-ids": { "version": "1.2.2", "resolved": "http://registry.npmjs.org/spdx-license-ids/-/spdx-license-ids-1.2.2.tgz", "integrity": "sha1-yd96NCRZSt5r0RkA1ZZpbcBrrFc=", "dev": true }, "string-width": { "version": "1.0.2", "resolved": "https://registry.npmjs.org/string-width/-/string-width-1.0.2.tgz", "integrity": "sha1-EYvfW4zcUaKn5w0hHgfisLmxB9M=", "dev": true, "requires": { "code-point-at": "^1.0.0", "is-fullwidth-code-point": "^1.0.0", "strip-ansi": "^3.0.0" } }, "string_decoder": { "version": "0.10.31", "resolved": "https://registry.npmjs.org/string_decoder/-/string_decoder-0.10.31.tgz", "integrity": "sha1-YuIDvEF2bGwoyfyEMB2rHFMQ+pQ=", "dev": true, "optional": true }, "strip-ansi": { "version": "3.0.1", "resolved": "http://registry.npmjs.org/strip-ansi/-/strip-ansi-3.0.1.tgz", "integrity": "sha1-ajhfuIU9lS1f8F0Oiq+UJ43GPc8=", "dev": true, "requires": { "ansi-regex": "^2.0.0" } }, "strip-bom": { "version": "2.0.0", "resolved": "https://registry.npmjs.org/strip-bom/-/strip-bom-2.0.0.tgz", "integrity": "sha1-YhmoVhZSBJHzV4i9vxRHqZx+aw4=", "dev": true, "requires": { "is-utf8": "^0.2.0" } }, "supports-color": { "version": "3.1.2", "resolved": "https://registry.npmjs.org/supports-color/-/supports-color-3.1.2.tgz", "integrity": "sha1-cqJiiU2dQIuVbKBf83su2KbiotU=", "dev": true, "requires": { "has-flag": "^1.0.0" } }, "util-deprecate": { "version": "1.0.2", "resolved": "https://registry.npmjs.org/util-deprecate/-/util-deprecate-1.0.2.tgz", "integrity": "sha1-RQ1Nyfpw3nMnYvvS1KKJgUGaDM8=", "dev": true, "optional": true }, "validate-npm-package-license": { "version": "3.0.1", "resolved": "https://registry.npmjs.org/validate-npm-package-license/-/validate-npm-package-license-3.0.1.tgz", "integrity": "sha1-KAS6vnEq0zeUWaz74kdGqywwP7w=", "dev": true, "requires": { "spdx-correct": "~1.0.0", "spdx-expression-parse": "~1.0.0" } }, "which-module": { "version": "1.0.0", "resolved": "https://registry.npmjs.org/which-module/-/which-module-1.0.0.tgz", "integrity": "sha1-u6Y8qGGUiZT/MHc2CJ47lgJsKk8=", "dev": true }, "window-size": { "version": "0.2.0", "resolved": "https://registry.npmjs.org/window-size/-/window-size-0.2.0.tgz", "integrity": "sha1-tDFbtCFKPXBY6+7okuE/ok2YsHU=", "dev": true }, "wrap-ansi": { "version": "2.1.0", "resolved": "http://registry.npmjs.org/wrap-ansi/-/wrap-ansi-2.1.0.tgz", "integrity": "sha1-2Pw9KE3QV5T+hJc8rs3Rz4JP3YU=", "dev": true, "requires": { "string-width": "^1.0.1", "strip-ansi": "^3.0.1" } }, "wrappy": { "version": "1.0.2", "resolved": "https://registry.npmjs.org/wrappy/-/wrappy-1.0.2.tgz", "integrity": "sha1-tSQ9jz7BqjXxNkYFvA0QNuMKtp8=", "dev": true }, "y18n": { "version": "3.2.1", "resolved": "https://registry.npmjs.org/y18n/-/y18n-3.2.1.tgz", "integrity": "sha1-bRX7qITAhnnA136I53WegR4H+kE=", "dev": true }, "yargs": { "version": "4.8.1", "resolved": "http://registry.npmjs.org/yargs/-/yargs-4.8.1.tgz", "integrity": "sha1-wMQpJMpKqmsObaFznfshZDn53cA=", "dev": true, "requires": { "cliui": "^3.2.0", "decamelize": "^1.1.1", "get-caller-file": "^1.0.1", "lodash.assign": "^4.0.3", "os-locale": "^1.4.0", "read-pkg-up": "^1.0.1", "require-directory": "^2.1.1", "require-main-filename": "^1.0.1", "set-blocking": "^2.0.0", "string-width": "^1.0.1", "which-module": "^1.0.0", "window-size": "^0.2.0", "y18n": "^3.2.1", "yargs-parser": "^2.4.1" } }, "yargs-parser": { "version": "2.4.1", "resolved": "http://registry.npmjs.org/yargs-parser/-/yargs-parser-2.4.1.tgz", "integrity": "sha1-hVaN488VD/SfpRgl8DqMiA3cxcQ=", "dev": true, "requires": { "camelcase": "^3.0.0", "lodash.assign": "^4.0.6" } } } } ================================================ FILE: package.json ================================================ { "name": "zetawar", "description": "A turn based strategy game and AI platform", "repository": { "type": "git", "url": "https://github.com/Zetawar/zetawar.git" }, "license": "MIT", "version": "0.1.0", "devDependencies": { "autoprefixer": "~6", "nyc": "^11.4.1", "postcss-cli": "~2", "source-map-support": "^0.5.9" }, "dependencies": { "highlight.js": "^9.13.1", "react": "^16.7.0", "react-dom": "^16.7.0", "react-grid-layout": "^0.16.6", "react-icons": "^2.2.7", "reakit": "^0.11.2" } } ================================================ FILE: shadow-cljs.edn ================================================ ;; shadow-cljs configuration {:dependencies [[nubank/workspaces "1.0.3"]] :source-paths ["src/clj" "src/cljc" "src/cljs"] :builds {:workspaces {:target nubank.workspaces.shadow-cljs.target :ns-regexp "-(test|cards)$" :output-dir "assets/js/workspaces" :asset-path "/js/workspaces" :devtools {:http-root "assets" :http-port 8080 :http-resource-root "." :preloads []}}}} ================================================ FILE: site/pages/backers.markdown ================================================ --- name: Backers --- Listed below are the [Zetawar Kickstarter](https://www.kickstarter.com/projects/311016908/zetawar/) backers who chose to have their names listed and backed the project at or above the "Virtual Fame" level. ## Sponsors
[![Awesome Forms](https://awesomeforms.com/assets/logotype-0e39fee9805478f7769f0e25cb16b6e2.png)](https://awesomeforms.com)
[![Bendyworks](../images/sponsors/bendyworks-logo.png)](http://www.bendyworks.com/)
[Rowdy Labs](http://www.rowdylabs.com) ## Backers - -Toni- - Alex Eberts - Austin Haas - Ben and Anna Donovan - Benno Kittelmann - Bill Kratzer - Boris Kourtoukov - Brandon Mathis - Brent Hagany - Cameron Callahan - Carl T Kleihege - Chris Wasser - Coop - Dan Boykis - Dmitri Lobach - Dmitri Sotnikov - Herb Bruss - Igor "McBell" Makaruks - JD Bell - James Reeves - Jarrod Doherty - Jeroen Lamain - Joel Martin - Jon M Dugan - Jonas Winje - Jonas lowery - Jonathan Boston - Joshua Miller - Juraj Martinka - Kephren - Kephren Newton - Kevin D. Saunders - Kevin Hutson (@mrjabba) - Koji Yusa - Lambda Island - Lloyd Goss - Loosetoes - Luke Ehresman - Markku Rontu - Martin Clausen - Mewmoomoo - Michael Dowden - Nate Jones - Nathan Ehresman - Nathan Powell - Nikita Prokopov - Pasi Heikkinen - Phillip DiPuccio - Rob Balder - RubyGeek LLC - Stonecrusher - The Griesbach Family - Tianxiang Xiong - Toby Nance - Ty Goss - Walton Hoops - Wasserlasser - Zach Erbaugh - gtoast - jclaggett - kika - peonicles - scientific-coder ================================================ FILE: site/pages/creating-maps-and-scenarios.markdown ================================================ --- name: Creating Maps and Scenarios --- This guide describes how to create maps and scenarios for Zetawar. First some explanation of terminology is needed. Games take place on maps, but maps by themselves don't include units or bases. Scenarios describe the initial state of units and bases on a map. This alows a single map to support multiple scenarios. The map and scenario data are located in the Clojure maps in the 'maps' and 'scenarios' vars in [src/cljs/zetawar/data.cljs](https://github.com/Zetawar/zetawar/blob/481bfa3e789683b8216c0495babcd2e32aa8e86a/src/cljs/zetawar/data.cljs). To add your own maps and scenarios simply add new entries to those maps. For help understanding the data format, check out the map and scenario format [dev cards](/devcards/#!/zetawar.devcards.data_formats). While creating maps and and scenarios it's useful to be able to see what they look like. To get a live preview while editing, add devcards for your scenarios to [src/cljs/zetawar/devcards/scenarios.cljs](https://github.com/Zetawar/zetawar/blob/481bfa3e789683b8216c0495babcd2e32aa8e86a/src/cljs/zetawar/devcards/scenarios.cljs). Then run "boot dev" (after [installing boot](https://github.com/boot-clj/boot#install) if necessary) and browse to . ================================================ FILE: site/pages/devcards.markdown ================================================ ================================================ FILE: site/pages/docs.markdown ================================================ --- name: Documentation --- ## Customizing Zetawar - [Writing Bots](../writing-bots/) - [Creating Maps and Scenarios](../creating-maps-and-scenarios/) ================================================ FILE: site/pages/roadmap.markdown ================================================ --- name: Roadmap --- The roadmap is now tracked in [GitHub issues](https://github.com/zetawar/zetawar/issues). ================================================ FILE: site/pages/writing-bots.markdown ================================================ --- name: Writing Bots --- Zetawar was created in part to provide a fun, easy way to experiment with AI in Clojure(Script). To that end, it provides a pluggable AI interface for writing bots that can play against humans and other bots. To understand the bot interface, it's helpful to understand its design goals: 1. Make it easy for anyone regardless of programming experience to create a working bot. 2. Given a working bot, it should be easy to improve it to make it more capable and intelligence. 3. Supporting advanced AI algorithms is secondary to the first two goals. With these goals in mind, let's see what it takes to make an AI bot. To do so, we need to write 3 functions. The first function, 'score-actor', takes 4 arguments, 'db', 'game', 'actor-ctx', and 'actor'. 'db' is a DataScript DB containing the current game state. 'game' is a DataScript entity representing the current game. 'actor-ctx' we'll ignore for now, and 'actor' is a DataScript entity representing either a base or unit. So, what does this function do? Given these arguments, it returns a number representing the score for the given base or unit. The score describes how desirable it is to perform an as yet undetermined action with the given base or unit. Higher numbers indicate higher desirability, lower numbers, lower desirability. The AI interface uses these scores to determine which unit or base will perform the next action. The other two functions, 'base-score' and 'unit-score' are similar and handle picking an action to take with the selected base or unit. Each takes 5 arguments, 'db', 'game', 'base'/'unit', 'action-ctx', and 'action'. The 'db', and 'game' arguments are the same as those passed to 'actor-score'. 'action-ctx' is similar to 'actor-ctx'. We'll ignore it too for the moment. The 'base'/'unit' argument represents the base (passed to 'base-score') or unit (passed to 'unit-score') DataScript entity chosen by the AI interface based on the output of 'actor-score'. 'action' is a map representing an action that can be taken by the unit or base. Given those arguments the function returns a score representing the desirability of the action passed to it. Again, higher numbers represent higher desirability and lower numbers represent lower desirability. Similar to with 'chose-score', the AI interface uses these scores to pick an action for the given unit or base. That's it. Those 3 functions are all you need to make a working bot. The simplest possible AI you could create would return random numbers or constants. It would choose random bases and units and execute random actions. Of course, it would be very stupid, but it would work and provide a starting place for building something more intelligent. So, what's the deal with those '\*-ctx' arguments? Well, I kind of lied earlier when I said there are only 3 functions to implement. There are actually 6, but you only need to implement 3 to get something working. The other 3 functions handle creating the '\*-ctx' arguments. The first function, 'mk-actor-ctx' takes 2 arguments, 'db' and 'game' and returns a context object. The context can contain any data you think might be useful in your score functions. The primary purpose of this function is optimization. Obviously since it takes subset of 'score-actor's arguments, the same logic could be executed in that function. However, the actor score function is called once per actor when making a decision about which actor to chose, where as the context function is called only once per actor selection decision. So, if you have costly calculations that would be the same for all actors, put them in 'mk-actor-ctx'. The second and third functions, 'mk-unit-action-ctx' and 'mk-unit-action-ctx' each take 4 arguments 'db', 'game', 'base'/'unit', and 'actor-ctx' and return a context object. They're analogous to the actor context function, but for actions. They're called once after the actor has been chosen, but before the actions are enumerated. Any calculation that would be different per actor, but the same for all actions for that actor can be calculated in them. Anything that you want to retain from the actor context should be merged into the returned context. Now that you have a basic understanding of the AI interface, you can start implementing your own AI. The easiest way to do this is by customizing the placeholder 'Custom AI' included with Zetawar. You can find it in [src/cljs/zetawar/players/ai/custom.cljs](https://github.com/Zetawar/zetawar/blob/481bfa3e789683b8216c0495babcd2e32aa8e86a/src/cljs/zetawar/players/ai/custom.cljs). To get started playing with it, clone the [code](https://github.com/Zetawar/zetawar), [install boot](https://github.com/boot-clj/boot#install), and run 'boot dev'. You can now connect to '' to interact with a version of Zetawar running using your local code base. Any changes to the code will be immediately (within a few seconds) reflected in the browser. If you want to test out your AI in the user interface, click on the "Configure faction" icon next to the faction you want your AI to play as. Then select "Custom AI" in the "Player type" drop down. Congratulations, you're now playing against your own custom AI! ================================================ FILE: site/perun.base.dev-builds.edn ================================================ { :sentry-url "https://c2df777d930c4862bf77c03db7167263@sentry.io/125725" :sentry-environment "development" :site-title "Zetawar Development Builds" } ================================================ FILE: site/perun.base.dev.edn ================================================ { :site-title "Zetawar Development" } ================================================ FILE: site/perun.base.prod.edn ================================================ { :google-analytics-tracking-id "UA-25415440-6" :sentry-url "https://c2df777d930c4862bf77c03db7167263@sentry.io/125725" :sentry-environment "production" :site-title "Zetawar" } ================================================ FILE: site/perun.base.staging.edn ================================================ { :sentry-url "https://c2df777d930c4862bf77c03db7167263@sentry.io/125725" :sentry-environment "staging" :site-title "Zetawar Staging" } ================================================ FILE: site/perun.base.test.edn ================================================ { :site-title "Zetawar Tests" } ================================================ FILE: site/posts/2016-05-17-technology-choices.markdown ================================================ --- description: Technology Choices date-published: 2016-05-17 --- Hello world! Welcome to the Zetawar blog! A few people have expressed interest in learning a bit more about the technology behind Zetawar, so here goes. In this first blog post I will describe the key libraries I'm using and my rationale for choosing them. ### ClojureScript First off, it's important to note Zetawar is implemented entirely in [ClojureScript](https://github.com/clojure/clojurescript). However, explaining that decision is more than I want to attempt in this post. Just take it as a given for now, and I'll try to dig into that more in the future. ### Datascript The Zetawar game and user interface state are stored in [Datascript](https://github.com/tonsky/datascript). Datascript is an in-memory database that supports ClojureScript and Clojure and implements a large portion of the Datomic API. [Datomic](http://www.datomic.com/) in turn is a durable relational database that supports ACID transactions, declarative queries, and has a first class notion of time. Due to it being in-memory only, Datascript does not support durability. It also does not retain a history of all changes to the database like Datomic does, but it implements enough Datomic features to be quite useful in its own right. I decided to use Datascript primarily for two reasons. First, Datascript provides extremely flexible query functionality. It supports [Datalog](http://docs.datomic.com/query.html), which provides SQL like queries, Datomic's [pull API](http://docs.datomic.com/pull.html), which provides hierarchical data selection, and Datomic's [entity API](http://docs.datomic.com/entities.html), which provides a lazy map like interface to database entities. This query flexibility means data can be structured based on logical relationships between data elements rather than how the data is accessed. Second, if in the future I want to make a version of the game that has a server component that needs to run some of the game logic, it should be relatively easy to port the game logic from Datascript to Datomic since their APIs are so similar. ### Reagent The Zetawar user interface is rendered with [Reagent](https://reagent-project.github.io/). Given that I wanted to make Zetawar web based (I'll discuss that decision more in a future post), the declarative React model on which Reagent is based is a natural fit. The game board interface is a pure function of the game state and the performance requirements of a turn based strategy game are not so great that rendering to the DOM (as opposed to Canvas or WebGL) is likely to be a bottleneck. So why Reagent and not [Om](https://github.com/omcljs/om), [Om.next](https://github.com/omcljs/om/wiki/Quick-Start-\(om.next\)), or [Rum](https://github.com/tonsky/rum)? Mostly it comes down to familiarity. I have used Reagent on other projects and found it to be effective and easy to use. It's also quite straightforward, with the addition of cursors in Reagent 0.5, to mimic the single atom approach of Om if desired. Om.next and Rum both look interesting, and I did seriously consider Om.next, but wasn't convinced that it provided enough benefits over Reagent (for this project anyway) to justify both the risk of using such a new library as well as the extra time it would take to get up to speed on it. I dismissed Rum on similar grounds. Though I do appreciate its minimalist design and hope to try it out on some future project. ### Posh [Posh](https://github.com/mpdairy/posh) is the glue that connects Reagent to Datascript. It provides a mechanism for specifying Datascript queries and pulls that are only updated when data related to them has changed. Compared to the simplest alternative of rerunning queries on every transaction, this provides a huge performance boost. As a new and not very well known library, it is likely the riskiest of these choices. But so far, it has worked extremely well. The only issue I have encountered was a bad interaction with the new lazy-by-default reactions in Reagent [0.6.0-alpha](https://reagent-project.github.io/news/news060-alpha.html). Posh currently assumes that only a single transaction will take place between each evaluation of its reactions. With the new lazy-by-default reactions, if multiple transactions take place before the next render, some Posh queries may fail to run when related data changes. Thankfully, there is a simple workaround, run Reagent's flush in a Datascript transaction listener so that all reactions are evaluated after every transaction. This destroys the performance improvements possible with lazy transactions, but so far this hasn't been a significant issue. Also, it sounds like this problem will be fixed in the next version of Posh, so it may not even be an issue by the time the final version of Reagent 0.6.0 is released. ### Conclusion That's it for now. In my next post I'll dig into how these libraries are tied together in Zetawar. ================================================ FILE: site/posts/2016-05-22-why-zetawar.markdown ================================================ --- description: Why Zetawar? date-published: 2016-05-22 --- In my last post I promised to dig into the architecture of Zetawar. I'm still planning to do that, but before I get too deep in the technical weeds I thought it might be a good idea to explain why Zetawar exists. The story begins earlier this year when I wanted to play a round of Weewar (an online turn based strategy game) with my wife. I hadn't played it in several years, but remembered it as a fun game and was looking for something turn based that wouldn't require us both to be available to play at exactly the same time. Unfortunately, I discovered EA had shut down Weewar. I also discovered another game, Elite Command, that suffered a similar fate. And while I don't blame either EA or the author of Elite Command for shutting them down — these things aren't free to maintain — it did seem like a shame that their respective player communities couldn't keep them running themselves. That's when the idea for Zetawar was born. What if I made a similar web based game that was open source (Zetawar isn't yet, but it will be) and didn't require an application server? It would have some limitations due to the lack of a server side communication channel, but it would be something that players could invest in without worrying about a third party shutting it down. So, I started writing it. Of course, once you start writing a game, it's impossible to resist trying to implement your favorite features, so Zetawar has a few extra goals beyond just being an open source, app server free, Weewar-like game. First, it will have a first class bot interface. In college I enjoyed competing in programming competitions and I think programming AI bots that can play against each other is one of the most fun ways to do that. I also believe basing these contests on a fun game that students can enjoy playing with each other outside the programming competition can increase their interest and engagement. Second, it's going to be as customizable as I can reasonably make it. Unit stats, terrain effects, tilesets, and even some of the game rules will be modifiable by players. This will allow players to help me with things like balancing unit stats and should keep the game interesting for a long time. It will also allow the game to serve as a laboratory of sorts for people interested in designing similar games. Want to make your own tactical strategy game? Prototype it first in Zetawar! Third, Zetawar is currently and will continue to be written in ClojureScript. ClojureScript is the most enjoyable language I've found for writing web applications, and I want to both continue working with it and promote its adoption. Hopefully Zetawar can serve as a fun example people can point to when they talk about things written in ClojureScript and, once it's open sourced, can be an interesting code base for other ClojureScript enthusiasts to learn from and contribute to. So that's what I'm hoping to accomplish with Zetawar. If any of those goals interest you, please follow [@ZetawarGame](https://twitter.com/ZetawarGame) to keep updated on how things are progressing, and if you have any feedback either send me a tweet or fill out the [feedback form](http://goo.gl/forms/RgTpkCYDBk). ================================================ FILE: site/posts/2017-02-07-from-callbacks-to-reified-events.md ================================================ --- description: From Callbacks to Reified Events date-published: 2017-02-07 --- Hello again! It's time to dust off this blog and get some posts out. A lot has changed in Zetawar over the past few months. I've discussed some of those changes in Kickstarter [updates](https://www.kickstarter.com/projects/djwhitt/zetawar/updates), but only at a high level. Here I'm going to dig into them in a bit more detail. First, let's take a look at the event system. If you recall, the demo version of Zetawar used simple callback event handlers. With that approach, calling an event handler looked like this: ```clojure [:button {:on-click #(handlers/repair conn %)} "Repair"]]) ``` And the event handlers looked like this: ```clojure (defn repair [conn ev] (let [db @conn [q r] (first (d/q '[:find ?q ?r :where [?a :app/selected-q ?q] [?a :app/selected-r ?r]] db))] (game/repair! conn (app/current-game-id db) q r) (clear-selection conn nil))) ``` The important things to notice here are that the handler takes a reference, 'conn', and performs side effects. This approach has the virtue of being easy to implement, hence it's use in the demo, but it also has several drawbacks. Performing actions via side effects in the call to 'repair!' makes testing and interactive development difficult. Passing in the connection is also problematic since it means theoretically the value of the connection can change during the execution of the function. Though, in practice, JavaScript's single threaded execution model prevents this. So how can we improve things? Thankfully, the [re-frame framework](https://github.com/Day8/re-frame) has already [solved this problem](https://github.com/Day8/re-frame/blob/master/docs/EffectfulHandlers.md). We can just follow its lead. Instead of calling handlers directly, we'll dispatch event messages and modify the handlers to accept a DB value rather than a connection reference. Also, instead of performing side effects directly, we'll return a data structure describing the side effects we want executed. With the new approach, dispatching an event looks like this: ```clojure [:button {:on-click #(dispatch [::events.ui/repair-selected])} "Repair"]) ``` And handling an event looks like this: ```clojure (defmethod router/handle-event ::repair-selected [{:as handler-ctx :keys [db]} _] (let [game (app/current-game db) cur-faction-color (game/current-faction-color game) [q r] (app/selected-hex db)] {:dispatch [[:zetawar.events.game/execute-action {:action/type :action.type/repair-unit :action/faction-color cur-faction-color :action/q q :action/r r}] [::clear-selection]]})) (defmethod router/handle-event ::execute-action [{:as handler-ctx :keys [db]} [_ action]] (let [game (app/current-game db)] ;; Irrelevant code omitted ... {:tx (game/action-tx db game action) :notify [[:zetawar.players/apply-action :faction.color/all action]]}))) ``` Because of changes to the AI system, the new code splits the event handler in two. The first handler extracts information about the current faction and selection from the DB and turns it into an 'execute-action' event which it returns along with a 'clear-selection' event. For the sake of brevity, most of the code has been omitted from the second handler, but the essentials are still there. It takes a DB value and an 'action' map and returns a transaction and an AI notification. Taken together the returned data describes the actions performed as side effects in the original handler. So, now our handlers are pure functions. They take values as arguments and return values. This makes them much easier to execute interactively and test, but there's still something missing. How do the returned values change the application state? In the next post we'll examine this question in detail as we look at the event router. ================================================ FILE: src/clj/zetawar/subs.clj ================================================ (ns zetawar.subs) ;; TODO: check that tracks defined this way are only evaluated once per arg combination ;; TODO: add support for doc strings ;; TODO: name function '~name'-track-fn (or something similar) (defmacro deftrack [name params* & body] `(def ~name (partial r/track (fn ~name ~params* (do ;;(js/console.debug "Running sub: " '~name (rest ~params*)) ~@body))))) ================================================ FILE: src/clj/zetawar/views/site.clj ================================================ (ns zetawar.views.site (:require [zetawar.views.common :refer [footer head navbar]] [hiccup.page :refer [html5 include-js]] [zetawar.site :as site]) (:import [java.text SimpleDateFormat] [java.util TimeZone])) (defn date-fmt [date] (let [formater (SimpleDateFormat. "MMMM dd, yyyy")] (.setTimeZone formater (TimeZone/getTimeZone "GMT")) (.format formater date))) (defn render-index [data] (let [{global-meta :meta} data] (html5 (head data (:site-title global-meta)) [:body#app [:div#main (navbar "Game") [:div.container.text-center [:img {:src (site/prefix "/images/spin-64.gif")}]] (footer)] (include-js (site/prefix "/js/main.js"))]))) (defn render-blog-index [data] (let [{:keys [entries] global-meta :meta} data] (html5 (head data (:site-title global-meta)) [:body#site (navbar "Blog") [:div.container (into [:div#blog-posts] (for [entry entries] [:div.blog-post [:div.blog-post-title (:description entry)] [:div.blog-post-meta [:a {:href (:permalink entry)} (date-fmt (:date-published entry))]] (:content entry)]))] (footer) (include-js (site/prefix "/js/main.js"))]))) (defn render-blog-post [data] (let [{:keys [entry] global-meta :meta} data] (html5 (head data (:site-title global-meta)) [:body#site (navbar "Blog") [:div.container [:div.blog-post [:div.blog-post-title (:description entry)] [:div.blog-post-meta (date-fmt (:date-published entry))] (:content entry)]] (footer) (include-js (site/prefix "/js/main.js"))]))) (defn render-page [data] (let [{:keys [entry] global-meta :meta} data] (html5 (head data (:site-title global-meta)) [:body#site (navbar (:name entry)) [:div.container (:content entry)] (footer) (include-js (site/prefix "/js/main.js"))]))) (defn render-devcards [data] (let [{:keys [entry] global-meta :meta} data] (html5 (head data "Zetawar Devcards") [:body#devcards (include-js (site/prefix "/js/main.js")) (include-js (site/prefix "/js/main/devcards.js"))]))) ================================================ FILE: src/cljc/zetawar/hex.cljc ================================================ (ns zetawar.hex (:require [zetawar.util :refer [abs]])) (def min-q 0) (def min-r 0) (def max-q 100) (def max-r 100) (defn east [q r] [(inc q) r]) (defn east-of? [q1 r1 q2 r2] (= [q2 r2] (east q1 r1))) (defn west [q r] [(dec q) r]) (defn west-of? [q1 r1 q2 r2] (= [q2 r2] (west q1 r1))) (defn northeast [q r] (if (= (mod r 2) 0) [q (dec r)] [(inc q) (dec r)])) (defn northeast-of? [q1 r1 q2 r2] (= [q2 r2] (northeast q1 r1))) (defn northwest [q r] (if (= (mod r 2) 0) [(dec q) (dec r)] [q (dec r)])) (defn northwest-of? [q1 r1 q2 r2] (= [q2 r2] (northwest q1 r1))) (defn southeast [q r] (if (= (mod r 2) 0) [q (inc r)] [(inc q) (inc r)])) (defn southeast-of? [q1 r1 q2 r2] (= [q2 r2] (southeast q1 r1))) (defn southwest [q r] (if (= (mod r 2) 0) [(dec q) (inc r)] [q (inc r)])) (defn southwest-of? [q1 r1 q2 r2] (= [q2 r2] (southwest q1 r1))) ;; TODO: make this more elegant (defn opposite? [q1 r1 q2 r2 q3 r3] (or (and (east-of? q1 r1 q2 r2) (east-of? q2 r2 q3 r3)) (and (west-of? q1 r1 q2 r2) (west-of? q2 r2 q3 r3)) (and (northwest-of? q1 r1 q2 r2) (northwest-of? q2 r2 q3 r3)) (and (southwest-of? q1 r1 q2 r2) (southwest-of? q2 r2 q3 r3)) (and (northeast-of? q1 r1 q2 r2) (northeast-of? q2 r2 q3 r3)) (and (southeast-of? q1 r1 q2 r2) (southeast-of? q2 r2 q3 r3)))) (def adjacents (memoize (fn adjacents [q r] #{(east q r) (west q r) (northeast q r) (northwest q r) (southeast q r) (southwest q r)}))) (defn adjacent? [q1 r1 q2 r2] ((adjacents q1 r1) [q2 r2])) (defn offset->cube [q r] (let [x (- q (/ (- r (mod r 2)) 2)) z r y (- 0 x z)] [x y z])) (defn distance [q1 r1 q2 r2] (let [[x1 y1 z1] (offset->cube q1 r1) [x2 y2 z2] (offset->cube q2 r2)] (max (abs (- x1 x2)) (abs (- y1 y2)) (abs (- z1 z2))))) ================================================ FILE: src/cljc/zetawar/site.cljc ================================================ (ns zetawar.site (:require [clojure.string :as string]) #?(:cljs (:require-macros [zetawar.site :refer [env-prefix env-build env-build-timestamp]]))) #?(:clj (do (defmacro env-prefix [] (or (System/getenv "ZETAWAR_PREFIX") "")) (defmacro env-build [] (or (System/getenv "ZETAWAR_BUILD") "")) (defmacro env-build-timestamp [] (or (System/getenv "BUILD_TIMESTAMP") "")) ) ) (def +prefix+ (env-prefix)) (defn prefix [& url-parts] (apply str +prefix+ url-parts)) (def build (env-build)) (def build-timestamp (env-build-timestamp)) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Perun #?(:clj (do (defn slug-fn [filename] (let [[year month day & parts] (string/split filename #"[-\.]") name-part (some->> parts drop-last not-empty (string/join "-") string/lower-case)] (when (and year month day name-part) (str year "/" month "/" day "/" name-part)))) (defn permalink-fn [{:keys [slug path filename] :as data}] (if (string/starts-with? path "posts") (str +prefix+ "/blog/" slug "/") (str +prefix+ (string/replace filename #"\.markdown" "/")))) (defn devcards? [{:keys [path]}] (= path "pages/devcards.markdown")) (defn page? [{:keys [path]}] (and (not (devcards? path)) (string/starts-with? path "pages/"))) (defn post? [{:keys [path]}] (and (not (devcards? path)) (string/starts-with? path "posts/"))) ) ) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Devcards #?(:cljs (do (defn viewing-devcards? "Returns true if currently viewing devcards." [] (re-matches #".*/devcards.*" js/window.location.href)) ) ) ================================================ FILE: src/cljc/zetawar/util.cljc ================================================ (ns zetawar.util #?(:cljs (:require-macros [zetawar.util :refer [inspect]]))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Accessors (defn solo "Like first, but throws if more than one item." [coll] (assert (not (next coll))) (first coll)) (defn only "Like first, but throws unless exactly one item." [coll] (assert (not (next coll))) (if-let [result (first coll)] result (assert false))) (defn ssolo "Same as (solo (solo coll))." [coll] (solo (solo coll))) (defn oonly "Same as (only (only coll))." [coll] (only (only coll))) (defn select-values "Returns a vector containing only those values who's key is in ks." [m ks] (reduce #(if-let [v (m %2)] (conj %1 v) %1) [] ks)) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Math (defn abs [x] (#?(:clj Math/abs :cljs js/Math.abs) x)) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Debugging (defn log-inspect [expr result] #?(:cljs (js/console.debug expr result))) (defn- inspect-1 [expr] `(let [result# ~expr] (zetawar.util/log-inspect '~expr result#) result#)) #?(:clj (do (defmacro inspect [& exprs] `(do ~@(map inspect-1 exprs))) (defmacro breakpoint [] '(do (js* "debugger;") nil)) ; (prevent "return debugger;" in compiled javascript) ) ) ================================================ FILE: src/cljc/zetawar/views/common.cljc ================================================ (ns zetawar.views.common #?@(:clj [(:require [clojure.java.io :as io] [hiccup.page :refer [html5 include-css include-js]] [zetawar.site :as site])] :cljs [(:require [cljsjs.react-bootstrap] [zetawar.site :as site])])) #?(:clj (do (defn ga [tracking-id] [:script (str "(function(i,s,o,g,r,a,m){i['GoogleAnalyticsObject']=r;i[r]=i[r]||function(){" "(i[r].q=i[r].q||[]).push(arguments)},i[r].l=1*new Date();a=s.createElement(o)," "m=s.getElementsByTagName(o)[0];a.async=1;a.src=g;m.parentNode.insertBefore(a,m)" "})(window,document,'script','https://www.google-analytics.com/analytics.js','ga');" "ga('create', '" tracking-id "', 'auto');" "ga('send', 'pageview');")]) (defn sentry [sentry-url environment] [[:script {:src "https://cdn.ravenjs.com/3.9.1/raven.min.js"}] [:script (str "Raven.config('" sentry-url "', {" "release: '" site/build "'," "environment: '" environment "'," "tags: {git_commit: '" site/build "'}" "}).install();")]]) (defn head [{global-meta :meta :as data} title] (into [:head [:meta {:charset "utf-8"}] [:meta {:http-equiv "X-UA-Compatible" :content "IE=edge"}] [:meta {:name "viewport" :content "width=device-width, initial-scale=1"}] [:title title] (include-css (site/prefix "/css/main.css")) (include-css (site/prefix "/css/highlight/default.css")) (include-js (site/prefix "/js/highlight.pack.js")) [:script "hljs.initHighlightingOnLoad();"] (some-> (:google-analytics-tracking-id global-meta) ga)] (some-> (:sentry-url global-meta) (sentry (:sentry-environment global-meta))))) )) (def nav-links [{:href (site/prefix "/") :title "Game"} {:href (site/prefix "/blog") :title "Blog"} {:href (site/prefix "/docs") :title "Documentation"} {:href "https://github.com/zetawar/zetawar/issues" :title "Roadmap"} {:href (site/prefix "/backers") :title "Backers"}]) (defn navbar ([] (navbar nil)) ([active-title] #?( :clj [:div#navbar-wrapper {:data-active-title active-title} [:nav.navbar.navbar-inverse.navbar-fixed-top [:div.container [:div.navbar-header [:a.navbar-brand {:href "/"} [:img {:src (site/prefix "/images/navbar-logo.svg")}] "Zetawar"]] [:div#navbar-collapse.collapse.navbar-collapse (into [:ul.nav.navbar-nav ] (for [{:keys [href title]} nav-links] (if (= title active-title) [:li {:class "active"} [:a {:href href} title]] [:li [:a {:href href} title]])))]]]] :cljs [:> js/ReactBootstrap.Navbar {:fixed-top true :inverse true} [:> js/ReactBootstrap.Navbar.Header [:> js/ReactBootstrap.Navbar.Brand [:a {:href "/"} [:img {:src (site/prefix "/images/navbar-logo.svg")}] "Zetawar"]] [:> js/ReactBootstrap.Navbar.Toggle]] [:> js/ReactBootstrap.Navbar.Collapse (into [:> js/ReactBootstrap.Nav] (map-indexed (fn [idx {:keys [href title]}] (let [active (= title active-title)] [:> js/ReactBootstrap.NavItem {:event-key idx :active active :href href} title])) nav-links))]] ) )) (defn footer [] [:div.container [:div#footer [:p "Build: " (if (not-empty site/build) [:a {:href (str "/builds/" site/build)} site/build] "DEV") (when (not-empty site/build-timestamp) (str " • " site/build-timestamp))] [:p "Follow " [:a {:href "https://twitter.com/ZetawarGame"} "@ZetawarGame"] " for updates. " "Questions or comments? Send us some " [:a {:href "http://goo.gl/forms/RgTpkCYDBk"} "feedback"] "."] [:p "Copyright 2016 Arugaba LLC under the " [:a {:href "https://github.com/Zetawar/zetawar/blob/master/LICENSE.txt"} "MIT license"]] [:p "Artwork from " [:a {:href "https://github.com/cvincent/elite-command"} "Elite Command"] " Copyright 2015 Chris Vincent under " [:a {:href "http://creativecommons.org/licenses/by/4.0/"} "Creative Commons Attribution 4.0 International License"]]]]) ================================================ FILE: src/cljs/zetawar/app.cljs ================================================ (ns zetawar.app (:require [cognitect.transit :as transit] [datascript.core :as d] [zetawar.data :as data] [zetawar.db :refer [e find-by qe qes qess]] [zetawar.game :as game] [zetawar.logging :as log] [zetawar.players :as players] [zetawar.util :as util :refer [breakpoint inspect]])) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; DB Accessors (defn root [db] (find-by db :app/game)) (defn current-game [db] (:app/game (root db))) (defn current-game-id [db] (:game/id (current-game db))) (defn selected-hex [db] (let [{:keys [app/selected-q app/selected-r]} (root db)] [selected-q selected-r])) (defn targeted-hex [db] (let [{:keys [app/targeted-q app/targeted-r]} (root db)] [targeted-q targeted-r])) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Game setup (defn create-players! [{:as app-ctx :keys [conn players]}] (let [factions (qess '[:find ?f :where [_ :app/game ?g] [?g :game/factions ?f]] @conn)] ;; TODO: cleanup (relocate?) player stopping ;; Stop existing players (when starting new games) (when players (doseq [[_ player] @players] (when player (players/stop player)))) (doseq [{:as faction :keys [faction/ai faction/color]} factions] (let [player-type (if ai ::players/reference-ai ::players/human) player (players/new-player app-ctx player-type color)] (d/transact! conn [{:db/id (e faction) :faction/player-type player-type}]) (players/start player) (swap! players assoc color player))))) ;; TODO: take option map instead of being multiarity (defn start-new-game! ([{:as app-ctx :keys [conn players]} scenario-id] (start-new-game! app-ctx data/rulesets data/maps data/scenarios scenario-id)) ([{:as app-ctx :keys [conn players]} rulesets map-defs scenario-defs scenario-id] (let [game (current-game @conn)] (when game (d/transact conn [[:db.fn/retractEntity (e game)]])) (let [scenario-def (scenario-defs scenario-id) game-id (game/load-scenario! conn rulesets map-defs scenario-def) db @conn app-eid (or (some-> (root db) e) -101) game (game/game-by-id db game-id) turn-stepping (= (game/faction-count db game) (game/ai-faction-count db game))] (d/transact! conn [{:db/id app-eid :app/game [:game/id game-id] :app/hide-win-message false :app/ai-turn-stepping turn-stepping}]) ;; Skip player creation for tests (when players (create-players! app-ctx)))))) ;; TODO: take option map instead of being multiarity (defn load-game-state! ([{:as app-ctx :keys [conn players]} game-state] (load-game-state! app-ctx data/rulesets data/maps data/scenarios game-state)) ([{:as app-ctx :keys [conn players]} rulesets map-defs scenario-defs game-state] (let [game-id (game/load-game-state! conn rulesets map-defs scenario-defs game-state) db @conn game (game/game-by-id db game-id) turn-stepping (= (game/faction-count db game) (game/ai-faction-count db game))] (d/transact! conn [{:db/id -1 :app/game [:game/id game-id] :app/ai-turn-stepping turn-stepping}]) ;; Skip player creation for tests (when players (create-players! app-ctx))))) ================================================ FILE: src/cljs/zetawar/benchmarks.cljs ================================================ (ns zetawar.benchmarks (:require [clojure.string :as string] [datascript.core :as d] [reagent.core :as r] [zetawar.app :as app] [zetawar.data :as data] [zetawar.db :as db :refer [qe]] [zetawar.game :as game] [zetawar.hex :as hex] [zetawar.logging :as log])) (defn setup-conn [] (let [conn (d/create-conn db/schema)] (app/start-new-game! {:conn conn} :sterlings-aruba-multiplayer) conn)) (defn run-benchmarks [] (let [suite (js/Benchmark.Suite.) db @(setup-conn) game (app/current-game db) unit (game/unit-at db game 2 2)] (-> suite (.add "valid-moves" (fn [] (game/valid-moves db game unit))) (.on "complete" (fn [] (this-as this (js/console.log (str "valid-moves: " (aget this 0)))))) (.run)))) ================================================ FILE: src/cljs/zetawar/cli.cljs ================================================ (ns zetawar.cli (:require [cljs.nodejs :as nodejs] [integrant.core :as ig] [zetawar.app :as app] [zetawar.db :as db] [zetawar.events.game] [zetawar.events.player] [zetawar.game :as game] [zetawar.players.ai.custom] [zetawar.players.ai.reference] [zetawar.players.human] [zetawar.router :as router] [zetawar.system.datascript] [zetawar.system.game] [zetawar.system.players] [zetawar.system.router])) (def cli-game-config {:zetawar.system/datascript {:schema db/schema} :zetawar.system/players {} :zetawar.system/router {:datascript (ig/ref :zetawar.system/datascript) :players (ig/ref :zetawar.system/players)} :zetawar.system/game {:datascript (ig/ref :zetawar.system/datascript) :router (ig/ref :zetawar.system/router) :players (ig/ref :zetawar.system/players)}}) (nodejs/enable-util-print!) (defn end-turn [system] (let [ev-chan (-> system :zetawar.system/router :ev-chan) db @(-> system :zetawar.system/datascript :conn) game (app/current-game db) cur-faction-color (game/current-faction-color game)] (router/dispatch ev-chan [:zetawar.events.game/execute-action {:action/type :action.type/end-turn :action/faction-color cur-faction-color}]))) ;; (.install (js/require "source-map-support")) ;; TODO: switch to cljs require (def readline (js/require "readline")) ;; TODO: add dummy logger player ;; TODO: add log level cli option ;; TODO: add ability to disable turn stepping ;; TODO: add ability to pass in scenario (defn ^:export -main [& args] (let [system (ig/init cli-game-config) ev-chan (-> system :zetawar.system/router :ev-chan) conn (-> system :zetawar.system/datascript :conn) rl (.createInterface readline #js {"input" js/process.stdin "output" js/process.stdout "terminal" false})] (.on rl "line" (fn [line] (end-turn system))) (println "Hello from the Zetawar game runner!") (app/start-new-game! (:zetawar.system/game system) :sterlings-aruba-ai-vs-ai) (router/dispatch ev-chan [:zetawar.events.player/send-game-state (->> @conn app/current-game game/current-faction-color)]))) (set! *main-cli-fn* -main) ================================================ FILE: src/cljs/zetawar/core.cljs ================================================ (ns zetawar.core (:require [cljsjs.raven] [integrant.core :as ig] [reagent.core :as r] [zetawar.app :as app] [zetawar.benchmarks :as benchmarks] [zetawar.db :as db] [zetawar.events.game] [zetawar.events.player] [zetawar.events.ui] [zetawar.game :as game] [zetawar.js.game] [zetawar.js.hex] [zetawar.logging :as log] [zetawar.players.ai.custom-js] [zetawar.players.ai.custom] [zetawar.players.ai.reference] [zetawar.players.human] [zetawar.router.reagent] [zetawar.serialization :as serialization] [zetawar.site :as site] [zetawar.system :as system] [zetawar.system.datascript] [zetawar.system.game-views] [zetawar.system.game] [zetawar.system.players] [zetawar.system.reagent] [zetawar.system.router] [zetawar.util :refer [breakpoint inspect]] [zetawar.views :as views] [zetawar.views.common :refer [navbar]])) (defonce system (atom nil)) (defn run [] (let [body-id (-> js/document (.getElementsByTagName "body") (aget 0) .-id)] (case body-id "app" (let [target (.getElementById js/document "main") views-cfg (:zetawar.system/game-views @system)] (r/render-component [views/app-root views-cfg] target)) "site" (let [target (.getElementById js/document "navbar-wrapper") active-navbar-title (.getAttribute target "data-active-title")] (r/render-component [navbar active-navbar-title] target)) "benchmarks" (benchmarks/run-benchmarks) ;; Default nil))) ;; TODO: don't start game when viewing non-game site ;; TODO: don't start game when running benchmarks (defn ^:export init [] (when-not (site/viewing-devcards?) (reset! system (ig/init system/game-config)) (let [game-cfg (:zetawar.system/game @system) encoded-game-state (some-> js/window.location.hash not-empty (subs 1))] (if encoded-game-state (serialization/load-encoded-game-state! game-cfg encoded-game-state) (app/start-new-game! game-cfg :sterlings-aruba-multiplayer)) (set! (.-onload js/window) run)))) (defn ^:export reload [] (when-not (site/viewing-devcards?) (ig/suspend! @system) (reset! system (ig/resume system/game-config @system))) (run)) ================================================ FILE: src/cljs/zetawar/data.cljs ================================================ (ns zetawar.data) (def dicts {:en {;; General :save-button "Save" :cancel-button "Cancel" :close-button "Close" ;; Game links :copy-game-url-link "Copy Link" :new-game-link "New Game" :end-turn-link "End Turn?" ;; Game labels :credits-label "Credits" :round-label "Round" ;; Faction configuration :configure-faction-tip "Configure faction" :configure-faction-title-prefix "Configure faction: " :player-type-label "Player type" ;; Faction colors :red-name "Red" :blue-name "Blue" :yellow-name "Yellow" :pink-name "Pink" :green-name "Green" :orange-name "Orange" ;; Armor types :personnel-name "Personnel" :armored-name "Armored" :naval-name "Naval" :air-name "Air" ;; New game settings :new-game-title "Start a new game" :scenario-label "Scenario" :start-button "Start" ;; Unit and base actions :move-unit-button "Move" :build-unit-button "Build" :attack-unit-button "Attack" :repair-unit-button "Repair" :field-repair-button "Field Repair" :capture-base-button "Capture" ;; Building units :build-title "Select a unit to build" :unit-cost-label "Cost: " :armor-type-label "Armor Type" :movement-label "Move- ment" :armor-label "Armor" :range-label "Range" :attack-label "Attack" :field-repair-label "Field Repair?" :while-capturing-label "While capturing: " :unit-cannot-capture-bases-label "Unit cannot capture bases" ;; Win dialog :win-title "Congratulations! You won!" :win-body (str "Thanks for playing Zetawar! If you're interested in staying up-to-date " "with Zetawar as it develops, please follow " "ZetawarGame on Twitter.") ;; Gameplay tips :select-unit-or-base-tip "Select a unit or base." :select-target-or-destination-tip "Select a destination or target to move, attack, or repair." :multiplayer-tip (str "To play multiplayer follow the instructions " "" "here.") ;; Status information :tile-coordinates-label "X,Y (Tile Coordinates)" :terrain-effects-label "Movement Cost, Attack Bonus, Armor Bonus" :movement-cost-label "Movement Cost" :attack-bonus-label "Attack Bonus" :armor-bonus-label "Armor Bonus" :selected-label "Selected: " :targeted-label "Targeted: " :hover-tile-location "Hover: " ;; Ending turn :end-turn-alert "Are you sure you want to end your turn? You still have available moves." :end-turn-confirm "Yes, end my turn"}}) ;; TODO: remove redundant id keys (?) (def rulesets {:zetawar {:settings {:ranged-attack-bonus 1 :adjacent-attack-bonus 1 :flanking-attack-bonus 2 :opposite-attack-bonus 3 :stochastic-damage false :self-repair false :move-through-friendly true} :terrains {:plains {:description "Plains" :image "tilesets/elite-command/terrains/plains.png"} :mountains {:description "Mountains" :image "tilesets/elite-command/terrains/mountains.png"} :woods {:description "Woods" :image "tilesets/elite-command/terrains/woods.png"} :desert {:description "Desert" :image "tilesets/elite-command/terrains/desert.png"} :tundra {:description "Tundra" :image "tilesets/elite-command/terrains/tundra.png"} :swamp {:description "Swamp" :image "tilesets/elite-command/terrains/swamp.png"} :ford {:description "Ford" :image "tilesets/elite-command/terrains/ford.png"} :shallow-water {:description "Shallow Water" :image "tilesets/elite-command/terrains/shallow-water.png"} :deep-water {:description "Deep Water" :image "tilesets/elite-command/terrains/deep-water.png"} :base {:description "Base" :image "tilesets/elite-command/terrains/base-COLOR.png"} :seaport {:description "Seaport" :image "tilesets/elite-command/terrains/seaport-COLOR.png"} :airfield {:description "Airfield" :image "tilesets/elite-command/terrains/airfield-COLOR.png"}} :unit-state-maps {:move-attack-once {:start-state :start :built-state :done :states {:start {:transitions {:move-unit :moved :attack-unit :done :repair-unit :done :field-repair-unit :done :capture-base :done}} :moved {:transitions {:attack-unit :done :repair-unit :done :field-repair-unit :done :capture-base :done}} :done {}}} :move-attack-twice {:start-state :start :built-state :done :states {:start {:transitions {:move-unit :moved-1-attacked-0 :attack-unit :moved-0-attacked-1 :repair-unit :done :capture-base :done}} :moved-0-attacked-1 {:transitions {:attack-unit :done :capture-base :done}} :moved-1-attacked-0 {:transitions {:attack-unit :moved-1-attacked-1 :capture-base :done}} :moved-1-attacked-1 {:transitions {:attack-unit :done :capture-base :done}} :done {}}} :free-attack-once {:start-state :start :built-state :done :states {:start {:transitions {:move-unit :moved-1-attacked-0 :attack-unit :moved-0-attacked-1 :repair-unit :done :capture-base :done}} :moved-0-attacked-1 {:transitions {:move-unit :done :capture-base :done}} :moved-1-attacked-0 {:transitions {:attack-unit :done :capture-base :done}} :done {}}} :free-attack-twice {:start-state :start :built-state :done :states {:start {:transitions {:move-unit :moved-1-attacked-0 :attack-unit :moved-0-attacked-1 :repair-unit :done :capture-base :done}} :moved-0-attacked-1 {:transitions {:move-unit :moved-1-attacked-1 :attack-unit :moved-0-attacked-2 :repair-unit :done :capture-base :done}} :moved-0-attacked-2 {:transitions {:move-unit :done :repair-unit :done :capture-base :done}} :moved-1-attacked-0 {:transitions {:attack-unit :moved-1-attacked-1 :repair-unit :done :capture-base :done}} :moved-1-attacked-1 {:transitions {:attack-unit :done :repair-unit :done :capture-base :done}} :done {}}} :exclusive {:start-state :start :built-state :done :states {:start {:transitions {:move-unit :done :attack-unit :done :repair-unit :done}} :done {}}}} ;; TODO: check how repair amount works in Elite Command ;; TODO: add :buildable-at (or -by?) => {...} :units {:infantry {:description "Infantry" :cost 75 :movement 9 :can-capture true :can-repair #{} :buildable-at #{:base} :min-range 1 :max-range 1 :armor-type :personnel :armor 6 :capturing-armor 4 :repair 1 :state-map :move-attack-once :image "tilesets/elite-command/units/infantry-COLOR.png" :terrain-effects {:plains {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :mountains {:movement-cost 6 :armor-bonus 5 :attack-bonus 2} :woods {:movement-cost 4 :armor-bonus 3 :attack-bonus 2} :desert {:movement-cost 4 :armor-bonus -1 :attack-bonus -1} :tundra {:movement-cost 4 :armor-bonus -1 :attack-bonus -1} :swamp {:movement-cost 6 :armor-bonus -2 :attack-bonus -2} :ford {:movement-cost 5 :armor-bonus -1 :attack-bonus -1} :base {:movement-cost 2 :armor-bonus 3 :attack-bonus 2} :seaport {:movement-cost 2 :armor-bonus 0 :attack-bonus 0} :airfield {:movement-cost 2 :armor-bonus 0 :attack-bonus 0}} :attack-strengths {:personnel 6 :armored 3 :naval 4 :air 0} :zoc [:personnel :armored]} :grenadier {:description "Grenadier" :cost 150 :movement 9 :can-capture true :can-repair #{} :buildable-at #{:base} :min-range 1 :max-range 2 :armor-type :personnel :armor 8 :capturing-armor 6 :repair 1 :state-map :move-attack-once :image "tilesets/elite-command/units/grenadier-COLOR.png" :terrain-effects {:plains {:movement-cost 4 :armor-bonus 0 :attack-bonus 0} :mountains {:movement-cost 9 :armor-bonus 5 :attack-bonus 2} :woods {:movement-cost 4 :armor-bonus 3 :attack-bonus -1} :desert {:movement-cost 5 :armor-bonus -1 :attack-bonus 0} :tundra {:movement-cost 5 :armor-bonus -1 :attack-bonus 0} :swamp {:movement-cost 9 :armor-bonus -2 :attack-bonus -2} :ford {:movement-cost 9 :armor-bonus -1 :attack-bonus -1} :base {:movement-cost 3 :armor-bonus 3 :attack-bonus -1} :seaport {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :airfield {:movement-cost 3 :armor-bonus 0 :attack-bonus 0}} :attack-strengths {:personnel 8 :armored 9 :naval 6 :air 3} :zoc [:personnel :armored :naval]} :mortar {:description "Mortar" :cost 200 :movement 9 :can-capture true :can-repair #{} :buildable-at #{:base} :min-range 2 :max-range 3 :armor-type :personnel :armor 6 :capturing-armor 4 :repair 1 :state-map :move-attack-once :image "tilesets/elite-command/units/mortar-COLOR.png" :terrain-effects {:plains {:movement-cost 4 :armor-bonus 0 :attack-bonus 0} :mountains {:movement-cost 9 :armor-bonus 5 :attack-bonus 3} :woods {:movement-cost 4 :armor-bonus 3 :attack-bonus -2} :desert {:movement-cost 5 :armor-bonus -1 :attack-bonus 0} :tundra {:movement-cost 5 :armor-bonus -1 :attack-bonus -1} :swamp {:movement-cost 9 :armor-bonus -2 :attack-bonus -2} :ford {:movement-cost 9 :armor-bonus -1 :attack-bonus -2} :base {:movement-cost 3 :armor-bonus 3 :attack-bonus -2} :seaport {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :airfield {:movement-cost 3 :armor-bonus 0 :attack-bonus 0}} :attack-strengths {:personnel 10 :armored 10 :naval 10 :air 0}} :ranger {:description "Ranger" :cost 200 :movement 9 :can-capture true :can-repair #{} :buildable-at #{:base} :min-range 1 :max-range 1 :armor-type :personnel :armor 9 :capturing-armor 7 :repair 1 :state-map :move-attack-once :image "tilesets/elite-command/units/ranger-COLOR.png" :terrain-effects {:plains {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :mountains {:movement-cost 6 :armor-bonus 5 :attack-bonus 2} :woods {:movement-cost 3 :armor-bonus 4 :attack-bonus 2} :desert {:movement-cost 3 :armor-bonus -1 :attack-bonus -1} :tundra {:movement-cost 3 :armor-bonus -1 :attack-bonus -1} :swamp {:movement-cost 3 :armor-bonus -2 :attack-bonus -2} :ford {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :shallow-water {:movement-cost 6 :armor-bonus -2 :attack-bonus -2} :base {:movement-cost 2 :armor-bonus 3 :attack-bonus 2} :seaport {:movement-cost 2 :armor-bonus 0 :attack-bonus 0} :airfield {:movement-cost 2 :armor-bonus 0 :attack-bonus 0}} :attack-strengths {:personnel 9 :armored 4 :naval 6 :air 0} :zoc [:personnel :armored]} :sniper {:description "Sniper" :cost 275 :movement 9 :can-capture true :can-repair #{} :buildable-at #{:base} :min-range 2 :max-range 4 :armor-type :personnel :armor 5 :capturing-armor 3 :repair 1 :state-map :move-attack-once :image "tilesets/elite-command/units/sniper-COLOR.png" :terrain-effects {:plains {:movement-cost 4 :armor-bonus 0 :attack-bonus 0} :mountains {:movement-cost 9 :armor-bonus 5 :attack-bonus 4} :woods {:movement-cost 4 :armor-bonus 3 :attack-bonus -4} :desert {:movement-cost 5 :armor-bonus -1 :attack-bonus -1} :tundra {:movement-cost 5 :armor-bonus -1 :attack-bonus -1} :swamp {:movement-cost 9 :armor-bonus -2 :attack-bonus -3} :ford {:movement-cost 9 :armor-bonus -1 :attack-bonus -6} :base {:movement-cost 3 :armor-bonus 3 :attack-bonus 2} :seaport {:movement-cost 3 :armor-bonus 0 :attack-bonus 0}} :attack-strengths {:personnel 8 :armored 0 :naval 0 :air 0}} :medic {:description "Medic" :cost 100 :movement 9 :can-capture true :can-repair #{:personnel} :buildable-at #{:base} :min-range 1 :max-range 1 :armor-type :personnel :armor 6 :capturing-armor 4 :repair 1 :state-map :move-attack-once :image "tilesets/elite-command/units/medic-COLOR.png" :terrain-effects {:plains {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :mountains {:movement-cost 6 :armor-bonus 5 :attack-bonus 2} :woods {:movement-cost 4 :armor-bonus 3 :attack-bonus 2} :desert {:movement-cost 4 :armor-bonus -1 :attack-bonus -1} :tundra {:movement-cost 4 :armor-bonus -1 :attack-bonus -1} :swamp {:movement-cost 6 :armor-bonus -2 :attack-bonus -2} :ford {:movement-cost 5 :armor-bonus -1 :attack-bonus -1} :base {:movement-cost 2 :armor-bonus 3 :attack-bonus 2} :seaport {:movement-cost 2 :armor-bonus 0 :attack-bonus 0} :airfield {:movement-cost 2 :armor-bonus 0 :attack-bonus 0}} :attack-strengths {:personnel 5 :armored 2 :naval 3 :air 0} :zoc [:personnel :armored]} :engineer {:description "Engineer" :cost 200 :movement 9 :can-capture true :can-repair #{:armored} :buildable-at #{:base} :min-range 1 :max-range 1 :armor-type :personnel :armor 6 :capturing-armor 4 :repair 1 :state-map :move-attack-once :image "tilesets/elite-command/units/engineer-COLOR.png" :terrain-effects {:plains {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :mountains {:movement-cost 6 :armor-bonus 5 :attack-bonus 2} :woods {:movement-cost 4 :armor-bonus 3 :attack-bonus 2} :desert {:movement-cost 4 :armor-bonus -1 :attack-bonus -1} :tundra {:movement-cost 4 :armor-bonus -1 :attack-bonus -1} :swamp {:movement-cost 6 :armor-bonus -2 :attack-bonus -2} :ford {:movement-cost 5 :armor-bonus -1 :attack-bonus -1} :shallow-water {:movement-cost 7 :armor-bonus -2 :attack-bonus -2} :base {:movement-cost 2 :armor-bonus 3 :attack-bonus 2} :seaport {:movement-cost 2 :armor-bonus 0 :attack-bonus 0} :airfield {:movement-cost 2 :armor-bonus 0 :attack-bonus 0}} :attack-strengths {:personnel 5 :armored 2 :naval 3 :air 0} :zoc [:personnel :armored]} ;; Armored :humvee {:description "Humvee" :cost 300 :movement 15 :can-capture false :can-repair #{} :buildable-at #{:base} :min-range 1 :max-range 1 :armor-type :armored :armor 8 :repair 1 :state-map :free-attack-twice :image "tilesets/elite-command/units/humvee-COLOR.png" :terrain-effects {:plains {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :woods {:movement-cost 6 :armor-bonus -2 :attack-bonus -2} :desert {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :tundra {:movement-cost 6 :armor-bonus 0 :attack-bonus 0} :swamp {:movement-cost 12 :armor-bonus -3 :attack-bonus -3} :ford {:movement-cost 12 :armor-bonus -1 :attack-bonus -1} :base {:movement-cost 2 :armor-bonus 0 :attack-bonus 0} :seaport {:movement-cost 2 :armor-bonus 0 :attack-bonus 0} :airfield {:movement-cost 2 :armor-bonus 0 :attack-bonus 0}} :attack-strengths {:personnel 9 :armored 3 :naval 6 :air 0} :zoc [:personnel :armored]} :tank {:description "Tank" :cost 350 :movement 12 :can-capture false :can-repair #{} :buildable-at #{:base} :min-range 1 :max-range 1 :armor-type :armored :armor 12 :repair 1 :state-map :move-attack-once :image "tilesets/elite-command/units/tank-COLOR.png" :terrain-effects {:plains {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :woods {:movement-cost 6 :armor-bonus -3 :attack-bonus 0} :desert {:movement-cost 4 :armor-bonus 0 :attack-bonus 0} :tundra {:movement-cost 5 :armor-bonus 0 :attack-bonus 0} :swamp {:movement-cost 8 :armor-bonus -4 :attack-bonus 0} :ford {:movement-cost 8 :armor-bonus 0 :attack-bonus 0} :base {:movement-cost 2 :armor-bonus -2 :attack-bonus 0} :seaport {:movement-cost 2 :armor-bonus 0 :attack-bonus 0} :airfield {:movement-cost 2 :armor-bonus 0 :attack-bonus 0}} :attack-strengths {:personnel 10 :armored 10 :naval 9 :air 0} :zoc [:personnel :armored]} :mobile-flak {:description "Mobile Flak" :cost 350 :movement 9 :can-capture false :can-repair #{} :min-range 1 :max-range 3 :armor-type :armored :armor 8 :repair 1 :state-map :move-attack-twice :buildable-at #{:base :airfield} :image "tilesets/elite-command/units/mobileflak-COLOR.png" :terrain-effects {:plains {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :woods {:movement-cost 6 :armor-bonus -2 :attack-bonus -3} :desert {:movement-cost 6 :armor-bonus 0 :attack-bonus 0} :tundra {:movement-cost 6 :armor-bonus -1 :attack-bonus 0} :swamp {:movement-cost 6 :armor-bonus -3 :attack-bonus -2} :ford {:movement-cost 6 :armor-bonus -2 :attack-bonus -1} :base {:movement-cost 2 :armor-bonus 0 :attack-bonus 0} :seaport {:movement-cost 2 :armor-bonus 0 :attack-bonus 0} :airfield {:movement-cost 2 :armor-bonus 0 :attack-bonus 0}} :attack-strengths {:personnel 0 :armored 0 :naval 0 :air 14} :zoc [:air]} :heavy-tank {:description "Heavy Tank" :cost 500 :movement 12 :can-capture false :can-repair #{} :buildable-at #{:base} :min-range 1 :max-range 1 :armor-type :armored :armor 15 :repair 1 :state-map :move-attack-once :image "tilesets/elite-command/units/heavytank-COLOR.png" :terrain-effects {:plains {:movement-cost 4 :armor-bonus 0 :attack-bonus 0} :woods {:movement-cost 6 :armor-bonus -3 :attack-bonus 0} :desert {:movement-cost 5 :armor-bonus 0 :attack-bonus 0} :tundra {:movement-cost 7 :armor-bonus 0 :attack-bonus 0} :swamp {:movement-cost 8 :armor-bonus -4 :attack-bonus 0} :ford {:movement-cost 8 :armor-bonus -2 :attack-bonus 0} :base {:movement-cost 3 :armor-bonus -2 :attack-bonus 0} :seaport {:movement-cost 3 :armor-bonus 0 :attack-bonus 0}} :attack-strengths {:personnel 15 :armored 12 :naval 14 :air 0} :zoc [:personnel :armored]} :artillery {:description "Artillery" :cost 400 :movement 8 :can-capture false :can-repair #{} :buildable-at #{:base} :min-range 3 :max-range 4 :armor-type :armored :armor 6 :repair 1 :state-map :exclusive :image "tilesets/elite-command/units/artillery-COLOR.png" :terrain-effects {:plains {:movement-cost 4 :armor-bonus 0 :attack-bonus 0} :woods {:movement-cost 6 :armor-bonus -3 :attack-bonus -3} :desert {:movement-cost 5 :armor-bonus 0 :attack-bonus 0} :tundra {:movement-cost 5 :armor-bonus 0 :attack-bonus 0} :swamp {:movement-cost 6 :armor-bonus -3 :attack-bonus -3} :ford {:movement-cost 6 :armor-bonus -2 :attack-bonus 0} :base {:movement-cost 2 :armor-bonus 0 :attack-bonus 0} :seaport {:movement-cost 2 :armor-bonus 0 :attack-bonus 0}} :attack-strengths {:personnel 12 :armored 13 :naval 14 :air 0}} :heavy-artillery {:description "Heavy Artillery" :cost 1250 :movement 2 :can-capture false :can-repair #{} :buildable-at #{:base} :min-range 4 :max-range 6 :armor-type :armored :armor 8 :repair 1 :state-map :exclusive :image "tilesets/elite-command/units/heavyartillery-COLOR.png" :terrain-effects {:plains {:movement-cost 2 :armor-bonus 0 :attack-bonus 0} :woods {:movement-cost 2 :armor-bonus -3 :attack-bonus -5} :desert {:movement-cost 2 :armor-bonus 0 :attack-bonus 0} :tundra {:movement-cost 2 :armor-bonus 0 :attack-bonus 0} :swamp {:movement-cost 2 :armor-bonus -3 :attack-bonus -5} :ford {:movement-cost 2 :armor-bonus -2 :attack-bonus 0} :base {:movement-cost 1 :armor-bonus 0 :attack-bonus 0} :seaport {:movement-cost 1 :armor-bonus 0 :attack-bonus 0}} :attack-strengths {:personnel 14 :armored 15 :naval 15 :air 0}} ;; Naval :frigate {:description "Frigate" :cost 300 :movement 8 :can-capture false :can-repair #{} :buildable-at #{:seaport} :min-range 1 :max-range 1 :armor-type :naval :armor 8 :repair 1 :state-map :free-attack-twice :image "tilesets/elite-command/units/frigate-COLOR.png" :terrain-effects {:deep-water {:movement-cost 1 :armor-bonus 0 :attack-bonus 0} :shallow-water {:movement-cost 1 :armor-bonus 0 :attack-bonus 0} :seaport {:movement-cost 1 :armor-bonus 0 :attack-bonus 0}} :attack-strengths {:personnel 9 :armored 9 :naval 8 :air 0} :zoc [:personnel :armored]} :destroyer {:description "Destroyer" :cost 600 :movement 5 :can-capture false :can-repair #{} :buildable-at #{:seaport} :min-range 1 :max-range 4 :armor-type :naval :armor 12 :repair 1 :state-map :free-attack-once :image "tilesets/elite-command/units/destroyer-COLOR.png" :terrain-effects {:deep-water {:movement-cost 1 :armor-bonus 0 :attack-bonus 0} :seaport {:movement-cost 1 :armor-bonus 0 :attack-bonus 0}} :attack-strengths {:personnel 10 :armored 12 :naval 8 :air 0} :zoc [:personnel :armored]} :cruiser {:description "Cruiser" :cost 1000 :movement 4 :can-capture false :can-repair #{} :buildable-at #{:seaport} :min-range 1 :max-range 3 :armor-type :naval :armor 15 :repair 1 :state-map :move-attack-twice :image "tilesets/elite-command/units/cruiser-COLOR.png" :terrain-effects {:deep-water {:movement-cost 1 :armor-bonus 0 :attack-bonus 0} :seaport {:movement-cost 1 :armor-bonus 0 :attack-bonus 0}} :attack-strengths {:personnel 14 :armored 16 :naval 12 :air 14} :zoc [:personnel :armored]} ;; Air :fighter {:description "Fighter" :cost 450 :movement 24 :can-capture false :can-repair #{} :min-range 1 :max-range 1 :armor-type :air :armor 12 :repair 1 :state-map :free-attack-once :buildable-at #{:airfield} :image "tilesets/elite-command/units/fighter-COLOR.png" :terrain-effects {:plains {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :mountains {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :woods {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :desert {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :tundra {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :swamp {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :ford {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :deep-water {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :shallow-water {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :base {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :seaport {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :airfield {:movement-cost 3 :armor-bonus 0 :attack-bonus 0}} :attack-strengths {:personnel 4 :armored 6 :naval 8 :air 16}} :bomber {:description "Bomber" :cost 650 :movement 24 :can-capture false :can-repair #{} :min-range 1 :max-range 1 :armor-type :air :armor 10 :repair 1 :state-map :free-attack-once :buildable-at #{:airfield} :image "tilesets/elite-command/units/bomber-COLOR.png" :terrain-effects {:plains {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :mountains {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :woods {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :desert {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :tundra {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :swamp {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :ford {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :deep-water {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :shallow-water {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :base {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :seaport {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :airfield {:movement-cost 3 :armor-bonus 0 :attack-bonus 0}} :attack-strengths {:personnel 14 :armored 16 :naval 15 :air 4}} :gunship {:description "Gunship" :cost 350 :movement 15 :can-capture false :can-repair #{} :min-range 1 :max-range 1 :armor-type :air :armor 8 :repair 1 :state-map :free-attack-once :buildable-at #{:airfield} :image "tilesets/elite-command/units/gunship-COLOR.png" :terrain-effects {:plains {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :mountains {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :woods {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :desert {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :tundra {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :swamp {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :ford {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :deep-water {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :shallow-water {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :base {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :seaport {:movement-cost 3 :armor-bonus 0 :attack-bonus 0} :airfield {:movement-cost 3 :armor-bonus 0 :attack-bonus 0}} :attack-strengths {:personnel 18 :armored 10 :naval 9 :air 8} :zoc [:personnel :armored :naval]}}}}) ;; TODO: remove redundant id keys (?) (def maps {:sterlings-aruba {:id :sterlings-aruba :description "Sterling's Aruba" :created-by "Weewar" :terrains [;; Row 1 {:q 1 :r 0 :terrain-type :plains} {:q 2 :r 0 :terrain-type :plains} {:q 3 :r 0 :terrain-type :mountains} {:q 4 :r 0 :terrain-type :deep-water} {:q 5 :r 0 :terrain-type :deep-water} {:q 6 :r 0 :terrain-type :deep-water} ;; Row 2 {:q 0 :r 1 :terrain-type :plains} {:q 1 :r 1 :terrain-type :mountains} {:q 2 :r 1 :terrain-type :plains} ;; Multiplayer base location {:q 3 :r 1 :terrain-type :plains} {:q 4 :r 1 :terrain-type :mountains} {:q 5 :r 1 :terrain-type :woods} {:q 6 :r 1 :terrain-type :deep-water} {:q 7 :r 1 :terrain-type :deep-water} ;; Row 3 {:q 0 :r 2 :terrain-type :mountains} {:q 1 :r 2 :terrain-type :plains} ;; Multiplayer base location {:q 2 :r 2 :terrain-type :plains} {:q 3 :r 2 :terrain-type :plains} {:q 4 :r 2 :terrain-type :plains} {:q 5 :r 2 :terrain-type :woods} {:q 6 :r 2 :terrain-type :mountains} {:q 7 :r 2 :terrain-type :mountains} {:q 8 :r 2 :terrain-type :deep-water} ;; Row 4 {:q 0 :r 3 :terrain-type :plains} {:q 1 :r 3 :terrain-type :plains} {:q 2 :r 3 :terrain-type :plains} {:q 3 :r 3 :terrain-type :plains} {:q 4 :r 3 :terrain-type :woods} {:q 5 :r 3 :terrain-type :plains} {:q 6 :r 3 :terrain-type :plains} {:q 7 :r 3 :terrain-type :mountains} {:q 8 :r 3 :terrain-type :deep-water} ;; Row 5 {:q 0 :r 4 :terrain-type :deep-water} {:q 1 :r 4 :terrain-type :mountains} ;; Multiplayer base location {:q 2 :r 4 :terrain-type :plains} {:q 3 :r 4 :terrain-type :plains} {:q 4 :r 4 :terrain-type :plains} {:q 5 :r 4 :terrain-type :plains} {:q 6 :r 4 :terrain-type :plains} {:q 7 :r 4 :terrain-type :plains} {:q 8 :r 4 :terrain-type :deep-water} ;; Row 6 {:q 0 :r 5 :terrain-type :deep-water} {:q 1 :r 5 :terrain-type :plains} {:q 2 :r 5 :terrain-type :plains} {:q 3 :r 5 :terrain-type :woods} {:q 4 :r 5 :terrain-type :plains} {:q 5 :r 5 :terrain-type :plains} {:q 6 :r 5 :terrain-type :plains} {:q 7 :r 5 :terrain-type :plains} {:q 8 :r 5 :terrain-type :deep-water} ;; Row 7 {:q 0 :r 6 :terrain-type :deep-water} {:q 1 :r 6 :terrain-type :mountains} {:q 2 :r 6 :terrain-type :plains} {:q 3 :r 6 :terrain-type :woods} {:q 4 :r 6 :terrain-type :plains} {:q 5 :r 6 :terrain-type :plains} {:q 6 :r 6 :terrain-type :plains} {:q 7 :r 6 :terrain-type :plains} ;; Multiplayer base location {:q 8 :r 6 :terrain-type :mountains} ;; Row 8 {:q 0 :r 7 :terrain-type :deep-water} {:q 1 :r 7 :terrain-type :mountains} {:q 2 :r 7 :terrain-type :woods} {:q 3 :r 7 :terrain-type :mountains} {:q 4 :r 7 :terrain-type :plains} {:q 5 :r 7 :terrain-type :plains} ;; Multiplayer base location {:q 6 :r 7 :terrain-type :mountains} {:q 7 :r 7 :terrain-type :plains} ;; Row 9 {:q 1 :r 8 :terrain-type :deep-water} {:q 2 :r 8 :terrain-type :deep-water} {:q 3 :r 8 :terrain-type :deep-water} {:q 4 :r 8 :terrain-type :deep-water} {:q 5 :r 8 :terrain-type :mountains} ;; Multiplayer base location {:q 6 :r 8 :terrain-type :plains} {:q 7 :r 8 :terrain-type :plains}]} :city-sprawl {:id :city-sprawl :description "City Sprawl" :created-by "Weewar" :terrains [;; Row 1 {:q 2 :r 0 :terrain-type :woods} {:q 3 :r 0 :terrain-type :woods} {:q 4 :r 0 :terrain-type :woods} {:q 5 :r 0 :terrain-type :woods} {:q 6 :r 0 :terrain-type :woods} {:q 10 :r 0 :terrain-type :woods} {:q 11 :r 0 :terrain-type :woods} {:q 12 :r 0 :terrain-type :woods} ;; Row 2 {:q 1 :r 1 :terrain-type :woods} {:q 2 :r 1 :terrain-type :plains} {:q 3 :r 1 :terrain-type :plains} {:q 4 :r 1 :terrain-type :plains} {:q 5 :r 1 :terrain-type :plains} {:q 6 :r 1 :terrain-type :woods} {:q 8 :r 1 :terrain-type :woods} {:q 9 :r 1 :terrain-type :plains} {:q 10 :r 1 :terrain-type :plains} {:q 11 :r 1 :terrain-type :plains} {:q 12 :r 1 :terrain-type :woods} {:q 13 :r 1 :terrain-type :woods} ;; Row 3 {:q 1 :r 2 :terrain-type :woods} {:q 2 :r 2 :terrain-type :plains} {:q 3 :r 2 :terrain-type :mountains} {:q 4 :r 2 :terrain-type :plains} ;; Multiplayer base location (unowned) {:q 5 :r 2 :terrain-type :plains} {:q 6 :r 2 :terrain-type :plains} {:q 7 :r 2 :terrain-type :woods} {:q 8 :r 2 :terrain-type :woods} {:q 9 :r 2 :terrain-type :plains} {:q 10 :r 2 :terrain-type :plains} {:q 11 :r 2 :terrain-type :plains} {:q 12 :r 2 :terrain-type :plains} ;; Multiplayer base location (unowned) {:q 13 :r 2 :terrain-type :plains} {:q 14 :r 2 :terrain-type :woods} ;; Row 4 {:q 0 :r 3 :terrain-type :plains} {:q 1 :r 3 :terrain-type :plains} {:q 2 :r 3 :terrain-type :mountains} {:q 3 :r 3 :terrain-type :plains} ;; Multiplayer base location (red owned) {:q 4 :r 3 :terrain-type :mountains} {:q 5 :r 3 :terrain-type :plains} ;; Multiplayer base location (unowned) {:q 6 :r 3 :terrain-type :woods} {:q 7 :r 3 :terrain-type :mountains} {:q 8 :r 3 :terrain-type :mountains} {:q 9 :r 3 :terrain-type :plains} {:q 10 :r 3 :terrain-type :plains} ;; Multiplayer base location (unowned) {:q 11 :r 3 :terrain-type :desert} {:q 12 :r 3 :terrain-type :woods} {:q 13 :r 3 :terrain-type :plains} {:q 14 :r 3 :terrain-type :woods} ;; Row 5 {:q 0 :r 4 :terrain-type :woods} {:q 1 :r 4 :terrain-type :plains} {:q 2 :r 4 :terrain-type :plains} ;; Multiplayer base location (red) {:q 3 :r 4 :terrain-type :desert} {:q 4 :r 4 :terrain-type :plains} ;; Multiplayer base location (unknown) {:q 5 :r 4 :terrain-type :desert} {:q 6 :r 4 :terrain-type :plains} {:q 7 :r 4 :terrain-type :woods} {:q 8 :r 4 :terrain-type :mountains} {:q 9 :r 4 :terrain-type :plains} {:q 10 :r 4 :terrain-type :mountains} {:q 11 :r 4 :terrain-type :desert} {:q 12 :r 4 :terrain-type :plains} ;; Multiplayer base location (unowned) {:q 13 :r 4 :terrain-type :mountains} {:q 14 :r 4 :terrain-type :plains} ;; Row 6 {:q 0 :r 5 :terrain-type :woods} {:q 1 :r 5 :terrain-type :plains} {:q 2 :r 5 :terrain-type :plains} {:q 3 :r 5 :terrain-type :plains} {:q 4 :r 5 :terrain-type :woods} {:q 5 :r 5 :terrain-type :plains} {:q 6 :r 5 :terrain-type :plains} {:q 7 :r 5 :terrain-type :plains} ;; Multiplayer base location (unowned) {:q 8 :r 5 :terrain-type :plains} {:q 9 :r 5 :terrain-type :plains} {:q 10 :r 5 :terrain-type :plains} {:q 11 :r 5 :terrain-type :plains} ;; Multiplayer base location (unowned) {:q 12 :r 5 :terrain-type :desert} {:q 13 :r 5 :terrain-type :plains} ;; Multiplayer base location (blue) {:q 14 :r 5 :terrain-type :woods} ;; Row 7 {:q 1 :r 6 :terrain-type :woods} {:q 2 :r 6 :terrain-type :woods} {:q 3 :r 6 :terrain-type :plains} {:q 4 :r 6 :terrain-type :woods} {:q 5 :r 6 :terrain-type :mountains} {:q 6 :r 6 :terrain-type :plains} {:q 7 :r 6 :terrain-type :plains} {:q 8 :r 6 :terrain-type :woods} {:q 9 :r 6 :terrain-type :plains} {:q 10 :r 6 :terrain-type :mountains} {:q 11 :r 6 :terrain-type :plains} {:q 12 :r 6 :terrain-type :plains} {:q 13 :r 6 :terrain-type :mountains} {:q 14 :r 6 :terrain-type :plains} ;; Row 8 {:q 1 :r 7 :terrain-type :woods} {:q 2 :r 7 :terrain-type :woods} {:q 3 :r 7 :terrain-type :plains} {:q 4 :r 7 :terrain-type :plains} {:q 5 :r 7 :terrain-type :plains} ;; Multiplayer base location (unowned) {:q 6 :r 7 :terrain-type :mountains} {:q 7 :r 7 :terrain-type :plains} ;; Multiplayer base location (unowned) {:q 8 :r 7 :terrain-type :mountains} {:q 9 :r 7 :terrain-type :plains} ;; Multiplayer base location (unowned) {:q 10 :r 7 :terrain-type :plains} {:q 11 :r 7 :terrain-type :plains} {:q 12 :r 7 :terrain-type :mountains} {:q 13 :r 7 :terrain-type :plains} {:q 14 :r 7 :terrain-type :woods} ;; Row 9 {:q 1 :r 8 :terrain-type :woods} {:q 2 :r 8 :terrain-type :woods} {:q 3 :r 8 :terrain-type :plains} {:q 4 :r 8 :terrain-type :mountains} {:q 5 :r 8 :terrain-type :plains} {:q 6 :r 8 :terrain-type :plains} {:q 7 :r 8 :terrain-type :plains} ;; Multiplayer base location (unowned) {:q 8 :r 8 :terrain-type :plains} {:q 9 :r 8 :terrain-type :plains} {:q 10 :r 8 :terrain-type :mountains} {:q 11 :r 8 :terrain-type :plains} {:q 12 :r 8 :terrain-type :plains} {:q 13 :r 8 :terrain-type :plains} {:q 14 :r 8 :terrain-type :woods} ;; Row 10 {:q 0 :r 9 :terrain-type :woods} {:q 1 :r 9 :terrain-type :plains} {:q 2 :r 9 :terrain-type :plains} {:q 3 :r 9 :terrain-type :desert} {:q 4 :r 9 :terrain-type :woods} ;; Multiplayer base location (unowned) {:q 5 :r 9 :terrain-type :plains} {:q 6 :r 9 :terrain-type :plains} {:q 7 :r 9 :terrain-type :mountains} {:q 8 :r 9 :terrain-type :plains} {:q 9 :r 9 :terrain-type :desert} {:q 10 :r 9 :terrain-type :woods} {:q 11 :r 9 :terrain-type :woods} {:q 12 :r 9 :terrain-type :plains} ;; Multiplayer base location (unowned) {:q 13 :r 9 :terrain-type :plains} {:q 14 :r 9 :terrain-type :woods} ;; Row 11 {:q 0 :r 10 :terrain-type :woods} {:q 1 :r 10 :terrain-type :plains} {:q 2 :r 10 :terrain-type :plains} ;; Multiplayer base location (unowned) {:q 3 :r 10 :terrain-type :desert} {:q 4 :r 10 :terrain-type :desert} {:q 5 :r 10 :terrain-type :plains} {:q 6 :r 10 :terrain-type :plains} {:q 7 :r 10 :terrain-type :plains} ;; Multiplayer base location (unowned) {:q 8 :r 10 :terrain-type :woods} {:q 9 :r 10 :terrain-type :plains} {:q 10 :r 10 :terrain-type :desert} {:q 11 :r 10 :terrain-type :plains} ;; Multiplayer base location (unowned) {:q 12 :r 10 :terrain-type :desert} {:q 13 :r 10 :terrain-type :plains} {:q 14 :r 10 :terrain-type :plains} ;; Row 12 {:q 0 :r 11 :terrain-type :plains} {:q 1 :r 11 :terrain-type :plains} {:q 2 :r 11 :terrain-type :plains} ;; Multiplayer base location (unowned) {:q 3 :r 11 :terrain-type :plains} ;; Multiplayer base location (yellow) {:q 4 :r 11 :terrain-type :plains} ;; Multiplayer base location (unowned) {:q 5 :r 11 :terrain-type :plains} {:q 6 :r 11 :terrain-type :mountains} {:q 7 :r 11 :terrain-type :mountains} {:q 8 :r 11 :terrain-type :woods} {:q 9 :r 11 :terrain-type :plains} ;; Multiplayer base location (unowned) {:q 10 :r 11 :terrain-type :mountains} {:q 11 :r 11 :terrain-type :plains} ;; Multiplayer base location (pink) {:q 12 :r 11 :terrain-type :plains} {:q 13 :r 11 :terrain-type :plains} {:q 14 :r 11 :terrain-type :woods} ;; Row 13 {:q 0 :r 12 :terrain-type :woods} {:q 1 :r 12 :terrain-type :woods} {:q 2 :r 12 :terrain-type :woods} {:q 3 :r 12 :terrain-type :mountains} {:q 4 :r 12 :terrain-type :desert} {:q 5 :r 12 :terrain-type :mountains} {:q 6 :r 12 :terrain-type :plains} {:q 7 :r 12 :terrain-type :plains} {:q 8 :r 12 :terrain-type :plains} {:q 9 :r 12 :terrain-type :plains} {:q 10 :r 12 :terrain-type :plains} {:q 11 :r 12 :terrain-type :desert} {:q 12 :r 12 :terrain-type :plains} {:q 13 :r 12 :terrain-type :woods} {:q 14 :r 12 :terrain-type :woods} ;; Row 14 {:q 1 :r 13 :terrain-type :woods} {:q 2 :r 13 :terrain-type :plains} {:q 3 :r 13 :terrain-type :plains} ;; Multiplayer base location (yellow) {:q 4 :r 13 :terrain-type :plains} {:q 5 :r 13 :terrain-type :woods} {:q 6 :r 13 :terrain-type :woods} {:q 7 :r 13 :terrain-type :woods} {:q 8 :r 13 :terrain-type :woods} {:q 9 :r 13 :terrain-type :plains} {:q 10 :r 13 :terrain-type :plains} ;; Multiplayer base location (pink) {:q 11 :r 13 :terrain-type :plains} {:q 12 :r 13 :terrain-type :woods} ;; Row 15 {:q 2 :r 14 :terrain-type :woods} {:q 3 :r 14 :terrain-type :plains} {:q 4 :r 14 :terrain-type :plains} {:q 5 :r 14 :terrain-type :woods} {:q 6 :r 14 :terrain-type :woods} {:q 8 :r 14 :terrain-type :woods} {:q 9 :r 14 :terrain-type :woods} {:q 10 :r 14 :terrain-type :plains} {:q 11 :r 14 :terrain-type :plains} {:q 12 :r 14 :terrain-type :woods}]} :duel {:id :duel :description "Duel" :created-by "Chris Vincent" :notes "There's only one way to settle this." :terrains [{:q 0, :r 0, :terrain-type :deep-water} {:q 1, :r 0, :terrain-type :deep-water} {:q 2, :r 0, :terrain-type :deep-water} {:q 3, :r 0, :terrain-type :deep-water} {:q 4, :r 0, :terrain-type :deep-water} {:q 5, :r 0, :terrain-type :deep-water} {:q 6, :r 0, :terrain-type :deep-water} {:q 7, :r 0, :terrain-type :deep-water} {:q 8, :r 0, :terrain-type :deep-water} {:q 9, :r 0, :terrain-type :deep-water} {:q 10, :r 0, :terrain-type :deep-water} {:q 11, :r 0, :terrain-type :deep-water} {:q 12, :r 0, :terrain-type :deep-water} {:q 13, :r 0, :terrain-type :deep-water} {:q 14, :r 0, :terrain-type :deep-water} {:q 15, :r 0, :terrain-type :deep-water} {:q 16, :r 0, :terrain-type :deep-water} {:q 17, :r 0, :terrain-type :deep-water} {:q 18, :r 0, :terrain-type :deep-water} {:q 19, :r 0, :terrain-type :deep-water} {:q 20, :r 0, :terrain-type :deep-water} {:q 21, :r 0, :terrain-type :deep-water} {:q 22, :r 0, :terrain-type :deep-water} {:q 23, :r 0, :terrain-type :deep-water} {:q 0, :r 1, :terrain-type :deep-water} {:q 1, :r 1, :terrain-type :deep-water} {:q 2, :r 1, :terrain-type :deep-water} {:q 3, :r 1, :terrain-type :deep-water} {:q 4, :r 1, :terrain-type :deep-water} {:q 5, :r 1, :terrain-type :deep-water} {:q 6, :r 1, :terrain-type :deep-water} {:q 7, :r 1, :terrain-type :deep-water} {:q 8, :r 1, :terrain-type :deep-water} {:q 9, :r 1, :terrain-type :deep-water} {:q 10, :r 1, :terrain-type :deep-water} {:q 11, :r 1, :terrain-type :deep-water} {:q 12, :r 1, :terrain-type :deep-water} {:q 13, :r 1, :terrain-type :deep-water} {:q 14, :r 1, :terrain-type :deep-water} {:q 15, :r 1, :terrain-type :deep-water} {:q 16, :r 1, :terrain-type :deep-water} {:q 17, :r 1, :terrain-type :deep-water} {:q 18, :r 1, :terrain-type :deep-water} {:q 19, :r 1, :terrain-type :deep-water} {:q 20, :r 1, :terrain-type :deep-water} {:q 21, :r 1, :terrain-type :deep-water} {:q 22, :r 1, :terrain-type :deep-water} {:q 0, :r 2, :terrain-type :deep-water} {:q 1, :r 2, :terrain-type :deep-water} {:q 2, :r 2, :terrain-type :deep-water} {:q 3, :r 2, :terrain-type :deep-water} {:q 4, :r 2, :terrain-type :deep-water} {:q 5, :r 2, :terrain-type :deep-water} {:q 6, :r 2, :terrain-type :deep-water} {:q 7, :r 2, :terrain-type :deep-water} {:q 8, :r 2, :terrain-type :deep-water} {:q 9, :r 2, :terrain-type :deep-water} {:q 10, :r 2, :terrain-type :deep-water} {:q 11, :r 2, :terrain-type :deep-water} {:q 12, :r 2, :terrain-type :shallow-water} {:q 13, :r 2, :terrain-type :shallow-water} {:q 14, :r 2, :terrain-type :shallow-water} {:q 15, :r 2, :terrain-type :shallow-water} {:q 16, :r 2, :terrain-type :shallow-water} {:q 17, :r 2, :terrain-type :shallow-water} {:q 18, :r 2, :terrain-type :shallow-water} {:q 19, :r 2, :terrain-type :deep-water} {:q 20, :r 2, :terrain-type :deep-water} {:q 21, :r 2, :terrain-type :deep-water} {:q 22, :r 2, :terrain-type :deep-water} {:q 23, :r 2, :terrain-type :deep-water} {:q 0, :r 3, :terrain-type :deep-water} {:q 1, :r 3, :terrain-type :deep-water} {:q 2, :r 3, :terrain-type :deep-water} {:q 3, :r 3, :terrain-type :deep-water} {:q 4, :r 3, :terrain-type :deep-water} {:q 5, :r 3, :terrain-type :deep-water} {:q 6, :r 3, :terrain-type :deep-water} {:q 7, :r 3, :terrain-type :deep-water} {:q 8, :r 3, :terrain-type :deep-water} {:q 9, :r 3, :terrain-type :deep-water} {:q 10, :r 3, :terrain-type :shallow-water} {:q 11, :r 3, :terrain-type :shallow-water} {:q 12, :r 3, :terrain-type :plains} {:q 13, :r 3, :terrain-type :plains} {:q 14, :r 3, :terrain-type :plains} {:q 15, :r 3, :terrain-type :plains} {:q 16, :r 3, :terrain-type :ford} {:q 17, :r 3, :terrain-type :shallow-water} {:q 18, :r 3, :terrain-type :shallow-water} {:q 19, :r 3, :terrain-type :deep-water} {:q 20, :r 3, :terrain-type :deep-water} {:q 21, :r 3, :terrain-type :deep-water} {:q 22, :r 3, :terrain-type :deep-water} {:q 0, :r 4, :terrain-type :deep-water} {:q 1, :r 4, :terrain-type :deep-water} {:q 2, :r 4, :terrain-type :deep-water} {:q 3, :r 4, :terrain-type :deep-water} {:q 4, :r 4, :terrain-type :deep-water} {:q 5, :r 4, :terrain-type :shallow-water} {:q 6, :r 4, :terrain-type :shallow-water} {:q 7, :r 4, :terrain-type :shallow-water} {:q 8, :r 4, :terrain-type :shallow-water} {:q 9, :r 4, :terrain-type :shallow-water} {:q 10, :r 4, :terrain-type :shallow-water} {:q 11, :r 4, :terrain-type :woods} {:q 12, :r 4, :terrain-type :plains} {:q 13, :r 4, :terrain-type :plains} {:q 14, :r 4, :terrain-type :plains} {:q 15, :r 4, :terrain-type :plains} {:q 16, :r 4, :terrain-type :plains} {:q 17, :r 4, :terrain-type :ford} {:q 18, :r 4, :terrain-type :swamp} {:q 19, :r 4, :terrain-type :shallow-water} {:q 20, :r 4, :terrain-type :deep-water} {:q 21, :r 4, :terrain-type :deep-water} {:q 22, :r 4, :terrain-type :deep-water} {:q 23, :r 4, :terrain-type :deep-water} {:q 0, :r 5, :terrain-type :deep-water} {:q 1, :r 5, :terrain-type :deep-water} {:q 2, :r 5, :terrain-type :deep-water} {:q 3, :r 5, :terrain-type :deep-water} {:q 4, :r 5, :terrain-type :shallow-water} {:q 5, :r 5, :terrain-type :plains} {:q 6, :r 5, :terrain-type :plains} {:q 7, :r 5, :terrain-type :plains} {:q 8, :r 5, :terrain-type :woods} {:q 9, :r 5, :terrain-type :woods} {:q 10, :r 5, :terrain-type :mountains} {:q 11, :r 5, :terrain-type :woods} {:q 12, :r 5, :terrain-type :plains} {:q 13, :r 5, :terrain-type :plains} {:q 14, :r 5, :terrain-type :plains} {:q 15, :r 5, :terrain-type :plains} {:q 16, :r 5, :terrain-type :swamp} {:q 17, :r 5, :terrain-type :ford} {:q 18, :r 5, :terrain-type :woods} {:q 19, :r 5, :terrain-type :shallow-water} {:q 20, :r 5, :terrain-type :deep-water} {:q 21, :r 5, :terrain-type :deep-water} {:q 22, :r 5, :terrain-type :deep-water} {:q 0, :r 6, :terrain-type :deep-water} {:q 1, :r 6, :terrain-type :deep-water} {:q 2, :r 6, :terrain-type :deep-water} {:q 3, :r 6, :terrain-type :deep-water} {:q 4, :r 6, :terrain-type :shallow-water} {:q 5, :r 6, :terrain-type :plains} {:q 6, :r 6, :terrain-type :plains} {:q 7, :r 6, :terrain-type :plains} {:q 8, :r 6, :terrain-type :woods} {:q 9, :r 6, :terrain-type :woods} {:q 10, :r 6, :terrain-type :plains} {:q 11, :r 6, :terrain-type :plains} {:q 12, :r 6, :terrain-type :shallow-water} {:q 13, :r 6, :terrain-type :shallow-water} {:q 14, :r 6, :terrain-type :plains} {:q 15, :r 6, :terrain-type :plains} {:q 16, :r 6, :terrain-type :woods} {:q 17, :r 6, :terrain-type :swamp} {:q 18, :r 6, :terrain-type :swamp} {:q 19, :r 6, :terrain-type :woods} {:q 20, :r 6, :terrain-type :shallow-water} {:q 21, :r 6, :terrain-type :deep-water} {:q 22, :r 6, :terrain-type :deep-water} {:q 23, :r 6, :terrain-type :deep-water} {:q 0, :r 7, :terrain-type :deep-water} {:q 1, :r 7, :terrain-type :deep-water} {:q 2, :r 7, :terrain-type :deep-water} {:q 3, :r 7, :terrain-type :deep-water} {:q 4, :r 7, :terrain-type :deep-water} {:q 5, :r 7, :terrain-type :plains} {:q 6, :r 7, :terrain-type :plains} {:q 7, :r 7, :terrain-type :woods} {:q 8, :r 7, :terrain-type :mountains} {:q 9, :r 7, :terrain-type :plains} {:q 10, :r 7, :terrain-type :plains} {:q 11, :r 7, :terrain-type :shallow-water} {:q 12, :r 7, :terrain-type :swamp} {:q 13, :r 7, :terrain-type :plains} {:q 14, :r 7, :terrain-type :shallow-water} {:q 15, :r 7, :terrain-type :woods} {:q 16, :r 7, :terrain-type :woods} {:q 17, :r 7, :terrain-type :woods} {:q 18, :r 7, :terrain-type :swamp} {:q 19, :r 7, :terrain-type :woods} {:q 20, :r 7, :terrain-type :shallow-water} {:q 21, :r 7, :terrain-type :deep-water} {:q 22, :r 7, :terrain-type :deep-water} {:q 0, :r 8, :terrain-type :deep-water} {:q 1, :r 8, :terrain-type :deep-water} {:q 2, :r 8, :terrain-type :deep-water} {:q 3, :r 8, :terrain-type :deep-water} {:q 4, :r 8, :terrain-type :deep-water} {:q 5, :r 8, :terrain-type :mountains} {:q 6, :r 8, :terrain-type :mountains} {:q 7, :r 8, :terrain-type :mountains} {:q 8, :r 8, :terrain-type :plains} {:q 9, :r 8, :terrain-type :plains} {:q 10, :r 8, :terrain-type :plains} {:q 11, :r 8, :terrain-type :plains} {:q 12, :r 8, :terrain-type :shallow-water} {:q 13, :r 8, :terrain-type :shallow-water} {:q 14, :r 8, :terrain-type :swamp} {:q 15, :r 8, :terrain-type :shallow-water} {:q 16, :r 8, :terrain-type :woods} {:q 17, :r 8, :terrain-type :woods} {:q 18, :r 8, :terrain-type :woods} {:q 19, :r 8, :terrain-type :swamp} {:q 20, :r 8, :terrain-type :woods} {:q 21, :r 8, :terrain-type :shallow-water} {:q 22, :r 8, :terrain-type :deep-water} {:q 23, :r 8, :terrain-type :deep-water} {:q 0, :r 9, :terrain-type :deep-water} {:q 1, :r 9, :terrain-type :deep-water} {:q 2, :r 9, :terrain-type :deep-water} {:q 3, :r 9, :terrain-type :deep-water} {:q 4, :r 9, :terrain-type :mountains} {:q 5, :r 9, :terrain-type :mountains} {:q 6, :r 9, :terrain-type :plains} {:q 7, :r 9, :terrain-type :plains} {:q 8, :r 9, :terrain-type :plains} {:q 9, :r 9, :terrain-type :woods} {:q 10, :r 9, :terrain-type :plains} {:q 11, :r 9, :terrain-type :plains} {:q 12, :r 9, :terrain-type :shallow-water} {:q 13, :r 9, :terrain-type :shallow-water} {:q 14, :r 9, :terrain-type :shallow-water} {:q 15, :r 9, :terrain-type :mountains} {:q 16, :r 9, :terrain-type :mountains} {:q 17, :r 9, :terrain-type :mountains} {:q 18, :r 9, :terrain-type :swamp} {:q 19, :r 9, :terrain-type :woods} {:q 20, :r 9, :terrain-type :shallow-water} {:q 21, :r 9, :terrain-type :deep-water} {:q 22, :r 9, :terrain-type :deep-water} {:q 0, :r 10, :terrain-type :deep-water} {:q 1, :r 10, :terrain-type :deep-water} {:q 2, :r 10, :terrain-type :deep-water} {:q 3, :r 10, :terrain-type :deep-water} {:q 4, :r 10, :terrain-type :shallow-water} {:q 5, :r 10, :terrain-type :mountains} {:q 6, :r 10, :terrain-type :plains} {:q 7, :r 10, :terrain-type :plains} {:q 8, :r 10, :terrain-type :plains} {:q 9, :r 10, :terrain-type :woods} {:q 10, :r 10, :terrain-type :woods} {:q 11, :r 10, :terrain-type :plains} {:q 12, :r 10, :terrain-type :plains} {:q 13, :r 10, :terrain-type :plains} {:q 14, :r 10, :terrain-type :mountains} {:q 15, :r 10, :terrain-type :mountains} {:q 16, :r 10, :terrain-type :mountains} {:q 17, :r 10, :terrain-type :mountains} {:q 18, :r 10, :terrain-type :swamp} {:q 19, :r 10, :terrain-type :woods} {:q 20, :r 10, :terrain-type :shallow-water} {:q 21, :r 10, :terrain-type :deep-water} {:q 22, :r 10, :terrain-type :deep-water} {:q 23, :r 10, :terrain-type :deep-water} {:q 0, :r 11, :terrain-type :deep-water} {:q 1, :r 11, :terrain-type :deep-water} {:q 2, :r 11, :terrain-type :deep-water} {:q 3, :r 11, :terrain-type :shallow-water} {:q 4, :r 11, :terrain-type :woods} {:q 5, :r 11, :terrain-type :plains} {:q 6, :r 11, :terrain-type :plains} {:q 7, :r 11, :terrain-type :plains} {:q 8, :r 11, :terrain-type :plains} {:q 9, :r 11, :terrain-type :woods} {:q 10, :r 11, :terrain-type :plains} {:q 11, :r 11, :terrain-type :plains} {:q 12, :r 11, :terrain-type :plains} {:q 13, :r 11, :terrain-type :woods} {:q 14, :r 11, :terrain-type :plains} {:q 15, :r 11, :terrain-type :plains} {:q 16, :r 11, :terrain-type :plains} {:q 17, :r 11, :terrain-type :plains} {:q 18, :r 11, :terrain-type :woods} {:q 19, :r 11, :terrain-type :shallow-water} {:q 20, :r 11, :terrain-type :deep-water} {:q 21, :r 11, :terrain-type :deep-water} {:q 22, :r 11, :terrain-type :deep-water} {:q 0, :r 12, :terrain-type :deep-water} {:q 1, :r 12, :terrain-type :deep-water} {:q 2, :r 12, :terrain-type :deep-water} {:q 3, :r 12, :terrain-type :shallow-water} {:q 4, :r 12, :terrain-type :woods} {:q 5, :r 12, :terrain-type :swamp} {:q 6, :r 12, :terrain-type :mountains} {:q 7, :r 12, :terrain-type :mountains} {:q 8, :r 12, :terrain-type :mountains} {:q 9, :r 12, :terrain-type :mountains} {:q 10, :r 12, :terrain-type :plains} {:q 11, :r 12, :terrain-type :plains} {:q 12, :r 12, :terrain-type :plains} {:q 13, :r 12, :terrain-type :woods} {:q 14, :r 12, :terrain-type :plains} {:q 15, :r 12, :terrain-type :plains} {:q 16, :r 12, :terrain-type :plains} {:q 17, :r 12, :terrain-type :plains} {:q 18, :r 12, :terrain-type :mountains} {:q 19, :r 12, :terrain-type :shallow-water} {:q 20, :r 12, :terrain-type :deep-water} {:q 21, :r 12, :terrain-type :deep-water} {:q 22, :r 12, :terrain-type :deep-water} {:q 23, :r 12, :terrain-type :deep-water} {:q 0, :r 13, :terrain-type :deep-water} {:q 1, :r 13, :terrain-type :deep-water} {:q 2, :r 13, :terrain-type :shallow-water} {:q 3, :r 13, :terrain-type :woods} {:q 4, :r 13, :terrain-type :swamp} {:q 5, :r 13, :terrain-type :mountains} {:q 6, :r 13, :terrain-type :mountains} {:q 7, :r 13, :terrain-type :mountains} {:q 8, :r 13, :terrain-type :shallow-water} {:q 9, :r 13, :terrain-type :shallow-water} {:q 10, :r 13, :terrain-type :shallow-water} {:q 11, :r 13, :terrain-type :plains} {:q 12, :r 13, :terrain-type :plains} {:q 13, :r 13, :terrain-type :woods} {:q 14, :r 13, :terrain-type :plains} {:q 15, :r 13, :terrain-type :plains} {:q 16, :r 13, :terrain-type :plains} {:q 17, :r 13, :terrain-type :mountains} {:q 18, :r 13, :terrain-type :mountains} {:q 19, :r 13, :terrain-type :deep-water} {:q 20, :r 13, :terrain-type :deep-water} {:q 21, :r 13, :terrain-type :deep-water} {:q 22, :r 13, :terrain-type :deep-water} {:q 0, :r 14, :terrain-type :deep-water} {:q 1, :r 14, :terrain-type :deep-water} {:q 2, :r 14, :terrain-type :shallow-water} {:q 3, :r 14, :terrain-type :woods} {:q 4, :r 14, :terrain-type :swamp} {:q 5, :r 14, :terrain-type :woods} {:q 6, :r 14, :terrain-type :woods} {:q 7, :r 14, :terrain-type :woods} {:q 8, :r 14, :terrain-type :shallow-water} {:q 9, :r 14, :terrain-type :swamp} {:q 10, :r 14, :terrain-type :shallow-water} {:q 11, :r 14, :terrain-type :shallow-water} {:q 12, :r 14, :terrain-type :plains} {:q 13, :r 14, :terrain-type :plains} {:q 14, :r 14, :terrain-type :plains} {:q 15, :r 14, :terrain-type :plains} {:q 16, :r 14, :terrain-type :mountains} {:q 17, :r 14, :terrain-type :mountains} {:q 18, :r 14, :terrain-type :mountains} {:q 19, :r 14, :terrain-type :deep-water} {:q 20, :r 14, :terrain-type :deep-water} {:q 21, :r 14, :terrain-type :deep-water} {:q 22, :r 14, :terrain-type :deep-water} {:q 23, :r 14, :terrain-type :deep-water} {:q 0, :r 15, :terrain-type :deep-water} {:q 1, :r 15, :terrain-type :deep-water} {:q 2, :r 15, :terrain-type :shallow-water} {:q 3, :r 15, :terrain-type :woods} {:q 4, :r 15, :terrain-type :swamp} {:q 5, :r 15, :terrain-type :woods} {:q 6, :r 15, :terrain-type :woods} {:q 7, :r 15, :terrain-type :woods} {:q 8, :r 15, :terrain-type :shallow-water} {:q 9, :r 15, :terrain-type :plains} {:q 10, :r 15, :terrain-type :swamp} {:q 11, :r 15, :terrain-type :shallow-water} {:q 12, :r 15, :terrain-type :plains} {:q 13, :r 15, :terrain-type :plains} {:q 14, :r 15, :terrain-type :mountains} {:q 15, :r 15, :terrain-type :woods} {:q 16, :r 15, :terrain-type :plains} {:q 17, :r 15, :terrain-type :plains} {:q 18, :r 15, :terrain-type :plains} {:q 19, :r 15, :terrain-type :deep-water} {:q 20, :r 15, :terrain-type :deep-water} {:q 21, :r 15, :terrain-type :deep-water} {:q 22, :r 15, :terrain-type :deep-water} {:q 0, :r 16, :terrain-type :deep-water} {:q 1, :r 16, :terrain-type :deep-water} {:q 2, :r 16, :terrain-type :deep-water} {:q 3, :r 16, :terrain-type :shallow-water} {:q 4, :r 16, :terrain-type :woods} {:q 5, :r 16, :terrain-type :swamp} {:q 6, :r 16, :terrain-type :swamp} {:q 7, :r 16, :terrain-type :woods} {:q 8, :r 16, :terrain-type :plains} {:q 9, :r 16, :terrain-type :plains} {:q 10, :r 16, :terrain-type :shallow-water} {:q 11, :r 16, :terrain-type :shallow-water} {:q 12, :r 16, :terrain-type :plains} {:q 13, :r 16, :terrain-type :plains} {:q 14, :r 16, :terrain-type :woods} {:q 15, :r 16, :terrain-type :woods} {:q 16, :r 16, :terrain-type :plains} {:q 17, :r 16, :terrain-type :plains} {:q 18, :r 16, :terrain-type :plains} {:q 19, :r 16, :terrain-type :shallow-water} {:q 20, :r 16, :terrain-type :deep-water} {:q 21, :r 16, :terrain-type :deep-water} {:q 22, :r 16, :terrain-type :deep-water} {:q 23, :r 16, :terrain-type :deep-water} {:q 0, :r 17, :terrain-type :deep-water} {:q 1, :r 17, :terrain-type :deep-water} {:q 2, :r 17, :terrain-type :deep-water} {:q 3, :r 17, :terrain-type :shallow-water} {:q 4, :r 17, :terrain-type :woods} {:q 5, :r 17, :terrain-type :ford} {:q 6, :r 17, :terrain-type :swamp} {:q 7, :r 17, :terrain-type :plains} {:q 8, :r 17, :terrain-type :plains} {:q 9, :r 17, :terrain-type :plains} {:q 10, :r 17, :terrain-type :plains} {:q 11, :r 17, :terrain-type :woods} {:q 12, :r 17, :terrain-type :mountains} {:q 13, :r 17, :terrain-type :woods} {:q 14, :r 17, :terrain-type :woods} {:q 15, :r 17, :terrain-type :plains} {:q 16, :r 17, :terrain-type :plains} {:q 17, :r 17, :terrain-type :plains} {:q 18, :r 17, :terrain-type :shallow-water} {:q 19, :r 17, :terrain-type :deep-water} {:q 20, :r 17, :terrain-type :deep-water} {:q 21, :r 17, :terrain-type :deep-water} {:q 22, :r 17, :terrain-type :deep-water} {:q 0, :r 18, :terrain-type :deep-water} {:q 1, :r 18, :terrain-type :deep-water} {:q 2, :r 18, :terrain-type :deep-water} {:q 3, :r 18, :terrain-type :deep-water} {:q 4, :r 18, :terrain-type :shallow-water} {:q 5, :r 18, :terrain-type :swamp} {:q 6, :r 18, :terrain-type :ford} {:q 7, :r 18, :terrain-type :plains} {:q 8, :r 18, :terrain-type :plains} {:q 9, :r 18, :terrain-type :plains} {:q 10, :r 18, :terrain-type :plains} {:q 11, :r 18, :terrain-type :plains} {:q 12, :r 18, :terrain-type :woods} {:q 13, :r 18, :terrain-type :shallow-water} {:q 14, :r 18, :terrain-type :shallow-water} {:q 15, :r 18, :terrain-type :shallow-water} {:q 16, :r 18, :terrain-type :shallow-water} {:q 17, :r 18, :terrain-type :shallow-water} {:q 18, :r 18, :terrain-type :shallow-water} {:q 19, :r 18, :terrain-type :deep-water} {:q 20, :r 18, :terrain-type :deep-water} {:q 21, :r 18, :terrain-type :deep-water} {:q 22, :r 18, :terrain-type :deep-water} {:q 23, :r 18, :terrain-type :deep-water} {:q 0, :r 19, :terrain-type :deep-water} {:q 1, :r 19, :terrain-type :deep-water} {:q 2, :r 19, :terrain-type :deep-water} {:q 3, :r 19, :terrain-type :deep-water} {:q 4, :r 19, :terrain-type :shallow-water} {:q 5, :r 19, :terrain-type :shallow-water} {:q 6, :r 19, :terrain-type :ford} {:q 7, :r 19, :terrain-type :plains} {:q 8, :r 19, :terrain-type :plains} {:q 9, :r 19, :terrain-type :plains} {:q 10, :r 19, :terrain-type :plains} {:q 11, :r 19, :terrain-type :shallow-water} {:q 12, :r 19, :terrain-type :shallow-water} {:q 13, :r 19, :terrain-type :deep-water} {:q 14, :r 19, :terrain-type :deep-water} {:q 15, :r 19, :terrain-type :deep-water} {:q 16, :r 19, :terrain-type :deep-water} {:q 17, :r 19, :terrain-type :deep-water} {:q 18, :r 19, :terrain-type :deep-water} {:q 19, :r 19, :terrain-type :deep-water} {:q 20, :r 19, :terrain-type :deep-water} {:q 21, :r 19, :terrain-type :deep-water} {:q 22, :r 19, :terrain-type :deep-water} {:q 0, :r 20, :terrain-type :deep-water} {:q 1, :r 20, :terrain-type :deep-water} {:q 2, :r 20, :terrain-type :deep-water} {:q 3, :r 20, :terrain-type :deep-water} {:q 4, :r 20, :terrain-type :deep-water} {:q 5, :r 20, :terrain-type :shallow-water} {:q 6, :r 20, :terrain-type :shallow-water} {:q 7, :r 20, :terrain-type :shallow-water} {:q 8, :r 20, :terrain-type :shallow-water} {:q 9, :r 20, :terrain-type :shallow-water} {:q 10, :r 20, :terrain-type :shallow-water} {:q 11, :r 20, :terrain-type :shallow-water} {:q 12, :r 20, :terrain-type :deep-water} {:q 13, :r 20, :terrain-type :deep-water} {:q 14, :r 20, :terrain-type :deep-water} {:q 15, :r 20, :terrain-type :deep-water} {:q 16, :r 20, :terrain-type :deep-water} {:q 17, :r 20, :terrain-type :deep-water} {:q 18, :r 20, :terrain-type :deep-water} {:q 19, :r 20, :terrain-type :deep-water} {:q 20, :r 20, :terrain-type :deep-water} {:q 21, :r 20, :terrain-type :deep-water} {:q 22, :r 20, :terrain-type :deep-water} {:q 23, :r 20, :terrain-type :deep-water} {:q 0, :r 21, :terrain-type :deep-water} {:q 1, :r 21, :terrain-type :deep-water} {:q 2, :r 21, :terrain-type :deep-water} {:q 3, :r 21, :terrain-type :deep-water} {:q 4, :r 21, :terrain-type :deep-water} {:q 5, :r 21, :terrain-type :deep-water} {:q 6, :r 21, :terrain-type :deep-water} {:q 7, :r 21, :terrain-type :deep-water} {:q 8, :r 21, :terrain-type :deep-water} {:q 9, :r 21, :terrain-type :deep-water} {:q 10, :r 21, :terrain-type :deep-water} {:q 11, :r 21, :terrain-type :deep-water} {:q 12, :r 21, :terrain-type :deep-water} {:q 13, :r 21, :terrain-type :deep-water} {:q 14, :r 21, :terrain-type :deep-water} {:q 15, :r 21, :terrain-type :deep-water} {:q 16, :r 21, :terrain-type :deep-water} {:q 17, :r 21, :terrain-type :deep-water} {:q 18, :r 21, :terrain-type :deep-water} {:q 19, :r 21, :terrain-type :deep-water} {:q 20, :r 21, :terrain-type :deep-water} {:q 21, :r 21, :terrain-type :deep-water} {:q 22, :r 21, :terrain-type :deep-water} {:q 0, :r 22, :terrain-type :deep-water} {:q 1, :r 22, :terrain-type :deep-water} {:q 2, :r 22, :terrain-type :deep-water} {:q 3, :r 22, :terrain-type :deep-water} {:q 4, :r 22, :terrain-type :deep-water} {:q 5, :r 22, :terrain-type :deep-water} {:q 6, :r 22, :terrain-type :deep-water} {:q 7, :r 22, :terrain-type :deep-water} {:q 8, :r 22, :terrain-type :deep-water} {:q 9, :r 22, :terrain-type :deep-water} {:q 10, :r 22, :terrain-type :deep-water} {:q 11, :r 22, :terrain-type :deep-water} {:q 12, :r 22, :terrain-type :deep-water} {:q 13, :r 22, :terrain-type :deep-water} {:q 14, :r 22, :terrain-type :deep-water} {:q 15, :r 22, :terrain-type :deep-water} {:q 16, :r 22, :terrain-type :deep-water} {:q 17, :r 22, :terrain-type :deep-water} {:q 18, :r 22, :terrain-type :deep-water} {:q 19, :r 22, :terrain-type :deep-water} {:q 20, :r 22, :terrain-type :deep-water} {:q 21, :r 22, :terrain-type :deep-water} {:q 22, :r 22, :terrain-type :deep-water} {:q 23, :r 22, :terrain-type :deep-water}]}}) ;; TODO: add support for :allowed-unit-types (def scenarios {:sterlings-aruba-multiplayer {:id :sterlings-aruba-multiplayer :description "Sterling's Aruba Multiplayer" :created-by "Weewar" :ruleset-id :zetawar :map-id :sterlings-aruba :max-count-per-unit 10 :credits-per-base 100 :bases [{:q 1 :r 2 :base-type :base} {:q 1 :r 4 :base-type :seaport} {:q 2 :r 1 :base-type :base} {:q 2 :r 4 :base-type :airfield} {:q 5 :r 7 :base-type :base} {:q 5 :r 8 :base-type :seaport} {:q 6 :r 5 :base-type :airfield} {:q 7 :r 6 :base-type :base}] :factions [{:color :blue :credits 300 :ai false :bases [{:q 1 :r 2}] :units [{:q 2 :r 2 :unit-type :infantry}]} {:color :red :credits 300 :ai true :bases [{:q 7 :r 6}] :units [{:q 7 :r 7 :unit-type :infantry} {:q 7 :r 8 :unit-type :infantry}]}]} :sterlings-aruba-ai-vs-ai {:id :sterlings-aruba-ai-vs-ai :description "Sterling's Aruba AI vs AI" :created-by "Weewar" :ruleset-id :zetawar :map-id :sterlings-aruba :max-count-per-unit 10 :credits-per-base 100 :bases [{:q 1 :r 2 :base-type :base} {:q 1 :r 4 :base-type :seaport} {:q 2 :r 1 :base-type :base} {:q 2 :r 4 :base-type :airfield} {:q 5 :r 7 :base-type :base} {:q 5 :r 8 :base-type :seaport} {:q 6 :r 5 :base-type :airfield} {:q 7 :r 6 :base-type :base}] :factions [{:color :blue :credits 300 :ai true :bases [{:q 1 :r 2}] :units [{:q 2 :r 2 :unit-type :infantry}]} {:color :red :credits 300 :ai true :bases [{:q 7 :r 6}] :units [{:q 7 :r 7 :unit-type :infantry} {:q 7 :r 8 :unit-type :infantry}]}]} :city-sprawl-multiplayer {:id :city-sprawl-multiplayer :description "City Sprawl Multiplayer" :created-by "Weewar" :ruleset-id :zetawar :map-id :city-sprawl :max-count-per-unit 10 :credits-per-base 50 :bases [{:q 4 :r 2 :base-type :base} {:q 12 :r 2 :base-type :base} {:q 3 :r 3 :base-type :base} {:q 5 :r 3 :base-type :base} {:q 10 :r 3 :base-type :base} {:q 2 :r 4 :base-type :base} {:q 4 :r 4 :base-type :base} {:q 12 :r 4 :base-type :base} {:q 7 :r 5 :base-type :base} {:q 11 :r 5 :base-type :base} {:q 13 :r 5 :base-type :base} {:q 5 :r 7 :base-type :base} {:q 7 :r 7 :base-type :base} {:q 9 :r 7 :base-type :base} {:q 7 :r 8 :base-type :base} {:q 12 :r 9 :base-type :base} {:q 2 :r 10 :base-type :base} {:q 7 :r 10 :base-type :base} {:q 11 :r 10 :base-type :base} {:q 2 :r 11 :base-type :base} {:q 3 :r 11 :base-type :base} {:q 4 :r 11 :base-type :base} {:q 9 :r 11 :base-type :base} {:q 11 :r 11 :base-type :base} {:q 3 :r 13 :base-type :base} {:q 10 :r 13 :base-type :base}] ;; TODO: determine best faction order :factions [{:color :red :credits 300 :ai false :bases [{:q 3 :r 3} {:q 2 :r 4}] :units [{:q 3 :r 2 :unit-type :infantry} {:q 2 :r 3 :unit-type :infantry}]} {:color :blue :credits 300 :ai true :bases [{:q 12 :r 4} {:q 13 :r 5}] :units [{:q 12 :r 3 :unit-type :infantry} {:q 13 :r 4 :unit-type :infantry}]} {:color :yellow :credits 300 :ai true :bases [{:q 3 :r 11} {:q 3 :r 13}] :units [{:q 2 :r 12 :unit-type :infantry} {:q 3 :r 12 :unit-type :infantry}]} {:color :pink :credits 300 :ai true :bases [{:q 11 :r 11} {:q 10 :r 13}] :units [{:q 10 :r 11 :unit-type :infantry} {:q 11 :r 12 :unit-type :infantry}]}]} :duel-multiplayer {:id :duel-multiplayer :description "Duel Multiplayer" :created-by "Chris Vincent" :notes "There's only one way to settle this." :ruleset-id :zetawar :map-id :duel :max-count-per-unit 10 :credits-per-base 100 :bases [{:q 4, :r 7, :base-type :seaport} {:q 5, :r 6, :base-type :base} {:q 5, :r 19, :base-type :base} {:q 6, :r 5, :base-type :base} {:q 8, :r 18, :base-type :airfield} {:q 9, :r 10, :base-type :base} {:q 10, :r 14, :base-type :base} {:q 10, :r 18, :base-type :base} {:q 13, :r 4, :base-type :base} {:q 13, :r 8, :base-type :base} {:q 14, :r 12, :base-type :base} {:q 15, :r 4, :base-type :airfield} {:q 16, :r 17, :base-type :base} {:q 17, :r 3, :base-type :base} {:q 18, :r 15, :base-type :seaport} {:q 18, :r 16, :base-type :base}] :factions [{:color :red :credits 300 :ai false :bases [{:q 4, :r 7} {:q 5, :r 6} {:q 6, :r 5}] :units [{:q 4, :r 8, :unit-type :cruiser} {:q 5, :r 5, :unit-type :infantry}]} {:color :blue :credits 300 :ai true :bases [{:q 16, :r 17} {:q 18, :r 15} {:q 18, :r 16}] :units [{:q 17, :r 17, :unit-type :infantry} {:q 19, :r 14, :unit-type :cruiser}]}]}}) ================================================ FILE: src/cljs/zetawar/db.cljs ================================================ (ns zetawar.db (:require [datascript.core :as d] [zetawar.logging :as log] [zetawar.util :refer [breakpoint inspect solo ssolo]])) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Schema ;; TODO: add base-type (for shipyards, airfields, etc.) (def schema {;; App :app/game {:db/valueType :db.type/ref} :app/configuring-faction {:db/valueType :db.type/ref} ;; Game :game/id {:db/unique :db.unique/identity} :game/terrain-types {:db/valueType :db.type/ref :db/cardinality :db.cardinality/many :db/isComponent true} :game/unit-types {:db/valueType :db.type/ref :db/cardinality :db.cardinality/many :db/isComponent true} :game/unit-state-maps {:db/valueType :db.type/ref :db/cardinality :db.cardinality/many :db/isComponent true} :game/unit-states {:db/valueType :db.type/ref :db/cardinality :db.cardinality/many :db/isComponent true} :game/map {:db/valueType :db.type/ref :db/isComponent true} :game/factions {:db/valueType :db.type/ref :db/cardinality :db.cardinality/many :db/isComponent true} :game/starting-faction {:db/valueType :db.type/ref} :game/current-faction {:db/valueType :db.type/ref} ;; Faction :faction/next-faction {:db/valueType :db.type/ref} :faction/units {:db/valueType :db.type/ref :db/cardinality :db.cardinality/many :db/isComponent true :db/index true} ;; Unit :unit/game-pos-idx {:db/unique :db.unique/identity} :unit/type {:db/valueType :db.type/ref} :unit/attacked-from {:db/valueType :db.type/ref :db/cardinality :db.cardinality/many} :unit/state {:db/valueType :db.type/ref} :unit/terrain {:db/valueType :db.type/ref} ;; Unit Type :unit-type/game-id-idx {:db/unique :db.unique/identity} :unit-type/state-map {:db/valueType :db.type/ref} :unit-type/zoc-armor-types {:db/cardinality :db.cardinality/many} :unit-type/can-repair {:db/cardinality :db.cardinality/many} :unit-type/strengths {:db/valueType :db.type/ref :db/cardinality :db.cardinality/many :db/isComponent true} ;; Unit State Maps :unit-state-map/game-id-idx {:db/unique :db.unique/identity} :unit-state-map/states {:db/valueType :db.type/ref :db/cardinality :db.cardinality/many :db/isComponent true} :unit-state-map/built-state {:db/valueType :db.type/ref} :unit-state-map/start-state {:db/valueType :db.type/ref} ;; Unit State :unit-state/game-id-idx {:db/unique :db.unique/identity} :unit-state/transitions {:db/valueType :db.type/ref :db/cardinality :db.cardinality/many :db/isComponent true} ;; Unit State Transitions :unit-state-transition/new-state {:db/valueType :db.type/ref} ;; Unit State ;; - unit-state-map ;; - unit-state-map/id ;; - unit-state-map/states ;; - unit-state-map/just-built-state ;; - unit-state-map/start-turn-state ;; - unit-state ;; - unit-state/name ;; - unit-state/transititons ;; - unit-state-transition ;; - unit-state-transition/action-type (-id?) ;; - unit-state-transition/new-state ;; Map :map/terrains {:db/valueType :db.type/ref :db/cardinality :db.cardinality/many :db/isComponent true} ;; Terrain :terrain/game-pos-idx {:db/unique :db.unique/identity} :terrain/owner {:db/valueType :db.type/ref} :terrain/type {:db/valueType :db.type/ref} ;; Terrain type :terrain-type/game-id-idx {:db/unique :db.unique/identity} :terrain-type/effects {:db/valueType :db.type/ref :db/cardinality :db.cardinality/many :db/isComponent true} :terrain-type/can-build {:db/valueType :db.type/ref :db/cardinality :db.cardinality/many} ;; Terrain effects :terrain-effect/unit-type {:db/valueType :db.type/ref :db/index true} }) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Utils (def prev-temp-id (atom -1000000)) (defn next-temp-id [] (swap! prev-temp-id dec)) (defn qe "Returns the single entity returned by a query." [query db & args] (when-let [result (-> (apply d/q query db args) ssolo)] (d/entity db result))) (defn find-by "Returns the unique entity identified by either attr (for singleton entities) or attr and val." ([db attr] (qe '[:find ?e :in $ ?attr :where [?e ?attr]] db attr)) ([db attr val] (qe '[:find ?e :in $ ?attr ?val :where [?e ?attr ?val]] db attr val))) (defn qes "Returns the entities returned by a query, assuming that all :find results are entity ids." [query db & args] (->> (apply d/q query db args) (mapv (fn [items] (mapv (partial d/entity db) items))))) (defn qess "Return a sequence of entities returned by a query, assuming that each :find result contains a single entity id." [query db & args] (->> (apply d/q query db args) (mapv #(d/entity db (solo %))))) (defn find-all-by "Returns all entities possessing attr." [db attr] (qess '[:find ?e :in $ ?attr :where [?e ?attr]] db attr)) (defprotocol Eid "A protocol for retrieving an object's entity id." (e [_] "identifying id for a value")) (extend-protocol Eid number (e [n] n) cljs.core.PersistentHashMap (e [ent] (:db/id ent)) cljs.core.PersistentArrayMap (e [ent] (:db/id ent)) datascript.impl.entity.Entity (e [ent] (:db/id ent))) ================================================ FILE: src/cljs/zetawar/dev.cljs ================================================ (ns zetawar.dev (:require [clojure.spec.test :as spec.test] [devtools.core :as devtools] [zetawar.game-test] [zetawar.subs-test] [zetawar.devcards])) (enable-console-print!) (devtools/install!) (spec.test/instrument) ================================================ FILE: src/cljs/zetawar/devcards/data_formats.cljs ================================================ (ns zetawar.devcards.data-formats (:require [clojure.spec :as s] [devcards.core :as dc :include-macros true] [integrant.core :as ig] [reagent.core :as r] [zetawar.app :as app] [zetawar.data :as data] [zetawar.doc :as doc] [zetawar.subs :as subs] [zetawar.system :as system] [zetawar.util :refer [breakpoint inspect]] [zetawar.views :as views]) (:require-macros [devcards.core :refer [defcard defcard-rg]])) (def maps {:simple-map {:id :simple-map :description "Simple Map" :terrains [;; Row 1 {:q 0 :r 0 :terrain-type :plains} {:q 1 :r 0 :terrain-type :plains} {:q 2 :r 0 :terrain-type :plains}]}}) (def scenarios {:simple-scenario {:id :simple-scenario :description "Simple Scenario" :ruleset-id :zetawar :map-id :simple-map :max-count-per-unit 10 :credits-per-base 100 :bases [{:q 0 :r 0} {:q 2 :r 0}] :factions [{:color :blue :credits 100 :ai false :bases [{:q 0 :r 0}] :units [{:q 0 :r 0 :unit-type :infantry}]} {:color :red :credits 100 :ai true :bases [{:q 2 :r 0}] :units [{:q 2 :r 0 :unit-type :infantry}]}]}}) (defcard map-data-example (let [{:keys [simple-map]} maps] (if (s/valid? :game/map simple-map) simple-map (s/explain :game/map simple-map)))) (defcard-rg map-attribute-descriptions [:div [:h3 "Map attributes"] [:table.table [:thead [:tr [:th.col-sm-2 "Key"] [:th.col-sm-3 "Description"] [:th.col-sm-5 "Spec"]]] (let [ks [:game.map/description :game.map/terrains]] (into [:tbody] (for [k ks] [:tr [:td.col-sm-2 (name k)] [:td.col-sm-3 (doc/key-descriptions k)] [:td.col-sm-5 (pr-str (s/describe k))]])))] [:h3 "Terrain attributes"] [:table.table [:thead [:tr [:th.col-sm-2 "Key"] [:th.col-sm-3 "Description"] [:th.col-sm-5 "Spec"]]] (let [ks [:game.map.terrain/q :game.map.terrain/r :game.map.terrain/terrain-type]] (into [:tbody] (for [k ks] [:tr [:td.col-sm-2 (name k)] [:td.col-sm-3 (doc/key-descriptions k)] [:td.col-sm-5 (pr-str (s/describe k))]])))]]) (defcard-rg map-and-scenario-example (let [system (ig/init system/game-config) game-cfg (:zetawar.system/game system) views-cfg (:zetawar.system/game-views system) conn (:conn views-cfg)] (app/start-new-game! game-cfg data/rulesets maps scenarios :simple-scenario) [views/board views-cfg])) (defcard simple-scenario-example-data (:simple-scenario scenarios)) ================================================ FILE: src/cljs/zetawar/devcards/game_specs.cljs ================================================ (ns zetawar.devcards.game-specs (:require [clojure.spec :as s] [clojure.test.check.generators] [devcards.core :as dc :include-macros true] [zetawar.game.spec :as game.spec]) (:require-macros [devcards.core :refer [defcard defcard-rg]])) (defcard game-map-spec (first (s/exercise :game/map 1))) ================================================ FILE: src/cljs/zetawar/devcards/maps_and_scenarios.cljs ================================================ (ns zetawar.devcards.maps-and-scenarios (:require [devcards.core :as dc :include-macros true] [integrant.core :as ig] [reagent.core :as r] [zetawar.app :as app] [zetawar.system :as system] [zetawar.views :as views]) (:require-macros [devcards.core :refer [defcard defcard-rg]])) (defn init-scenario [scenario-id] (let [system (ig/init system/game-config) game-cfg (:zetawar.system/game system)] (app/start-new-game! game-cfg scenario-id) system)) (defcard-rg sterlings-aruba-multiplayer-card (let [views-cfg (-> (init-scenario :sterlings-aruba-multiplayer) :zetawar.system/game-views)] [views/board views-cfg])) (defcard-rg city-sprawl-multiplayer-card (let [views-cfg (-> (init-scenario :city-sprawl-multiplayer) :zetawar.system/game-views)] [views/board views-cfg])) ================================================ FILE: src/cljs/zetawar/devcards/selection_and_target.cljs ================================================ (ns zetawar.devcards.selection-and-target (:require [datascript.core :as d] [devcards.core :as dc :include-macros true] [integrant.core :as ig] [reagent.core :as r] [zetawar.app :as app] [zetawar.data :as data] [zetawar.db :refer [e]] [zetawar.game :as game] [zetawar.subs :as subs] [zetawar.system :as system] [zetawar.util :refer [breakpoint inspect]] [zetawar.views :as views]) (:require-macros [devcards.core :refer [defcard defcard-rg]])) (defcard-rg unit-selected (let [system (ig/init system/game-config) game-cfg (:zetawar.system/game system) views-cfg (:zetawar.system/game-views system) conn (:conn views-cfg)] (app/start-new-game! game-cfg :sterlings-aruba-multiplayer) (d/transact! conn [{:db/id (-> @conn app/root e) :app/selected-q 2 :app/selected-r 2}]) [views/game-interface views-cfg])) (defcard-rg moved-unit-selected (let [system (ig/init system/game-config) game-cfg (:zetawar.system/game system) views-cfg (:zetawar.system/game-views system) conn (:conn views-cfg)] (app/start-new-game! game-cfg :sterlings-aruba-multiplayer) (let [db @conn game (app/current-game db) unit (game/unit-at db game 2 2) done-state (game/unit-state-by-id db game :unit-state.id/move-attack_moved)] (d/transact! conn [{:db/id (-> db app/root e) :app/selected-q 2 :app/selected-r 2} {:db/id (e unit) :unit/move-count 1 :unit/state (e done-state)}])) [views/game-interface views-cfg])) (defcard-rg moved-unit-with-attacks (let [system (ig/init system/game-config) game-cfg (:zetawar.system/game system) views-cfg (:zetawar.system/game-views system) conn (:conn views-cfg)] (app/start-new-game! game-cfg :sterlings-aruba-multiplayer) (let [db @conn game (app/current-game db) unit (game/unit-at db game 2 2) done-state (game/unit-state-by-id db game :unit-state.id/move-attack_moved)] (d/transact! conn (into (game/teleport-tx db game 2 2 6 8) [{:db/id (-> db app/root e) :app/selected-q 6 :app/selected-r 8} {:db/id (e unit) :unit/move-count 1 :unit/state (e done-state)}]))) [views/game-interface views-cfg])) (defcard-rg targeted-enemy (let [system (ig/init system/game-config) game-cfg (:zetawar.system/game system) views-cfg (:zetawar.system/game-views system) conn (:conn views-cfg)] (app/start-new-game! game-cfg :sterlings-aruba-multiplayer) (let [game (app/current-game @conn) unit (game/unit-at @conn game 2 2)] (d/transact! conn (into (game/teleport-tx @conn game 2 2 6 8) [{:db/id (-> @conn app/root e) :app/selected-q 6 :app/selected-r 8 :app/targeted-q 7 :app/targeted-r 8}]))) [views/game-interface views-cfg])) ;; TODO: add targeted-friend (defcard-rg base-selected (let [system (ig/init system/game-config) game-cfg (:zetawar.system/game system) views-cfg (:zetawar.system/game-views system) conn (:conn views-cfg)] (app/start-new-game! game-cfg :sterlings-aruba-multiplayer) (d/transact! conn [{:db/id (-> @conn app/root e) :app/selected-q 1 :app/selected-r 2}]) [views/game-interface views-cfg])) ================================================ FILE: src/cljs/zetawar/devcards.cljs ================================================ (ns zetawar.devcards (:require [devcards.core :as devcards :include-macros true] [zetawar.devcards.data-formats] [zetawar.devcards.game-specs] [zetawar.devcards.maps-and-scenarios] [zetawar.devcards.selection-and-target] [zetawar.site :as site])) (when (site/viewing-devcards?) (devcards/start-devcard-ui!)) ================================================ FILE: src/cljs/zetawar/doc.cljs ================================================ (ns zetawar.doc) (def key-descriptions {:game.map/description "A string describing the map" :game.map/terrains "A vector of terrains" :game.map.terrain/q "Terrain tile column index" :game.map.terrain/r "Terrain tile row index" :game.map.terrain/terrain-type "Terrain type keyword"}) ================================================ FILE: src/cljs/zetawar/events/game.cljs ================================================ (ns zetawar.events.game (:require [datascript.core :as d] [zetawar.app :as app] [zetawar.game :as game] [zetawar.logging :as log] [zetawar.router :as router])) ;; TODO: simplify (defmethod router/handle-event ::execute-action [{:as handler-ctx :keys [db]} [_ action]] (let [game (app/current-game db)] (case (:action/type action) :action.type/attack-unit (let [{:keys [action/attacker-q action/attacker-r action/defender-q action/defender-r]} action [attacker-damage defender-damage] (game/battle-damage db game attacker-q attacker-r defender-q defender-r) action (merge action {:action/attacker-damage attacker-damage :action/defender-damage defender-damage})] {:tx (game/action-tx db game action) :dispatch [[:zetawar.events.ui/hide-copy-link]] :notify [[:zetawar.players/apply-action :faction.color/all action]]}) :action.type/end-turn (let [game (app/current-game db) next-faction-color (game/next-faction-color game)] {:tx (game/action-tx db game action) :dispatch (cond-> [[:zetawar.events.ui/set-url-game-state]] (<= 2 (game/human-faction-count db game)) (into [[:zetawar.events.ui/show-copy-link]])) :notify [[:zetawar.players/apply-action :faction.color/all action] [:zetawar.players/start-turn next-faction-color]]}) {:tx (game/action-tx db game action) :dispatch [[:zetawar.events.ui/hide-copy-link]] :notify [[:zetawar.players/apply-action :faction.color/all action]]}))) ================================================ FILE: src/cljs/zetawar/events/player.cljs ================================================ (ns zetawar.events.player (:require [datascript.core :as d] [zetawar.app :as app] [zetawar.game :as game] [zetawar.logging :as log] [zetawar.router :as router])) (defmethod router/handle-event ::send-game-state [{:as handler-ctx :keys [db]} [_ faction-color]] (let [game (app/current-game db) game-state (game/get-game-state db game :full)] {:notify [[:zetawar.players/update-game-state faction-color game-state]]})) ;; TODO: add middleware for actions? (defmethod router/handle-event ::execute-action [{:as handler-ctx :keys [db]} [_ action]] (let [app (app/root db) game (app/current-game db) faction-color (game/current-faction-color game) action (assoc action :action/faction-color faction-color)] (when-not (and (= (:action/type action) :action.type/end-turn) (:app/ai-turn-stepping app)) {:dispatch [[:zetawar.events.game/execute-action action]]}))) ================================================ FILE: src/cljs/zetawar/events/ui.cljs ================================================ (ns zetawar.events.ui (:require [cljsjs.clipboard] [datascript.core :as d] [zetawar.app :as app] [zetawar.db :refer [e qe qes qess]] [zetawar.game :as game] [zetawar.logging :as log] [zetawar.players :as players] [zetawar.router :as router] [zetawar.serialization :as serialization] [zetawar.util :refer [breakpoint inspect only oonly]])) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Global (defmethod router/handle-event ::alert [{:as handler-ctx :keys [db]} [_ message]] (let [app (app/root db)] {:tx [{:db/id (e app) :app/alert-type :success :app/alert-message message}]})) (defmethod router/handle-event ::hide-alert [{:as handler-ctx :keys [db]} [_]] (let [app (app/root db)] {:tx [[:db/retract (e app) :app/alert-message (:app/alert-message app)] [:db/retract (e app) :app/alert-type (:app/alert-type app)]]})) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Selection ;; New click logic: ;; - no selection? ;; - owned unit on tile? ;; - select unit ;; - owned base? ;; - select base ;; - already this tile selected? ;; - deselect ;; - selection set, but this tile not selected? ;; - selected tile a unit? ;; - tile contains enemy in range? ;; - set target to enemy ;; - tile is a valid move destination? ;; - set target to terrain (defmethod router/handle-event ::select-hex [{:as handler-ctx :keys [db]} [_ ev-q ev-r]] (let [app (app/root db) game (app/current-game db) [selected-q selected-r] (app/selected-hex db) [targeted-q targeted-r] (app/targeted-hex db) unit (game/unit-at db game ev-q ev-r) terrain (game/terrain-at db game ev-q ev-r) selected-unit (game/unit-at db game selected-q selected-r) selected-terrain (game/terrain-at db game selected-q selected-r) targeted-unit (game/unit-at db game targeted-q targeted-r) targeted-terrain (game/terrain-at db game targeted-q targeted-r)] {:tx (cond ;; selecting selected tile (and (= ev-q selected-q) (= ev-r selected-r)) (cond-> [] (and selected-q selected-r) (conj [:db/retract (e app) :app/selected-q selected-q] [:db/retract (e app) :app/selected-r selected-r]) (and targeted-q targeted-r) (conj [:db/retract (e app) :app/targeted-q targeted-q] [:db/retract (e app) :app/targeted-r targeted-r])) ;; selecting targeted tile (and (= ev-q targeted-q) (= ev-r targeted-r)) [[:db/retract (e app) :app/targeted-q targeted-q] [:db/retract (e app) :app/targeted-r targeted-r]] ;; selecting in range enemy unit with unit selected (and unit selected-unit (not (game/unit-current? db game unit)) (and (game/can-attack? db game selected-unit) (game/in-range? db selected-unit unit))) [{:db/id (e app) :app/targeted-q ev-q :app/targeted-r ev-r}] ;; selecting valid destination terrain with unit selected (and terrain selected-unit (game/can-move? db game selected-unit) (game/valid-destination? db game selected-unit ev-q ev-r)) [{:db/id (e app) :app/targeted-q ev-q :app/targeted-r ev-r}] ;; selecting friendly unit with unit or terrain selected (and unit (or selected-unit selected-terrain) (game/can-field-repair? db game selected-unit) (game/repairable? db game unit) (game/in-range? db selected-unit unit) (game/has-repairable-armor-type? db game selected-unit unit)) [{:db/id (e app) :app/targeted-q ev-q :app/targeted-r ev-r}] ;; selecting owned base with no unit selected (and terrain (not unit) (not selected-unit) (game/current-base? db game terrain)) (cond-> [{:db/id (e app) :app/selected-q ev-q :app/selected-r ev-r}] (and targeted-q targeted-r) (conj [:db/retract (e app) :app/targeted-q targeted-q] [:db/retract (e app) :app/targeted-r targeted-r])) ;; selecting unselected friendly unit (and unit (or (game/can-move? db game unit) (game/can-repair? db game unit) (and (game/can-attack? db game unit) (not= 0 (count (game/enemies-in-range db game unit)))) (and (game/can-field-repair? db game unit) (not= 0 (count (game/friends-in-range db game unit)))) (game/can-capture? db game unit terrain))) (cond-> [{:db/id (e app) :app/selected-q ev-q :app/selected-r ev-r}] (and targeted-q targeted-r) (conj [:db/retract (e app) :app/targeted-q targeted-q] [:db/retract (e app) :app/targeted-r targeted-r])))})) (defmethod router/handle-event ::clear-selection [{:as handler-ctx :keys [db]} _] (let [app (app/root db) [selected-q selected-r] (app/selected-hex db) [targeted-q targeted-r] (app/targeted-hex db)] {:tx (cond-> [] (and selected-q selected-r) (conj [:db/retract (e app) :app/selected-q selected-q] [:db/retract (e app) :app/selected-r selected-r]) (and targeted-q targeted-r) (conj [:db/retract (e app) :app/targeted-q targeted-q] [:db/retract (e app) :app/targeted-r targeted-r]))})) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Unit and base actions (defmethod router/handle-event ::move-selected-unit [{:as handler-ctx :keys [db]} _] (let [game (app/current-game db) cur-faction-color (game/current-faction-color game) [from-q from-r] (app/selected-hex db) [to-q to-r] (app/targeted-hex db)] {:dispatch [[:zetawar.events.game/execute-action {:action/type :action.type/move-unit :action/faction-color cur-faction-color :action/from-q from-q :action/from-r from-r :action/to-q to-q :action/to-r to-r}] [::move-selection from-q from-r to-q to-r]]})) ;; TODO: replace with move selection to target (defmethod router/handle-event ::move-selection [{:as handler-ctx :keys [db]} [_ from-q from-r to-q to-r]] (let [app (app/root db) game (app/current-game db) unit (game/unit-at db game to-q to-r) terrain (game/base-at db game to-q to-r)] (if (or (and (game/can-attack? db game unit) (not-empty (game/enemies-in-range db game unit))) (and (game/can-field-repair? db game unit) (not-empty (game/repairable-friends-in-range db game unit))) (game/can-capture? db game unit terrain)) {:tx [[:db/add (e app) :app/selected-q to-q] [:db/add (e app) :app/selected-r to-r] [:db/retract (e app) :app/targeted-q to-q] [:db/retract (e app) :app/targeted-r to-r]]} {:dispatch [[::clear-selection]]}))) (defmethod router/handle-event ::attack-targeted [{:as handler-ctx :keys [db]} _] (let [game (app/current-game db) cur-faction-color (game/current-faction-color game) [attacker-q attacker-r] (app/selected-hex db) [defender-q defender-r] (app/targeted-hex db) [attacker-damage defender-damage] (game/battle-damage db game attacker-q attacker-r defender-q defender-r)] {:dispatch [[:zetawar.events.game/execute-action {:action/type :action.type/attack-unit :action/faction-color cur-faction-color :action/attacker-q attacker-q :action/attacker-r attacker-r :action/defender-q defender-q :action/defender-r defender-r :action/attacker-damage attacker-damage :action/defender-damage defender-damage}] [::clear-selection]]})) (defmethod router/handle-event ::repair-selected [{:as handler-ctx :keys [db]} _] (let [game (app/current-game db) cur-faction-color (game/current-faction-color game) [q r] (app/selected-hex db)] {:dispatch [[:zetawar.events.game/execute-action {:action/type :action.type/repair-unit :action/faction-color cur-faction-color :action/q q :action/r r}] [::clear-selection]]})) (defmethod router/handle-event ::repair-targeted [{:as handler-ctx :keys [db]} _] (let [game (app/current-game db) cur-faction-color (game/current-faction-color game) [repairer-q repairer-r] (app/selected-hex db) [target-q target-r] (app/targeted-hex db)] {:dispatch [[:zetawar.events.game/execute-action {:action/type :action.type/field-repair-unit :action/faction-color cur-faction-color :action/repairer-q repairer-q :action/repairer-r repairer-r :action/target-q target-q :action/target-r target-r}] [::clear-selection]]})) (defmethod router/handle-event ::capture-selected [{:as handler-ctx :keys [db]} _] (let [game (app/current-game db) cur-faction-color (game/current-faction-color game) [q r] (app/selected-hex db)] {:dispatch [[:zetawar.events.game/execute-action {:action/type :action.type/capture-base :action/faction-color cur-faction-color :action/q q :action/r r}] [::clear-selection]]})) (defmethod router/handle-event ::build-unit [{:as handler-ctx :keys [db]} [_ unit-type-id]] (let [game (app/current-game db) cur-faction-color (game/current-faction-color game) [q r] (app/selected-hex db)] {:dispatch [[:zetawar.events.game/execute-action {:action/type :action.type/build-unit :action/faction-color cur-faction-color :action/q q :action/r r :action/unit-type-id unit-type-id}] [::clear-selection]]})) (defmethod router/handle-event ::end-turn [{:as handler-ctx :keys [ev-chan notify-chan conn db]} _] (let [game (app/current-game db) cur-faction-color (game/current-faction-color game)] {:dispatch [[::clear-selection] [:zetawar.events.game/execute-action {:action/type :action.type/end-turn :action/faction-color cur-faction-color}]]})) (defmethod router/handle-event ::set-url-game-state [{:as handler-ctx :keys [ev-chan conn db]} _] (serialization/set-url-game-state! @conn)) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Copy link (defmethod router/handle-event ::show-copy-link [{:as handler-ctx :keys [ev-chan db]} _] (let [app (app/root db)] {:tx [[:db/add (e app) :app/show-copy-link true]]})) (defmethod router/handle-event ::hide-copy-link [{:as handler-ctx :keys [ev-chan db]} _] (let [app (app/root db) {:keys [app/show-copy-link]} app] (when-not (nil? show-copy-link) {:tx [[:db/retract (e app) :app/show-copy-link show-copy-link]]}))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Unit picker (defmethod router/handle-event ::show-unit-picker [{:as handler-ctx :keys [ev-chan db]} _] (let [app (app/root db)] {:tx [[:db/add (e app) :app/picking-unit true]]})) (defmethod router/handle-event ::hide-unit-picker [{:as handler-ctx :keys [ev-chan db]} _] (let [app (app/root db)] {:tx [[:db/add (e app) :app/picking-unit false]]})) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Win message (defmethod router/handle-event ::hide-win-message [{:as handler-ctx :keys [ev-chan db]} _] (let [app (app/root db)] {:tx [[:db/add (e app) :app/hide-win-message true]]})) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Faction configuration (defmethod router/handle-event ::configure-faction [{:as handler-ctx :keys [ev-chan db]} [_ faction]] (let [app (app/root db)] {:tx [[:db/add (e app) :app/configuring-faction (e faction)]]})) (defmethod router/handle-event ::hide-faction-settings [{:as handler-ctx :keys [ev-chan db]} _] (let [app (app/root db) faction-eid (-> app :app/configuring-faction e)] {:tx [[:db/retract (e app) :app/configuring-faction faction-eid]]})) ;; TODO: find a way to make player swapping nicer (maybe put in router?) ;; TODO: cleanup return value construction (defmethod router/handle-event ::set-faction-player-type [{:as handler-ctx :keys [ev-chan conn db players]} [_ faction player-type-id]] (let [{:as app :keys [ai-turn-stepping]} (app/root db) {:keys [game/factions game/current-faction]} (app/current-game db) {:keys [faction/color]} faction other-factions (remove #(= (e faction) (e %)) factions) {:keys [ai]} (players/player-types-by-id player-type-id) tx [{:db/id (e faction) :faction/ai ai :faction/player-type player-type-id}] cur-player (color @players) new-player (players/new-player handler-ctx player-type-id color) notify (when (and ai (= (e faction) (e current-faction))) [[:zetawar.players/start-turn color]])] (players/stop cur-player) (players/start new-player) (swap! players assoc color new-player) (if (and ai (= (count other-factions) (count (filter :faction/ai other-factions)))) {:tx (conj tx [:db/add (e app) :app/ai-turn-stepping (not ai-turn-stepping)]) :dispatch [[::alert "AI enabled for all factions. Enabling turn stepping."]] :notify notify} {:tx (conj tx [:db/add (e app) :app/ai-turn-stepping false]) :notify notify}))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; New game (defmethod router/handle-event ::show-new-game-settings [{:as handler-ctx :keys [ev-chan db]} _] (let [app (app/root db)] {:tx [[:db/add (e app) :app/configuring-new-game true]]})) (defmethod router/handle-event ::hide-new-game-settings [{:as handler-ctx :keys [ev-chan db]} _] (let [app (app/root db)] {:tx [[:db/add (e app) :app/configuring-new-game false]]})) (defmethod router/handle-event ::start-new-game [{:as handler-ctx :keys [ev-chan conn]} [_ scenario-id]] (app/start-new-game! handler-ctx scenario-id)) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Tile coordinates (defmethod router/handle-event ::hover-hex-enter [{:as handler-ctx :keys [ev-chan db]} [_ q r]] (let [app (app/root db)] {:tx [[:db/add (e app) :app/hover-q q] [:db/add (e app) :app/hover-r r]]})) (defmethod router/handle-event ::hover-hex-leave [{:as handler-ctx :keys [ev-chan db]} [_ q r]] (let [app (app/root db)] {:tx [[:db/retract (e app) :app/hover-q q] [:db/retract (e app) :app/hover-r r]]})) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; End turn alert (defmethod router/handle-event ::show-end-turn-alert [{:as handler-ctx :keys [ev-chan db]} _] (let [app (app/root db)] {:tx [[:db/add (e app) :app/end-turn-alert true]]})) (defmethod router/handle-event ::hide-end-turn-alert [{:as handler-ctx :keys [ev-chan db]} _] (let [app (app/root db)] {:tx [[:db/add (e app) :app/end-turn-alert false]]})) ================================================ FILE: src/cljs/zetawar/game/spec.cljs ================================================ (ns zetawar.game.spec (:require [clojure.spec :as s])) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Maps (s/def :game.map/description string?) (s/def :game.map.terrain/q (s/and int? #(>= % 0))) (s/def :game.map.terrain/r (s/and int? #(>= % 0))) (s/def :game.map.terrain/terrain-type keyword?) (s/def :game.map/terrain (s/keys :req-un [:game.map.terrain/q :game.map.terrain/r :game.map.terrain/terrain-type])) (s/def :game.map/terrains (s/coll-of :game.map/terrain)) (s/def :game/map (s/keys :req-un [:game.map/description :game.map/terrains])) ================================================ FILE: src/cljs/zetawar/game.cljs ================================================ (ns zetawar.game (:require [clojure.string :as string] [datascript.core :as d] [zetawar.data :as data] [zetawar.db :as db :refer [e find-by qe qes qess]] [zetawar.hex :as hex] [zetawar.logging :as log] [zetawar.util :refer [breakpoint inspect oonly only]])) ;; TODO: improve exception data ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Util ;; TODO: benchmark vs bit shifting and with/without memoization (def game-pos-idx (memoize (fn game-pos-idx [game q r] (if (and game q r) (+ r (* 1000 (+ (* (e game) 1000) q))) -1)))) (defn game-id-idx [game-or-game-id id] (let [game-id (if (:db/id game-or-game-id) (:game/id game-or-game-id) game-or-game-id)] (-> id str (string/split #":") (nth 1) (str "-" game-id) keyword))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Game (defn game-by-id [db game-id] (find-by db :game/id game-id)) (defn current-faction-color [game] (get-in game [:game/current-faction :faction/color])) (defn next-faction-color [game] (get-in game [:game/current-faction :faction/next-faction :faction/color])) (defn game-ex [message game] (ex-info message (select-keys game [:game/self-repair]))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Factions (defn to-faction-color [color] (->> color name (keyword 'faction.color))) (defn faction-by-color [db game color] (qe '[:find ?f :in $ ?g ?color :where [?g :game/factions ?f] [?f :faction/color ?color]] db (e game) (to-faction-color color))) (defn faction-count [db game] (-> (d/q '[:find (count ?f) :in $ ?g :where [?g :game/factions ?f]] db (e game)) ffirst (or 0))) (defn ai-faction-count [db game] (-> (d/q '[:find (count ?f) :in $ ?g :where [?g :game/factions ?f] [?f :faction/ai true]] db (e game)) ffirst (or 0))) (defn human-faction-count [db game] (- (faction-count db game) (ai-faction-count db game))) (defn faction-bases [db faction] (qess '[:find ?t :in $ ?f :where [?t :terrain/owner ?f]] db (e faction))) (defn faction-base-count [db faction] (-> (d/q '[:find (count ?b) :in $ ?f :where [?b :terrain/owner ?f]] db (e faction)) ffirst (or 0))) (defn faction-base-being-captured-count [db faction] (-> (d/q '[:find (count ?b) :in $ ?f :where [?b :terrain/owner ?f] [(not= ?ef f)] [?ef :faction/units ?u] [?u :unit/terrain ?b] [?u :unit/capturing true]] db (e faction)) ffirst (or 0))) (defn enemy-base-count [db faction] (-> (d/q '[:find (count ?b) :in $ ?f :where [?b :terrain/owner ?ef] [(not= ?ef ?f)]] db (e faction)) ffirst (or 0))) (defn faction-unit-count [db faction] (-> (d/q '[:find (count ?u) :in $ ?f :where [?f :faction/units ?u]] db (e faction)) ffirst (or 0))) (defn enemy-unit-count [db faction] (-> (d/q '[:find (count ?u) :in $ ?f :where [?f :faction/units ?u] [(not= ?f ?cf)]] db (e faction)) ffirst (or 0))) (defn faction-won? [db faction] (and (= 0 enemy-base-count db faction) (= 0 enemy-unit-count db faction))) (defn income [db game faction] (let [base-count (faction-base-count db faction) captured-count (faction-base-being-captured-count db faction) {:keys [game/credits-per-base]} game] (* (- base-count captured-count) credits-per-base))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Terrain (defn to-terrain-type-id [terrain-type-name] (->> terrain-type-name name (keyword 'terrain-type.id))) (defn terrain-type-by-id [db game terrain-type-id] (qe '[:find ?tt :in $ ?g ?tt-id :where [?g :game/terrain-types ?tt] [?tt :terrain-type/id ?tt-id]] db (e game) terrain-type-id)) (defn terrain? [x] (contains? x :terrain/type)) (defn base? [x] (not (empty? (get-in x [:terrain/type :terrain-type/can-build])))) (defn terrain-hex [terrain] [(:terrain/q terrain) (:terrain/r terrain)]) (defn terrain-at [db game q r] (->> (game-pos-idx game q r) (d/datoms db :avet :terrain/game-pos-idx) first :e (d/entity db))) (defn checked-terrain-at [db game q r] (let [terrain (terrain-at db game q r)] (when-not terrain (throw (ex-info "No terrain at specified coordinates" {:q q :r r}))) terrain)) (defn base-at [db game q r] (let [terrain (terrain-at db game q r)] (when (base? terrain) terrain))) (defn checked-base-at [db game q r] (let [base (base-at db game q r)] (when-not base (throw (ex-info "No base at specified coordinates" {:q q :r r}))) base)) (defn check-base-current [db game base] (let [cur-faction (:game/current-faction game) base-faction (:terrain/owner base)] (when (not= cur-faction base-faction) (throw (ex-info "Base is not owned by the current faction" {:current-faction (:faction/color cur-faction) }))))) (defn current-base? [db game x] (when (base? x) (let [cur-faction (:game/current-faction game) base-faction (:terrain/owner x)] (= cur-faction base-faction)))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Units (defn to-unit-type-id [unit-type-name] (->> unit-type-name name (keyword 'unit-type.id))) (defn to-armor-type [armor-type-name] (->> armor-type-name name (keyword 'unit-type.armor-type))) (defn to-buildable-at [buildable-at-name] (->> buildable-at-name name (keyword 'unit-type.buildable-at))) (defn unit? [x] (contains? x :unit/type)) (defn unit-hex [unit] [(:unit/q unit) (:unit/r unit)]) (defn unit-color [unit] (get-in unit [:faction/_units :faction/color])) (defn unit-at [db game q r] (->> (game-pos-idx game q r) (d/datoms db :avet :unit/game-pos-idx) first :e (d/entity db))) (defn checked-unit-at [db game q r] (let [unit (unit-at db game q r)] (when-not unit (throw (ex-info "Unit does not exist at specified coordinates" {:q q :r r}))) unit)) (defn unit-faction [db unit] (:faction/_units unit)) (defn check-unit-current [db game unit] (let [cur-faction (:game/current-faction game) u-faction (unit-faction db unit)] (when (not= (e cur-faction) (e u-faction)) (throw (ex-info "Unit is not a member of the current faction" {:current-faction (:faction/color cur-faction) :unit-faction (:faction/color u-faction)}))))) (defn unit-current? [db game unit] (try (check-unit-current db game unit) true (catch :default ex false))) (defn on-base? [db game unit] (base? (terrain-at db game (:unit/q unit) (:unit/r unit)))) (defn on-owned-base? [db game unit] (let [{:keys [unit/q unit/r]} unit terrain (terrain-at db game q r)] (and (base? terrain) (= (some-> terrain :terrain/owner e) (e (unit-faction db unit)))))) (defn on-capturable-base? [db game unit] (let [{:keys [unit/q unit/r]} unit terrain (terrain-at db game q r)] (and (base? terrain) (not= (some-> terrain :terrain/owner e) (e (unit-faction db unit)))))) (defn unit-ex [message unit] (ex-info message (select-keys unit [:unit/q :unit/r]))) (defn unit-terrain-effects [db unit terrain] (only (d/q '[:find ?mc ?at ?ar :in $ ?u ?t :where [?u :unit/type ?ut] [?t :terrain/type ?tt] [?tt :terrain-type/effects ?e] [?e :terrain-effect/unit-type ?ut] [?e :terrain-effect/attack-bonus ?at] [?e :terrain-effect/armor-bonus ?ar] [?e :terrain-effect/movement-cost ?mc]] db (e unit) (e terrain)))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Unit States (defn to-unit-state-map-id [state-map-name] (->> state-map-name name (keyword 'unit-state-map.id))) (defn unit-state-map-by-id [db game unit-state-map-id] (qe '[:find ?usm :in $ ?g ?usm-id :where [?g :game/unit-state-maps ?usm] [?usm :unit-state-map/id ?usm-id]] db (e game) unit-state-map-id)) (defn to-unit-state-id ([unit-state-name] (->> unit-state-name name (keyword 'unit-state.id))) ([state-map-name state-name] (to-unit-state-id (str (name state-map-name) "_" (name state-name))))) (defn unit-state-by-id [db game unit-state-id] (qe '[:find ?us :in $ ?g ?us-id :where [?g :game/unit-states ?us] [?us :unit-state/id ?us-id]] db (e game) unit-state-id)) (defn to-action-type [action-type-name] (->> action-type-name name (keyword 'action.type))) (defn start-state [unit-or-unit-type] (let [unit-type (if (unit? unit-or-unit-type) (:unit/type unit-or-unit-type) unit-or-unit-type)] (get-in unit-type [:unit-type/state-map :unit-state-map/start-state]))) (defn built-state [unit-or-unit-type] (let [unit-type (if (unit? unit-or-unit-type) (:unit/type unit-or-unit-type) unit-or-unit-type)] (get-in unit-type [:unit-type/state-map :unit-state-map/built-state]))) ;; Note: (->> (e unit) (d/entity db) ...) is to support UI subs (defn next-state [db unit action] (let [transition-map (->> (e unit) (d/entity db) :unit/state :unit-state/transitions (map (juxt :unit-state-transition/action-type :unit-state-transition/new-state)) (into {}))] (transition-map action))) (defn checked-next-state [db unit action] (let [new-state (next-state db unit action)] (when-not new-state (throw (ex-info "No state transition from current state found for action" {:current-state (get-in unit [:unit/state :unit-state/id]) :action action}))) new-state)) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Movement (defn valid-moves [db game unit] (let [start [(:unit/q unit) (:unit/r unit)] u-faction-eid (e (unit-faction db unit)) unit-type-eid (e (:unit/type unit)) armor-type (-> unit :unit/type :unit-type/armor-type) unit-movement (get-in unit [:unit/type :unit-type/movement]) unit-at (memoize #(unit-at db game %1 %2)) terrain-type->cost (into {} (d/q '[:find ?tt ?mc :in $ ?ut :where [?tt :terrain-type/effects ?e] [?e :terrain-effect/unit-type ?ut] [?e :terrain-effect/movement-cost ?mc]] db unit-type-eid)) terrain-cost-at (memoize (fn terrain-cost-at [q r] (some-> (terrain-at db game q r) :terrain/type e terrain-type->cost))) adjacent-costs (memoize (fn adjacent-costs [q r] (into [] (keep #(when-let [cost (apply terrain-cost-at %)] (conj % cost))) (hex/adjacents q r)))) enemy-at? (memoize (fn enemy-at? [q r] (some-> (unit-at q r) :faction/_units e (not= u-faction-eid)))) zoc-enemy-at? (memoize (fn zoc-enemy-at? [q r] (when-let [other-unit (unit-at q r)] (let [ou-faction-eid (-> other-unit :faction/_units e) zoc-armor-types (-> other-unit :unit/type :unit-type/zoc-armor-types)] (and (not= u-faction-eid ou-faction-eid) (contains? zoc-armor-types armor-type)))))) adjacent-zoc-enemy? (memoize (fn adjacent-enemy? [q r] (some #(apply zoc-enemy-at? %) (hex/adjacents q r)))) ;; frontier = {[q r] [cost path], ...} ;; moves = {[q r] [cost path], ...} expand-frontier (fn expand-frontier [frontier moves] (loop [[[[q r] [frontier-cost path]] & remaining-frontier] frontier new-frontier {}] (if frontier-cost (let [remaining-movement (- unit-movement frontier-cost) terrain-costs (adjacent-costs q r) new-moves (into {} (keep (fn [[q r terrain-cost]] (when (and (or (:game/move-through-friendly game) (not (unit-at q r))) (not (enemy-at? q r))) (let [terrain-cost (if (adjacent-zoc-enemy? q r) ; check in zoc (max terrain-cost remaining-movement) terrain-cost) new-move-cost (+ frontier-cost terrain-cost)] (when (and (<= new-move-cost (moves [q r] unit-movement)) (<= new-move-cost (new-frontier [q r] unit-movement))) [[q r] [new-move-cost (conj path [q r])]]))))) terrain-costs)] (recur remaining-frontier (conj new-frontier new-moves))) new-frontier)))] (loop [frontier {start [0 []]} moves {start [0 []]}] (let [new-frontier (expand-frontier frontier moves) new-moves (conj moves new-frontier)] (if (empty? new-frontier) (into #{} (comp (remove #(apply unit-at (first %))) ; remove occupied destinations (map (fn [[dest [cost path]]] {:from start :to dest :cost cost :path path}))) (dissoc moves start)) (recur new-frontier new-moves)))))) ;; TODO: implement valid-move? (defn valid-destinations [db game unit] (into #{} (map :to) (valid-moves db game unit))) (defn valid-destination? [db game unit q r] (contains? (valid-destinations db game unit) [q r])) (defn check-valid-destination [db game unit q r] (when-not (valid-destination? db game unit q r) (throw (ex-info "Specified destination is not a valid move" {:q q :r r})))) (defn check-can-move [db game unit] (check-unit-current db game unit) (when (:unit/capturing unit) (throw (unit-ex "Unit cannot move while capturing" unit))) (checked-next-state db unit :action.type/move-unit)) (defn can-move? [db game unit] (try (check-can-move db game unit) true (catch :default ex false))) (defn teleport-tx [db game from-q from-r to-q to-r] (let [unit (checked-unit-at db game from-q from-r) terrain (checked-terrain-at db game to-q to-r)] [{:db/id (e unit) :unit/game-pos-idx (game-pos-idx game to-q to-r) :unit/q to-q :unit/r to-r :unit/terrain (e terrain)}])) ;; TODO: check move is valid (defn move-tx "Returns a transaction that updates the unit's location and move count." ([db game unit to-terrain] (let [new-move-count (inc (:unit/move-count unit 0)) [to-q to-r] (terrain-hex to-terrain) new-state (check-can-move db game unit)] [{:db/id (e unit) :unit/game-pos-idx (game-pos-idx game to-q to-r) :unit/q to-q :unit/r to-r :unit/terrain (e to-terrain) :unit/move-count new-move-count :unit/state (e new-state)}])) ([db game from-q from-r to-q to-r] (let [unit (checked-unit-at db game from-q from-r) terrain (checked-terrain-at db game to-q to-r)] (move-tx db game unit terrain)))) (defn move! [conn game-id from-q from-r to-q to-r] (let [db @conn game (game-by-id db game-id)] (d/transact! conn (move-tx db game from-q from-r to-q to-r)))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Attack (defn check-can-attack [db game unit] (check-unit-current db game unit) (when (:unit/capturing unit) (throw (unit-ex "Unit cannot attack while capturing" unit))) (checked-next-state db unit :action.type/attack-unit)) (defn can-attack? [db game unit] (try (check-can-attack db game unit) true (catch :default ex false))) (defn check-in-range [db attacker defender] (let [distance (hex/distance (:unit/q attacker) (:unit/r attacker) (:unit/q defender) (:unit/r defender)) min-range (get-in attacker [:unit/type :unit-type/min-range]) max-range (get-in attacker [:unit/type :unit-type/max-range])] (when (or (< distance min-range) (> distance max-range)) ;; TODO: add defender details to exception (throw (unit-ex "Targeted unit is not in range" attacker))))) (defn in-range? [db attacker defender] (try (check-in-range db attacker defender) true (catch :default ex false))) (defn attack-damage [db game attacker defender attacker-terrain defender-terrain] (let [defender-armor-type (get-in defender [:unit/type :unit-type/armor-type]) [attacker-q attacker-r] (unit-hex attacker) [defender-q defender-r] (unit-hex defender) attack-strength (oonly (d/q '[:find ?s :in $ ?u ?at :where [?u :unit/type ?ut] [?ut :unit-type/strengths ?us] [?us :unit-strength/armor-type ?at] [?us :unit-strength/attack ?s]] db (e attacker) defender-armor-type)) armor (if (:unit/capturing defender) (get-in defender [:unit/type :unit-type/capturing-armor]) (get-in defender [:unit/type :unit-type/armor])) attack-bonus (oonly (d/q '[:find ?a :in $ ?u ?t :where [?u :unit/type ?ut] [?t :terrain/type ?tt] [?tt :terrain-type/effects ?e] [?e :terrain-effect/unit-type ?ut] [?e :terrain-effect/attack-bonus ?a]] db (e attacker) (e attacker-terrain))) armor-bonus (oonly (d/q '[:find ?d :in $ ?u ?t :where [?u :unit/type ?ut] [?t :terrain/type ?tt] [?tt :terrain-type/effects ?e ] [?e :terrain-effect/unit-type ?ut] [?e :terrain-effect/armor-bonus ?d]] db (e defender) (e defender-terrain))) attack-hexes (into #{} (map terrain-hex) (:unit/attacked-from defender)) ranged-attack-hexes (into #{} (filter #(> (apply hex/distance defender-q defender-r %) 1)) attack-hexes) adjacent-attack-hexes (into #{} (filter #(and (apply hex/adjacent? attacker-q attacker-r %) (apply hex/adjacent? defender-q defender-r %))) attack-hexes) opposite-attack-hexes (into #{} (filter #(apply hex/opposite? attacker-q attacker-r defender-q defender-r %)) attack-hexes) flanking-attack-hexes (clojure.set/difference attack-hexes ranged-attack-hexes adjacent-attack-hexes opposite-attack-hexes) gang-up-bonus (+ (* (count ranged-attack-hexes) (:game/ranged-attack-bonus game)) (* (count adjacent-attack-hexes) (:game/adjacent-attack-bonus game)) (* (count flanking-attack-hexes) (:game/flanking-attack-bonus game)) (* (count opposite-attack-hexes) (:game/opposite-attack-bonus game)))] (let [p (-> (+ 0.5 (* 0.05 (+ (- (+ attack-strength attack-bonus) (+ armor armor-bonus)) gang-up-bonus))) (max 0) (min 1))] (js/Math.round (if (:game/stochastic-damage game) (let [hits (->> (repeatedly #(rand)) (take (* 6 (:unit/count attacker))) (filter #(< % p)) count)] (quot hits 6)) (* (:unit/count attacker) p)))))) (defn battle-damage ([db game attacker defender] (let [attacker-terrain (:unit/terrain attacker) defender-terrain (:unit/terrain defender) attack-count (:unit/attack-count attacker 0) defender-damage (attack-damage db game attacker defender attacker-terrain defender-terrain) attacker-damage (if (in-range? db defender attacker) (attack-damage db game defender attacker defender-terrain attacker-terrain) 0)] [(min (:unit/count attacker) attacker-damage) (min (:unit/count defender) defender-damage)])) ([db game attacker-q attacker-r defender-q defender-r] (let [attacker (checked-unit-at db game attacker-q attacker-r) defender (checked-unit-at db game defender-q defender-r)] (battle-damage db game attacker defender)))) (defn battle-tx ([db game attacker defender attacker-damage defender-damage] (let [new-state (check-can-attack db game attacker)] (check-in-range db attacker defender) (let [attacker-terrain (:unit/terrain attacker) defender-terrain (:unit/terrain defender) attack-count (:unit/attack-count attacker 0) attacker-count (:unit/count attacker) defender-count (:unit/count defender)] (cond-> [] (> defender-count defender-damage) (conj {:db/id (e defender) :unit/count (- defender-count defender-damage) :unit/attacked-count (inc (:unit/attacked-count defender)) :unit/attacked-from (e attacker-terrain)}) (= defender-count defender-damage) (conj [:db.fn/retractEntity (e defender)]) (> attacker-count attacker-damage) (conj {:db/id (e attacker) :unit/count (- attacker-count attacker-damage) :unit/attack-count (inc attack-count) :unit/state (e new-state)}) (= attacker-count attacker-damage) (conj [:db.fn/retractEntity (e attacker)]))))) ([db game attacker-q attacker-r defender-q defender-r attacker-damage defender-damage] (let [attacker (checked-unit-at db game attacker-q attacker-r) defender (checked-unit-at db game defender-q defender-r)] (battle-tx db game attacker defender attacker-damage defender-damage)))) ;; TODO: remove attack-tx (superceded by battle-tx) (defn attack-tx ([db game attacker defender] (check-can-attack db game attacker) (check-in-range db attacker defender) (apply battle-tx db game attacker defender (battle-damage db game attacker defender))) ([db game attacker-q attacker-r defender-q defender-r] (let [attacker (checked-unit-at db game attacker-q attacker-r) defender (checked-unit-at db game defender-q defender-r)] (attack-tx db game attacker defender)))) (defn attack! [conn game-id attacker-q attacker-r defender-q defender-r] (let [db @conn game (game-by-id db game-id) tx (attack-tx db game attacker-q attacker-r defender-q defender-r)] (d/transact! conn tx))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Repair (defn check-repairable [db game unit] (when (>= (:unit/count unit) (:game/max-count-per-unit game)) (throw (unit-ex "Unit is already fully repaired" unit))) unit) (defn repairable? [db game unit] (try (check-repairable db game unit) true (catch :default ex false))) (defn check-can-repair [db game unit] (check-unit-current db game unit) (when-not (or (:game/self-repair game) (on-owned-base? db game unit)) (throw (game-ex "Unit self repair is not allowed" game))) (when (:unit/capturing unit) (throw (unit-ex "Unit cannot make repairs while capturing" unit))) (check-repairable db game unit) (checked-next-state db unit :action.type/repair-unit)) (defn can-repair? [db game unit] (try (check-can-repair db game unit) true (catch :default ex false))) (defn repair-tx "Returns a transaction that increments unit count and sets the unit repaired flag to true." ([db game unit] (let [new-state (check-can-repair db game unit)] [{:db/id (e unit) :unit/count (min (:game/max-count-per-unit game) (+ (:unit/count unit) (get-in unit [:unit/type :unit-type/repair]))) :unit/repaired true :unit/state (e new-state)}])) ([db game q r] (let [unit (checked-unit-at db game q r)] (repair-tx db game unit)))) (defn repair! [conn game-id q r] (let [db @conn game (game-by-id db game-id) tx (repair-tx db game q r)] (d/transact! conn tx))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Field Repair (defn check-can-field-repair [db game unit] (check-unit-current db game unit) (when (:unit/capturing unit) (throw (unit-ex "Unit cannot make repairs while capturing" unit))) (when (empty? (get-in unit [:unit/type :unit-type/can-repair])) (throw (unit-ex "Unit cannot repair other units" unit))) (checked-next-state db unit :action.type/field-repair-unit)) (defn can-field-repair? [db game unit] (try (check-can-field-repair db game unit) true (catch :default ex false))) (defn check-has-repairable-armor-type [db game repairer target] (let [possible-repair-types (get-in repairer [:unit/type :unit-type/can-repair]) goal-repair-type (get-in target [:unit/type :unit-type/armor-type])] (when-not (some #{goal-repair-type} possible-repair-types) (throw (unit-ex "Armor types are not compatible" repairer))) repairer)) (defn has-repairable-armor-type? [db game repairer target] (try (check-has-repairable-armor-type db game repairer target) true (catch :default ex false))) (defn field-repair-tx ([db game repairer target] (let [new-state (check-can-field-repair db game repairer)] (check-in-range db repairer target) (check-repairable db game target) (check-has-repairable-armor-type db game repairer target) [{:db/id (e target) :unit/count (min (:game/max-count-per-unit game) (+ (:unit/count target) (get-in repairer [:unit/type :unit-type/repair])))} {:db/id (e repairer) :unit/state (e new-state)}])) ([db game q1 r1 q2 r2] (let [repairer (checked-unit-at db game q1 r1) target (checked-unit-at db game q2 r2)] (field-repair-tx db game repairer target)))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Capture ;; TODO: add can-capture? that only checks if unit type can capture ;; TODO: rename to check-can-capture (defn check-capturable [db game unit terrain] (check-unit-current db game unit) (when-not (-> unit :unit/type :unit-type/can-capture) (throw (unit-ex "Unit does not have the ability to capture" unit))) (when-not (and terrain (base? terrain)) (throw (unit-ex "Unit unit is not on a base" unit))) (when (:unit/capturing unit) (throw (unit-ex "Unit is already caturing" unit))) (when (= (e (unit-faction db unit)) (some-> terrain :terrain/owner e)) ;; TODO: add more exception info (throw (ex-info "Base is already owned by current faction" {:q (:terrain/q terrain) :r (:terrain/r terrain)}))) (checked-next-state db unit :action.type/capture-base)) ;; TODO: rename to can-capture-terrain? (?) (defn can-capture? [db game unit terrain] (try (check-capturable db game unit terrain) true (catch :default ex false))) (defn capture-tx "Returns a transaction that sets the unit capturing flag and capture round." ([db game unit] (let [base (base-at db game (:unit/q unit) (:unit/r unit)) round (:game/round game) new-state (check-capturable db game unit base)] [{:db/id (e unit) :unit/capturing true :unit/capture-round (inc round) :unit/state (e new-state)}])) ([db game q r] (let [unit (checked-unit-at db game q r)] (capture-tx db game unit)))) (defn capture! [conn game-id q r] (let [db @conn game (game-by-id db game-id) tx (capture-tx db game q r)] (d/transact! conn tx))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Build ;; TODO: implement check-can-build (defn check-unoccupied [db game q r] (let [unit (unit-at db game q r)] (when unit ;; TODO: include info about occupying unit (throw (ex-info "Base is occupied" {:q q :r r}))))) (defn unoccupied? [db game q r] (try (check-unoccupied db game q r) true (catch :default ex false))) (defn build-tx "Returns a transaction that creates a new unit and updates faction credits." ([db game q r unit-type-id] (let [base (checked-base-at db game q r)] (build-tx db game base unit-type-id))) ([db game base unit-type-id] (let [unit-type (find-by db :unit-type/id unit-type-id) cur-faction (:game/current-faction game) credits (:faction/credits cur-faction) cost (:unit-type/cost unit-type) base-q (:terrain/q base) base-r (:terrain/r base)] (check-base-current db game base) (check-unoccupied db game base-q base-r) (when (> cost credits) (throw (ex-info "Unit cost exceeds available credits" {:credits credits :cost cost}))) [{:db/id -1 :unit/game-pos-idx (game-pos-idx game base-q base-r) :unit/q base-q :unit/r base-r :unit/terrain (e base) :unit/round-built (:game/round game) :unit/type (e unit-type) :unit/count (:game/max-count-per-unit game) :unit/move-count 0 :unit/attack-count 0 :unit/attacked-count 0 :unit/repaired false :unit/capturing false :unit/state (-> unit-type built-state e)} {:db/id (e cur-faction) :faction/credits (- credits cost) :faction/units -1}]))) (defn build! [conn game-id q r unit-type-id] (let [db @conn game (game-by-id db game-id) tx (build-tx db game q r unit-type-id)] (d/transact! conn tx))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; End Turn (defn unit-end-turn-tx [db game unit] (let [{:keys [unit/q unit/r unit/capturing unit/capture-round]} unit] (if (and capturing (= capture-round (:game/round game))) (let [faction (unit-faction db unit) terrain (checked-base-at db game q r)] [[:db/add (e terrain) :terrain/owner (e faction)] [:db.fn/retractEntity (e unit)]]) (into [{:db/id (e unit) :unit/repaired false :unit/move-count 0 :unit/attack-count 0 :unit/attacked-count 0 :unit/state (-> unit start-state e)}] (map (fn [u] [:db/retract (e unit) :unit/attacked-from (e u)])) (:unit/attacked-from unit))))) (defn end-turn-tx "Return a transaction that completes captures, clears per round unit flags, updates the current faction, adds faction credits, and updates the round." [db game] (let [starting-faction (:game/starting-faction game) cur-faction (:game/current-faction game) next-faction (:faction/next-faction cur-faction) cur-round (:game/round game) new-round (if (= starting-faction next-faction) (inc cur-round) cur-round) credits (+ (:faction/credits next-faction) (if (> new-round 1) (income db game next-faction) 0)) units (:faction/units cur-faction) attacked-froms (:game/attacked-froms game)] (into [{:db/id (e next-faction) :faction/credits credits} {:db/id (e game) :game/round new-round :game/current-faction (e next-faction)}] (mapcat #(unit-end-turn-tx db game %) units)))) (defn end-turn! [conn game-id] (let [db @conn game (game-by-id db game-id)] (d/transact! conn (end-turn-tx db game)))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Actions (defn action-tx [db game action] (case (:action/type action) :action.type/build-unit (let [{:keys [action/q action/r action/unit-type-id]} action] (build-tx db game q r unit-type-id)) :action.type/move-unit (let [{:keys [action/from-q action/from-r action/to-q action/to-r]} action] (move-tx db game from-q from-r to-q to-r)) :action.type/attack-unit (let [{:keys [action/attacker-q action/attacker-r action/defender-q action/defender-r action/attacker-damage action/defender-damage]} action] (battle-tx db game attacker-q attacker-r defender-q defender-r attacker-damage defender-damage)) :action.type/repair-unit (let [{:keys [action/q action/r]} action] (repair-tx db game q r)) :action.type/field-repair-unit (let [{:keys [action/repairer-q action/repairer-r action/target-q action/target-r]} action] (field-repair-tx db game repairer-q repairer-r target-q target-r)) :action.type/capture-base (let [{:keys [action/q action/r]} action] (capture-tx db game q r)) :action.type/end-turn (end-turn-tx db game))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; AI Helpers (defn buildable-unit-types [db game] (qess '[:find ?ut :in $ ?g :where [?g :game/current-faction ?f] [?f :faction/credits ?credits] [?ut :unit-type/cost ?cost] [(>= ?credits ?cost)]] db (e game))) (defn base-can-act? [db game base] (let [{:keys [terrain/q terrain/r]} base] (and (> (count (buildable-unit-types db game)) 0) (unoccupied? db game q r)))) (defn base-actions [db game base] (let [{:keys [terrain/q terrain/r]} base] (map (fn [ut] {:action/type :action.type/build-unit :action/q q :action/r r :action/unit-type-id (:unit-type/id ut)}) (buildable-unit-types db game)))) (defn actionable-bases [db game] (let [faction (:game/current-faction game) bases (faction-bases db faction)] (filter #(base-can-act? db game %) bases))) ;; TODO: rename to enemy-units (?) (defn enemies [db game unit] (let [u-faction (unit-faction db unit)] (qess '[:find ?u :in $ ?g ?f-arg :where [?g :game/factions ?f] [?f :faction/units ?u] [(not= ?f ?f-arg)]] db (e game) (e u-faction)))) (defn enemies-in-range [db game unit] (into [] (filter #(in-range? db unit %)) (enemies db game unit))) (defn closest-enemy [db game unit] (let [unit-q (:unit/q unit) unit-r (:unit/r unit)] (reduce (fn [closest enemy] (let [enemy-q (:unit/q enemy) enemy-r (:unit/r enemy) closest-q (:unit/q closest) closest-r (:unit/r closest)] (if (< (hex/distance unit-q unit-r enemy-q enemy-r) (hex/distance unit-q unit-r closest-q closest-r)) enemy closest))) (enemies db game unit)))) (defn friends [db game unit] (let [u-faction (unit-faction db unit)] (qess '[:find ?u :in $ ?g ?f-arg :where [?g :game/factions ?f] [?f :faction/units ?u] [(= ?f ?f-arg)]] db (e game) (e u-faction)))) (defn friends-in-range [db game unit] (into [] (filter #(in-range? db unit %)) (friends db game unit))) (defn repairable-friends-in-range [db game unit] (into [] (filter #(repairable? db game %)) (friends-in-range db game unit))) (defn closest-friend [db game unit] (let [unit-q (:unit/q unit) unit-r (:unit/r unit)] (reduce (fn [closest friend] (let [friend-q (:unit/q friend) friend-r (:unit/r friend) closest-q (:unit/q closest) closest-r (:unit/r closest)] (if (< (hex/distance unit-q unit-r friend-q friend-r) (hex/distance unit-q unit-r closest-q closest-r)) friend closest))) (friends db game unit)))) (defn unit-can-act? [db game unit] (let [terrain (:unit/terrain unit)] (or (can-move? db game unit) (and (can-attack? db game unit) (> (count (enemies-in-range db game unit)) 0)) (can-repair? db game unit) (can-capture? db game unit terrain)))) (defn move-actions [db game unit] (if (can-move? db game unit) (map (fn [move] (let [[to-q to-r] (:to move) [from-q from-r] (:from move)] (-> move (dissoc :to :from) (assoc :action/type :action.type/move-unit :action/to-q to-q :action/to-r to-r :action/from-q from-q :action/from-r from-r)))) (valid-moves db game unit)) [])) (defn attack-actions [db game unit] (if (can-attack? db game unit) (map (fn [defender] {:action/type :action.type/attack-unit :action/attacker-q (:unit/q unit) :action/attacker-r (:unit/r unit) :action/defender-q (:unit/q defender) :action/defender-r (:unit/r defender)}) (enemies-in-range db game unit)) [])) (defn repair-actions [db game unit] (if (can-repair? db game unit) [{:action/type :action.type/repair-unit :action/q (:unit/q unit) :action/r (:unit/r unit)}] [])) (defn field-repair-actions [db game unit] (if (can-field-repair? db game unit) (map (fn [target] {:action/type :action.type/field-repair-unit :action/repairer-q (:unit/q unit) :action/repairer-r (:unit/r unit) :action/target-q (:unit/q target) :action/target-r (:unit/r target)}) (friends-in-range db game unit)) [])) (defn capture-actions [db game unit] (let [{:keys [unit/q unit/r unit/terrain]} unit] (if (can-capture? db game unit terrain) [{:action/type :action.type/capture-base :action/q q :action/r r}] []))) (defn unit-actions [db game unit] (concat (move-actions db game unit) (attack-actions db game unit) (repair-actions db game unit) (field-repair-actions db game unit) (capture-actions db game unit))) (defn actionable-units [db game] (let [units (get-in game [:game/current-faction :faction/units])] (filter #(unit-can-act? db game %) units))) (defn actionable-actors [db game] (concat (actionable-units db game) (actionable-bases db game))) (defn capturable-bases [db game unit] (when (get-in unit [:unit/type :unit-type/can-capture]) (let [u-faction (unit-faction db unit)] (into [] (filter #(not= u-faction (:terrain/owner %))) (qess '[:find ?t :in $ ?g :where [?g :game/map ?m] [?m :map/terrains ?t] [?t :terrain/type ?tt] [?tt :terrain-type/id :terrain-type.id/base]] db (e game)))))) (defn closest-capturable-base [db game unit] (let [unit-q (:unit/q unit) unit-r (:unit/r unit) bases (capturable-bases db game unit)] (reduce (fn [closest terrain] (let [terrain-q (:terrain/q terrain) terrain-r (:terrain/r terrain) closest-q (:terrain/q closest) closest-r (:terrain/r closest)] (if (< (hex/distance unit-q unit-r terrain-q terrain-r) (hex/distance unit-q unit-r closest-q closest-r)) terrain closest))) bases))) ;; TODO: return nil if no move is found (defn closest-move-to-hex [db game unit q r] (reduce (fn [closest move] (if closest (let [[closest-q closest-r] (:to closest) [move-q move-r] (:to move)] (if (< (hex/distance move-q move-r q r) (hex/distance closest-q closest-r q r)) move closest)) move)) (valid-moves db game unit))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Setup (defn settings-tx [db game-id settings-def] (let [game (game-by-id db game-id)] [{:db/id (e game) :game/ranged-attack-bonus (:ranged-attack-bonus settings-def) :game/adjacent-attack-bonus (:adjacent-attack-bonus settings-def) :game/flanking-attack-bonus (:flanking-attack-bonus settings-def) :game/opposite-attack-bonus (:opposite-attack-bonus settings-def) :game/stochastic-damage (:stochastic-damage settings-def) :game/self-repair (:self-repair settings-def) :game/move-through-friendly (:move-through-friendly settings-def)}])) (defn terrain-types-tx [db game-id terrains-def] (let [game (game-by-id db game-id)] (into [] (map (fn [[terrain-type-name terrain-def]] (let [terrain-type-id (to-terrain-type-id terrain-type-name) terrain-type-idx (game-id-idx game-id terrain-type-id)] {:db/id (db/next-temp-id) :game/_terrain-types (e game) :terrain-type/id terrain-type-id :terrain-type/game-id-idx terrain-type-idx :terrain-type/description (:description terrain-def) :terrain-type/image (:image terrain-def)}))) terrains-def))) (defn attack-strengths-tx [db game-id unit-type-eid attack-strengths-def] (let [game (game-by-id db game-id)] (into [] (map (fn [[armor-type-name attack-strength]] {:db/id (db/next-temp-id) :unit-type/_strengths unit-type-eid :unit-strength/armor-type (to-armor-type armor-type-name) :unit-strength/attack attack-strength})) attack-strengths-def))) (defn terrain-effects-tx [db game-id unit-type-eid terrain-effects-def] (let [game (game-by-id db game-id)] (into [] (map (fn [[terrain-type-name terrain-effect-def]] (let [{:keys [attack-bonus armor-bonus movement-cost]} terrain-effect-def terrain-type-idx (->> terrain-type-name to-terrain-type-id (game-id-idx game-id))] {:db/id (db/next-temp-id) :terrain-type/_effects [:terrain-type/game-id-idx terrain-type-idx] :terrain-effect/unit-type unit-type-eid :terrain-effect/movement-cost movement-cost :terrain-effect/attack-bonus attack-bonus :terrain-effect/armor-bonus armor-bonus}))) terrain-effects-def))) (defn terrain-build-tx [db game-id unit-type-eid buildable-at-def] (let [game (game-by-id db game-id)] (into [] (map (fn [terrain-type-name] (let [terrain-type-idx (->> terrain-type-name to-terrain-type-id (game-id-idx game-id))] {:db/id [:terrain-type/game-id-idx terrain-type-idx] :terrain-type/can-build unit-type-eid}))) buildable-at-def))) (defn unit-types-tx [db game-id units-def] (let [game (game-by-id db game-id)] (into [] (mapcat (fn [[unit-type-name unit-def]] (let [{:keys [armor capturing-armor state-map]} unit-def unit-state-map-idx (->> state-map to-unit-state-map-id (game-id-idx game-id)) unit-type-eid (db/next-temp-id)] (-> [{:db/id unit-type-eid :game/_unit-types (e game) :unit-type/id (to-unit-type-id unit-type-name) :unit-type/description (:description unit-def) :unit-type/cost (:cost unit-def) :unit-type/can-capture (:can-capture unit-def) :unit-type/can-repair (map #(to-armor-type %) (:can-repair unit-def)) :unit-type/movement (:movement unit-def) :unit-type/min-range (:min-range unit-def) :unit-type/max-range (:max-range unit-def) :unit-type/armor-type (-> unit-def :armor-type to-armor-type) :unit-type/armor armor :unit-type/capturing-armor (or capturing-armor armor) :unit-type/repair (:repair unit-def) :unit-type/state-map [:unit-state-map/game-id-idx unit-state-map-idx] :unit-type/image (:image unit-def) :unit-type/zoc-armor-types (map #(to-armor-type %) (:zoc unit-def))}] (into (attack-strengths-tx db game-id unit-type-eid (:attack-strengths unit-def))) (into (terrain-effects-tx db game-id unit-type-eid (:terrain-effects unit-def))) (into (terrain-build-tx db game-id unit-type-eid (:buildable-at unit-def))))))) units-def))) (defn unit-states-tx [db game-id state-map-eid state-map-name states] (let [game (game-by-id db game-id)] (into [] (map (fn [[state-name states]] (let [state-id (to-unit-state-id state-map-name state-name) state-idx (game-id-idx game-id state-id)] {:db/id (db/next-temp-id) :game/_unit-states (e game) :unit-state/id state-id :unit-state/game-id-idx state-idx :unit-state-map/_states state-map-eid}))) states))) (defn unit-states-transitions-tx [db game-id state-map-name states] (let [game (game-by-id db game-id)] (into [] (mapcat (fn [[state-name {:keys [transitions]}]] (map (fn [[action new-state]] (let [state-idx (->> state-name (to-unit-state-id state-map-name) (game-id-idx game-id)) new-state-idx (->> new-state (to-unit-state-id state-map-name) (game-id-idx game-id))] {:db/id (db/next-temp-id) :unit-state-transition/action-type (to-action-type action) :unit-state-transition/new-state [:unit-state/game-id-idx new-state-idx] :unit-state/_transitions [:unit-state/game-id-idx state-idx]})) transitions))) states))) (defn unit-state-map-tx [db game-id state-maps-def] (let [game (game-by-id db game-id)] (into [] (mapcat (fn [[state-map-name state-map-def]] (let [{:keys [states start-state built-state]} state-map-def map-id (to-unit-state-map-id state-map-name) map-idx (game-id-idx game-id map-id) start-idx (->> start-state (to-unit-state-id state-map-name) (game-id-idx game-id)) built-idx (->> built-state (to-unit-state-id state-map-name) (game-id-idx game-id)) state-map-temp-eid (db/next-temp-id)] (-> [{:db/id state-map-temp-eid :game/_unit-state-maps (e game) :unit-state-map/id map-id :unit-state-map/game-id-idx map-idx}] (into (unit-states-tx db game-id state-map-temp-eid state-map-name states)) (into (unit-states-transitions-tx db game-id state-map-name states)) (into [{:db/id state-map-temp-eid :unit-state-map/start-state [:unit-state/game-id-idx start-idx] :unit-state-map/built-state [:unit-state/game-id-idx built-idx]}]))))) state-maps-def))) (defn game-map-tx [db game-id map-def] (let [game (game-by-id db game-id) map-eid (db/next-temp-id)] (into [{:db/id map-eid :map/id (:id map-def) :map/description (:description map-def) :game/_map (e game)}] (map (fn [t] (let [{:keys [q r]} t terrain-type-id (to-terrain-type-id (:terrain-type t)) terrain-type (terrain-type-by-id db game terrain-type-id)] {:db/id (db/next-temp-id) :terrain/game-pos-idx (game-pos-idx game q r) :terrain/q q :terrain/r r :terrain/type (e terrain-type) :map/_terrains map-eid})) (:terrains map-def))))) (defn create-game! ([conn scenario-def] (create-game! conn scenario-def {})) ([conn scenario-def game-state] (let [game-id (random-uuid) {:keys [id credits-per-base max-count-per-unit]} scenario-def] (d/transact! conn [{:db/id (db/next-temp-id) :game/id game-id :game/scenario-id id :game/round (:round game-state 1) :game/max-count-per-unit max-count-per-unit :game/credits-per-base credits-per-base}]) game-id))) (defn bases-tx [db game-id scenario-def] (let [game (game-by-id db game-id)] (for [base (:bases scenario-def)] (let [{:keys [q r base-type]} base] {:terrain/game-pos-idx (game-pos-idx game q r) :terrain/q q :terrain/r r :terrain/type [:terrain-type/game-id-idx (game-id-idx game-id (to-terrain-type-id base-type))] :map/_terrains (e (:game/map game))})))) (defn factions-tx [db game-id factions] (let [game (game-by-id db game-id)] (map-indexed (fn [i faction] (let [{:keys [color credits ai]} faction next-id (- -101 (mod (inc i) (count factions)))] {:db/id (- -101 i) :faction/color (to-faction-color color) :faction/credits credits :faction/ai ai :faction/order (inc i) :faction/next-faction next-id :game/_factions (e game)})) factions))) (defn factions-bases-tx [db game-id factions] (let [game (game-by-id db game-id)] (mapcat (fn [faction] (let [{:keys [bases color]} faction faction (faction-by-color db game color)] (map (fn [{:keys [q r]}] {:terrain/game-pos-idx (game-pos-idx game q r) :terrain/owner (e faction)}) bases))) factions))) (defn factions-units-tx [db game-id factions] (let [game (game-by-id db game-id)] (mapcat (fn [faction] (let [{:keys [game/max-count-per-unit]} game {:keys [units color]} faction faction-eid (e (faction-by-color db game color))] (map (fn [{:keys [q r] :as unit}] (let [unit-type-id (to-unit-type-id (:unit-type unit)) unit-state (:state unit) unit-type (find-by db :unit-type/id unit-type-id) capturing (:capturing unit false) terrain (terrain-at db game q r)] (cond-> {:db/id (db/next-temp-id) :unit/game-pos-idx (game-pos-idx game q r) :unit/q q :unit/r r :unit/terrain (e terrain) :unit/count (:count unit max-count-per-unit) :unit/round-built (:round-built unit 0) :unit/move-count (:move-count unit 0) :unit/attack-count (:attack-count unit 0) :unit/attacked-count (:attack-count unit 0) :unit/repaired (:repaired unit false) :unit/capturing capturing :unit/type (e unit-type) :unit/state (if unit-state [:unit-state/game-id-idx (->> unit-state to-unit-state-id (game-id-idx game-id))] (-> unit-type start-state e)) :faction/_units faction-eid} capturing (assoc :unit/capture-round (:capture-round unit))))) units))) factions))) (defn load-scenario! [conn rulesets map-defs scenario-def] (let [game-id (create-game! conn scenario-def) {:keys [ruleset-id map-id credits-per-base factions]} scenario-def starting-faction-color (get-in factions [0 :color]) ruleset (rulesets ruleset-id)] ;; Rules (d/transact! conn (settings-tx @conn game-id (:settings ruleset))) (d/transact! conn (terrain-types-tx @conn game-id (:terrains ruleset))) (d/transact! conn (unit-state-map-tx @conn game-id (:unit-state-maps ruleset))) (d/transact! conn (unit-types-tx @conn game-id (:units ruleset))) ;; Map and bases (d/transact! conn (game-map-tx @conn game-id (map-defs map-id))) (d/transact! conn (bases-tx @conn game-id scenario-def)) ;; Factions (d/transact! conn (factions-tx @conn game-id factions)) (d/transact! conn (factions-bases-tx @conn game-id factions)) (d/transact! conn (factions-units-tx @conn game-id factions)) (let [db @conn game (game-by-id db game-id) starting-faction-eid (->> starting-faction-color (faction-by-color db game) e)] (d/transact! conn [{:db/id (e game) :game/starting-faction starting-faction-eid :game/current-faction starting-faction-eid}])) game-id)) ;; Info needed to load game from URL ;; - scenario id ;; - current-faction ;; - faction ;; - credits ;; - ai status ;; - owned bases ;; - location ;; - units ;; - location ;; - health ;; - round-built ;; - capturing (defn load-game-state! [conn rulesets map-defs scenario-defs game-state] (let [{:keys [scenario-id factions]} game-state current-faction-color (:current-faction game-state) scenario-def (scenario-defs scenario-id) starting-faction-color (get-in scenario-def [:factions 0 :color]) game-id (create-game! conn scenario-def game-state) {:keys [ruleset-id map-id credits-per-base]} scenario-def ruleset (rulesets ruleset-id)] ;; Rules (d/transact! conn (settings-tx @conn game-id (:settings ruleset))) (d/transact! conn (terrain-types-tx @conn game-id (:terrains ruleset))) (d/transact! conn (unit-state-map-tx @conn game-id (:unit-state-maps ruleset))) (d/transact! conn (unit-types-tx @conn game-id (:units ruleset))) ;; Map and bases (d/transact! conn (game-map-tx @conn game-id (map-defs map-id))) (d/transact! conn (bases-tx @conn game-id scenario-def)) ;; Factions (d/transact! conn (factions-tx @conn game-id factions)) (d/transact! conn (factions-bases-tx @conn game-id factions)) (d/transact! conn (factions-units-tx @conn game-id factions)) (let [db @conn game (game-by-id db game-id) starting-faction-eid (e (faction-by-color db game starting-faction-color)) current-faction-eid (e (faction-by-color db game current-faction-color))] (d/transact! conn [{:db/id (e game) :game/starting-faction starting-faction-eid :game/current-faction current-faction-eid}])) game-id)) ;; TODO: figure out better name (defn get-game-state ([db game] (get-game-state db game :minimal)) ([db game dump-type] (let [factions (->> game :game/factions (sort-by :order))] {:scenario-id (:game/scenario-id game) :round (:game/round game) :current-faction (-> game :game/current-faction :faction/color name keyword) :factions (into [] (for [faction factions] {:credits (:faction/credits faction) :ai (:faction/ai faction) :color (-> (:faction/color faction) name keyword) :bases (into [] (for [base (faction-bases db faction)] {:q (:terrain/q base) :r (:terrain/r base)})) :units (into [] (for [unit (:faction/units faction)] (cond-> {:q (:unit/q unit) :r (:unit/r unit) :unit-type (-> unit :unit/type :unit-type/id name keyword) :count (:unit/count unit)} (:unit/capturing unit) (assoc :capturing true :capture-round (:unit/capture-round unit)) (= dump-type :full) (assoc :attack-count (:unit/attack-count unit) :move-count (:unit/move-count unit) :repaired (:unit/repaired unit) :round-built (:unit/round-built unit) :state (-> unit :unit/state :unit-state/id name keyword)) ))) })) }))) ================================================ FILE: src/cljs/zetawar/js/game.cljs ================================================ (ns zetawar.js.game (:require [zetawar.game :as game])) (defn ^:export is_unit [x] (game/unit? x)) (defn ^:export is_base [x] (game/base? x)) (defn ^:export terrain_hex [terrain] (clj->js (game/terrain-hex terrain))) (defn ^:export unit_hex [terrain] (clj->js (game/unit-hex terrain))) (defn ^:export closest_capturable_base [db game unit] (game/closest-capturable-base db game unit)) (defn ^:export closest_enemy [db game unit] (game/closest-enemy db game unit)) ================================================ FILE: src/cljs/zetawar/js/hex.cljs ================================================ (ns zetawar.js.hex (:require [zetawar.hex :as hex])) (defn ^:export distance [q1 r1 q2 r2] (hex/distance q1 r1 q2 r2)) ================================================ FILE: src/cljs/zetawar/logging.cljs ================================================ (ns zetawar.logging) (goog-define LOG_LEVEL 4) (defn log [& args] (let [[ex & other-args] args] (if (.-stack ex) (do (js/console.log (apply str (interpose " " other-args))) (js/console.log ex)) (js/console.log (apply str (interpose " " args)))))) (defn error [& args] (when (>= LOG_LEVEL 0) (apply log args))) (defn warn [& args] (when (>= LOG_LEVEL 1) (apply log args))) (defn info [& args] (when (>= LOG_LEVEL 2) (apply log args))) (defn debug [& args] (when (>= LOG_LEVEL 3) (apply log args))) (defn trace [& args] (when (>= LOG_LEVEL 4) (apply log args))) ================================================ FILE: src/cljs/zetawar/players/ai/custom.cljs ================================================ (ns zetawar.players.ai.custom (:require [cljs.core.async :as async] [datascript.core :as d] [zetawar.app :as app] [zetawar.db :as db] [zetawar.game :as game] [zetawar.hex :as hex] [zetawar.logging :as log] [zetawar.players :as players] [zetawar.players.simple-embedded :refer [simple-embedded-player]])) (defn score-actor [db game actor actor-ctx] (cond (game/unit? actor) (rand-int 100) (game/base? actor) (+ (rand-int 100) 100))) (defn score-base-action [db game base action-ctx action] (rand-int 200)) (defn mk-unit-action-ctx [db game actor-ctx unit] (assoc actor-ctx :closest-base (game/closest-capturable-base db game unit) :closest-enemy (game/closest-enemy db game unit))) (defn score-unit-action [db game unit action-ctx action] (let [{:keys [closest-base closest-enemy]} action-ctx] (case (:action/type action) :action.type/capture-base 200 :action.type/attack-unit 100 :action.type/move-unit (if closest-base (let [[base-q base-r] (game/terrain-hex closest-base) {:keys [action/to-q action/to-r]} action base-distance (hex/distance base-q base-r to-q to-r)] (- 100 base-distance)) (let [[enemy-q enemy-r] (game/unit-hex closest-enemy) {:keys [action/to-q action/to-r]} action enemy-distance (hex/distance enemy-q enemy-r to-q to-r)] (- 100 enemy-distance))) 0))) (defmethod players/new-player ::players/custom-ai [{:as app-ctx :keys [ev-chan notify-pub]} player-type faction-color] (let [fns {:score-actor #'score-actor :score-base-action #'score-base-action :mk-unit-action-ctx #'mk-unit-action-ctx :score-unit-action #'score-unit-action}] (simple-embedded-player faction-color ev-chan notify-pub fns))) ================================================ FILE: src/cljs/zetawar/players/ai/custom_js.cljs ================================================ (ns zetawar.players.ai.custom-js (:require [cljs.core.async :as async] [datascript.core :as d] [zetawar-js-ai] [zetawar.app :as app] [zetawar.db :as db] [zetawar.game :as game] [zetawar.hex :as hex] [zetawar.logging :as log] [zetawar.players :as players] [zetawar.players.simple-embedded :refer [simple-embedded-player]])) (defn mk-actor-ctx [db game actor] (js/ZetawarAI.makeActorContext db game actor)) (defn score-actor [db game actor actor-ctx] (js/ZetawarAI.scoreActor db game actor actor-ctx)) (defn mk-base-action-ctx [db game actor-ctx base] (js/ZetawarAI.makeBaseActionContext db game actor-ctx base)) (defn score-base-action [db game base action-ctx action] (js/ZetawarAI.scoreBaseAction db game base action-ctx (clj->js action))) (defn mk-unit-action-ctx [db game actor-ctx unit] (js/ZetawarAI.makeUnitActionContext db game actor-ctx unit)) (defn score-unit-action [db game unit action-ctx action] (js/ZetawarAI.scoreUnitAction db game unit action-ctx (clj->js action))) (defmethod players/new-player ::players/custom-js-ai [{:as app-ctx :keys [ev-chan notify-pub]} player-type faction-color] (let [fns {:mk-actor-ctx #'mk-actor-ctx :score-actor #'score-actor :mk-base-action-ctx #'mk-base-action-ctx :score-base-action #'score-base-action :mk-unit-action-ctx #'mk-unit-action-ctx :score-unit-action #'score-unit-action}] (simple-embedded-player faction-color ev-chan notify-pub fns))) ================================================ FILE: src/cljs/zetawar/players/ai/reference.cljs ================================================ (ns zetawar.players.ai.reference (:require [cljs.core.async :as async] [datascript.core :as d] [zetawar.app :as app] [zetawar.db :as db] [zetawar.game :as game] [zetawar.hex :as hex] [zetawar.logging :as log] [zetawar.players :as players] [zetawar.players.simple-embedded :refer [simple-embedded-player]])) (defn score-actor [db game actor actor-ctx] (cond (game/unit? actor) (rand-int 100) (game/base? actor) (+ (rand-int 100) 100))) (defn score-base-action [db game base action-ctx action] (rand-int 200)) (defn mk-unit-action-ctx [db game actor-ctx unit] (assoc actor-ctx :closest-base (game/closest-capturable-base db game unit) :closest-enemy (game/closest-enemy db game unit))) (defn score-unit-action [db game unit action-ctx action] (let [{:keys [closest-base closest-enemy]} action-ctx] (case (:action/type action) :action.type/capture-base 200 :action.type/attack-unit 100 :action.type/move-unit (if closest-base (let [[base-q base-r] (game/terrain-hex closest-base) {:keys [action/to-q action/to-r]} action base-distance (hex/distance base-q base-r to-q to-r)] (- 100 base-distance)) (let [[enemy-q enemy-r] (game/unit-hex closest-enemy) {:keys [action/to-q action/to-r]} action enemy-distance (hex/distance enemy-q enemy-r to-q to-r)] (- 100 enemy-distance))) 0))) (defmethod players/new-player ::players/reference-ai [{:as app-ctx :keys [ev-chan notify-pub]} player-type faction-color] (let [fns {:score-actor #'score-actor :score-base-action #'score-base-action :mk-unit-action-ctx #'mk-unit-action-ctx :score-unit-action #'score-unit-action}] (simple-embedded-player faction-color ev-chan notify-pub fns))) ================================================ FILE: src/cljs/zetawar/players/human.cljs ================================================ (ns zetawar.players.human (:require [zetawar.players :as players])) (defrecord HumanPlayer [faction-color] players/Player (start [player]) (stop [player])) (defmethod players/new-player ::players/human [_ _ faction-color] (HumanPlayer. faction-color)) ================================================ FILE: src/cljs/zetawar/players/simple_embedded.cljs ================================================ (ns zetawar.players.simple-embedded (:require [cljs.core.async :as async] [datascript.core :as d] [zetawar.logging :as log] [zetawar.app :as app] [zetawar.db :as db] [zetawar.game :as game] [zetawar.players :as players] [zetawar.router :as router]) (:require-macros [cljs.core.async.macros :refer [go go-loop]])) (defmulti handle-event (fn [player [ev-type & _]] ev-type)) (defmethod handle-event :default [_ msg] (log/debug "Unhandled player event:" (pr-str msg))) (defn handle-event* [{:as player :keys [ev-chan]} msg] (let [{:as ret :keys [tx]} (handle-event player msg)] (log/trace "Player handler returned:" (pr-str ret)) (doseq [new-msg (:dispatch ret)] (router/dispatch ev-chan new-msg)))) (defrecord SimpleEmbeddedPlayer [faction-color ev-chan notify-pub player-chan conn fns] players/Player (start [player] (let [{:keys [notify-pub]} player] (async/sub notify-pub :faction.color/all player-chan) (async/sub notify-pub faction-color player-chan) (go-loop [msg (> (game/actionable-actors db game) (keep (juxt identity #(*score-actor* db game ctx %))) (apply max-key second) first)) (declare ^:dynamic *mk-base-action-ctx*) (declare ^:dynamic *score-base-action*) (defn choose-base-action [db game base action-ctx] (->> (game/base-actions db game base) (keep (juxt identity #(*score-base-action* db game base action-ctx %))) (apply max-key second) first)) (declare ^:dynamic *mk-unit-action-ctx*) (declare ^:dynamic *score-unit-action*) (defn choose-unit-action [db game unit action-ctx] (->> (game/unit-actions db game unit) (keep (juxt identity #(*score-unit-action* db game unit action-ctx %))) (apply max-key second) first)) (defn choose-action [player db game] (let [actor-ctx (*mk-actor-ctx* db game) actor (choose-actor db game actor-ctx)] (when actor (cond (game/base? actor) (let [action-ctx (*mk-base-action-ctx* db game actor-ctx actor)] (choose-base-action db game actor action-ctx)) (game/unit? actor) (let [action-ctx (*mk-unit-action-ctx* db game actor-ctx actor)] (choose-unit-action db game actor action-ctx)))))) (defn wrap-exception-handler [f] (fn [& args] (try (apply f args) (catch :default ex (log/error "Error running player function:" ex) nil)))) (defmethod handle-event ::players/update-game-state [{:as player :keys [conn faction-color fns]} [_ _ game-state]] (let [new-conn (d/create-conn db/schema) game-id (players/load-player-game-state! new-conn game-state)] (reset! conn @new-conn) (let [db @conn game (game/game-by-id db game-id) {:keys [mk-actor-ctx score-actor mk-base-action-ctx score-base-action mk-unit-action-ctx score-unit-action]} fns action (or (binding [*mk-actor-ctx* (wrap-exception-handler (or mk-actor-ctx (constantly nil))) *score-actor* (wrap-exception-handler score-actor) *mk-base-action-ctx* (wrap-exception-handler (or mk-base-action-ctx (fn [db game actor-ctx base] actor-ctx))) *score-base-action* (wrap-exception-handler score-base-action) *mk-unit-action-ctx* (wrap-exception-handler (or mk-unit-action-ctx (fn [db game actor-ctx unit] actor-ctx))) *score-unit-action* (wrap-exception-handler score-unit-action)] (choose-action player db game)) {:action/type :action.type/end-turn :action/faction-color faction-color})] {:dispatch [[:zetawar.events.player/execute-action action]]}))) ================================================ FILE: src/cljs/zetawar/players.cljs ================================================ (ns zetawar.players (:require [cljs.core.async :as async] [zetawar.data :as data] [zetawar.game :as game] [zetawar.logging :as log])) ;; TODO: move to data ns? ;; TODO: namespace keys? (def player-types [[::human {:description "Human" :ai false}] [::reference-ai {:description "Reference AI" :ai true}] [::custom-ai {:description "Custom AI" :ai true}] [::custom-js-ai {:description "Custom JavaScript AI" :ai true}]]) (def player-types-by-id (into {} player-types)) (defprotocol Player (start [player]) (stop [player])) (defmulti new-player (fn [player-ctx player-type faction-color] player-type)) (defn notify [notify-chan msg] (log/debug "Notifying player:" (pr-str msg)) (async/put! notify-chan msg)) (defn load-player-game-state! [conn game-state] (game/load-game-state! conn data/rulesets data/maps data/scenarios game-state)) ;; requests ;; - get-state ;; - move ;; - attack ;; - capture ;; - build ;; - end-turn ;; events ;; - start-turn ;; - game-state ;; events structure ;; - event-type ;; request response notification ;; - request-id ;; - response or error ================================================ FILE: src/cljs/zetawar/router/reagent.cljs ================================================ (ns zetawar.router.reagent (:require [cljs.core.async :refer [! chan offer!]] [reagent.core :as r] [zetawar.logging :as log]) (:require-macros [cljs.core.async.macros :refer [go]])) ;; TODO: consider alternative names (event-wrapper-fn?) (defn handler-wrapper-fn [{:as router-ctx :keys [max-render-interval]} event-handler] (let [timer-start (atom -1) last-render (atom 0) render-queued? (atom false) render-chan (chan 1)] (fn reagent-handler-wrapper [event-handler] (go ;; Reset render timer if a render just occurred (when (< @timer-start @last-render) (let [now (.getTime (js/Date.))] (reset! timer-start now) (log/trace "@timer-start:" @timer-start))) ;; Queue notification of render (when-not @render-queued? (r/next-tick #(let [now (.getTime (js/Date.))] (log/trace "Rendering...") (offer! render-chan :rendered) (when (> now @last-render) (reset! last-render now) (log/trace "@last-render:" @last-render) (reset! render-queued? false))))) (event-handler) ;; Block till render if max-render-interval has been exceeded (let [since-last-render (- (.getTime (js/Date.)) @timer-start)] (log/trace "since-last-render:" since-last-render) (when (> since-last-render max-render-interval) (log/trace "Blocking till next render...") (! chan offer!]] [datascript.core :as d] [goog.object :as gobj] [zetawar.logging :as log] [zetawar.players :as players]) (:require-macros [cljs.core.async.macros :refer [go go-loop]])) (when-not (exists? js/Raven) (let [stub #js {"captureMessage" #() ;; TODO: something better than js/console.trace "captureException" #(js/console.trace)} global (if (exists? js/window) js/window js/global)] (gobj/set global "Raven" stub))) (defmulti handle-event (fn [ev-ctx [ev-type & _]] ev-type)) (defmethod handle-event :default [_ msg] (let [log-msg (str "Unhandled event: " (pr-str msg))] (js/Raven.captureMessage log-msg) (log/warn log-msg)) nil) (defn dispatch [ch msg] (if msg (if (offer! ch msg) (log/info "Dispatching event:" (pr-str msg)) (let [log-msg (str "Failed to dispatch event (buffer full?): " (pr-str msg))] (js/Raven.captureMessage log-msg) (log/error log-msg))) (let [log-msg "Unable to dispatch 'nil' event message"] (js/Raven.captureMessage log-msg) (log/error log-msg)))) (defn handle-event* [{:as router-ctx :keys [conn ev-chan notify-chan]} msg] (let [ev-ctx (assoc router-ctx :db @conn) {:as ret :keys [tx]} (handle-event ev-ctx msg)] (log/trace "Handler returned:" (pr-str ret)) (when tx (log/debug "Transacting:" (pr-str tx)) (d/transact! conn tx)) (doseq [new-msg (:dispatch ret)] (dispatch ev-chan new-msg)) ;; TODO: block with timeout when notifying players (doseq [notify-msg (:notify ret)] (players/notify notify-chan notify-msg)))) (defn start [{:as router-ctx :keys [ev-chan handler-wrapper-fn max-render-interval]}] (let [handler-wrapper (if handler-wrapper-fn (handler-wrapper-fn router-ctx) (fn [handler] (go (handler))))] (go-loop [] (when-let [msg ( (transit/write writer game-state) js/lzwEncode js/encodeURIComponent js/unescape (base64/encodeString true)))) (defn decode-game-state [encoded-game-state] (let [reader (transit/reader :json) transit-game-state (-> encoded-game-state (base64/decodeString true) js/escape js/decodeURIComponent js/lzwDecode)] (transit/read reader transit-game-state))) ;; TODO: move load-encoded-game-state! and set-url-game-state! back to app ns once ;; lzw works on node (defn load-encoded-game-state! ([{:as app-ctx :keys [conn players]} encoded-game-state] (load-encoded-game-state! app-ctx data/rulesets data/maps data/scenarios encoded-game-state)) ([{:as app-ctx :keys [conn players]} rulesets map-defs scenario-defs encoded-game-state] (->> encoded-game-state decode-game-state (app/load-game-state! app-ctx rulesets map-defs scenario-defs)))) ;; TODO: put URL in paste buffer automatically (defn set-url-game-state! [db] (let [encoded-game-state (->> (app/current-game db) (game/get-game-state db) encode-game-state)] (set! js/window.location.hash encoded-game-state))) ================================================ FILE: src/cljs/zetawar/subs.cljs ================================================ (ns zetawar.subs (:require [datascript.core :as d] [posh.reagent :as posh] [reagent.core :as r] [zetawar.db :refer [e qe]] [zetawar.game :as game] [zetawar.hex :as hex] [zetawar.logging :as log] [zetawar.tiles :as tiles] [zetawar.util :refer [breakpoint inspect select-values]]) (:require-macros [zetawar.subs :refer [deftrack]])) ;; TODO: add param asserts to check params for better error messages? ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; App (deftrack app-eid [conn] (ffirst @(posh/q '[:find ?a :where [?a :app/game]] conn))) (deftrack app [conn] @(posh/pull conn '[*] @(app-eid conn))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Game (deftrack game-eid [conn] (-> @(app conn) :app/game e)) (def game-pull [:game/id :game/self-repair :game/credits-per-base :game/max-count-per-unit :game/scenario-id {:game/map []} {:game/factions []} :game/starting-faction :game/current-faction :game/round]) (deftrack game [conn] @(posh/pull conn game-pull @(game-eid conn))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Map (deftrack game-map-eid [conn] (-> @(game conn) :game/map e)) (deftrack game-map [conn] @(posh/pull conn '[:map/description] @(game-map-eid conn))) ;; TODO: use terrains output instead of running a separate query (deftrack terrain-eid-at [conn q r] (let [game-eid' @(game-eid conn) idx (game/game-pos-idx game-eid' q r)] (ffirst @(posh/q '[:find ?u :in $ ?idx :where [?u :terrain/game-pos-idx ?idx]] conn (game/game-pos-idx game-eid' q r))))) (def terrain-pull [:terrain/q :terrain/r {:terrain/type [:terrain-type/id :terrain-type/image :terrain-type/can-build] :terrain/owner [:faction/color]}]) ;; TODO: use terrains output instead of running a separate query (deftrack terrain-at [conn q r] (when-let [terrain-eid @(terrain-eid-at conn q r)] @(posh/pull conn terrain-pull terrain-eid))) (deftrack terrains [conn] (let [map-eid' @(game-map-eid conn)] (:map/terrains @(posh/pull conn [{:map/terrains terrain-pull}] map-eid')))) (deftrack map-width [conn] (or (->> @(terrains conn) (map :terrain/q) (apply max)) 0)) (deftrack map-height [conn] (or (->> @(terrains conn) (map :terrain/r) (apply max)) 0)) (deftrack map-width-px [conn] (+ tiles/odd-row-column-offset (* tiles/width (inc @(map-width conn))))) (deftrack map-height-px [conn] (+ tiles/height (* tiles/row-offset @(map-height conn)))) ;; TODO: use terrains output instead of running a separate query (defn current-base-locations [conn] (posh/q '[:find ?q ?r :where [_ :app/game ?g] [?g :game/map ?m] [?g :game/current-faction ?f] [?t :terrain/owner ?f] [?m :map/terrains ?t] [?t :terrain/q ?q] [?t :terrain/r ?r]] conn {:cache :forever})) (deftrack current-base? [conn q r] (contains? @(current-base-locations conn) [q r])) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Factions (deftrack faction-eids [conn] (into [] (map e) (:game/factions @(game conn)))) (def faction-pull '[:faction/color :faction/credits :faction/player-type :faction/ai :faction/next-faction :faction/order]) (deftrack factions-by-eid [conn] (->> @(faction-eids conn) (map (fn [eid] [eid @(posh/pull conn faction-pull eid)])) (into {}))) (deftrack factions [conn] (->> @(factions-by-eid conn) (map second) (sort-by :faction/order) (into []))) (deftrack faction-eid->base-count [conn] (->> @(posh/q '[:find ?f (count ?t) :where [_ :app/game ?g] [?g :game/factions ?f] [?t :terrain/owner ?f]] conn) (into {}))) (deftrack faction-eid->base-being-captured-count [conn] (->> @(posh/q '[:find ?f (count ?t) :where [_ :app/game ?g] [?g :game/factions ?f] [?t :terrain/owner ?f] [(not= ?ef f)] [?ef :faction/units ?u] [?u :unit/terrain ?t] [?u :unit/capturing true]] conn) (into {}))) (deftrack faction-eid->unit-count [conn] (->> @(posh/q '[:find ?f (count ?u) :where [_ :app/game ?g] [?g :game/factions ?f] [?f :faction/units ?u]] conn) (into {}))) (deftrack winning-faction-eid [conn] (let [faction-eids-with-bases (into [] (comp (filter #(> (second %) 0)) (map first)) @(faction-eid->base-count conn)) faction-eids-with-units (into [] (comp (filter #(> (second %) 0)) (map first)) @(faction-eid->unit-count conn))] (when (and (= (count faction-eids-with-bases) 1) (= (count faction-eids-with-units) 1) (= faction-eids-with-bases faction-eids-with-units)) (first faction-eids-with-bases)))) (deftrack current-faction-eid [conn] (e (:game/current-faction @(game conn)))) (defn current-faction [conn] (posh/pull conn faction-pull @(current-faction-eid conn))) (deftrack current-faction-won? [conn] (= @(current-faction-eid conn) @(winning-faction-eid conn))) (deftrack current-base-count [conn] (get @(faction-eid->base-count conn) @(current-faction-eid conn))) (deftrack current-base-being-captured-count [conn] (get @(faction-eid->base-being-captured-count conn) @(current-faction-eid conn))) (deftrack current-unit-count [conn] (get @(faction-eid->unit-count conn) @(current-faction-eid conn))) (deftrack current-income [conn] (let [{:keys [game/credits-per-base]} @(game conn)] (* credits-per-base (- @(current-base-count conn) @(current-base-being-captured-count conn))))) (deftrack enemy-unit-count [conn] (or (ffirst @(posh/q '[:find (count ?u) :in $ ?cf :where [?f :faction/units ?u] [(not= ?f ?cf)]] conn @(current-faction-eid conn))) 0)) (deftrack enemy-base-count [conn] (or (ffirst @(posh/q '[:find (count ?b) :in $ ?cf :where [?b :terrain/owner ?f] [(not= ?f ?cf)]] conn @(current-faction-eid conn))) 0)) (deftrack faction-color-name [faction] (when @faction (-> @faction :faction/color name (str "-name") keyword))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Units (deftrack unit-eid-at [conn q r] (let [game-eid' @(game-eid conn) idx (game/game-pos-idx game-eid' q r)] (ffirst @(posh/q '[:find ?u :in $ ?idx :where [?u :unit/game-pos-idx ?idx]] conn idx)))) (deftrack unit-at? [conn q r] (some? @(unit-eid-at conn q r))) (deftrack unit-at [conn q r] (when-let [unit-eid @(unit-eid-at conn q r)] @(posh/pull conn '[:unit/q :unit/r :unit/round-built :unit/move-count :unit/attack-count :unit/count :unit/repaired :unit/capturing {:faction/_units [:faction/color] :unit/type [:unit-type/id :unit-type/description :unit-type/can-capture :unit-type/can-repair :unit-type/armor-type :unit-type/min-range :unit-type/max-range :unit-type/image]}] unit-eid))) (deftrack current-unit-at [conn q r] (when-let [unit @(unit-at conn q r)] (let [cur-faction-eid @(current-faction-eid conn)] (when (= cur-faction-eid (e (:faction/_units unit))) unit)))) (deftrack current-unit-eid-at [conn q r] (some-> @(current-unit-at conn q r) e)) (deftrack current-unit-at? [conn q r] (some? @(current-unit-at conn q r))) (deftrack unit-color-at [conn q r] (get-in @(unit-at conn q r) [:faction/_units :faction/color])) (deftrack unit-type-at [conn q r] (get-in @(unit-at conn q r) [:unit/type :unit-type/id])) (deftrack enemy-locations [conn] @(posh/q '[:find ?q ?r :in $ ?g ?cf :where [_ :app/game ?g] [?g :game/factions ?f] [?f :faction/units ?u] [?u :unit/q ?q] [?u :unit/r ?r] [(not= ?f ?cf)]] conn @(game-eid conn) @(current-faction-eid conn) {:cache :forever})) (deftrack enemy-at? [conn q r] (contains? @(enemy-locations conn) [q r])) (deftrack enemy-locations-in-range-of [conn q r] (let [attacker @(unit-at conn q r) min-range (get-in attacker [:unit/type :unit-type/min-range]) max-range (get-in attacker [:unit/type :unit-type/max-range])] (into #{} (filter #(let [distance (apply hex/distance q r %)] (and (>= distance min-range) (<= distance max-range)))) @(enemy-locations conn)))) (deftrack any-enemy-in-range-of? [conn q r] (not (empty? @(enemy-locations-in-range-of conn q r)))) (deftrack in-range-of-enemy-at? [conn unit-q unit-r enemy-q enemy-r] (contains? @(enemy-locations-in-range-of conn unit-q unit-r) [enemy-q enemy-r])) (deftrack friend-locations [conn] @(posh/q '[:find ?q ?r :in $ ?g ?cf :where [_ :app/game ?g] [?g :game/factions ?f] [?f :faction/units ?u] [?u :unit/q ?q] [?u :unit/r ?r] [(= ?f ?cf)]] conn @(game-eid conn) @(current-faction-eid conn) {:cache :forever})) (deftrack friend-at? [conn q r] (contains? @(friend-locations conn) [q r])) (deftrack friend-locations-in-range-of [conn q r] (let [unit @(unit-at conn q r) min-range (get-in unit [:unit/type :unit-type/min-range]) max-range (get-in unit [:unit/type :unit-type/max-range])] (into #{} (filter #(let [distance (apply hex/distance q r %)] (and (>= distance min-range) (<= distance max-range)))) @(friend-locations conn)))) (deftrack any-friend-in-range-of? [conn q r] (not (empty? @(friend-locations-in-range-of conn q r)))) (deftrack in-range-of-friend-at? [conn unit-q unit-r friend-q friend-r] (contains? @(friend-locations-in-range-of conn unit-q unit-r) [friend-q friend-r])) (deftrack unit-terrain-effects [conn unit-q unit-r terrain-q terrain-r] (when-let [unit @(unit-at conn unit-q unit-r)] (let [terrain @(terrain-at conn terrain-q terrain-r)] (game/unit-terrain-effects @conn unit terrain)))) (deftrack repairable? [conn q r] (when-let [unit @(unit-at conn q r)] (game/repairable? @conn @(game conn) unit))) (deftrack can-move? [conn q r] (when-let [unit @(unit-at conn q r)] (game/can-move? @conn @(game conn) unit))) (deftrack can-attack? [conn q r] (when-let [unit @(unit-at conn q r)] (and (game/can-attack? @conn @(game conn) unit) @(any-enemy-in-range-of? conn q r)))) (deftrack can-repair? [conn q r] (when-let [unit @(unit-at conn q r)] (game/can-repair? @conn @(game conn) unit))) (deftrack can-field-repair? [conn q r] (when-let [unit @(unit-at conn q r)] (game/can-field-repair? @conn @(game conn) unit))) (deftrack can-capture? [conn q r] (let [unit @(unit-at conn q r) terrain @(terrain-at conn q r)] (and unit terrain (game/can-capture? @conn @(game conn) unit terrain)))) (deftrack unit-can-act? [conn q r] (or @(can-move? conn q r) @(can-attack? conn q r) @(can-repair? conn q r) @(can-field-repair? conn q r) @(can-capture? conn q r))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Selection and target (deftrack selected? [conn q r] (let [app' @(app conn)] (and (= q (:app/selected-q app')) (= r (:app/selected-r app'))))) (deftrack targeted? [conn q r] (let [app' @(app conn)] (and (= q (:app/targeted-q app')) (= r (:app/targeted-r app'))))) (deftrack selected-hex [conn] (-> @(app conn) (select-values [:app/selected-q :app/selected-r]) not-empty)) (deftrack targeted-hex [conn] (-> @(app conn) (select-values [:app/targeted-q :app/targeted-r]) not-empty)) (deftrack selected-unit [conn] (when-let [[q r] @(selected-hex conn)] @(unit-at conn q r))) (deftrack selected-terrain-effects [conn] (when-let [[q r] @(selected-hex conn)] @(unit-terrain-effects conn q r q r))) (deftrack targeted-terrain-effects [conn] (when-let [[terrain-q terrain-r] @(targeted-hex conn)] (let [[unit-q unit-r] @(selected-hex conn)] @(unit-terrain-effects conn unit-q unit-r terrain-q terrain-r)))) (deftrack unit-selected? [conn] (when-let [[q r] @(selected-hex conn)] @(unit-at? conn q r))) (deftrack selected-can-move? [conn] (when-let [[q r] @(selected-hex conn)] @(can-move? conn q r))) (deftrack selected-can-attack? [conn] (when-let [[q r] @(selected-hex conn)] @(can-attack? conn q r))) (deftrack selected-can-repair? [conn] (when-let [[q r] @(selected-hex conn)] @(can-repair? conn q r))) (deftrack selected-can-field-repair? [conn] (when-let [[q r] @(selected-hex conn)] @(can-field-repair? conn q r))) (deftrack has-repairable-armor-type? [conn targeted-q targeted-r] (when-let [[selected-q selected-r] @(selected-hex conn)] (game/has-repairable-armor-type? @conn @(game conn) @(unit-at conn selected-q selected-r) @(unit-at conn targeted-q targeted-r)))) (deftrack selected-can-capture? [conn] (when-let [[q r] @(selected-hex conn)] @(can-capture? conn q r))) (deftrack selected-can-build? [conn] (when-let [[q r] @(selected-hex conn)] (and (not @(unit-selected? conn)) @(current-base? conn q r)))) (deftrack valid-destinations-for-selected [conn] (if @(selected-can-move? conn) (let [db @conn game' (d/entity db @(game-eid conn)) [q r] @(selected-hex conn) unit (game/unit-at db game' q r)] (game/valid-destinations db game' unit)) #{})) (deftrack valid-destination-for-selected? [conn q r] (contains? @(valid-destinations-for-selected conn) [q r])) (deftrack selected-can-move-to-targeted? [conn] (when-let [[q r] @(targeted-hex conn)] (and @(selected-can-move? conn) (contains? @(valid-destinations-for-selected conn) [q r])))) (deftrack enemy-in-range-of-selected? [conn q r] (when-let [[selected-q selected-r] @(selected-hex conn)] @(in-range-of-enemy-at? conn selected-q selected-r q r))) (deftrack friend-in-range-of-selected? [conn q r] (when-let [[selected-q selected-r] @(selected-hex conn)] @(in-range-of-friend-at? conn selected-q selected-r q r))) (deftrack repairable-friend-in-range-of-selected? [conn q r] (when-let [[selected-q selected-r] @(selected-hex conn)] (and @(in-range-of-friend-at? conn selected-q selected-r q r) @(repairable? conn q r)))) (deftrack selected-can-attack-targeted? [conn] (when-let [[q r] @(targeted-hex conn)] (and @(selected-can-attack? conn) @(enemy-in-range-of-selected? conn q r)))) (deftrack selected-can-repair-targeted? [conn] (when-let [[targeted-q targeted-r] @(targeted-hex conn)] (and @(selected-can-field-repair? conn) @(friend-in-range-of-selected? conn targeted-q targeted-r) @(repairable? conn targeted-q targeted-r) @(has-repairable-armor-type? conn targeted-q targeted-r)))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Clickable (deftrack clickable? [conn q r] (or @(valid-destination-for-selected? conn q r) @(enemy-in-range-of-selected? conn q r) @(unit-can-act? conn q r) (and @(current-base? conn q r) (not @(unit-at? conn q r))) (and @(repairable-friend-in-range-of-selected? conn q r) @(selected-can-field-repair? conn) @(has-repairable-armor-type? conn q r)))) ;;; Unit construction (deftrack available-unit-type-eids [conn] (when-let [[sel-q sel-r] @(selected-hex conn)] (let [selected-base (e @(terrain-at conn sel-q sel-r))] (->> @(posh/q '[:find ?ut :in $ ?g ?t :where [_ :app/game ?g] [?g :game/current-faction ?f] [?f :faction/credits ?credits] [?ut :unit-type/cost ?cost] [?ut :unit-type/id ?unit-type-id] [?t :terrain/type ?tt] [?tt :terrain-type/can-build ?ut]] conn @(game-eid conn) selected-base {:cache :forever}) (map first) (into []))))) (deftrack available-unit-types [conn] (let [{:keys [faction/credits]} @(current-faction conn)] (->> @(available-unit-type-eids conn) (map (fn [ut-eid] (let [ut @(posh/pull conn '[*] ut-eid) affordable (<= (:unit-type/cost ut) credits)] ;; TODO: make affordable a namespaced key (?) (assoc ut :affordable affordable)))) (sort-by :unit-type/cost) (into [])))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Unit picker (deftrack picking-unit? [conn] (:app/picking-unit @(app conn))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Win message (deftrack show-win-message? [conn] (and @(current-faction-won? conn) (not (:faction/ai @(current-faction conn))) (not (:app/hide-win-message @(app conn))))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Faction configuration (deftrack faction-to-configure [conn] (some->> @(app conn) :app/configuring-faction e (get @(factions-by-eid conn)))) (deftrack configuring-faction? [conn] (some? @(faction-to-configure conn))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; New game configuration (deftrack configuring-new-game? [conn] (:app/configuring-new-game @(app conn))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Tile coordinates (deftrack hover-hex [conn] (-> @(app conn) (select-values [:app/hover-q :app/hover-r]) not-empty)) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; End turn (deftrack available-moves-left? [conn] (some (fn [[q r] coordinates] @(unit-can-act? conn q r)) @(friend-locations conn))) (deftrack show-end-turn-alert? [conn] (:app/end-turn-alert @(app conn))) ================================================ FILE: src/cljs/zetawar/system/datascript.cljs ================================================ (ns zetawar.system.datascript (:require [datascript.core :as d] [integrant.core :as ig])) (defmethod ig/init-key :zetawar.system/datascript [_ opts] (let [{:keys [schema]} opts] {:schema schema :conn (d/create-conn schema)})) (defmethod ig/resume-key :zetawar.system/datascript [_ opts old-opts old-impl] (let [{:keys [schema]} opts old-schema (:schema old-opts)] (if (= schema old-schema) old-impl {:schema schema :conn (d/create-conn schema)}))) ================================================ FILE: src/cljs/zetawar/system/game.cljs ================================================ (ns zetawar.system.game (:require [integrant.core :as ig] [zetawar.logging :as log] [zetawar.router :as router])) ;; TODO: setup initial game + load game state (move from core) (defmethod ig/init-key :zetawar.system/game [_ opts] (let [{:keys [datascript players router]} opts {:keys [conn]} datascript {:keys [ev-chan notify-pub]} router] {:conn conn :players players :ev-chan ev-chan :notify-pub notify-pub})) ================================================ FILE: src/cljs/zetawar/system/game_views.cljs ================================================ (ns zetawar.system.game-views (:require [integrant.core :as ig] [posh.reagent :as posh] [tongue.core :as tongue] [zetawar.data :as data] [zetawar.logging :as log] [zetawar.router :as router])) ;; TODO: start Reagent components when running in the browser (defmethod ig/init-key :zetawar.system/game-views [_ opts] (let [{:keys [datascript router locale]} opts {:keys [conn]} datascript {:keys [ev-chan]} router dispatch #(router/dispatch ev-chan %) translate (-> data/dicts tongue/build-translate (partial locale))] (posh/posh! conn) {:conn conn :dispatch dispatch :translate translate})) (defmethod ig/resume-key :zetawar.system/game-views [_ opts old-opts old-impl] (let [{:keys [datascript router locale]} opts {:keys [conn]} datascript {:keys [ev-chan]} router old-conn (get-in old-opts [:datascript :conn]) dispatch #(router/dispatch ev-chan %) translate (-> data/dicts tongue/build-translate (partial locale))] (when-not (= conn old-conn) (posh/posh! conn)) {:conn conn :dispatch dispatch :translate translate})) ================================================ FILE: src/cljs/zetawar/system/players.cljs ================================================ (ns zetawar.system.players (:require [integrant.core :as ig] [zetawar.players :as players])) (defmethod ig/init-key :zetawar.system/players [_ opts] (atom {})) ;; TODO: re-enable once game setup is part of Integrant system #_(defmethod ig/halt-key! :zetawar.system/players [_ players] (doseq [player players] (players/stop player))) ================================================ FILE: src/cljs/zetawar/system/reagent.cljs ================================================ (ns zetawar.system.reagent (:require [integrant.core :as ig] [zetawar.logging :as log] [zetawar.router.reagent])) (defmethod ig/init-key :zetawar.system/reagent [_ opts] {:handler-wrapper-fn zetawar.router.reagent/handler-wrapper-fn}) ================================================ FILE: src/cljs/zetawar/system/router.cljs ================================================ (ns zetawar.system.router (:require [cljs.core.async :as async] [integrant.core :as ig] [zetawar.router :as router])) (defmethod ig/init-key :zetawar.system/router [_ opts] (let [{:keys [datascript renderer players]} opts {:keys [conn]} datascript {:keys [handler-wrapper-fn]} renderer ev-chan (async/chan 100) notify-chan (async/chan) notify-pub (async/pub notify-chan #(nth % 1))] (router/start {:ev-chan ev-chan :handler-wrapper-fn handler-wrapper-fn :max-render-interval 200 :notify-chan notify-chan :notify-pub notify-pub :conn conn :players players}) {:ev-chan ev-chan :notify-chan notify-chan :notify-pub notify-pub})) (defmethod ig/halt-key! :zetawar.system/router [_ router] (let [{:keys [ev-chan notify-chan notify-pub]} router] (async/close! ev-chan) (async/close! notify-chan))) ================================================ FILE: src/cljs/zetawar/system/spec.cljs ================================================ (ns zetawar.system.spec (:require [cljs.core.async :as async] [cljs.core.async.impl.protocols :as async.protocols] [clojure.spec :as s] [clojure.spec.impl.gen :as gen] [clojure.test.check] [datascript.core :as d])) ;; Logger (s/def :zetawar.system/logger nil?) ;; DataScript (s/def :zetawar.system.datascript/schema (s/with-gen map? #(gen/return {}))) (s/def :zetawar.system.datascript/conn (s/with-gen d/conn? #(gen/return (d/create-conn {})))) (s/def :zetawar.system/datascript (s/keys :req-un [:zetawar.system.datascript/schema :zetawar.system.datascript/conn])) ;; Players (s/def :zetawar.system/players (s/with-gen (s/and #(satisfies? IDeref %) #(map? (deref %))) #(gen/fmap (fn [m] (atom m)) (gen/map (gen/keyword) (gen/any-printable))))) ;; Router (s/def :zetawar.system.router/ev-chan (s/with-gen (s/and #(satisfies? async.protocols/ReadPort %) #(satisfies? async.protocols/WritePort %)) #(gen/return (async/chan)))) (s/def :zetawar.system.router/notify-chan (s/with-gen #(satisfies? async.protocols/WritePort %) #(gen/return (async/chan)))) (s/def :zetawar.system.router/notify-pub (s/with-gen #(satisfies? async/Pub %) #(gen/return (let [notify-chan (async/chan)] (async/pub notify-chan (fn [x] (nth x 1))))))) (s/def :zetawar.system/router (s/keys :req-un [:zetawar.system.datascript/conn :zetawar.system/players :zetawar.system.router/ev-chan :zetawar.system.router/notify-chan :zetawar.system.router/notify-pub])) ;; Views (s/def :zetawar.system.views/dispatch fn?) (s/def :zetawar.system.views/translate fn?) (s/def :zetawar.system/views (s/keys :req-un [:zetawar.system.datascript/conn :zetawar.system.views/dispatch :zetawar.system.views/translate])) ;; System (s/def :zetawar/system (s/keys :req-un [:zetawar.system/logger :zetawar.system/datascript :zetawar.system/players :zetawar.system/router :zetawar.system/views])) ================================================ FILE: src/cljs/zetawar/system.cljs ================================================ (ns zetawar.system (:require [integrant.core :as ig] [zetawar.db :as db])) ;; TODO: rename to browser-cfg (def game-config {:zetawar.system/datascript {:schema db/schema} :zetawar.system/reagent {} :zetawar.system/players {} :zetawar.system/router {:datascript (ig/ref :zetawar.system/datascript) :renderer (ig/ref :zetawar.system/reagent) :players (ig/ref :zetawar.system/players)} :zetawar.system/game {:datascript (ig/ref :zetawar.system/datascript) :router (ig/ref :zetawar.system/router) :players (ig/ref :zetawar.system/players)} :zetawar.system/game-views {:datascript (ig/ref :zetawar.system/datascript) :router (ig/ref :zetawar.system/router) :locale :en}}) ;; TODO: add cli-cfg ================================================ FILE: src/cljs/zetawar/tiles.cljs ================================================ (ns zetawar.tiles) (def width 32) (def height 34) (def row-offset 26) (def odd-row-column-offset (/ width 2)) (def offset->pixel (memoize (fn [q r] [(cond-> (* q width) (odd? r) (+ odd-row-column-offset)) (* r row-offset)]))) ================================================ FILE: src/cljs/zetawar/views.cljs ================================================ (ns zetawar.views (:require [cljsjs.clipboard] [cljsjs.react-bootstrap] [clojure.string :as string] [datascript.core :as d] [posh.reagent :as posh] [reagent.core :as r :refer [with-let]] [zetawar.data :as data] [zetawar.db :refer [e qe]] [zetawar.events.ui :as events.ui] [zetawar.game :as game] [zetawar.logging :as log] [zetawar.players :as players] [zetawar.site :as site] [zetawar.subs :as subs] [zetawar.tiles :as tiles] [zetawar.util :refer [breakpoint inspect only oonly]] [zetawar.views.common :refer [footer navbar]])) (defn tile-border [{:as view-ctx :keys [conn]} q r] (let [[x y] (tiles/offset->pixel q r)] [:g {:id (str "border-" q "," r)} (cond ;; Selected @(subs/selected? conn q r) [:image {:x x :y y :width tiles/width :height tiles/height :xlink-href (site/prefix "/images/game/borders/selected.png")}] ;; Enemy unit targeted (and @(subs/targeted? conn q r) @(subs/enemy-at? conn q r)) [:image {:x x :y y :width tiles/width :height tiles/height :xlink-href (site/prefix "/images/game/borders/targeted-enemy.png")}] ;; Friend unit targeted (for repair) (and @(subs/targeted? conn q r) @(subs/friend-at? conn q r)) [:image {:x x :y y :width tiles/width :height tiles/height :xlink-href (site/prefix "/images/game/borders/targeted-friend.png")}] ;; Terrain targeted @(subs/targeted? conn q r) [:image {:x x :y y :width tiles/width :height tiles/height :xlink-href (site/prefix "/images/game/borders/selected.png")}])])) (defn unit-image [unit] (let [color-name (-> unit game/unit-color name)] ;; TODO: return placeholder if terrain image is not found (some-> unit (get-in [:unit/type :unit-type/image]) (string/replace "COLOR" color-name)))) (defn board-unit [{:as view-ctx :keys [conn dispatch]} q r] (when-let [unit @(subs/unit-at conn q r)] (let [[x y] (tiles/offset->pixel q r) image (unit-image unit)] [:g {:id (str "unit-" (e unit))} [:image {:x x :y y :width tiles/width :height tiles/height :xlink-href (site/prefix "/images/game/" image) :on-click #(dispatch [::events.ui/select-hex q r])}] (when (:unit/capturing unit) [:image {:x x :y y :width tiles/width :height tiles/height :xlink-href (site/prefix "/images/game/capturing.gif")}]) [:image {:x x :y y :width tiles/width :height tiles/height :xlink-href (site/prefix "/images/game/health/" (:unit/count unit) ".png")}]]))) (defn tile-mask [{:as view-ctx :keys [conn]} q r] (let [[x y] (tiles/offset->pixel q r) show (or ;; No unit selected and tile contains current unit with no actions (and (not @(subs/unit-selected? conn)) @(subs/current-unit-at? conn q r) (not @(subs/unit-can-act? conn q r))) ;; Unit selected and tile is a valid attack, repair, or move target (and @(subs/unit-selected? conn) (not @(subs/selected? conn q r)) (not @(subs/enemy-in-range-of-selected? conn q r)) (not (and @(subs/repairable-friend-in-range-of-selected? conn q r) @(subs/selected-can-field-repair? conn) @(subs/has-repairable-armor-type? conn q r))) (not @(subs/valid-destination-for-selected? conn q r))))] [:image {:visibility (if show "visible" "hidden") :x x :y y :width tiles/width :height tiles/height :xlink-href (site/prefix "/images/game/mask.png")}])) (defn terrain-image [terrain] (let [color-name (-> terrain (get-in [:terrain/owner :faction/color]) (or :none) name)] ;; TODO: return placeholder if terrain image is not found (some-> terrain (get-in [:terrain/type :terrain-type/image]) (string/replace "COLOR" color-name)))) (defn terrain-tile [view-ctx terrain q r] (let [[x y] (tiles/offset->pixel q r) image (terrain-image terrain)] [:image {:x x :y y :width tiles/width :height tiles/height :xlink-href (site/prefix "/images/game/" image)}])) (defn tile [{:as view-ctx :keys [conn dispatch]} terrain] (let [{:keys [terrain/q terrain/r]} terrain] ^{:key (str q "," r)} [:g {:on-click #(dispatch [::events.ui/select-hex q r]) :on-mouse-enter #(dispatch [::events.ui/hover-hex-enter q r]) :on-mouse-leave #(dispatch [::events.ui/hover-hex-leave q r]) :cursor (if @(subs/clickable? conn q r) "pointer" "default")} [terrain-tile view-ctx terrain q r] [tile-border view-ctx q r] [board-unit view-ctx q r] [tile-mask view-ctx q r]])) (defn tiles [{:as view-ctx :keys [conn]}] (into [:g] (for [terrain @(subs/terrains conn)] [tile view-ctx terrain]))) (defn board [{:as view-ctx :keys [conn]}] [:svg#board {:width @(subs/map-width-px conn) :height @(subs/map-height-px conn)} [tiles view-ctx]]) (defn faction-credits [{:as view-ctx :keys [conn translate]}] (let [{:keys [faction/credits]} @(subs/current-faction conn) {:keys [map/credits-per-base]} @(subs/game-map conn) income @(subs/current-income conn)] [:p#faction-credits [:strong (str credits " " (translate :credits-label))] [:span.text-muted.pull-right (str "+" income)]])) (defn copy-url-link [{:as view-ctx :keys [conn translate]}] (let [clipboard (atom nil) text-fn (fn [] js/window.location)] (r/create-class {:component-did-mount (fn [this] (reset! clipboard (js/Clipboard. (r/dom-node this) #js {"text" text-fn}))) :component-will-unmount (fn [this] (.destroy @clipboard) (reset! clipboard nil)) :reagent-render (fn [this] [:a {:href "#" :on-click #(.preventDefault %)} (translate :copy-game-url-link)])}))) (defn end-turn-alert [{:as view-ctx :keys [conn dispatch translate]}] [:> js/ReactBootstrap.Modal {:show @(subs/show-end-turn-alert? conn) :on-hide #(dispatch [::events.ui/hide-end-turn-alert])} [:> js/ReactBootstrap.Modal.Body (translate :end-turn-alert)] [:> js/ReactBootstrap.Modal.Footer [:div.btn.btn-default {:on-click (fn [e] (.preventDefault e) (dispatch [::events.ui/end-turn]) (dispatch [::events.ui/hide-end-turn-alert]))} (translate :end-turn-confirm)] [:div.btn.btn-default {:on-click #(dispatch [::events.ui/hide-end-turn-alert])} (translate :cancel-button)]]]) (defn faction-status [{:as view-ctx :keys [conn dispatch translate]}] (let [{:keys [app/show-copy-link]} @(subs/app conn) {:keys [game/round]} @(subs/game conn) base-count @(subs/current-base-count conn)] [:div#faction-status ;; TODO: make link red [:a {:href "#" :on-click (fn [e] (.preventDefault e) (if @(subs/available-moves-left? conn) (dispatch [::events.ui/show-end-turn-alert]) (dispatch [::events.ui/end-turn])))} (translate :end-turn-link)] (when show-copy-link [:span " · " [copy-url-link view-ctx]]) [:div.pull-right [:a {:href "#" :on-click (fn [e] (.preventDefault e) (dispatch [::events.ui/show-new-game-settings]))} (translate :new-game-link)] " · " (str (translate :round-label) " " round)]])) (defn faction-actions [{:as view-ctx :keys [conn dispatch translate]}] ;; TODO: replace query with something from subs ns (let [[round current-color] (-> @(posh/q '[:find ?round ?current-color :where [?g :game/round ?round] [?g :game/current-faction ?f] [?f :faction/color ?current-color]] conn) first) {:keys [faction/credits]} @(subs/current-faction conn)] [:div#faction-actions (when @(subs/selected-can-move-to-targeted? conn) [:p [:button.btn.btn-primary.btn-block {:on-click #(dispatch [::events.ui/move-selected-unit])} (translate :move-unit-button)]]) (when @(subs/selected-can-build? conn) [:p [:button.btn.btn-primary.btn-block {:on-click #(dispatch [::events.ui/show-unit-picker])} (translate :build-unit-button)]]) (when @(subs/selected-can-attack-targeted? conn) [:p [:button.btn.btn-danger.btn-block {:on-click #(dispatch [::events.ui/attack-targeted])} (translate :attack-unit-button)]]) (when @(subs/selected-can-repair? conn) [:p [:button.btn.btn-success.btn-block {:on-click #(dispatch [::events.ui/repair-selected])} (translate :repair-unit-button)]]) (when @(subs/selected-can-repair-targeted? conn) [:p [:button.btn.btn-success.btn-block {:on-click #(dispatch [::events.ui/repair-targeted])} (translate :field-repair-button)]]) (when @(subs/selected-can-capture? conn) [:p [:button.btn.btn-primary.btn-block {:on-click #(dispatch [::events.ui/capture-selected])} (translate :capture-base-button)]]) ;; TODO: cleanup conditionals ;; TODO: make help text a separate component (when (not (or @(subs/selected-can-move? conn) @(subs/selected-can-build? conn) @(subs/selected-can-attack? conn) @(subs/selected-can-repair? conn) @(subs/selected-can-capture? conn))) [:p.hidden-xs.hidden-sm (translate :select-unit-or-base-tip)]) (when (and (or @(subs/selected-can-move? conn) @(subs/selected-can-attack? conn) @(subs/selected-can-repair? conn)) (not (or @(subs/selected-can-move-to-targeted? conn) @(subs/selected-can-attack-targeted? conn) @(subs/selected-can-repair-targeted? conn)))) [:p.hidden-xs.hidden-sm (translate :select-target-or-destination-tip)]) ;; TODO: only display when starting faction is active (when (and (= round 1) (not @(subs/selected-hex conn))) [:p.hidden-xs.hidden-sm {:dangerouslySetInnerHTML {:__html (translate :multiplayer-tip)}}])])) (defn faction-list [{:as view-ctx :keys [conn dispatch translate]}] (into [:ul.list-group] (for [faction @(subs/factions conn)] (let [faction-eid (e faction) color (-> faction :faction/color name string/capitalize) active (= faction-eid @(subs/current-faction-eid conn)) li-class (if active "list-group-item active" "list-group-item") icon-class (if (:faction/ai faction) "fa fa-fw fa-laptop clickable" "fa fa-fw fa-user clickable")] [:li {:class li-class} color " " (when active [:span.fa.fa-angle-double-left {:aria-hidden true}]) [:div.pull-right [:span {:class icon-class :aria-hidden true :on-click #(dispatch [::events.ui/configure-faction faction]) :title (translate :configure-faction-tip)}]]])))) (defn status-info [{:as view-ctx :keys [conn translate]}] [:div (let [[sel-q sel-r] @(subs/selected-hex conn) [tar-q tar-r] @(subs/targeted-hex conn) [sel-mc sel-at sel-ar] @(subs/selected-terrain-effects conn) [tar-mc tar-at tar-ar] @(subs/targeted-terrain-effects conn) [hover-q hover-r] @(subs/hover-hex conn)] [:span (translate :selected-label) (if sel-q [:span [:abbr {:title (translate :tile-coordinates-label) :style {:cursor "inherit"}} (str sel-q "," sel-r)] (if sel-mc ;; If selected doesn't contain a unit [:span " (" [:abbr {:title (translate :terrain-effects-label) :style {:cursor "inherit"}} (str sel-mc "," sel-at "," sel-ar)] ")"])] [:span " -"]) " • " (translate :targeted-label) (if tar-q [:span [:abbr {:title (translate :tile-coordinates-label) :style {:cursor "inherit"}} (str tar-q "," tar-r)] " (" [:abbr {:title (translate :terrain-effects-label) :style {:cursor "inherit"}} (str tar-mc "," tar-at "," tar-ar)] ")"] [:span " -"]) [:span.hidden-xs.hidden-sm " • " (translate :hover-tile-location) (if hover-q (str hover-q "," hover-r) "-")]])]) (def armor-type-abbrevs {:unit-type.armor-type/personnel "P" :unit-type.armor-type/armored "Ar" :unit-type.armor-type/naval "N" :unit-type.armor-type/air "Ai"}) ;; TODO: cleanup unit-picker (defn unit-picker [{:as view-ctx :keys [conn dispatch translate]}] (let [unit-types @(subs/available-unit-types conn) cur-faction @(subs/current-faction conn) color (name (:faction/color cur-faction)) hide-picker #(dispatch [::events.ui/hide-unit-picker])] [:> js/ReactBootstrap.Modal {:show @(subs/picking-unit? conn) :on-hide hide-picker} [:> js/ReactBootstrap.Modal.Header {:close-button true} [:> js/ReactBootstrap.Modal.Title (translate :build-title)]] [:> js/ReactBootstrap.Modal.Body [:> js/ReactBootstrap.Table {:bordered true :striped true :condensed true :hover true} [:thead>tr [:th ""] [:th.text-center {:style {:width "12%"}} (translate :armor-type-label)] [:th.text-center {:style {:width "12%"}} (translate :movement-label)] [:th.text-center {:style {:width "12%"}} (translate :armor-label)] [:th.text-center {:style {:width "12%"}} (translate :range-label)] [:th.text-center {:style {:width "12%"}} (translate :attack-label)] [:th.text-center {:style {:width "12%"}} (translate :field-repair-label)]] (into [:tbody] (for [unit-type unit-types] (let [;; TODO: replace with unit-type-image color-or-grey (if (:affordable unit-type) color "unavailable") image (->> (string/replace (:unit-type/image unit-type) "COLOR" color-or-grey) (str "/images/game/")) media-class (if (:affordable unit-type) "media text-left" "media text-left text-muted") {:keys [unit-type/id unit-type/description unit-type/cost unit-type/movement unit-type/armor unit-type/armor-type unit-type/can-capture unit-type/capturing-armor unit-type/min-range unit-type/max-range]} unit-type armor-type-abbrev (armor-type-abbrevs armor-type)] [:tr.text-center.clickable {:on-click #(when (:affordable unit-type) (dispatch [::events.ui/hide-unit-picker]) (dispatch [::events.ui/build-unit id]))} [:td>div {:class media-class} [:div.media-left.media-middle [:img {:src image}]] [:div.media-body [:h4.media-heading description] (str (translate :unit-cost-label) cost)]] [:td (case armor-type :unit-type.armor-type/personnel [:abbr {:title (translate :personnel-name) :style {:cursor "inherit"}} armor-type-abbrev] :unit-type.armor-type/armored [:abbr {:title (translate :armored-name) :style {:cursor "inherit"}} armor-type-abbrev] :unit-type.armor-type/naval [:abbr {:title (translate :naval-name) :style {:cursor "inherit"}} armor-type-abbrev] :unit-type.armor-type/air [:abbr {:title (translate :air-name) :style {:cursor "inherit"}} armor-type-abbrev])] [:td movement] [:td (if can-capture [:abbr {:title (str (translate :while-capturing-label) capturing-armor) :style {:cursor "inherit"}} armor] [:abbr {:title (translate :unit-cannot-capture-bases-label) :style {:cursor "inherit"}} armor])] [:td min-range "-" max-range] (into [:td] (for [unit-strength (:unit-type/strengths unit-type)] (let [{:keys [unit-strength/armor-type unit-strength/attack]} unit-strength armor-type-abbrev (armor-type-abbrevs armor-type)] [:div (str armor-type-abbrev ": " attack)]))) [:td (string/join ", " (for [can-repair (:unit-type/can-repair unit-type)] (armor-type-abbrevs can-repair "")))]])))]] [:> js/ReactBootstrap.Modal.Footer [:div.btn.btn-default {:on-click hide-picker} (translate :cancel-button)]]])) (defn faction-settings [{:as views-ctx :keys [conn dispatch translate]}] (with-let [faction (subs/faction-to-configure conn) faction-color (subs/faction-color-name faction) selected-player-type (r/atom nil) hide-settings (fn [ev] (when ev (.preventDefault ev)) (dispatch [::events.ui/hide-faction-settings])) select-player-type #(reset! selected-player-type (.-target.value %)) set-player-type (fn [ev] (.preventDefault ev) (when-let [player-type-id (->> (or @selected-player-type :human) (keyword 'zetawar.players))] (reset! selected-player-type nil) (dispatch [::events.ui/set-faction-player-type @faction player-type-id])) (dispatch [::events.ui/hide-faction-settings]))] [:> js/ReactBootstrap.Modal {:show (some? @faction) :on-hide hide-settings} [:> js/ReactBootstrap.Modal.Header {:close-button true} [:> js/ReactBootstrap.Modal.Title (translate :configure-faction-title-prefix) (translate @faction-color)]] [:> js/ReactBootstrap.Modal.Body [:form [:div.form-group [:label {:for "player-type"} (translate :player-type-label)] (into [:select.form-control {:id "player-type" :value (or @selected-player-type (some-> @faction :faction/player-type name) "") :on-change select-player-type}] (for [[player-type-id {:keys [description ai]}] players/player-types] [:option {:value (name player-type-id)} description])) [:> js/ReactBootstrap.Modal.Footer [:button.btn.btn-primary {:on-click set-player-type} (translate :save-button)] [:button.btn.btn-default {:on-click hide-settings} (translate :cancel-button)]]]]]])) ;; TODO: move default-scenario-id to data ns? (defn new-game-settings [{:as view-ctx :keys [conn dispatch translate]}] (with-let [default-scenario-id :sterlings-aruba-multiplayer selected-scenario-id (r/atom default-scenario-id) hide-settings (fn [ev] (when ev (.preventDefault ev)) (dispatch [::events.ui/hide-new-game-settings])) select-scenario #(reset! selected-scenario-id (keyword (.-target.value %))) start-new-game #(do (.preventDefault %) (dispatch [::events.ui/start-new-game @selected-scenario-id]) (reset! selected-scenario-id default-scenario-id) (dispatch [::events.ui/hide-new-game-settings]))] [:> js/ReactBootstrap.Modal {:show @(subs/configuring-new-game? conn) :on-hide hide-settings} [:> js/ReactBootstrap.Modal.Header {:close-button true} [:> js/ReactBootstrap.Modal.Title (translate :new-game-title)]] [:> js/ReactBootstrap.Modal.Body [:form [:div.form-group [:label {:for "scenario-id"} (translate :scenario-label)] (into [:select.form-control {:id "scenario-id" :selected (some-> @selected-scenario-id name) :on-change select-scenario}] (for [[scenario-id {:keys [description notes]}] data/scenarios] [:option {:value (name scenario-id)} (if notes (str description ": " notes) description)])) [:> js/ReactBootstrap.Modal.Footer [:button.btn.btn-primary {:on-click start-new-game} (translate :start-button)] [:button.btn.btn-default {:on-click hide-settings} (translate :cancel-button)]]]]]])) (defn alert [{:as view-ctx :keys [conn dispatch]}] (let [{:keys [app/alert-message app/alert-type]} @(subs/app conn) alert-class (str "alert alert-" (some-> alert-type name))] (when alert-message [:div.row [:div.col-md-12 [:div {:class alert-class} [:button.close {:type :button :aria-label "Close" :on-click #(dispatch [::events.ui/hide-alert])} [:span {:aria-hidden true} "×"]] alert-message]]]))) (defn game-interface [view-ctx] [:div.row [:div.col-md-2 [faction-credits view-ctx] [faction-list view-ctx] [faction-actions view-ctx]] [:div.col-md-10 [faction-status view-ctx] [board view-ctx] [status-info view-ctx]]]) (defn app-root [{:as view-ctx :keys [conn dispatch translate]}] [:div [new-game-settings view-ctx] [faction-settings view-ctx] [unit-picker view-ctx] [end-turn-alert view-ctx] ;; TODO: break win dialog out into it's own component ;; TODO: add continue + start new game buttons to win dialog [:> js/ReactBootstrap.Modal {:show @(subs/show-win-message? conn) :on-hide #(dispatch [::events.ui/hide-win-message])} [:> js/ReactBootstrap.Modal.Header [:> js/ReactBootstrap.Modal.Title (translate :win-title)]] [:> js/ReactBootstrap.Modal.Body {:dangerouslySetInnerHTML {:__html (translate :win-body)}}] [:> js/ReactBootstrap.Modal.Footer [:button.btn.btn-default {:on-click #(dispatch [::events.ui/hide-win-message])} (translate :close-button)]]] (navbar "Game") [:div.container [alert view-ctx] [game-interface view-ctx]] (footer)]) ================================================ FILE: src/cljs/zetawar/workspaces/test_cards.cljs ================================================ (ns zetawar.workspaces.test-cards (:require ["react" :as react] [nubank.workspaces.card-types.react :as ct.react] [nubank.workspaces.core :as ws])) ;; simple function to create react elemnents (defn element [name props & children] (apply react/createElement name (clj->js props) children)) (ws/defcard hello-card (ct.react/react-card (element "div" {} "Hello World"))) ================================================ FILE: src/js/custom_ai.js ================================================ ZetawarAI = (function() { var ZetawarAI = {}; ZetawarAI.makeActorContext = function(db, game, actor) { return {}; }; ZetawarAI.scoreActor = function(db, game, actor, actor_ctx) { if (zetawar.js.game.is_base(actor)) { return 100 + Math.floor(Math.random() * 100); } return Math.floor(Math.random() * 100); }; ZetawarAI.makeBaseActionContext = function(db, game, actor_ctx, base) { return actor_ctx; }; ZetawarAI.scoreBaseAction = function(db, game, base, actor_ctx, action) { return Math.floor(Math.random() * 200); }; ZetawarAI.makeUnitActionContext = function(db, game, actor_ctx, unit) { actor_ctx['closest_base'] = zetawar.js.game.closest_capturable_base(db, game, unit); actor_ctx['closest_enemy'] = zetawar.js.game.closest_enemy(db, game, unit); return actor_ctx; }; ZetawarAI.scoreUnitAction = function(db, game, unit, action_ctx, action) { var closestBase = action_ctx.closest_base; var closestEnemy = action_ctx.closest_enemy; var ret = 0; switch (action["type"]) { case "capture-base": return 200; case "attack-unit": return 100; case "move-unit": if (closestBase) { [baseQ, baseR] = zetawar.js.game.terrain_hex(closestBase); toQ = action["to-q"]; toR = action["to-r"]; distanceFromBase = zetawar.js.hex.distance(baseQ, baseR, toQ, toR); ret = 100 - distanceFromBase; } else { [enemyQ, enemyR] = zetawar.js.game.unit_hex(closestEnemy); toQ = action["to-q"]; toR = action["to-r"]; distanceFromEnemy = zetawar.js.hex.distance(enemyQ, enemyR, toQ, toR); ret = 100 - distanceFromEnemy; } } return ret; }; return ZetawarAI; })(); ================================================ FILE: src/js/lzw.js ================================================ // From: https://gist.github.com/revolunet/843889 // LZW-compress a string function lzwEncode(s) { var dict = {}; var data = (s + "").split(""); var out = []; var currChar; var phrase = data[0]; var code = 256; for (var i = 1; i < data.length; i++) { currChar = data[i]; if (dict['_' + phrase + currChar] != null) { phrase += currChar; } else { out.push(phrase.length > 1 ? dict['_' + phrase] : phrase.charCodeAt(0)); dict['_' + phrase + currChar] = code; code++; phrase = currChar; } } out.push(phrase.length > 1 ? dict['_' + phrase] : phrase.charCodeAt(0)); for (var i=0; i (game/valid-moves db game unit) first keys)))) (is (= valid-destinations (into #{} (map :to) (game/valid-moves db game unit)))))) (deftest test-valid-destinations (let [db @(helper/create-scenario-conn :sterlings-aruba-multiplayer) game (app/current-game db) unit (game/unit-at db game 2 2)] (is (= valid-destinations (game/valid-destinations db game unit))))) ;; TODO: add test for check-valid-destination (deftest test-valid-destination? (let [db @(helper/create-scenario-conn :sterlings-aruba-multiplayer) game (app/current-game db) unit (game/unit-at db game 2 2)] (is (= (count valid-destinations) (count (filter #(apply game/valid-destination? db game unit %) valid-destinations)))) (is (= false (game/valid-destination? db game unit 6 6))))) (deftest test-can-move-fns (let [db @(helper/create-scenario-conn :sterlings-aruba-multiplayer) game (app/current-game db) unit (game/unit-at db game 2 2)] ;; TODO: update for state machine changes #_(testing "units that have not yet performed any actions can move" (is (= nil (game/check-can-move db game unit))) (is (= true (game/can-move? db game unit)))) #_(testing "newly built units cannot move" (let [db' (d/db-with db [[:db/add (e unit) :unit/round-built 1]]) unit' (game/unit-at db' game 2 2)] (is (thrown? ExceptionInfo (game/check-can-move db' game unit'))) (is (= false (game/can-move? db' game unit'))))) #_(testing "moved units cannot move again" (let [db' (d/db-with db [[:db/add (e unit) :unit/move-count 1]]) unit' (game/unit-at db' game 2 2)] (is (thrown? ExceptionInfo (game/check-can-move db' game unit'))) (is (= false (game/can-move? db' game unit'))))) #_(testing "units that have already attacked cannot move" (let [db' (d/db-with db [[:db/add (e unit) :unit/attack-count 1]]) unit' (game/unit-at db' game 2 2)] (is (thrown? ExceptionInfo (game/check-can-move db' game unit'))) (is (= false (game/can-move? db' game unit'))))) #_(testing "capturing units cannot move" (let [db' (d/db-with db [[:db/add (e unit) :unit/capturing true]]) unit' (game/unit-at db' game 2 2)] (is (thrown? ExceptionInfo (game/check-can-move db' game unit'))) (is (= false (game/can-move? db' game unit'))))) #_(testing "repaired units cannot move" (let [db' (d/db-with db [[:db/add (e unit) :unit/repaired true]]) unit' (game/unit-at db' game 2 2)] (is (thrown? ExceptionInfo (game/check-can-move db' game unit'))) (is (= false (game/can-move? db' game unit'))))) )) (deftest test-teleport-tx (let [db @(helper/create-scenario-conn :sterlings-aruba-multiplayer) game (app/current-game db) unit (game/unit-at db game 2 2)] (let [db' (d/db-with db (game/teleport-tx db game 2 2 4 4)) teleported-unit (game/unit-at db' game 4 4)] (is (= (e unit) (e teleported-unit))) (is (= 0 (:unit/move-count teleported-unit)))) ;; TODO: test moving to an invalid destination )) (deftest test-move-tx (let [db @(helper/create-scenario-conn :sterlings-aruba-multiplayer) game (app/current-game db) unit (game/unit-at db game 2 2)] (testing "moving to a valid destination" (let [db' (d/db-with db (game/move-tx db game 2 2 4 4)) moved-unit (game/unit-at db' game 4 4)] (is (= (e unit) (e moved-unit))) (is (= 1 (:unit/move-count moved-unit))))) ;; TODO: test moving to an invalid destination )) (deftest test-move! (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer) db @conn game (app/current-game db) game-id (app/current-game-id db) unit (game/unit-at db game 2 2)] (game/move! conn game-id 2 2 4 4) (is (= (e unit) (e (game/unit-at @conn game 4 4)))))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Attack (deftest test-can-attack-fns (let [db @(helper/create-scenario-conn :sterlings-aruba-multiplayer) game (app/current-game db) unit (game/unit-at db game 2 2)] ;; TODO: update for state machine changes #_(testing "units that have not yet performed any actions can attack" (is (= nil (game/check-can-attack db game unit))) (is (= true (game/can-attack? db game unit)))) #_(testing "newly built units cannot attack" (let [db' (d/db-with db [[:db/add (e unit) :unit/round-built 1]]) unit' (game/unit-at db' game 2 2)] (is (thrown? ExceptionInfo (game/check-can-attack db' game unit'))) (is (= false (game/can-attack? db' game unit'))))) #_(testing "moved units can attack" (let [db' (d/db-with db [[:db/add (e unit) :unit/move-count 1]]) unit' (game/unit-at db' game 2 2)] (is (= nil (game/check-can-attack db' game unit'))) (is (= true (game/can-attack? db' game unit'))))) #_(testing "units that have already attacked cannot attack again" (let [db' (d/db-with db [[:db/add (e unit) :unit/attack-count 1]]) unit' (game/unit-at db' game 2 2)] (is (thrown? ExceptionInfo (game/check-can-attack db' game unit'))) (is (= false (game/can-attack? db' game unit'))))) #_(testing "capturing units cannot attack" (let [db' (d/db-with db [[:db/add (e unit) :unit/capturing true]]) unit' (game/unit-at db' game 2 2)] (is (thrown? ExceptionInfo (game/check-can-attack db' game unit'))) (is (= false (game/can-attack? db' game unit'))))) #_(testing "repaired units cannot attack" (let [db' (d/db-with db [[:db/add (e unit) :unit/repaired true]]) unit' (game/unit-at db' game 2 2)] (is (thrown? ExceptionInfo (game/check-can-attack db' game unit'))) (is (= false (game/can-attack? db' game unit'))))) )) (deftest test-in-range-fns (let [db @(helper/create-scenario-conn :sterlings-aruba-multiplayer) game (app/current-game db)] (testing "can attack units that are in range" (let [db' (d/db-with db (game/teleport-tx db game 7 8 3 2)) attacker (game/unit-at db' game 2 2) defender (game/unit-at db' game 3 2)] (is (= nil (game/check-in-range db' attacker defender))) (is (= true (game/in-range? db' attacker defender))))) (testing "cannot attack units that are out of range" (let [attacker (game/unit-at db game 2 2) defender (game/unit-at db game 7 8)] (is (thrown? ExceptionInfo (game/check-in-range db attacker defender))) (is (= false (game/in-range? db attacker defender))))))) (deftest test-attack-tx (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer) game (app/current-game @conn) db (d/db-with @conn (game/teleport-tx @conn game 7 8 3 2))] (testing "attacking unit in range" (let [db' (d/db-with db (game/attack-tx db game 2 2 3 2)) attacker (game/unit-at db' game 2 2) defender (game/unit-at db' game 3 2)] (is (< (:unit/count attacker) 10)) (is (= (:unit/attack-count attacker) 1)) (is (< (:unit/count defender) 10)) (is (= (:unit/attack-count defender) 0)))))) ;; TODO: test attack! ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Repair (deftest test-repair-checking (let [db @(helper/create-scenario-conn :sterlings-aruba-multiplayer) game (app/current-game db) unit (game/unit-at db game 2 2)] (testing "undamaged units cannot be repaired" (is (thrown? ExceptionInfo (game/check-can-repair db game unit))) (is (= false (game/can-repair? db game unit)))) ;; TODO: update for state machine changes #_(testing "damaged units that have not performed any actions can be repaired" (let [db' (d/db-with db [[:db/add (e unit) :unit/count 9]]) unit' (game/unit-at db' game 2 2)] (is (= nil (game/check-can-repair db' game unit'))) (is (= true (game/can-repair? db' game unit'))))) #_(testing "newly built units cannot be repaired" (let [db' (d/db-with db [[:db/add (e unit) :unit/round-built 1]]) unit' (game/unit-at db' game 2 2)] (is (thrown? ExceptionInfo (game/check-can-repair db' game unit'))) (is (= false (game/can-repair? db' game unit'))))) #_(testing "moved units cannot be repaired" (let [db' (d/db-with db [[:db/add (e unit) :unit/move-count 1]]) unit' (game/unit-at db' game 2 2)] (is (thrown? ExceptionInfo (game/check-can-repair db' game unit'))) (is (= false (game/can-repair? db' game unit'))))) #_(testing "units that have already attacked cannot be repaired" (let [db' (d/db-with db [[:db/add (e unit) :unit/attack-count 1]]) unit' (game/unit-at db' game 2 2)] (is (thrown? ExceptionInfo (game/check-can-repair db' game unit'))) (is (= false (game/can-repair? db' game unit'))))) #_(testing "capturing units cannot be repaired" (let [db' (d/db-with db [[:db/add (e unit) :unit/capturing true]]) unit' (game/unit-at db' game 2 2)] (is (thrown? ExceptionInfo (game/check-can-repair db' game unit'))) (is (= false (game/can-repair? db' game unit'))))) #_(testing "already repaired units cannot be repaired" (let [db' (d/db-with db [[:db/add (e unit) :unit/repaired true]]) unit' (game/unit-at db' game 2 2)] (is (thrown? ExceptionInfo (game/check-can-repair db' game unit'))) (is (= false (game/can-repair? db' game unit'))))) )) (deftest test-repair-tx (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer) db @conn game (app/current-game db) unit (game/unit-at db game 2 2) damaged-db (-> db (d/db-with (game/teleport-tx db game 2 2 1 2)) (d/db-with [[:db/add (e unit) :unit/count 9]])) damaged-unit (game/unit-at damaged-db game 1 2)] (testing "repairing damaged unit" (let [repaired-db (d/db-with damaged-db (game/repair-tx damaged-db game damaged-unit)) repaired-unit (game/unit-at repaired-db game 1 2)] (is (= (:unit/count repaired-unit) 10)))))) ;; TODO: test repair! ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Capture (deftest test-can-capture-fns (let [db @(helper/create-scenario-conn :sterlings-aruba-multiplayer) game (app/current-game db) unit (game/unit-at db game 2 2) terrain (game/terrain-at db game 2 2)] (testing "unit not on a base cannot capture" (is (thrown? ExceptionInfo (game/check-capturable db game unit terrain))) (is (= false (game/can-capture? db game unit terrain)))) (testing "unit on already owned base cannot capture" (let [db' (d/db-with db (game/teleport-tx db game 2 2 1 2)) unit' (game/unit-at db' game 1 2) terrain' (game/terrain-at db game 1 2)] (is (thrown? ExceptionInfo (game/check-capturable db' game unit' terrain'))) (is (= false (game/can-capture? db' game unit' terrain'))))) ;; TODO: update for state machine changes #_(testing "unit on unowned base can capture" (let [db' (d/db-with db (game/teleport-tx db game 2 2 2 1)) unit' (game/unit-at db' game 2 1) terrain' (game/terrain-at db' game 2 1)] (is (= nil (game/check-capturable db' game unit' terrain'))) (is (= true (game/can-capture? db' game unit' terrain'))))) #_(testing "unit on enemy base can capture" (let [db' (d/db-with db (game/teleport-tx db game 2 2 7 6)) unit' (game/unit-at db' game 7 6) terrain' (game/terrain-at db' game 7 6)] (is (= nil (game/check-capturable db' game unit' terrain'))) (is (= true (game/can-capture? db' game unit' terrain'))))) #_(testing "units that have attacked cannot capture" (let [db' (d/db-with db (concat (game/teleport-tx db game 2 2 2 1) [[:db/add (e unit) :unit/attack-count 1]])) unit' (game/unit-at db' game 2 1) terrain' (game/terrain-at db' game 2 1)] (is (thrown? ExceptionInfo (game/check-capturable db' game unit' terrain'))) (is (= false (game/can-capture? db' game unit' terrain'))))) #_(testing "repaired units cannot capture" (let [db' (d/db-with db (concat (game/teleport-tx db game 2 2 2 1) [[:db/add (e unit) :unit/repaired true]])) unit' (game/unit-at db' game 2 1) terrain' (game/terrain-at db' game 2 1)] (is (thrown? ExceptionInfo (game/check-capturable db' game unit' terrain'))) (is (= false (game/can-capture? db' game unit' terrain'))))) (testing "already capturing units cannot capture" (let [db' (d/db-with db (concat (game/teleport-tx db game 2 2 2 1) [[:db/add (e unit) :unit/capturing true]])) unit' (game/unit-at db' game 2 1) terrain' (game/terrain-at db' game 2 1)] (is (thrown? ExceptionInfo (game/check-capturable db' game unit' terrain'))) (is (= false (game/can-capture? db' game unit' terrain'))))))) (deftest test-capture-tx (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer) db @conn game (app/current-game db) unit (game/unit-at db game 2 2) moved-db (d/db-with db (game/teleport-tx db game 2 2 2 1)) moved-unit (game/unit-at moved-db game 2 1)] (testing "capturing unowned base" (let [capturing-db (d/db-with moved-db (game/capture-tx moved-db game moved-unit)) capturing-unit (game/unit-at capturing-db game 2 1)] (is (= (:unit/capturing capturing-unit) true)) (is (= (:unit/capture-round capturing-unit) 2)))))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Build ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; End Turn ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Setup (comment (defcard terrain-types-tx (let [terrains-spec (select-keys data/ruleset [:terrains :plains])] {:terrains-spec terrains-spec :terrain-types-tx (game/terrain-types-tx terrains-spec)})) (defcard units-spec-tx (let [conn (d/create-conn db/schema) units-spec (select-keys data/ruleset [:units :infantry])] (d/transact! conn (game/terrain-types-tx (:terains data/ruleset))) {:units-spec units-spec :unit-types-tx (game/unit-types-tx @conn units-spec)})) (deftest test-map-tx (let [game-id (random-uuid)] (is (= nil (game/map-tx game-id (:sterlings-aruba data/maps)))) )) ) ================================================ FILE: test/cljs/zetawar/subs_test.cljs ================================================ (ns zetawar.subs-test (:require [cljs.test :refer-macros [deftest testing is async use-fixtures]] [datascript.core :as d] [zetawar.app :as app] [zetawar.db :refer [e qe]] [zetawar.game :as game] [zetawar.subs :as subs] [zetawar.test-helper :as helper])) ;; TODO: use fixtures ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; App (deftest test-app-eid (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer) app-eid (ffirst (d/q '[:find ?a :where [?a :app/game]] @conn))] (testing "returned app-eid matches queried app-eid" (is (= app-eid @(subs/app-eid conn)))))) (deftest test-app (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer)] (testing "returned app has expected attributes" (is (:app/game @(subs/app conn)))))) ;; TODO: add show-win-message? test ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Game (deftest test-game-eid (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer) game-eid (ffirst (d/q '[:find ?g :where [_ :app/game ?g]] @conn))] (testing "game-eid returned by subscription is the same as queried game-eid" (is (= game-eid @(subs/game-eid conn)))))) (deftest test-game (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer)] (testing "game returned by subscription has expected attributes" (is (= #{:db/id :game/id :game/scenario-id :game/self-repair :game/map :game/credits-per-base :game/max-count-per-unit :game/starting-faction :game/current-faction :game/factions :game/round} (into #{} (keys @(subs/game conn)))))))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Map (deftest test-game-map-eid (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer) map-eid (ffirst (d/q '[:find ?m :where [_ :app/game ?g] [?g :game/map ?m]] @conn))] (testing "game-map-eid returned by subscription is the same as queried game-map-eid" (is (= map-eid @(subs/game-map-eid conn)))))) (deftest test-game-map (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer)] (testing "game map returned by subscription has expected attributes" (is (= #{:db/id :map/description} (into #{} (keys @(subs/game-map conn)))))))) (deftest test-terrains (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer) terrains @(subs/terrains conn)] (testing "returns expected number of terrains" (is (= 74 (count terrains)))))) (deftest test-current-base-locations (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer) terrains @(subs/terrains conn)] (testing "returns the locations of all the current faction's bases" (is (= #{[1 2]} @(subs/current-base-locations conn)))))) (deftest test-current-base? (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer) terrains @(subs/terrains conn)] (testing "returns true given the coordinates of a base owned by the current faction" (is (= true @(subs/current-base? conn 1 2)))) (testing "returns false given the coordinates of an unowned base" (is (= false @(subs/current-base? conn 2 1)))) (testing "returns false given the coordinates of an enemy base" (is (= false @(subs/current-base? conn 7 6)))) (testing "returns false given the coordinates of a non-base terrain" (is (= false @(subs/current-base? conn 7 6)))))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Factions (deftest test-current-faction-eid (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer) faction-eid (ffirst (d/q '[:find ?f :where [_ :app/game ?g] [?g :game/current-faction ?f]] @conn))] (testing "returned eid is the same as queried eid" (is (= faction-eid @(subs/current-faction-eid conn)))))) (deftest test-current-faction (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer)] (testing "returned faction has expected attributes" (is (= #{:db/id :faction/color :faction/credits :faction/next-faction :faction/ai :faction/order} (into #{} (keys @(subs/current-faction conn)))))))) (deftest test-current-unit-count (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer)] (testing "returns the count of units owned by the current faction (blue)" (is (= 1 @(subs/current-unit-count conn)))) (game/end-turn! conn (app/current-game-id @conn)) (testing "returns the count of units owned by the current faction (red)" (is (= 2 @(subs/current-unit-count conn)))))) (deftest test-current-base-count (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer)] (testing "returns the count of bases owned by the current faction" (is (= 1 @(subs/current-unit-count conn)))))) (deftest test-unit-eid-at (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer) db @conn game (app/current-game db)] (testing "returns eid for unit at specified coordinates" (is (= (:db/id (game/unit-at db game 2 2)) @(subs/unit-eid-at conn 2 2)))) (testing "returns nil if there is no unit at the specified coordinates" (is (= (:db/id (game/unit-at db game 4 4)) @(subs/unit-eid-at conn 4 4)))))) (deftest test-current-unit-eid-at (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer) db @conn game (app/current-game db)] (testing "returns eid for current unit at specified coordinates" (is (= (:db/id (game/unit-at db game 2 2)) @(subs/current-unit-eid-at conn 2 2)))) (testing "returns nil if unit at specified coordinates is an enemy" (is (= nil @(subs/current-unit-eid-at conn 7 8)))) (testing "returns nil if there is no unit at the specified coordinates" (is (= nil @(subs/current-unit-eid-at conn 4 4)))))) (deftest test-unit-at? (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer) db @conn game (app/current-game db)] (testing "returns true if there is a unit at the specified cordinates" (is (= true @(subs/unit-at? conn 2 2)))) (testing "returns false if there is no unit at the specified coordinates" (is (= false @(subs/unit-at? conn 4 4)))))) (deftest test-current-unit-at? (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer) db @conn game (app/current-game db)] (testing "returns true for current unit at specified coordinates" (is (= true @(subs/current-unit-at? conn 2 2)))) (testing "returns false if unit at specified coordinates is an enemy" (is (= false @(subs/current-unit-at? conn 7 8)))) (testing "returns false if there is no unit at the specified coordinates" (is (= false @(subs/current-unit-at? conn 4 4)))))) (deftest test-unit-at (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer) db @conn game (app/current-game db)] (testing "returned unit has expected attributes" (let [unit @(subs/unit-at conn 2 2) unit-keys (keys unit) unit-type-keys (keys (:unit/type unit))] (is (= #{:db/id :unit/q :unit/r :unit/round-built :unit/move-count :unit/attack-count :unit/count :unit/repaired :unit/capturing :unit/type :faction/_units} (into #{} unit-keys))) (is (= #{:db/id :unit-type/id :unit-type/description :unit-type/min-range :unit-type/max-range :unit-type/can-capture :unit-type/armor-type :unit-type/image} (into #{} unit-type-keys))))))) (deftest test-unit-color-at (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer) db @conn game (app/current-game db)] (testing "returns the color for unit at the specified coordinates" (is (= :faction.color/blue @(subs/unit-color-at conn 2 2)))))) (deftest test-unit-type-at (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer) db @conn game (app/current-game db)] (testing "returns the type name for unit at the specified coordinates" (is (= :unit-type.id/infantry @(subs/unit-type-at conn 2 2)))))) (deftest test-enemy-locations (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer) db @conn game (app/current-game db)] (testing "returns the locations of all enemy units" (is (= #{[7 7] [7 8]} @(subs/enemy-locations conn)))))) (deftest test-enemy-at? (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer) db @conn game (app/current-game db)] (testing "returns true if there is an enemy at the specified coordinates" (is (= true @(subs/enemy-at? conn 7 7)))) (testing "returns false if there is not an enemy at the specified coordinates" (is (= false @(subs/enemy-at? conn 4 4)))))) (deftest test-enemy-locations-in-range-of (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer) db @conn game (app/current-game db)] (testing "returns enemy locations in range of unit at specified coordinates" (is (= #{} @(subs/enemy-locations-in-range-of conn 2 2))) (d/transact! conn (game/teleport-tx db game 2 2 6 8)) (is (= #{[7 8]} @(subs/enemy-locations-in-range-of conn 6 8)))))) (deftest test-any-enemy-in-range-of? (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer) db @conn game (app/current-game db)] (testing "returns false if no enemies are in range of unit at specified coordinates" (is (= false @(subs/any-enemy-in-range-of? conn 2 2)))) (testing "returns true if enemies are in range of unit at specified coordinates" (d/transact! conn (game/teleport-tx db game 2 2 6 8)) (is (= true @(subs/any-enemy-in-range-of? conn 6 8)))))) ;; TODO: implement check tests ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;;; Selection (deftest test-selected? (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer) db @conn game (app/current-game db) app (app/root db)] (d/transact! conn [{:db/id (e app) :app/selected-q 1 :app/selected-r 2}]) (testing "returns true if specified coordinates are selected" (is (= true @(subs/selected? conn 1 2)))) (testing "returns false if specified coordinates are selected" (is (= false @(subs/selected? conn 2 2)))))) (deftest test-targeted? (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer) db @conn game (app/current-game db) app (app/root db)] (d/transact! conn [{:db/id (e app) :app/targeted-q 1 :app/targeted-r 2}]) (testing "returns true if specified coordinates are targeted" (is (= true @(subs/targeted? conn 1 2)))) (testing "returns false if specified coordinates are targeted" (is (= false @(subs/targeted? conn 2 2)))))) (deftest test-selected-hex (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer) db @conn game (app/current-game db) app (app/root db)] (testing "returns selected coordinates" (is (= nil @(subs/selected-hex conn))) (d/transact! conn [{:db/id (e app) :app/selected-q 1 :app/selected-r 2}]) (is (= [1 2] @(subs/selected-hex conn))) (d/transact! conn [{:db/id (e app) :app/selected-q 2 :app/selected-r 1}]) (is (= [2 1] @(subs/selected-hex conn)))))) (deftest test-targeted-hex (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer) db @conn game (app/current-game db) app (app/root db)] (testing "returns selected coordinates" (is (= nil @(subs/targeted-hex conn))) (d/transact! conn [{:db/id (e app) :app/targeted-q 1 :app/targeted-r 2}]) (is (= [1 2] @(subs/targeted-hex conn))) (d/transact! conn [{:db/id (e app) :app/targeted-q 2 :app/targeted-r 1}]) (is (= [2 1] @(subs/targeted-hex conn)))))) ;; TODO: combine with copy in game-test (def valid-destinations #{[0 1] [3 4] [1 2] [1 5] [3 2] [2 4] [4 2] [1 3] [2 3] [3 1] [0 2] [3 0] [1 1] [3 3] [1 4] [0 3] [2 1] [4 4] [1 0] [2 0] [2 5]}) (deftest test-valid-destinations-for-selected (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer) db @conn game (app/current-game db) app (app/root db)] (testing "returns valid destinations for selected unit" (is (= #{} @(subs/valid-destinations-for-selected conn))) (d/transact! conn [{:db/id (e app) :app/selected-q 2 :app/selected-r 2}]) (is (= valid-destinations @(subs/valid-destinations-for-selected conn)))))) ;; TODO: test valid-destination-for-selected? (deftest test-selected-can-move-to-targeted? (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer) db @conn game (app/current-game db) app (app/root db)] (testing "returns true if selected unit can move to targeted location" (d/transact! conn [{:db/id (e app) :app/selected-q 2 :app/selected-r 2 :app/targeted-q 4 :app/targeted-r 4}]) (is (= true @(subs/selected-can-move-to-targeted? conn)))) (testing "returns false if selected unit cannot move to targeted location" (d/transact! conn [{:db/id (e app) :app/selected-q 2 :app/selected-r 2 :app/targeted-q 5 :app/targeted-r 5}]) (is (= false @(subs/selected-can-move-to-targeted? conn)))))) (deftest test-enemy-in-range-of-selected? (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer) db @conn game (app/current-game db) app (app/root db)] (testing "returns true if selected unit is in range of enemy at specified coordinates" (d/transact! conn (conj (game/teleport-tx db game 2 2 6 8) {:db/id (e app) :app/selected-q 6 :app/selected-r 8})) (is (= true @(subs/enemy-in-range-of-selected? conn 7 8)))) (testing "returns false if selected unit is not in range of enemy at specified coordinates" (d/transact! conn [{:db/id (e app) :app/selected-q 6 :app/selected-r 8}]) (is (= false @(subs/enemy-in-range-of-selected? conn 7 7)))))) (deftest test-selected-can-attack-targeted? (let [conn (helper/create-scenario-conn :sterlings-aruba-multiplayer) db @conn game (app/current-game db) app (app/root db)] (testing "returns true if selected unit can attack targeted unit" (d/transact! conn (conj (game/teleport-tx db game 2 2 6 8) {:db/id (e app) :app/selected-q 6 :app/selected-r 8 :app/targeted-q 7 :app/targeted-r 8})) (is (= true @(subs/selected-can-attack-targeted? conn)))) (testing "returns false if selected unit cannot attack targeted unit" (d/transact! conn [{:db/id (e app) :app/selected-q 6 :app/selected-r 8 :app/targeted-q 7 :app/targeted-r 7}]) (is (= false @(subs/selected-can-attack-targeted? conn)))))) ================================================ FILE: test/cljs/zetawar/test_helper.cljs ================================================ (ns zetawar.test-helper (:require [datascript.core :as d] [posh.reagent :as posh] [reagent.core :as r] [zetawar.app :as app] [zetawar.db :as db] [zetawar.game :as game])) (defn create-scenario-conn [scenario-id] (let [conn (d/create-conn db/schema)] (posh/posh! conn) (app/start-new-game! {:conn conn} scenario-id) conn)) ================================================ FILE: test/cljs/zetawar/test_runner.cljs ================================================ (ns ^:figwheel-hooks zetawar.test-runner (:require [cljs-test-display.core] [cljs.test] [zetawar.game-test] [zetawar.subs-test])) (defn ^:after-load test-run [] (cljs.test/run-tests (cljs-test-display.core/init! "app") 'zetawar.game-test 'zetawar.subs-test)) (defonce runit (test-run))