Showing preview only (1,139K chars total). Download the full file or copy to clipboard to get everything.
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
[](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 [](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
================================================
<!doctype html>
<html>
<head>
<title>Zetawar Benchmarks</title>
<link rel="stylesheet" type="text/css" href="css/main.css">
</head>
<body id="benchmarks">
<script type="text/javascript" src="js/vendor/lodash.js"></script>
<script type="text/javascript" src="js/vendor/platform.js"></script>
<script type="text/javascript" src="js/vendor/benchmark.js"></script>
<script type="text/javascript" src="js/main.js"></script>
</body>
</html>
================================================
FILE: assets/css/highlight/default.css
================================================
/*
Original highlight.js style (c) Ivan Sagalaev <maniac@softwaremaniacs.org>
*/
.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<r[0].offset?e:r:"start"===r[0].event?e:r:e.length?e:r}function o(e){function r(e){return" "+e.nodeName+'="'+n(e.value)+'"'}l+="<"+t(e)+w.map.call(e.attributes,r).join("")+">"}function u(e){l+="</"+t(e)+">"}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='<span class="'+i,o=t?"":C;return a+=e+'">',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||"<unnamed>")+'"');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?"<br>":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(/<br[ \/]*>/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="</span>",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 <https://benchmarkjs.com/>
* Copyright 2010-2016 Mathias Bynens <https://mths.be/>
* Based on JSLitmus.js, copyright Robert Kieffer <http://broofa.com/>
* Modified by John-David Dalton <http://allyoucanleet.com/>
* Available under MIT license <https://mths.be/mit>
*/
;(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 : '<Test #' + 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' ? '<Test #' + id + '>' : 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) <https://lodash.com/>
* Build: `lodash -o ./dist/lodash.js`
* Copyright jQuery Foundation and other contributors <https://jquery.org/>
* Released under MIT license <https://lodash.com/license>
* Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>
* 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} Re
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
SYMBOL INDEX (91 symbols across 6 files)
FILE: assets/js/highlight.pack.js
function n (line 2) | function n(e){return e.replace(/[&<>]/gm,function(e){return I[e]})}
function t (line 2) | function t(e){return e.nodeName.toLowerCase()}
function r (line 2) | function r(e,n){var t=e&&e.exec(n);return t&&0===t.index}
function i (line 2) | function i(e){return k.test(e)}
function a (line 2) | function a(e){var n,t,r,a,o=e.className+" ";if(o+=e.parentNode?e.parentN...
function o (line 2) | 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...
function u (line 2) | function u(e){var n=[];return function r(e,i){for(var a=e.firstChild;a;a...
function c (line 2) | function c(e,r,i){function a(){return e.length&&r.length?e[0].offset!==r...
function s (line 2) | function s(e){function n(e){return e&&e.source||e}function t(t,r){return...
function l (line 2) | function l(e,t,i,a){function o(e,n){var t,i;for(t=0,i=n.c.length;i>t;t++...
function f (line 2) | function f(e,t){t=t||y.languages||E(x);var r={r:0,value:n(e)},i=r;return...
function g (line 2) | function g(e){return y.tabReplace||y.useBR?e.replace(M,function(e,n){ret...
function h (line 2) | function h(e,n,t){var r=n?L[n]:t,i=[e.trim()];return e.match(/\bhljs\b/)...
function p (line 2) | function p(e){var n,t,r,o,s,p=a(e);i(p)||(y.useBR?(n=document.createElem...
function d (line 2) | function d(e){y=o(y,e)}
function b (line 2) | function b(){if(!b.called){b.called=!0;var e=document.querySelectorAll("...
function v (line 2) | function v(){addEventListener("DOMContentLoaded",b,!1),addEventListener(...
function m (line 2) | function m(n,t){var r=x[n]=t(e);r.aliases&&r.aliases.forEach(function(e)...
function N (line 2) | function N(){return E(x)}
function R (line 2) | function R(e){return e=(e||"").toLowerCase(),x[e]||x[L[e]]}
FILE: assets/js/vendor/benchmark.js
function runInContext (line 125) | function runInContext(context) {
FILE: assets/js/vendor/lodash.js
function addMapEntry (line 399) | function addMapEntry(map, pair) {
function addSetEntry (line 413) | function addSetEntry(set, value) {
function apply (line 428) | function apply(func, thisArg, args) {
function arrayAggregator (line 449) | function arrayAggregator(array, setter, iteratee, accumulator) {
function arrayConcat (line 468) | function arrayConcat(array, other) {
function arrayEach (line 493) | function arrayEach(array, iteratee) {
function arrayEachRight (line 514) | function arrayEachRight(array, iteratee) {
function arrayEvery (line 535) | function arrayEvery(array, predicate) {
function arrayFilter (line 556) | function arrayFilter(array, predicate) {
function arrayIncludes (line 580) | function arrayIncludes(array, value) {
function arrayIncludesWith (line 593) | function arrayIncludesWith(array, value, comparator) {
function arrayMap (line 614) | function arrayMap(array, iteratee) {
function arrayPush (line 633) | function arrayPush(array, values) {
function arrayReduce (line 656) | function arrayReduce(array, iteratee, accumulator, initAccum) {
function arrayReduceRight (line 681) | function arrayReduceRight(array, iteratee, accumulator, initAccum) {
function arraySome (line 702) | function arraySome(array, predicate) {
function baseExtremum (line 724) | function baseExtremum(array, iteratee, comparator) {
function baseFind (line 756) | function baseFind(collection, predicate, eachFunc, retKey) {
function baseFindIndex (line 777) | function baseFindIndex(array, predicate, fromRight) {
function baseIndexOf (line 798) | function baseIndexOf(array, value, fromIndex) {
function baseIndexOfWith (line 823) | function baseIndexOfWith(array, value, fromIndex, comparator) {
function baseMean (line 844) | function baseMean(array, iteratee) {
function baseReduce (line 862) | function baseReduce(collection, iteratee, accumulator, initAccum, eachFu...
function baseSortBy (line 881) | function baseSortBy(array, comparer) {
function baseSum (line 900) | function baseSum(array, iteratee) {
function baseTimes (line 923) | function baseTimes(n, iteratee) {
function baseToPairs (line 942) | function baseToPairs(object, props) {
function baseUnary (line 955) | function baseUnary(func) {
function baseValues (line 971) | function baseValues(object, props) {
function charsStartIndex (line 986) | function charsStartIndex(strSymbols, chrSymbols) {
function charsEndIndex (line 1003) | function charsEndIndex(strSymbols, chrSymbols) {
function checkGlobal (line 1017) | function checkGlobal(value) {
function compareAscending (line 1029) | function compareAscending(value, other) {
function compareMultiple (line 1067) | function compareMultiple(object, other, orders) {
function countHolders (line 1102) | function countHolders(array, placeholder) {
function createMathOperation (line 1121) | function createMathOperation(operator) {
function deburrLetter (line 1144) | function deburrLetter(letter) {
function escapeHtmlChar (line 1155) | function escapeHtmlChar(chr) {
function escapeStringChar (line 1166) | function escapeStringChar(chr) {
function indexOfNaN (line 1179) | function indexOfNaN(array, fromIndex, fromRight) {
function isHostObject (line 1199) | function isHostObject(value) {
function isIndex (line 1219) | function isIndex(value, length) {
function iteratorToArray (line 1232) | function iteratorToArray(iterator) {
function mapToArray (line 1249) | function mapToArray(map) {
function replaceHolders (line 1268) | function replaceHolders(array, placeholder) {
function setToArray (line 1291) | function setToArray(set) {
function stringSize (line 1308) | function stringSize(string) {
function stringToArray (line 1326) | function stringToArray(string) {
function unescapeHtmlChar (line 1337) | function unescapeHtmlChar(chr) {
function runInContext (line 1379) | function runInContext(context) {
FILE: assets/js/vendor/platform.js
function capitalize (line 65) | function capitalize(string) {
function cleanupOS (line 78) | function cleanupOS(os, pattern, label) {
function each (line 132) | function each(object, callback) {
function format (line 152) | function format(string) {
function forOwn (line 166) | function forOwn(object, callback) {
function getClassOf (line 181) | function getClassOf(value) {
function isHostType (line 197) | function isHostType(object, property) {
function qualify (line 210) | function qualify(string) {
function reduce (line 222) | function reduce(array, callback) {
function trim (line 237) | function trim(string) {
function parse (line 251) | function parse(ua) {
FILE: assets/js/vendor/rollbar-snippet.js
function e (line 2) | function e(t){if(o[t])return o[t].exports;var n=o[t]={exports:{},id:t,lo...
function o (line 2) | function o(r){return function(){try{return r.apply(this,arguments)}catch...
function t (line 2) | function t(r,e,o){window._rollbarWrappedError&&(o[4]||(o[4]=window._roll...
function n (line 2) | function n(r){var e=function(){var e=Array.prototype.slice.call(argument...
function a (line 2) | function a(r){this.shimId=++c,this.notifier=null,this.parentShim=r,this....
function i (line 2) | function i(r){var e=a;return o(function(){if(this.notifier)return this.n...
function l (line 2) | function l(r,e){if(e.hasOwnProperty&&e.hasOwnProperty("addEventListener"...
FILE: src/js/lzw.js
function lzwEncode (line 4) | function lzwEncode(s) {
function lzwDecode (line 31) | function lzwDecode(s) {
Condensed preview — 101 files, each showing path, character count, and a content snippet. Download the .json file or copy for the full structured content (1,174K chars).
[
{
"path": ".ctags",
"chars": 92,
"preview": "--exclude=*.svg\n--exclude=*.yml\n--exclude=.cljs_rhino_repl\n--exclude=target\n--exclude=vendor"
},
{
"path": ".dir-locals.el",
"chars": 99,
"preview": "((nil . ((cider-preferred-build-tool . \"clojure-cli\")\n (cider-default-cljs-repl . node))))\n"
},
{
"path": ".gitignore",
"chars": 125,
"preview": "*.class\n*.jar\n.m2\n/.cljs_rhino_repl\n/.cpcache\n/.nightlight.edn\n/.nrepl-*\n/.nyc_output\n/TAGS\n/node_modules\n/out\n/tags\n/ta"
},
{
"path": ".s3cfg",
"chars": 1023,
"preview": "[default]\naccess_key =\nacl_public = False\nbucket_location = US\ncloudfront_host = cloudfront.amazonaws.com\ncloudfront_res"
},
{
"path": "BACKERS.md",
"chars": 1565,
"preview": "Listed below are the [Zetawar Kickstarter](https://www.kickstarter.com/projects/311016908/zetawar/)\nbackers who chose to"
},
{
"path": "CHANGELOG.md",
"chars": 82,
"preview": "# Unreleased\n* Use clickable cursor for clickable things on the map\n* Add new map\n"
},
{
"path": "Jenkinsfile",
"chars": 2897,
"preview": "// -*- mode: groovy; -*-\n\nnode {\n currentBuild.result = 'SUCCESS'\n\n def commitHash\n def permaBuildPrefix\n\n try {\n "
},
{
"path": "LICENSE.txt",
"chars": 1072,
"preview": "The MIT License\n\nCopyright (c) 2016 Arugaba LLC\n\nPermission is hereby granted, free of charge, to any person obtaining a"
},
{
"path": "Makefile",
"chars": 274,
"preview": ".PHONY: build-staging build-prod deploy-staging deploy-prod\n\nbuild-staging:\n\tboot build-site -e staging\n\nbuild-prod:\n\tbo"
},
{
"path": "README.md",
"chars": 923,
"preview": "# Zetawar [![CircleCI](https://circleci.com/gh/Zetawar/zetawar.svg?style=svg&circle-token=b630f4db37e3538b7c390856687648"
},
{
"path": "assets/benchmarks.html",
"chars": 499,
"preview": "<!doctype html>\n<html>\n <head>\n <title>Zetawar Benchmarks</title>\n <link rel=\"stylesheet\" type=\"text/cs"
},
{
"path": "assets/css/highlight/default.css",
"chars": 1159,
"preview": "/*\n\nOriginal highlight.js style (c) Ivan Sagalaev <maniac@softwaremaniacs.org>\n\n*/\n\n.hljs {\n display: block;\n overflow"
},
{
"path": "assets/js/cli.cljs.edn",
"chars": 62,
"preview": "{:require [zetawar.cli]\n :compiler-options {:target :nodejs}}\n"
},
{
"path": "assets/js/externs.js",
"chars": 371,
"preview": "/** @return {string} */\nvar lzwEncode = function(s) {};\n\n/** @return {string} */\nvar lzwDecode = function(s) {};\n\nvar Ze"
},
{
"path": "assets/js/highlight.pack.js",
"chars": 10878,
"preview": "/*! highlight.js v9.9.0 | BSD3 License | git.io/hljslicense */\n!function(e){var n=\"object\"==typeof window&&window||\"obje"
},
{
"path": "assets/js/main.cljs.edn",
"chars": 471,
"preview": "{:require [zetawar.core]\n :init-fns [zetawar.core/init]\n :modules {:devcards {:entries #{\"zetawar.devcards\"}}}\n :compile"
},
{
"path": "assets/js/vendor/benchmark.js",
"chars": 86023,
"preview": "/*!\n * Benchmark.js v2.1.0 <https://benchmarkjs.com/>\n * Copyright 2010-2016 Mathias Bynens <https://mths.be/>\n * Based "
},
{
"path": "assets/js/vendor/lodash.js",
"chars": 504038,
"preview": "/**\n * @license\n * lodash 4.11.1 (Custom Build) <https://lodash.com/>\n * Build: `lodash -o ./dist/lodash.js`\n * Copyrigh"
},
{
"path": "assets/js/vendor/platform.js",
"chars": 36766,
"preview": "/*!\n * Platform.js v1.3.1 <http://mths.be/platform>\n * Copyright 2014-2016 Benjamin Tan <https://d10.github.io/>\n * Copy"
},
{
"path": "assets/js/vendor/rollbar-snippet.js",
"chars": 4396,
"preview": "// Rollbar Snippet\n!function(r){function e(t){if(o[t])return o[t].exports;var n=o[t]={exports:{},id:t,loaded:!1};return "
},
{
"path": "assets/workspaces.html",
"chars": 581,
"preview": "<!DOCTYPE html>\n<html>\n <head>\n <meta charset=\"UTF-8\">\n <meta name=\"viewport\" content=\"width=device-wid"
},
{
"path": "bin/deploy",
"chars": 2052,
"preview": "#!/usr/bin/env bash\n\nprogname=$(basename $0)\n\nfunction usage {\n echo \"usage: $progname [-s SOURCE] -b BUCKET [-p PREFIX"
},
{
"path": "boot.properties",
"chars": 54,
"preview": "BOOT_CLOJURE_VERSION=1.9.0-alpha14\nBOOT_VERSION=2.7.1\n"
},
{
"path": "build.boot",
"chars": 7759,
"preview": "(set-env!\n :source-paths #{\"src/clj\" \"src/cljc\" \"src/cljs\" \"src/js\" \"src/scss\" \"test/cljs\" \"site\"}\n :resource-paths #{\"a"
},
{
"path": "circle.yml",
"chars": 517,
"preview": "general:\n artifacts:\n - \"target\"\nmachine:\n java:\n version: oraclejdk8\n node:\n version: 6.9.1\n environment:\n"
},
{
"path": "default.nix",
"chars": 200,
"preview": "with import <nixpkgs> {}; {\n sdlEnv = stdenv.mkDerivation {\n name = \"zetawar\";\n buildInputs = [ boot git nodejs p"
},
{
"path": "deps.edn",
"chars": 726,
"preview": "{:paths [\"assets\" \"src/clj\" \"src/cljc\" \"src/cljs\"]\n :deps\n {com.cognitect/transit-cljs {:mvn/version \"0.8.239\"}\n datasc"
},
{
"path": "dev/cljs/user.cljs",
"chars": 407,
"preview": "(ns cljs.user\n (:require\n [datascript.core :as d]\n [zetawar.core :as core]\n [zetawar.game :as game]\n [zetawar.u"
},
{
"path": "dev.cljs.edn",
"chars": 92,
"preview": "^{:connect-url \"ws://penguin.linux.test:9500/figwheel-connect\"}\n{:main zetawar.test-runner}\n"
},
{
"path": "npm-shrinkwrap.json",
"chars": 120016,
"preview": "{\n \"name\": \"zetawar\",\n \"version\": \"0.1.0\",\n \"lockfileVersion\": 1,\n \"requires\": true,\n \"dependencies\": {\n \"ansi-r"
},
{
"path": "package.json",
"chars": 556,
"preview": "{\n \"name\": \"zetawar\",\n \"description\": \"A turn based strategy game and AI platform\",\n \"repository\": {\n \"type\": \"git"
},
{
"path": "shadow-cljs.edn",
"chars": 606,
"preview": ";; shadow-cljs configuration\n{:dependencies [[nubank/workspaces \"1.0.3\"]]\n :source-paths [\"src/clj\" \"src/cljc\" \"src/cljs"
},
{
"path": "site/pages/backers.markdown",
"chars": 1493,
"preview": "---\nname: Backers\n---\n\nListed below are the [Zetawar Kickstarter](https://www.kickstarter.com/projects/311016908/zetawar"
},
{
"path": "site/pages/creating-maps-and-scenarios.markdown",
"chars": 1311,
"preview": "---\nname: Creating Maps and Scenarios\n---\n\nThis guide describes how to create maps and scenarios for Zetawar.\n\nFirst som"
},
{
"path": "site/pages/devcards.markdown",
"chars": 0,
"preview": ""
},
{
"path": "site/pages/docs.markdown",
"chars": 153,
"preview": "---\nname: Documentation\n---\n\n## Customizing Zetawar\n\n- [Writing Bots](../writing-bots/)\n- [Creating Maps and Scenarios]("
},
{
"path": "site/pages/roadmap.markdown",
"chars": 113,
"preview": "---\nname: Roadmap\n---\n\nThe roadmap is now tracked in [GitHub issues](https://github.com/zetawar/zetawar/issues).\n"
},
{
"path": "site/pages/writing-bots.markdown",
"chars": 5229,
"preview": "---\nname: Writing Bots\n---\n\nZetawar was created in part to provide a fun, easy way to experiment with AI in\nClojure(Scri"
},
{
"path": "site/perun.base.dev-builds.edn",
"chars": 155,
"preview": "{\n :sentry-url \"https://c2df777d930c4862bf77c03db7167263@sentry.io/125725\"\n :sentry-environment \"development\"\n :site-tit"
},
{
"path": "site/perun.base.dev.edn",
"chars": 40,
"preview": "{\n :site-title \"Zetawar Development\"\n }\n"
},
{
"path": "site/perun.base.prod.edn",
"chars": 182,
"preview": "{\n :google-analytics-tracking-id \"UA-25415440-6\"\n :sentry-url \"https://c2df777d930c4862bf77c03db7167263@sentry.io/125725"
},
{
"path": "site/perun.base.staging.edn",
"chars": 140,
"preview": "{\n :sentry-url \"https://c2df777d930c4862bf77c03db7167263@sentry.io/125725\"\n :sentry-environment \"staging\"\n :site-title \""
},
{
"path": "site/perun.base.test.edn",
"chars": 34,
"preview": "{\n :site-title \"Zetawar Tests\"\n }\n"
},
{
"path": "site/posts/2016-05-17-technology-choices.markdown",
"chars": 4968,
"preview": "---\ndescription: Technology Choices\ndate-published: 2016-05-17\n---\n\nHello world! Welcome to the Zetawar blog!\n\nA few peo"
},
{
"path": "site/posts/2016-05-22-why-zetawar.markdown",
"chars": 3259,
"preview": "---\ndescription: Why Zetawar?\ndate-published: 2016-05-22\n---\n\nIn my last post I promised to dig into the architecture of"
},
{
"path": "site/posts/2017-02-07-from-callbacks-to-reified-events.md",
"chars": 4105,
"preview": "---\ndescription: From Callbacks to Reified Events\ndate-published: 2017-02-07\n---\n\nHello again! It's time to dust off thi"
},
{
"path": "src/clj/zetawar/subs.clj",
"chars": 455,
"preview": "(ns zetawar.subs)\n\n;; TODO: check that tracks defined this way are only evaluated once per arg combination\n;; TODO: add "
},
{
"path": "src/clj/zetawar/views/site.clj",
"chars": 2298,
"preview": "(ns zetawar.views.site\n (:require\n [zetawar.views.common :refer [footer head navbar]]\n [hiccup.page :refer [html5 i"
},
{
"path": "src/cljc/zetawar/hex.cljc",
"chars": 1920,
"preview": "(ns zetawar.hex\n (:require\n [zetawar.util :refer [abs]]))\n\n(def min-q 0)\n(def min-r 0)\n\n(def max-q 100)\n(def max-r 10"
},
{
"path": "src/cljc/zetawar/site.cljc",
"chars": 1976,
"preview": "(ns zetawar.site\n (:require\n [clojure.string :as string])\n #?(:cljs\n (:require-macros\n [zetawar.site :refer"
},
{
"path": "src/cljc/zetawar/util.cljc",
"chars": 1433,
"preview": "(ns zetawar.util\n #?(:cljs\n (:require-macros [zetawar.util :refer [inspect]])))\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"
},
{
"path": "src/cljc/zetawar/views/common.cljc",
"chars": 4693,
"preview": "(ns zetawar.views.common\n #?@(:clj\n [(:require\n [clojure.java.io :as io]\n [hiccup.page :refer [html5"
},
{
"path": "src/cljs/zetawar/app.cljs",
"chars": 3797,
"preview": "(ns zetawar.app\n (:require\n [cognitect.transit :as transit]\n [datascript.core :as d]\n [zetawar.data :as data]\n "
},
{
"path": "src/cljs/zetawar/benchmarks.cljs",
"chars": 866,
"preview": "(ns zetawar.benchmarks\n (:require\n [clojure.string :as string]\n [datascript.core :as d]\n [reagent.core :as r]\n "
},
{
"path": "src/cljs/zetawar/cli.cljs",
"chars": 2526,
"preview": "(ns zetawar.cli\n (:require\n [cljs.nodejs :as nodejs]\n [integrant.core :as ig]\n [zetawar.app :as app]\n [zetawar."
},
{
"path": "src/cljs/zetawar/core.cljs",
"chars": 2431,
"preview": "(ns zetawar.core\n (:require\n [cljsjs.raven]\n [integrant.core :as ig]\n [reagent.core :as r]\n [zetawar.app :as ap"
},
{
"path": "src/cljs/zetawar/data.cljs",
"chars": 77335,
"preview": "(ns zetawar.data)\n\n(def dicts\n {:en\n {;; General\n :save-button \"Save\"\n :cancel-button \"Cancel\"\n :close-butto"
},
{
"path": "src/cljs/zetawar/db.cljs",
"chars": 6908,
"preview": "(ns zetawar.db\n (:require\n [datascript.core :as d]\n [zetawar.logging :as log]\n [zetawar.util :refer [breakpoint i"
},
{
"path": "src/cljs/zetawar/dev.cljs",
"chars": 237,
"preview": "(ns zetawar.dev\n (:require\n [clojure.spec.test :as spec.test]\n [devtools.core :as devtools]\n [zetawar.game-test]\n"
},
{
"path": "src/cljs/zetawar/devcards/data_formats.cljs",
"chars": 2934,
"preview": "(ns zetawar.devcards.data-formats\n (:require\n [clojure.spec :as s]\n [devcards.core :as dc :include-macros true]\n "
},
{
"path": "src/cljs/zetawar/devcards/game_specs.cljs",
"chars": 319,
"preview": "(ns zetawar.devcards.game-specs\n (:require\n [clojure.spec :as s]\n [clojure.test.check.generators]\n [devcards.core"
},
{
"path": "src/cljs/zetawar/devcards/maps_and_scenarios.cljs",
"chars": 871,
"preview": "(ns zetawar.devcards.maps-and-scenarios\n (:require\n [devcards.core :as dc :include-macros true]\n [integrant.core :a"
},
{
"path": "src/cljs/zetawar/devcards/selection_and_target.cljs",
"chars": 3811,
"preview": "(ns zetawar.devcards.selection-and-target\n (:require\n [datascript.core :as d]\n [devcards.core :as dc :include-macro"
},
{
"path": "src/cljs/zetawar/devcards.cljs",
"chars": 331,
"preview": "(ns zetawar.devcards\n (:require\n [devcards.core :as devcards :include-macros true]\n [zetawar.devcards.data-formats]"
},
{
"path": "src/cljs/zetawar/doc.cljs",
"chars": 298,
"preview": "(ns zetawar.doc)\n\n(def key-descriptions\n {:game.map/description \"A string describing the map\"\n :game.map/terrains \"A "
},
{
"path": "src/cljs/zetawar/events/game.cljs",
"chars": 1816,
"preview": "(ns zetawar.events.game\n (:require\n [datascript.core :as d]\n [zetawar.app :as app]\n [zetawar.game :as game]\n [z"
},
{
"path": "src/cljs/zetawar/events/player.cljs",
"chars": 949,
"preview": "(ns zetawar.events.player\n (:require\n [datascript.core :as d]\n [zetawar.app :as app]\n [zetawar.game :as game]\n "
},
{
"path": "src/cljs/zetawar/events/ui.cljs",
"chars": 16282,
"preview": "(ns zetawar.events.ui\n (:require\n [cljsjs.clipboard]\n [datascript.core :as d]\n [zetawar.app :as app]\n [zetawar."
},
{
"path": "src/cljs/zetawar/game/spec.cljs",
"chars": 656,
"preview": "(ns zetawar.game.spec\n (:require\n [clojure.spec :as s]))\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"
},
{
"path": "src/cljs/zetawar/game.cljs",
"chars": 61223,
"preview": "(ns zetawar.game\n (:require\n [clojure.string :as string]\n [datascript.core :as d]\n [zetawar.data :as data]\n [ze"
},
{
"path": "src/cljs/zetawar/js/game.cljs",
"chars": 487,
"preview": "(ns zetawar.js.game\n (:require\n [zetawar.game :as game]))\n\n(defn ^:export is_unit [x]\n (game/unit? x))\n\n(defn ^:expo"
},
{
"path": "src/cljs/zetawar/js/hex.cljs",
"chars": 127,
"preview": "(ns zetawar.js.hex\n (:require\n [zetawar.hex :as hex]))\n\n(defn ^:export distance [q1 r1 q2 r2]\n (hex/distance q1 r1 q"
},
{
"path": "src/cljs/zetawar/logging.cljs",
"chars": 631,
"preview": "(ns zetawar.logging)\n\n(goog-define LOG_LEVEL 4)\n\n(defn log [& args]\n (let [[ex & other-args] args]\n (if (.-stack ex)"
},
{
"path": "src/cljs/zetawar/players/ai/custom.cljs",
"chars": 1956,
"preview": "(ns zetawar.players.ai.custom\n (:require\n [cljs.core.async :as async]\n [datascript.core :as d]\n [zetawar.app :as "
},
{
"path": "src/cljs/zetawar/players/ai/custom_js.cljs",
"chars": 1605,
"preview": "(ns zetawar.players.ai.custom-js\n (:require\n [cljs.core.async :as async]\n [datascript.core :as d]\n [zetawar-js-ai"
},
{
"path": "src/cljs/zetawar/players/ai/reference.cljs",
"chars": 1962,
"preview": "(ns zetawar.players.ai.reference\n (:require\n [cljs.core.async :as async]\n [datascript.core :as d]\n [zetawar.app :"
},
{
"path": "src/cljs/zetawar/players/human.cljs",
"chars": 269,
"preview": "(ns zetawar.players.human\n (:require\n [zetawar.players :as players]))\n\n(defrecord HumanPlayer [faction-color]\n playe"
},
{
"path": "src/cljs/zetawar/players/simple_embedded.cljs",
"chars": 5103,
"preview": "(ns zetawar.players.simple-embedded\n (:require\n [cljs.core.async :as async]\n [datascript.core :as d]\n [zetawar.lo"
},
{
"path": "src/cljs/zetawar/players.cljs",
"chars": 1453,
"preview": "(ns zetawar.players\n (:require\n [cljs.core.async :as async]\n [zetawar.data :as data]\n [zetawar.game :as game]\n "
},
{
"path": "src/cljs/zetawar/router/reagent.cljs",
"chars": 1674,
"preview": "(ns zetawar.router.reagent\n (:require\n [cljs.core.async :refer [<! >! chan offer!]]\n [reagent.core :as r]\n [zetaw"
},
{
"path": "src/cljs/zetawar/router.cljs",
"chars": 2387,
"preview": "(ns zetawar.router\n (:require\n [cljs.core.async :refer [<! >! chan offer!]]\n [datascript.core :as d]\n [goog.objec"
},
{
"path": "src/cljs/zetawar/serialization.cljs",
"chars": 1852,
"preview": "(ns zetawar.serialization\n (:require\n [cognitect.transit :as transit]\n [goog.crypt.base64 :as base64]\n [lzw]\n ["
},
{
"path": "src/cljs/zetawar/subs.cljs",
"chars": 20257,
"preview": "(ns zetawar.subs\n (:require\n [datascript.core :as d]\n [posh.reagent :as posh]\n [reagent.core :as r]\n [zetawar.d"
},
{
"path": "src/cljs/zetawar/system/datascript.cljs",
"chars": 502,
"preview": "(ns zetawar.system.datascript\n (:require\n [datascript.core :as d]\n [integrant.core :as ig]))\n\n(defmethod ig/init-ke"
},
{
"path": "src/cljs/zetawar/system/game.cljs",
"chars": 461,
"preview": "(ns zetawar.system.game\n (:require\n [integrant.core :as ig]\n [zetawar.logging :as log]\n [zetawar.router :as route"
},
{
"path": "src/cljs/zetawar/system/game_views.cljs",
"chars": 1247,
"preview": "(ns zetawar.system.game-views\n (:require\n [integrant.core :as ig]\n [posh.reagent :as posh]\n [tongue.core :as tong"
},
{
"path": "src/cljs/zetawar/system/players.cljs",
"chars": 355,
"preview": "(ns zetawar.system.players\n (:require\n [integrant.core :as ig]\n [zetawar.players :as players]))\n\n(defmethod ig/init"
},
{
"path": "src/cljs/zetawar/system/reagent.cljs",
"chars": 249,
"preview": "(ns zetawar.system.reagent\n (:require\n [integrant.core :as ig]\n [zetawar.logging :as log]\n [zetawar.router.reagen"
},
{
"path": "src/cljs/zetawar/system/router.cljs",
"chars": 988,
"preview": "(ns zetawar.system.router\n (:require\n [cljs.core.async :as async]\n [integrant.core :as ig]\n [zetawar.router :as r"
},
{
"path": "src/cljs/zetawar/system/spec.cljs",
"chars": 2202,
"preview": "(ns zetawar.system.spec\n (:require\n [cljs.core.async :as async]\n [cljs.core.async.impl.protocols :as async.protocol"
},
{
"path": "src/cljs/zetawar/system.cljs",
"chars": 941,
"preview": "(ns zetawar.system\n (:require\n [integrant.core :as ig]\n [zetawar.db :as db]))\n\n;; TODO: rename to browser-cfg\n(def "
},
{
"path": "src/cljs/zetawar/tiles.cljs",
"chars": 252,
"preview": "(ns zetawar.tiles)\n\n(def width 32)\n(def height 34)\n(def row-offset 26)\n(def odd-row-column-offset (/ width 2))\n\n(def off"
},
{
"path": "src/cljs/zetawar/views.cljs",
"chars": 25090,
"preview": "(ns zetawar.views\n (:require\n [cljsjs.clipboard]\n [cljsjs.react-bootstrap]\n [clojure.string :as string]\n [datas"
},
{
"path": "src/cljs/zetawar/workspaces/test_cards.cljs",
"chars": 389,
"preview": "(ns zetawar.workspaces.test-cards\n (:require\n [\"react\" :as react]\n [nubank.workspaces.card-types.react :as ct.react"
},
{
"path": "src/js/custom_ai.js",
"chars": 1977,
"preview": "ZetawarAI = (function() {\n var ZetawarAI = {};\n\n ZetawarAI.makeActorContext = function(db, game, actor) {\n "
},
{
"path": "src/js/lzw.js",
"chars": 1365,
"preview": "// From: https://gist.github.com/revolunet/843889\n\n// LZW-compress a string\nfunction lzwEncode(s) {\n var dict = {};\n v"
},
{
"path": "src/scss/main.scss",
"chars": 1324,
"preview": "@import \"bootstrap/bootstrap\";\n@import \"font-awesome/font-awesome\";\n\n///////////////////////////////////////////////////"
},
{
"path": "test/cljs/zetawar/game_test.cljs",
"chars": 22324,
"preview": "(ns zetawar.game-test\n (:require\n [cljs.test :refer-macros [deftest testing is async use-fixtures]]\n [datascript.co"
},
{
"path": "test/cljs/zetawar/subs_test.cljs",
"chars": 16970,
"preview": "(ns zetawar.subs-test\n (:require\n [cljs.test :refer-macros [deftest testing is async use-fixtures]]\n [datascript.co"
},
{
"path": "test/cljs/zetawar/test_helper.cljs",
"chars": 357,
"preview": "(ns zetawar.test-helper\n (:require\n [datascript.core :as d]\n [posh.reagent :as posh]\n [reagent.core :as r]\n [ze"
},
{
"path": "test/cljs/zetawar/test_runner.cljs",
"chars": 313,
"preview": "(ns ^:figwheel-hooks zetawar.test-runner\n (:require\n [cljs-test-display.core]\n [cljs.test]\n [zetawar.game-test]\n "
}
]
About this extraction
This page contains the full source code of the Zetawar/zetawar GitHub repository, extracted and formatted as plain text for AI agents and large language models (LLMs). The extraction includes 101 files (1.1 MB), approximately 307.9k tokens, and a symbol index with 91 extracted functions, classes, methods, constants, and types. Use this with OpenClaw, Claude, ChatGPT, Cursor, Windsurf, or any other AI tool that accepts text input. You can copy the full output to your clipboard or download it as a .txt file.
Extracted by GitExtract — free GitHub repo to text converter for AI. Built by Nikandr Surkov.